检索结果-内蒙古大学图书馆

Water wave optimization for combinatorial optimization: design strategies and applications

APPLIED SOFT COMPUTING 2019年 83卷 105611-000页

作者： Zheng, Yu-Jun Lu, Xue-Qin Du, Yi-Chen Xue, Yu Sheng, Wei-Guo Hangzhou Normal Univ Inst Serv Engn Hangzhou 311121 Zhejiang Peoples R China Zhejiang Univ Technol Coll Comp Sci & Technol Hangzhou 310023 Zhejiang Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing 210044 Jiangsu Peoples R China Victoria Univ Wellington Sch Engn & Comp Sci Wellington 6140 New Zealand

Although the community of nature-inspired computing has witnessed a wide variety of metaheuristics, it often requires considerable effort to adapt them to different combinatorial optimization problems (COPs), and few studies have been devoted to reducing this burden. This paper proposes a systematic approach that consists of a set of basic steps and strategies for adapting water wave optimization (WWO), a simple and generic metaheuristic, to concrete heuristic algorithms for different COPs. Taking advantages of the generic algorithmic framework, designers can only focus on adapting the prorogation operator and the wavelength calculation method according to the combinatorial properties of the given problem, and thus easily derive efficient problem-solving algorithms. We illustrate and test our approach on the flow-shop scheduling problem (FSP), the single-objective multidimensional knapsack problem (MKP), and the multi-objective MKP, and then present an application to a machine utilization optimization problem for a large manufacturing enterprise. The results demonstrate that our approach can derive concrete algorithms that are competitive to the state-of-the-arts. Our approach also provides insights into the adaptation of other metaheuristics and the development of new metaheuristics for COPs. (C) 2019 The Author(s). Published by Elsevier B.V.

关键词： Combinatorial optimization Metaheuristics Water wave optimization (WWO) algorithm design Machine utilization optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithm design for Multi-robot Generalized Task Assignment Problem

Distributed Algorithm Design for Multi-robot Generalized Tas...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Lingzhi Luo Nilanjan Chakraborty Katia Sycara Robotics Institute School of Computer Science Carnegie Mellon University 5000 Forbes Ave Pittsburgh PA 15213

ISBN: (纸本)9781467363563

We present a provably-good distributed algorithm for generalized task assignment problem in the context of multirobot systems, where robots cooperate to complete a set of given tasks. In multi-robot generalized assignment problem (MR-GAP), each robot has its own resource constraint (e.g., energy constraint), and needs to consume a certain amount of resource to obtain a payoff for each task. The objective is to find a maximum payoff assignment of tasks to robots such that each task is assigned to at most one robot while respecting robots' resource constraints. MR-GAP is a NP-hard problem. It is an extension of multi-robot linear assignment problem since different robots can use different amount of resource for doing a task (due to the heterogeneity of robots and tasks). We first present an auction-based iterative algorithm for MR-GAP assuming the presence of a shared memory (or centralized auctioneer), where each robot uses a knapsack algorithm as a subroutine to iteratively maximize its own objective (using a modified payoff function based on an auxiliary variable, called price of a task). Our iterative algorithm can be viewed as (an approximation of) best response assignment update rule of each robot to the assignment of other robots at that iteration. We prove that our algorithm converges to an assignment (approximately) at equilibrium under the assignment update rule, with an approximation ratio of 1 + α (where α is the approximation ratio for the Knapsack problem). We also combine our algorithm with a message passing mechanism to remove the requirement of a shared memory and make our algorithm totally distributed assuming the robots' communication network is connected. Finally, we present simulation results to depict our algorithm's performance.

关键词： Robot knapsack algorithm shared memory knapsack problems Religious Missions algorithm design channel assignment problem distributed algorithms Iterative algorithms multi-robot systems approximation

来源：评论

学校读者我要写书评

暂无评论

Pedestrian Autonomous Positioning System Based on Inertial Navigation

Pedestrian Autonomous Positioning System Based on Inertial N...

引用

第十一届中国卫星导航年会

作者： Bowen Xing Haonan Jia Pengfei Liu Guoju Ma Xiaonan Li The 54th Research Institute of CETC State Key Laboratory of Satellite Navigation System and Equipment Technology

Under the background of mobile Internet era, the application requirements of indoor positioning technology is increasingly urgent,and accurate positioning information has become an important prerequis

关键词： inertial navigation autonomous positioning algorithm design hardware design

来源：评论

学校读者我要写书评

暂无评论

LP-based Approximation for Personalized Reserve Prices 19

LP-based Approximation for Personalized Reserve Prices

引用

20th ACM Conference on Economics and Computation (ACM EC) held as part of the ACM Federated Computing Research Conference

作者： Derakhshan, Mahsa Golrezaei, Negin Leme, Renato Paes Univ Maryland Baltimore MD 21201 USA MIT Sloan Sch Management Cambridge MA 02139 USA Google Res Mountain View CA USA Google Mountain View CA USA

