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

R-LINE: A better randomized 2-server algorithm on the line

THEORETICAL COMPUTER SCIENCE 2015年 605卷 106-118页

作者： Bang, Lucas Bein, Wolfgang Larmore, Lawrence L. Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA Univ Nevada Dept Comp Sci Las Vegas NV 89154 USA

A randomized on-line algorithm is given for competitiveness less than 1901 against the previously best known competitiveness of IN uses a new approach and defines a potential in the 2-server problem on the line, with oblivious adversary. This improves the 155/78 approximate to 1.987 for the problem. The algorithm terms of isolation indices from T-theory. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Online algorithms Randomized algorithms Server problem algorithm design T-theory Game theory

来源：评论

学校读者我要写书评

暂无评论

Recent advances in metaheuristic algorithms: Does the Makara dragon exist?

引用

JOURNAL OF SUPERCOMPUTING 2016年第10期72卷 3764-3786页

作者： Fong, Simon Wang, Xi Xu, Qiwen Wong, Raymond Fiaidhi, Jinan Mohammed, Sabah Univ Macau Dept Comp & Informat Sci Zhuhai Macau Peoples R China Univ New South Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia Lakehead Univ Dept Comp Sci Thunder Bay ON Canada

Metaheuristic algorithms (MHs) have a long history that can be traced back to genetic algorithms and evolutionary computing in the 1950s. Since February 2008, with the birth of the Firefly algorithm, MHs started to receive attention from researchers around the globe. Variants and new species of MH algorithms have bloomed like sprouts after rain. However, the necessity for creating more new species of such algorithms is questionable. It can be observed that these algorithms are fundamentally made up of several widely used core components. By explaining these components, the underlying design for a collection of the so-called modern MH optimisation algorithms is revealed. In this paper, the core components in some of the more popular MH algorithms are reviewed, thereby debunking the myths of their novelty, and perhaps dampening claims that something really 'new' is invented simply by branding an MH search method with the name of another living creature. Counterintuitive experimentations have shown that by taking snapshots, anyone can show some improvements of an MH over another in some situation. Mixing certain components up indeed adds advantage over the original MH. The same goes to extending MH with slight functional modification. This work also serves as a general guideline and a reference for any algorithm architect who wants to create a new MH algorithm in the future.

关键词： Metaheuristics Search methods Swarm intelligence algorithm design

来源：评论

学校读者我要写书评

暂无评论

A truthful mechanism for multi-access multi-server multi-task resource allocation in mobile edge computing

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2024年第1期17卷 532-548页

作者： Liu, Xi Liu, Jun Qujing Normal Univ Sch Informat Engn Qujing Peoples R China Qujing Normal Univ Inst Appl Math Qujing Peoples R China

This paper addresses multi-access multi-server multi-task resource allocation in mobile edge computing (MEC). Our aim is to maximize social welfare for heterogeneous MEC servers from multiple access points (APs) providing heterogeneous virtual machine instances to the mobile devices (MDs) within the coverage area. In the system model, each MD has multiple tasks, and tasks can offload to more than one MEC server through different APs within its direct communication range. We formulated the problem with an auction-based model to provide flexible service. However, the MDs are self-interested and can misreport their preferences, leading to inefficient resource allocation. We designed an optimal approximation mechanism to solve this problem. Then, we showed that this mechanism achieves individual rationality and truthfulness, that is, the MDs had no incentive to declare untrue values. In addition, we analyzed the approximation ratio of our truthfulness mechanism. The task allocation problem was also considered, and the proposed approximation algorithm could stop at any step and provide reasonable performance. Experimental results demonstrated that our proposed approximation mechanism provides near-optimal social welfare in a reasonable time and effectively reduces energy consumption.

关键词： Mobile edge computing Truthfulness Resource allocation Energy consumption algorithm design

来源：评论

学校读者我要写书评

暂无评论

Two-stage multi-objective evolutionary algorithm for overlapping community discovery

引用

PEERJ COMPUTER SCIENCE 2024年 10卷 e2185页

作者： Cai, Lei Zhou, Jincheng Wang, Dan Qiannan Normal Univ Nationalities Sch Comp & Informat Key Lab Complex Syst & Intelligent Optimizat Guizh Duyun Guizhou Peoples R China Guizhou Univ Coll Comp Sci & Technol State Key Lab Publ Big Data Guiyang Peoples R China Qiannan Normal Univ Nationalities Sch Math & Stat Duyun Guizhou Peoples R China

