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

Price of anarchy in machine load balancing game

AUTOMATION AND REMOTE CONTROL 2015年第10期76卷 1849-1864页

作者： Chirkova, Yu. V. Russian Acad Sci Inst Appl Math Res Karelian Res Ctr Petrozavodsk Russia

This paper considers the machine load balancing game with uniformly related machines. Players choose machines of different speeds to run their jobs striving to minimize job's delay, i.e., the job completion time on a chosen machine. The social cost is the maximum delay over all machines. In the general case and the special case of 3 machines, we obtain upper estimates for the price of anarchy (PoA) and demonstrate when they coincide with the exact values. Moreover, sufficient conditions for PoA increase are established under new machine inclusion into the system. And finally, we propose a computing algorithm of the exact PoA value in the three-machine model.

关键词： MACHINE theory AUTOMATIC control computer algorithms MATHEMATICAL models COMPUTATIONAL grids (computer systems)

来源：评论

学校读者我要写书评

暂无评论

Adams Predictor-Corrector Systems for Solving Fuzzy Differential Equations

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2013年第1期2013卷 1-12页

作者： Shang, Dequan Guo, Xiaobin Gansu Coll Tradit Chinese Med Dept Publ Courses Lanzhou 730000 Peoples R China Northwest Normal Univ Coll Math & Stat Lanzhou 730070 Peoples R China

A predictor-corrector algorithm and an improved predictor-corrector (IPC) algorithm based on Adams method are proposed to solve first-order differential equations with fuzzy initial condition. These algorithms are generated by updating the Adams predictor-corrector method and their convergence is also analyzed. Finally, the proposed methods are illustrated by solving an example.

关键词： FUZZY systems NUMERICAL solutions to differential equations computer algorithms STOCHASTIC convergence PROBLEM solving

来源：评论

学校读者我要写书评

暂无评论

Efficient exploration of faulty trees

引用

THEORY OF COMPUTING SYSTEMS 2007年第3期40卷 225-247页

作者： Markou, Euripides Pelc, Andrzej Univ Quebec Dept Informat Gatineau PQ J8X 3X7 Canada

We consider the problem of the exploration of trees, some of whose edges are faulty. A robot, situated in a starting node and unaware of the location of faults, has to explore the connected fault-free component of this node by visiting all its nodes. The cost of the exploration is the number of edge traversals. For a given tree and given starting node, the overhead of an exploration algorithm is the worst-case ratio (taken over all fault configurations) of its cost to the cost of an optimal algorithm which knows where faults are situated. An algorithm, for a given tree and given starting node, is called perfectly competitive if its overhead is the smallest among all exploration algorithms not knowing the location of faults. We design a perfectly competitive exploration algorithm for any line, and an exploration algorithm for any tree, whose overhead is at most 9/8 larger than that of a perfectly competitive algorithm. Both our algorithms are fairly natural and the total time of local computations used during exploration is linear in the size of the explored tree. Our main contribution is the analysis of the performance of these algorithms, showing that natural exploration strategies perform well in faulty trees.

关键词： algorithms ROBOTICS computer programming computer algorithms MOBILE agents (computer software)

来源：评论

学校读者我要写书评

暂无评论

Fuel cycle analysis of TRU or MA burner fast reactors with variable conversion ratio using a new algorithm at equilibrium

引用

NUCLEAR ENGINEERING AND DESIGN 2009年第10期239卷 2160-2168页

作者： Salvatores, Massimo Chabert, Christine Fazio, Concetta Hill, Robert Peneliau, Yannick Slessarev, Igor Yang, Won Sik CEN Cadarache F-13108 St Paul Les Durance France Argonne Natl Lab NE Div Argonne IL 60439 USA Forschungszentrum Karlsruhe D-76021 Karlsruhe Germany

Partitioning and Transmutation (P&T) strategies assessment and implementation play a key role in the definition of advanced fuel cycles. in order to insure both sustainability and waste minimization. Several options are under study worldwide, and their impact on core design and associated fuel cycles are under investigation, to offer a rationale to down selection and to streamline efforts and resources. Interconnected issues like fuel type, minor actinide content, conversion ratio values, etc. need to be understood and their impact quantified. Then, from a practical point of view, studies related to advanced fuel cycles require a considerable amount of analysis to assess performances both of the reactor cores and of the associated fuel cycles. A physics analysis should provide a sound understanding of major trends and features, in order to provide guidelines for more detailed studies. In this paper, it is presented an improved version of a generalization of the Bateman equation that allows performing analysis at equilibrium for a large number of systems. It is shown that the method reproduces very well the results obtained with full depletion calculations. The method is applied to explore the specific issue of the features of the fuel cycle parameters related to fast reactors with different fuel types, different conversion ratios (CR) and different ratios of Pu over minor actinide (Pu/MA) in the fuel feed. As an example of the potential impact of such analysis, it is shown that for cores with CR below similar to 0.8, the increase of neutron doses and decay heat can represent a significant drawback to implement the corresponding reactors and associated fuel cycles. (C) 2009 Elsevier B.V. All rights reserved.