ISBN: (纸本)9781450367929

We study the problem of computing personalized reserve prices in eager second price auctions without having any assumption on valuation distributions. Here, the input is a dataset that contains the submitted bids of n buyers in a set of auctions and the goal is to return personalized reserve prices r that maximize the revenue earned on these auctions by running eager second price auctions with reserve r. We present a novel LP formulation to this problem and a rounding procedure which achieves a (1+2(√2-1)e√2-2)-1≅0.684-approximation. This improves over the 1/2-approximation algorithm due to Roughgarden and Wang. We show that our analysis is tight for this rounding procedure. We also bound the integrality gap of the LP, which bounds the performance of any algorithm based on this LP.

关键词： Auctions algorithm design Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Solving Optimal Power Flow for Distribution Networks with State Estimation Feedback

Solving Optimal Power Flow for Distribution Networks with St...

引用

American Control Conference

作者： Yi Guo Xinyang Zhou Changhong Zhao Yue Chen Tyler Summers Lijun Chen Department of Mechanical Engineering The University of Texas at Dallas Richardson TX USA Department of Power System Engineering National Renewable Energy Laboratory Golden CO USA Department of Information Engineering The Chinese University of Hong Kong HK College of Engineering and Applied Science The University of Colorado Boulder CO USA

ISBN: (数字)9781538682661

ISBN: (纸本)9781538682678

Conventional optimal power flow (OPF) solvers assume full observability of the involved system states. However in practice, there is a lack of reliable system monitoring devices in the distribution networks. To close the gap between the theoretic algorithm design and practical implementation, this work proposes to solve the OPF problems based on the state estimation (SE) feedback for the distribution networks where only a part of the involved system states are physically measured. The SE feedback increases the observability of the under-measured system and provides more accurate system states monitoring when the measurements are noisy. We analytically investigate the convergence of the proposed algorithm. The numerical results demonstrate that the proposed approach is more robust to large pseudo measurement variability and inherent sensor noise in comparison to the other frameworks without SE feedback.

关键词： Power grids optimal load flow Feedback Observability State estimation Power flow algorithm design

来源：评论

学校读者我要写书评

暂无评论

Toward high-efficiency and detailed Monte Carlo simulation study of the granular flow spallation target

引用

NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT 2018年 882卷 117-123页

作者： Cai, Han-Jie Zhang, Zhi-Lei Fu, Fen Li, Jian-Yang Zhang, Xun-Chao Zhang, Ya-Ling Yan, Xue-Song Lin, Ping Xv, Jian-Ya Yang, Lei Chinese Acad Sci Inst Modern Phys Lanzhou 730000 Gansu Peoples R China

The dense granular flow spallation target is a new target concept chosen for the Accelerator-Driven Subcritical (ADS) project in China. For the R&D of this kind of target concept, a dedicated Monte Carlo (MC) program named GMT was developed to perform the simulation study of the beam-target interaction. Owing to the complexities of the target geometry, the computational cost of the MC simulation of particle tracks is highly expensive. Thus, improvement of computational efficiency will be essential for the detailed MC simulation studies of the dense granular target. Here we present the special design of the GMT program and its high efficiency performance. In addition, the speedup potential of the GPU-accelerated spallation models is discussed. (C) 2017 Elsevier B.V. All rights reserved.

关键词： ADS granular target Detailed simulation algorithm design High efficiency Beam-target Interaction

来源：评论

学校读者我要写书评

暂无评论

Progressive Thresholding: Shaping and Specificity in Automated Neurofeedback Training

引用

IEEE TRANSACTIONS ON NEURAL SYSTEMS AND REHABILITATION ENGINEERING 2018年第12期26卷 2297-2305页

作者： Dhindsa, Kiret Gauder, Kyle D. Marszalek, Kristen A. Terpou, Braeden Becker, Suzanna McMaster Univ Performance Sci Lab Hamilton ON L8S 4K1 Canada Vector Inst Toronto ON M5G1M1 Canada McMaster Univ Dept Psychol Neurosci & Behav Hamilton ON L8S 4L8 Canada Mohawk Coll Kerrys Pl Autism Serv Aurora ON L4G 1W9 Canada Western Univ Univ Hosp Dept Neurosci London ON N6A 5A5 Canada

Neurofeedback has long been proposed as a promising form of adjunctive non-pharmaceutical treatment for a variety of neuropsychological disorders. However, there is much debate over its efficacy and specificity. Many suggest that specificity can only be achieved when a specially trained clinician manually updates reward thresholds that indicate to the trainee when they are modulating their brain activity correctly, during training. We present a novel fully automated reward thresholding algorithm called progressive thresholding and test it with a frontal alpha asymmetry neurofeedback protocol. Progressive thresholding uses dynamic difficulty tuning and individual-specific progress models to simulate the shaping a clinician might perform when setting reward thresholds manually. We demonstrate in a double-blind comparison that progressive thresholding leads to significantly better learning outcomes compared with current automatic reward thresholding algorithms.