As one of the essential topological structures in complex networks, community structure has signi fi cant theoretical and application value and has attracted the attention of researchers in many fi elds. In a social network, individuals may belong to different communities simultaneously, such as a workgroup and a hobby group. Therefore, overlapping community discovery can help us understand and model the network structure of these multiple relationships more accurately. This article proposes a two-stage multi-objective evolutionary algorithm for overlapping community discovery problem. First, using the initialization method to divide the central node based on node degree, combined with the cross-mutation evolution strategy of the genome matrix, the fi rst stage of non-overlapping community division is completed on the decomposition-based multi-objective optimization framework. Then, based on the result set of the fi rst stage, appropriate nodes are selected from each individual ' s community as the central node of the initial population in the second stage, and the fuzzy threshold is optimized through the fuzzy clustering method based on evolutionary calculation and the feedback model, to fi nd reasonable overlapping nodes. Finally, tests are conducted on synthetic datasets and real datasets. The statistical results demonstrate that compared with other representative algorithms, this algorithm performs optimally on test instances and has better results.

关键词： Overlapping community discovery Evolutionary clustering Fuzzy clustering Feedback model algorithm design

来源：评论

学校读者我要写书评

暂无评论

Model-based diagnosis through Structural Analysis and Causal Computation for automotive Polymer Electrolyte Membrane Fuel Cell systems

引用

JOURNAL OF POWER SOURCES 2017年 357卷 26-40页

作者： Polverino, Pierpaolo Frisk, Erik Jung, Daniel Krysander, Mattias Pianese, Cesare Univ Salerno Dept Ind Engn Via Giovanni Paolo 2 132 I-84084 Fisciano SA Italy Linkoping Univ Dept Elect Engn S-5183 Linkoping Sweden

The present paper proposes an advanced approach for Polymer Electrolyte Membrane Fuel Cell (PEMFC) systems fault detection and isolation through a model-based diagnostic algorithm. The considered algorithm is developed upon a lumped parameter model simulating a whole PEMFC system oriented towards automotive applications. This model is inspired by other models available in the literature, with further attention to stack thermal dynamics and water management. The developed model is analysed by means of Structural Analysis, to identify the correlations among involved physical variables, defined equations and a set of faults which may occur in the system (related to both auxiliary components malfunctions and stack degradation phenomena). Residual generators are designed by means of Causal Computation analysis and the maximum theoretical fault isolability, achievable with a minimal number of installed sensors, is investigated. The achieved results proved the capability of the algorithm to theoretically detect and isolate almost all faults with the only use of stack voltage and temperature sensors, with significant advantages from an industrial point of view. The effective fault isolability is proved through fault simulations at a specific fault magnitude with an advanced residual evaluation technique, to consider quantitative residual deviations from normal conditions and achieve univocal fault isolation. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Polymer Electrolyte Membrane Fuel Cell Model-based diagnosis Fault detection Fault isolation Residual generation algorithm design

来源：评论

学校读者我要写书评

暂无评论

A dual-mode evolutionary algorithm for designing optimized refrigerant circuitries for finned-tube heat exchangers

引用

HVAC&R RESEARCH 2012年第5期18卷 834-844页

作者： Yashar, David A. Wojtusiak, Janusz Kaufman, Kenneth Domanski, Piotr A. NIST HVAC&R Equipment Performance Grp BFRL Gaithersburg MD 20899 USA George Mason Univ Dept Hlth Adm & Policy Fairfax VA 22030 USA George Mason Univ Machine Learning & Inference Lab Fairfax VA 22030 USA Internal Revenue Serv Res Off Washington DC USA

Heat exchanger performance is strongly influenced by the refrigerant circuitry, i.e., the connection sequence of the tubes. This article describes an evolutionary computation-based approach for designing an optimized refrigerant circuitry used in an intelligent system for heat exchanger design. The technique used in this design employs two methods to generate designs implemented separately in two modules: the knowledge-based evolutionary computation module and the symbolic-learning-based evolutionary computation module. The optimization example presented in this article employed each module independently and used the combined approach to demonstrate the performance of each module and the power of the combined module approach. The best circuitry designs determined through these optimization runs yielded substantial capacity improvements over the original design;the symbolic-learning-and knowledge-based modules returned circuitry designs that improved the heat exchanger capacity by 2.6% and 4.8%, respectively, while the combined module approach resulted in a circuitry design that improved the capacity by 6.5%.

关键词： heat exchangers Refrigerants Intelligent systems finned tube heat exchanger evolutionary algorithm algorithm design Heat exchanger tubes

来源：评论

学校读者我要写书评

暂无评论

An adaptive generic sorting algorithm that uses variable partitioning

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1996年第3-4期61卷 181-194页

作者： EstivillCastro, V Wood, D HONG KONG UNIV SCI & TECHNOL DEPT COMP SCIKOWLOONHONG KONG