关键词： FAST reactors URANIUM as fuel ACTINIDE elements computer algorithms RADIOACTIVE wastes -- Transmutation SUSTAINABILITY WASTE minimization CHEMICAL equilibrium

来源：评论

学校读者我要写书评

暂无评论

MDA-Based Data Association with Prior Track Information for Passive Multitarget Tracking

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2011年第1期47卷 539-556页

作者： Sathyan, T. Sinha, A. Kirubarajan, T. Mcdonald, Michael Lang, Thomas CSIRO ICT Ctr Epping NSW 1710 Australia AUG Signals Toronto ON M5H 4E8 Canada McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada DRDC Surveillance Radar Grp Ottawa ON K1A 0Z4 Canada Gen Dynam Canada Air & Naval Syst Ottawa ON K2H 5B7 Canada

An assignment-based solution for the data association problem in synchronous passive multisensor (Type 3) tracking systems involves two steps: first measurement-to-measurement or static association is solved using a multidimensional (S-dimensional or S-D with S sensors) assignment, and then measurement-to-track association is solved using a 2-D assignment. This solution is computationally very expensive and, to rectify an efficient (S + 1)-D assignment algorithm has been proposed in the literature. Two new assignment-based algorithms are proposed that use prior track information (i.e., predicted state and covariance) which result in improved tracking performance compared with the existing solutions, while requiring considerably less computations. One of the proposed algorithms, the gated assignment, is similar to the two-step solution mentioned above except that it uses prior track information and avoids the need to consider all possible association hypotheses in the static association step. The second algorithm, the gated (S + 1)-D assignment, combines the gated assignment and the (S + 1)-D algorithms. An approximation to the (S + 1)-D algorithm is also derived when sensor measurements are independent, which results in an extremely fast solution. Simulation results confirm that the proposed algorithms show improved tracking performance and faster execution times.

关键词： PERFORMANCE evaluation MEASUREMENT DETECTORS APPROXIMATION theory INFORMATION theory computer algorithms

来源：评论

学校读者我要写书评

暂无评论

The characterization of data-accumulating algorithms

引用

THEORY OF COMPUTING SYSTEMS 2000年第1期33卷 85-96页

作者： Bruda, SD Akl, SG Queens Univ Dept Comp & Informat Sci Kingston ON K7L 3N6 Canada

Data-accumulating algorithms (d-algorithms for short), extensively studied in [12], work on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data have been processed before another datum arrives. In this paper a finer characterization of the class of d-algorithms is given, and it is shown that this class is identical to the class of on-line algorithms under a proper definition of the latter. The parallel implementation of d-algorithms is then investigated. It is found that, in general, the speedup achieved through parallelism can be made arbitrarily large for almost any such algorithm. On the other hand, we prove that for d-algorithms whose static counterparts manifest only unitary speedup, no improvement is possible through parallel implementation.

关键词： computer algorithms algorithms

来源：评论

学校读者我要写书评

暂无评论

Time Reversal Reconstruction Algorithm Based on PSO Optimized SVM Interpolation for Photoacoustic Imaging

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-9页

作者： Sun, Mingjian Wu, Zhenghua Liu, Ting Hu, Jiajun Wu, Guanqun Feng, Naizhang Harbin Inst Technol Sch Astronaut Dept Control Sci & Engn Weihai 264209 Shandong Peoples R China

Photoacoustic imaging is an innovative imaging technique to image biomedical tissues. The time reversal reconstruction algorithm in which a numerical model of the acoustic forward problem is run backwards in time is widely used. In the paper, a time reversal reconstruction algorithm based on particle swarm optimization (PSO) optimized support vector machine (SVM) interpolation method is proposed for photoacoustics imaging. Numerical results show that the reconstructed images of the proposed algorithm are more accurate than those of the nearest neighbor interpolation, linear interpolation, and cubic convolution interpolation based time reversal algorithm, which can provide higher imaging quality by using significantly fewer measurement positions or scanning times.

关键词： TIME reversal PARTICLE swarm optimization SUPPORT vector machines ACOUSTIC imaging computer algorithms NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

Getting close without touching: near-gathering for autonomous mobile robots

引用

DISTRIBUTED COMPUTING 2015年第5期28卷 333-349页

