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

IEEE International Conference on Systems, Man and Cybernetics

作者： Yang Jianxiong Watada, Junzo Waseda Univ Grad Sch Informat Prod & Syst Kitakyushu Fukuoka 8080135 Japan

ISBN: (纸本)9781424427932

This paper proposes an algorithm for data mining named Pheromone-Miner (ant-colony-based data miner). The algorithm is inspired by both researches on the behavior of real ant colonies and data mining concepts as well as principles. The goal of Pheromone-Miner is to extract more exact knowledge from a database. Pheromone-based mining breaks through limitations of other mining approaches. We compare the performance of pheromone-miner with a general semantic miner. The accident causes discovered by ant-miner are considerably more accurate than those discovered by a general semantic miner. In a word, this evolutionary algorithm is suitable for improving the accuracy of data miners.

关键词： ant colony optimization algorithm pheromone data mining knowledge discovery

来源：评论

学校读者我要写书评

暂无评论

Crosstalk- and fragmentation-aware survivable routing, modulation, space, and spectrum assignment using ant colony optimization

引用

COMPUTER NETWORKS 2024年 249卷

作者： de Lima, Leandro Alvarez Pavani, Gustavo Sousa Fed Univ ABC UFABC Ctr Matemat Comp & Cognicao Av Estados 5001 BR-09210580 Santo Andre SP Brazil

The use of Space Division Multiplexing (SDM) technology in Elastic Optical Networks (EONs) is a promising solution to improve the transport capability and flexibility required by next -generation applications. In this work, we have illustrated that ant colony optimization (ACO) algorithms can be incorporated into the network control plane and associated with a crankback mechanism to provision and restore lightpaths in a fully distributed manner. In effect, by tackling the challenging Routing, Modulation, Spectrum, and Space Assignment (RMSSA) problem, ACO algorithms can address the inter -core crosstalk and spectrum fragmentation that may limit the potential of the SDM-EON. By comparing different levels of resource state accuracy at the control plane, the simulation results demonstrate the superior performance of the ACO algorithms compared to routing algorithms based on a centralized control plane with a link -state routing protocol, showcasing lower bandwidth blocking rate, comparable restorability, controlled crosstalk levels, and higher scalability, all achieved without a significant increase in setup and restoration times.

关键词： Distributed AI-based network management and control ant colony optimization algorithm Optical networks Restoration Space division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Development and Control of an upper Limb Rehabilitation Robot via ant colony optimization-PID and Fuzzy-PID Controllers

引用

INTERNATIONAL JOURNAL OF ENGINEERING 2022年第8期35卷

作者： Mirrashid, N. Alibeiki, E. Rakhtala, S. M. Islamic Azad Univ Dept Elect Engn Aliabad Katoul Branch Aliabad Katoul Iran Golestan Univ Fac Engn Dept Elect Engn Gorgan Golestan Iran

The control of movement rehabilitation robots is necessary for the recovery of physically disabled patients and is an interesting open problem. This paper presents a mathematical model of the upper limb rehabilitation robot using Euler-Lagrange approach. Since the PID controller is one of the most popular feedback controllers in the control strategy due to its simplicity, we an ACO-PID controller for an upper limb rehabilitation robot. The main part of designing the PID controller is determining the gains of the controller. For this purpose. we ant colony optimization algorithm (ACO) to tune the coefficients. To evaluate the validity of the proposed controller, we have compared it to Fuzzy-PID controller and the PID controller adjusted with the Ziegler-Nichols method (ZN-PID). The results that the performance of the ACO-PID controller is better than the others. Also, the adaptive PID controllers (ACO-PID and Fuzzy-PID) ensure accurate tracking, finite-time convergence, and stability. The results that the mean absolute error and normalized root mean square (NRMS) of tracking error using the CO-PID are less than that using the Fuzzy-PID and ZN-PID controller.

关键词： Rehabilitation Robot ant colony optimization algorithm Fuzzy-PID Controller Ziegler-Nichols Method PID Tuning

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient task allocation for reliable parallel computation of cluster-based wireless sensor network in edge computing

引用

Digital Communications and Networks 2023年第2期9卷 473-482页

作者： Jiabao Wen Jiachen Yang Tianying Wang Yang Li Zhihan Lv School of Electrical and Information Engineering Tianjin UniversityTianjin300072China College of Mechanical and Electrical Engineering Shihezi UniversityXinjiang832003China School of Data Science and Software Engineering Qingdao UniversityQingdao266000China