A sorting algorithm is adaptive if its run time, for inputs of the same size n, varies smoothly from O (n) to O (n log n) as the disorder of the input varies. It is well accepted that files that are already sorted are often sorted again and that nearly sorted files often occur. Recently, researchers have focused their attention on sorting algorithms that are optimally adaptive with respect to several measures of disorder, since the type of disorder in the input is usually not known. They have demonstrated a need to develop tools for the construction of sorting algorithms that are adaptive with respect to large classes of measures. We present Partition Sort, a new generic sorting algorithm for which we can establish adaptivity. It is based on divide-and-conquer in which the number of subproblems at each level of recursion depends on the disorder of the input. We apply this generic algorithm to obtain optimal adaptivity for several measures of disorder. In addition, we introduce Randomized Partition Sort, a randomized version of Partition Sort, that not only is adaptive in the expected case, but also simplifies implementation (for example, it avoids median finding).

关键词： algorithm design analysis of algorithms adaptive sorting

来源：评论

学校读者我要写书评

暂无评论

Parameter Optimization and Experimental Test of 4-MJ/m³ IPPS Module

引用

IEEE TRANSACTIONS ON PLASMA SCIENCE 2021年第2期49卷 921-927页

作者： Sun, Hao Yu, Xinjie Li, Bei Li, Zhen He, Hongzhuang Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Tsinghua Univ State Key Lab Power Syst Beijing 100084 Peoples R China Xi An Jiao Tong Univ Dept Elect Engn Xian 710048 Peoples R China

Inductive pulsed power supply (IPPS) is a competitive type of power supply for electromagnetic launch (EML). Compared with the capacitive type, the structure and working process of IPPS are more complicated, which make the design of the IPPS module difficult. In this article, the method of calculating the module performance from structural and electrical parameters is proposed. Based on that, the biobjective optimization of a 100-kJ module is carried out. With the help of genetic algorithms, the optimization results are 2500 nondominated solutions on the Pareto front, and one of the representative solutions is verified by experiments. The performance of the built module is in good agreement with the calculated value. Its energy density reaches 3.98 MJ/m(3), the peak output current reaches 23 kA with 8.1-ms pulsewidth.

关键词： Optimization Power supplies Inductors Genetic algorithms Capacitors Topology Power system measurements algorithm design biobjective optimization experimental verification inductive pulsed power supply (IPPS)

来源：评论

学校读者我要写书评

暂无评论

TRACKING CONTROL TECHNIQUE FOR INDUCTION-MOTORS

引用

IEEE TRANSACTIONS ON ENERGY CONVERSION 1989年第1期4卷 81-87页

作者： ELSHARKAWI, MA AKHERRAZ, M UNIV WASHINGTON MOHAMMED SCH ENGNSEATTLEWA 98195

A novel application is presented of the tracking control technique to induction motor drive systems. By this technique, the position or the speed of the rotor can follow a preselected track (a time history of rotor position or velocity). An algorithm for the design of the tracking controller is developed. The induction motor model and the controller are modified to allow the inclusion of the nonlinear modes in the system without excessive computations. A simple and realistic criterion for selecting the proper reference tracks during starting, speed control and braking is proposed. The controller developed, is tested on a full-size nonlinear analog simulator. All test results show the effectiveness of the scheme in position-tracking applications such as robotics and manipulators.

关键词： rotor position time history induction motors robotics induction motor drives tracking controller tracking control Controllers Control technology Braking algorithm design Manipulators rotor speed Track Clinical Test Result

来源：评论

学校读者我要写书评

暂无评论

Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures

引用

COMPUTER 2015年第8期48卷 46-55页

作者： Halappanavar, Mahantesh Pothen, Alex Azad, Ariful Manne, Fredrik Langguth, Johannes Khan, Arif Pacific NW Natl Lab Fundamental & Computat Sci Directorate Richland WA 99352 USA Purdue Univ Comp Sci W Lafayette IN 47907 USA Lawrence Livermore Natl Lab Computat Res Div Livermore CA USA Univ Bergen Comp Sci N-5020 Bergen Norway Simula Res Lab Oslo Norway Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

Executing irregular, data-intensive workloads on multithreaded architectures can result in performance losses and scalability problems. Codesigning algorithms and architectures can realize high performance on irregular applications. A codesign study reveals four key lessons learned from implementing matching algorithms on various platforms.

关键词： graph theory multi-threading parallel architectures codesign algorithm graph matching algorithm irregular-data-intensive workload execution multithreaded architectures performance loss scalability problem algorithm design and analysis Computer architecture Computer graphics Irregular applications Multithreading Parallel programming algorithm design graph matching irregular applications matching algorithms multithreaded architectures parallel architectures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：