关键词： Neurofeedback statistical modeling electroencephalography (EEG) automatic thresholding algorithm design mental health

来源：评论

学校读者我要写书评

暂无评论

GPS Relative Navigation for the CanX-4 and CanX-5 Formation-Flying Nanosatellites

引用

JOURNAL OF SPACECRAFT AND ROCKETS 2018年第6期55卷 1545-1558页

作者： Kahr, Erin Roth, Niels Montenbruck, Oliver Ris, Ben Zee, Robert E. Univ Calgary Dept Geomat Engn Calgary AB T2N 1N4 Canada Univ Toronto Inst Aerosp Studies Space Flight Lab Toronto ON M3H 5T6 Canada DLR German Aerosp Ctr German Space Operat Ctr D-82234 Wessling Germany

In November 2014 the CanX-4 and CanX-5 spacecraft became the first nanosatellites to demonstrate autonomous formation control with error less than 1 m. This feat was accomplished both in along-track formations at 1000 and 500 m range and projected circular orbit formations at 100 and 50 m. This control performance was enabled through carrier-phase differential GPS navigation techniques, providing online relative state estimates typically accurate to better than 10 cm. It was an important milestone on the road to regular and fully operational formation-flying missions. This paper provides an overview of the relative positioning algorithm design, presents an independent assessment of the receiver performance, and assesses the absolute and relative navigation results. The mission's on-orbit results are compared with an independently determined orbit solution computed using the GPS High Precision Orbit Determination Software Tools at the German Aerospace Centre.

关键词： Formation Flying Orbit Determination Software Tool German Aerospace Center algorithm design CubeSat Extended Kalman Filter Navigation Satellites Attitude Control System Total Electron Content

来源：评论

学校读者我要写书评

暂无评论

Influence Maximization on Social Graphs: A Survey

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2018年第10期30卷 1852-1872页

作者： Li, Yuchen Fan, Ju Wang, Yanhao Tan, Kian-Lee Singapore Management Univ Sch Informat Syst Singapore 188065 Singapore Renmin Univ China Key Lab Data Engn & Knowledge Engn MOE China Beijing 100872 Peoples R China Renmin Univ China Sch Informat Beijing 100872 Peoples R China Natl Univ Singapore Sch Comp Singapore 119077 Singapore

Influence Maximization (IM), which selects a set of k users (called seed set) from a social network to maximize the expected number of influenced users (called influence spread), is a key algorithmic problem in social influence analysis. Due to its immense application potential and enormous technical challenges, IM has been extensively studied in the past decade. In this paper, we survey and synthesize a wide spectrum of existing studies on IM from an algorithmic perspective, with a special focus on the following key aspects: (1) a review of well-accepted diffusion models that capture the information diffusion process and build the foundation of the IM problem, (2) a fine-grained taxonomy to classify existing IM algorithms based on their design objectives, (3) a rigorous theoretical comparison of existing IM algorithms, and (4) a comprehensive study on the applications of IM techniques in combining with novel context features of social networks such as topic, location, and time. Based on this analysis, we then outline the key challenges and research directions to expand the boundary of IM research.

关键词： Influence maximization information diffusion social networks algorithm design

来源：评论

学校读者我要写书评

暂无评论

Speed scaling problems with memory/cache consideration

引用

JOURNAL OF SCHEDULING 2018年第6期21卷 633-646页

作者： Wu, Weiwei Li, Minming Wang, Kai Huang, He Chen, Enhong Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Univ Sci & Technol China Sch Comp Sci Hefei Anhui Peoples R China

Speed scaling problems consider energy- efficient job scheduling in processors by adjusting the speed to reduce energy consumption, where power consumption is a convex function of speed ( usually, P( s) = sa, a = 2, 3). In this work, we study speed scaling problems considering memory/ cache. Each job needs some time for memory operation when it is fetched from memory, and needs less time if fetched from the cache. The objective is to minimize energy consumption while satisfying the time constraints of the jobs. Two models are investigated, the non- cache model and the with- cache model. The non- cache model is a variant of the ideal model, where each job i needs a fixed ci time for its memory operation;the with- cache model further considers the cache, a memory device with much faster access time but limited space. The uniform with- cache model is a special case of the with- cache model in which all ci values are the same. We provide an O( n3) time algorithm and an improved O( n2 log n) time algorithm to compute the optimal solution in the non- cache model. For the with- cache model, we prove that it is NP- complete to compute the optimal solution. For the uniform with- cache model with agreeable jobs ( later- released jobs do not have earlier deadlines), we derive an O( n4) time algorithm to compute the optimal schedule, while for the general case we propose a ( 2a g g- 1) a/ 2- approximation algorithm in a resource augmentation setting in which the memory operation time can accelerate by at most g times.

关键词： Speed scaling Energy efficiency Scheduling Memory operation time DVS algorithm design

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：