To efficiently complete a complex computation task,the complex task should be decomposed into subcomputation tasks that run parallel in edge *** Sensor Network(WSN)is a typical application of parallel *** achieve highly reliable parallel computation for wireless sensor network,the network's lifetime needs to be ***,a proper task allocation strategy is needed to reduce the energy consumption and balance the load of the *** paper proposes a task model and a cluster-based WSN model in edge *** our model,different tasks require different types of resources and different sensors provide different types of resources,so our model is heterogeneous,which makes the model more *** we propose a task allocation algorithm that combines the Genetic algorithm(GA)and the ant colony optimization(ACO)*** algorithm concentrates on energy conservation and load balancing so that the lifetime of the network can be *** experimental result shows the algorithm's effectiveness and advantages in energy conservation and load balancing.

关键词： Wireless sensor network Parallel computation Task allocation Genetic algorithm ant colony optimization algorithm Energy-efficient Load balancing

来源：评论

学校读者我要写书评

暂无评论

The Lobe Fissure Tracking by the Modified ant colony optimization Framework in CT Images

引用

algorithmS 2014年第4期7卷 635-649页

作者： Chen, Chii-Jen Wang, You-Wei Shen, Wei-Chih Chen, Chih-Yi Fang, Wen-Pinn Yuanpei Univ Med Technol Dept Comp Sci & Informat Engn Hsinchu 30015 Taiwan Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 10617 Taiwan Asia Univ Dept Comp Sci & Informat Engn Taichung 40402 Taiwan Chung Shan Med Univ Inst Med Taichung 40201 Taiwan

Chest computed tomography (CT) is the most commonly used technique for the inspection of lung lesions. However, the lobe fissures in lung CT is still difficult to observe owing to its imaging structure. Therefore, in this paper, we aimed to develop an efficient tracking framework to extract the lobe fissures by the proposed modified ant colony optimization (ACO) algorithm. We used the method of increasing the consistency of pheromone on lobe fissure to improve the accuracy of path tracking. In order to validate the proposed system, we had tested our method in a database from 15 lung patients. In the experiment, the quantitative assessment shows that the proposed ACO method achieved the average F-measures of 80.9% and 82.84% in left and right lungs, respectively. The experiments indicate our method results more satisfied performance, and can help investigators detect lung lesion for further examination.

关键词： CT ant colony optimization algorithm lung lobe fissure segmentation

来源：评论

学校读者我要写书评

暂无评论

An ant stochastic decision based particle filter and its convergence

引用

SIGNAL PROCESSING 2010年第9期90卷 2731-2748页

作者： Xu, Benlian Zhu, Jihong Xu, Huigang Changshu Inst Technol Sch Elect & Automat Engn Changshu 215500 Peoples R China Nanjing Univ Sci & Technol Sch Automat Nanjing 210094 Peoples R China

Particle filter (PF) is a kind of flexible and powerful sequential Monte-Carlo technique designed to solve the optimal nonlinear parameter estimation numerically, and the degradation of particles in generic PF occurs when it is applied to the model switching dynamic system. To avoid this phenomenon, an ant stochastic decision based particle filter is proposed to encapsulate model switching information through dividing probabilistically particles into two model operations, and then a well defined re-sampling scheme is introduced to gain a better overlap with the true density function. To show the theoretic consistency with the generic PF, its basic convergence result is presented as well. Finally, we compare the performance of our proposed algorithm with that of other estimators (e.g., PF and moving ant estimator), and simulation results demonstrate its superior robustness of parameter estimation for switching dynamic system. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Particle filter ant colony optimization algorithm Target tracking Convergence analysis

来源：评论

学校读者我要写书评

暂无评论

ACO-HCO: Heuristic Performance Tuning Scheme for the Hadoop MapReduce Architecture

引用

JOURNAL OF INTERNET TECHNOLOGY 2020年第4期21卷 1151-1159页

作者： Liu, Chiang-Lung Lo, Hsiang-Fu Lee, Wei-Tsong Natl Def Univ Dept Elect & Elect Engn Chung Cheng Inst Technol Taoyuan Taiwan Chung Shan Inst Sci & Technol Chem Syst Res Div Taoyuan Taiwan Tamkang Univ Dept Elect Engn New Taipei Taiwan

Hadoop MapReduce is a widely-used cloud computing technology for big data processing. However, the Hadoop configuration parameters settings can significantly change the execution performance. Manual adjustment of the Hadoop parameters will be a time consuming and difficult task. In this paper, we propose ACO-HCO, a Hadoop configuration tuning scheme for MapReduce applications. We use MapReduce applications job history records to generate specific job profiles. Based on these profiles, an objective function for execution time is constructed with gene expression programming algorithm by mining the correlation among the core Hadoop configuration parameters and input data size. Leveraging the objective function, an ACO-based configuration optimizer is able to heuristically search for the optimal configuration for a given application. Experimental results show that ACO-HCO enhances the performance of Hadoop significantly compared with the default configuration. Moreover, ACO-HCO performs better than heuristic approach and the cost-based model in Hadoop performance tuning.