作者： Pagli, Linda Prencipe, Giuseppe Viglietta, Giovanni Univ Pisa Dipartimento Informat Pisa Italy Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON Canada

In this paper we study the Near-Gathering problem for a finite set of dimensionless, deterministic, asynchronous, anonymous, oblivious and autonomous mobile robots with limited visibility moving in the Euclidean plane in Look-Compute-Move cycles. In this problem, the robots have to get close enough to each other, so that every robot can see all the others, without touching (i.e., colliding with) any other robot. The importance of solving the Near-Gathering problem is that it makes it possible to overcome the restriction of having robots with limited visibility. Hence it allows to exploit all the studies (the majority, actually) done on this topic in the unlimited visibility setting. Indeed, after the robots get close enough to each other, they are able to see all the robots in the system, a scenario that is similar to the one where the robots have unlimited visibility. We present the first (deterministic) algorithm for the Near-Gathering problem, to the best of our knowledge, which allows a set of autonomous mobile robots to nearly gather within finite time without ever colliding. Our algorithm assumes some reasonable conditions on the input configuration (the Near-Gathering problem is easily seen to be unsolvable in general). Further, all the robots are assumed to have a compass (hence they agree on the "North" direction), but they do not necessarily have the same handedness (hence they may disagree on the clockwise direction). We also show how the robots can detect termination, i.e., detect when the Near-Gathering problem has been solved. This is crucial when the robots have to perform a generic task after having nearly gathered. We show that termination detection can be obtained even if the total number of robots is unknown to the robots themselves (i.e., it is not a parameter of the algorithm), and robots have no way to explicitly communicate.

关键词： MOBILE robots RESEARCH AUTONOMOUS robots computer algorithms ROBOTS ROBOTICS research

来源：评论

学校读者我要写书评

暂无评论

Non-linear dynamics and chaos control of a damped satellite with partially-filled liquid

引用

JOURNAL OF SOUND AND VIBRATION 1998年第5期217卷 807-825页

作者： Ge, ZM Lee, CI Chen, HH Lee, SC Natl Chiao Tung Univ Dept Mech Engn Hsinchu Taiwan

The dynamic behaviors of a damped satellite with partially-filled liquid which is subjected to external disturbance are studied in this paper. The Lyapunov direct method is used to obtain conditions of stability of the equilibrium point of the system. A co-dimension one bifurcation analysis for the autonomous system is carried out near the degenerate point. It is found that Hopf bifurcation occurs in the system by center manifold theory. By applying numerical results, phase diagrams, power spectrum, Poincare maps, and Lyapunov exponents are presented to observe periodic and chaotic motions. The effect of the parameter changes in the system can be found in the bifurcation and parametric diagrams. For global analysis, the basins of attraction of each attractor of the system are located by employing the modified interpolated cell mapping (MICM) method. Finally, several methods, the delayed feedback control, the addition of constant motor torque, the addition of periodic force, and adaptive control algorithm are used to control chaos effectively. (C) 1998 Academic Press.

关键词： Lyapunov Attractor Autonomous Systems chaos control Attraction computer algorithms torque motors BIFURCATION satellites absorption of shock external disturbance periodic force equilibrium point Liapunov exponents Nonlinear Dynamics

来源：评论

学校读者我要写书评

暂无评论

A New Three-Dimensional Indoor Positioning Mechanism Based on Wireless LAN

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2014年第1期2014卷 1-7页

作者： Cheng, Jiujun Cai, Yueqiao Zhang, Qingyang Cheng, Junlu Yan, Chendan Tongji Univ Dept Comp Sci & Technol Shanghai 201804 Peoples R China Tongji Univ Key Lab Embedded Syst & Serv Comp Minist Educ Shanghai 201804 Peoples R China

The researches on two-dimensional indoor positioning based on wireless LAN and the location fingerprint methods have become mature, but in the actual indoor positioning situation, users are also concerned about the height where they stand. Due to the expansion of the range of three-dimensional indoor positioning, more features must be needed to describe the location fingerprint. Directly using a machine learning algorithm will result in the reduced ability of classification. To solve this problem, in this paper, a "divide and conquer" strategy is adopted;that is, first through k-medoids algorithm the three-dimensional location space is clustered into a number of service areas, and then a multicategory SVM with less features is created for each service area for further positioning. Our experiment shows that the error distance resolution of the approach with k-medoids algorithm and multicategory SVM is higher than that of the approach only with SVM, and the former can effectively decrease the "crazy prediction."

关键词： INDOOR positioning systems (Wireless communication systems) WIRELESS LANs MACHINE learning SUPPORT vector machines computer algorithms MATHEMATICAL analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：