关键词： Hadoop performance tuning ant colony optimization algorithm Gene expression programming

来源：评论

学校读者我要写书评

暂无评论

optimization of multiple autonomous underwater vehicle cooperative system communication network topology based on total energy consumption

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART M-JOURNAL OF ENGINEERING FOR THE MARITIME ENVIRONMENT 2020年第3期234卷 668-675页

作者： Liang, Qingwei Ou, Junlin Shi, Liang Zhang, Xin Northwestern Polytech Univ Sch Marine Sci & Technol Xian 710072 Shaanxi Peoples R China

Given the importance of the communication energy consumption of multiple autonomous underwater vehicle cooperative systems in practical work, this work optimizes the network topology to reduce total energy consumption. In accordance with the characteristics of underwater communication, the energy consumption of communication links is obtained, thereby obtaining the total communication energy consumption of multiple autonomous underwater vehicle cooperative systems. Taking the all-terminal reliability of the communication network as a constraint and the total energy consumption of network communication as the optimization goal, this work puts forward an optimization model for the communication network topology of multiple autonomous underwater vehicle cooperative systems. Furthermore, this work creatively describes the network topology optimization problem as a special path optimization problem suitable for the ant colony optimization algorithm presented to solve the optimization problem and shown to be effective and efficiency on this problem.

关键词： Network topology total energy consumption ant colony optimization algorithm optimization model multiple autonomous underwater vehicle cooperative system

来源：评论

学校读者我要写书评

暂无评论

An improved dynamic model identification method for small unmanned helicopter

引用

AIRCRAFT ENGINEERING AND AEROSPACE TECHNOLOGY 2024年第1期96卷 175-183页

作者： Zhou, Jian Liu, Shuyu Lu, Jian Liu, Xinyu Xian Polytech Univ Sch Elect & Informat Xian Peoples R China

PurposeThe purpose of this paper is to introduce an improved system identification method for small unmanned helicopters combining adaptive ant colony optimization algorithm and Levy's method and to solve the problem of low model prediction accuracy caused by low-frequency domain curve fitting in the small unmanned helicopter frequency domain parameter identification ***/methodology/approachThis method uses the Levy method to obtain the initial parameters of the fitting model, uses the global optimization characteristics of the adaptive ant colony algorithm and the advantages of avoiding the "premature" phenomenon to optimize the initial parameters and finally obtains a small unmanned helicopter through computational optimization Kinetic models under lateral channel and longitudinal *** algorithm is verified by flight test data. The verification results show that the established dynamic model has high identification accuracy and can accurately reflect the dynamic characteristics of small unmanned helicopter ***/valueThis paper presents a novel and improved frequency domain identification method for small unmanned helicopters. Compared with the conventional method, this method improves the identification accuracy and reduces the identification error.

关键词： Small unmanned helicopter Frequency domain identification Frequency domain curve fitting ant colony optimization algorithm Levy method model identification

来源：评论

学校读者我要写书评

暂无评论

Path selection model and algorithm for emergency logistics management

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2009年第3期56卷 1081-1094页

作者： Yuan, Yuan Wang, Dingwei Northeastern Univ Dept Management Sci & Engn Sch Business Adm Shenyang Peoples R China Northeastern Univ Sch Informat Sci & Engn Inst Syst Engn Shenyang Peoples R China

Path selection is one of the fundamental problems in emergency logistics management. Two mathematical models for path selection in emergency logistics management are presented considering more actual factors in time of disaster. First a single-objective path selection model is presented taking into account that the travel speed on each arc will be affected by disaster extension. The objective of the model is to minimize total travel time along a path. The travel speed on each arc is modeled as a continuous decrease function with respect to time. A modified Dijkstra algorithm is designed to solve the model. Based oil the first model, we further consider the chaos, panic and congestions in time of disaster. A multi-objective path selection model is presented to minimize the total travel time along a path and to minimize the path complexity. The complexity of the path is modeled as the total number of arcs included in the path. An ant colony optimization algorithm is proposed to solve the model. Simulation results show the effectiveness and feasibility of the models and algorithms presented in this paper. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Emergency logistics management Path selection Disaster extension Path complexity Modified Dijkstra algorithm ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：