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

Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation

作者： Yu Liu Wei-Neng Chen Xiao-min Hu Jun Zhang Sun Yat-sen University Guangzhou China

ISBN: (纸本)9781450334723

With the proliferation of wireless sensor networks (WSN), the issues about how to schedule all the sensors in order to maximize the system's working time have been in the spotlight. Inspired by the promising performance of ant colony optimization (ACO) in solving combinational optimization problem, we attempt to apply it in prolonging the life time of WSN. In this paper, we propose an improved version of ACO algorithm to get solutions about selecting exact sensors to accomplish the covering task in a reasonable way to preserve more energy to maintain longer active time. The methodology is based on maximizing the disjoint subsets of sensors, in other words, in every time interval, choosing which sensor to sustain active state must be rational in certain extent. With the aid of pheromone and heuristic information, a better solution can be constructed in which pheromone denotes the previous scheduling experience, while heuristic information reflects the desirable device assignment. Orderly sensor selection is designed to construct an advisable subset for coverage task. The proposed method has been successfully applied in solving limited energy assignment problem no matter in homogenous or heterogeneous WSNs. Simulation experiments have shown it has a good performance in addressing relevant issues.

关键词： schedule wireless sensors network (WSM) ant colony optimization algorithm maximize working time

来源：评论

学校读者我要写书评

暂无评论

Improvement of big data retrieval algorithm in the intelligent archives management

Improvement of big data retrieval algorithm in the intellige...

引用

2015 IEEE 12th International Conference on Electronic Measurement & Instruments

作者： Wang Yong Liu Liming Qiu Yongsheng Nanjing University of Posts and Telecommunications

Under the guidance of scientific and technological innovation concept, new technology and algorithms are applied to information retrieval and real estate registration system. These excellent algorithms and hardware technology make our file management more convenient, intelligent, and efficient. In this paper, researches on the establishment of intelligent file management system and document retrieval were done based on big data environment and with the combination of the project development experience of the Land and Resources Bureau of Nanjing. First of all, this paper focuses on the defects of Java EE framework which is proposed based on the composite Spring-Struts-Hibernate(SSH) frame system and aims to optimize the performance of SSH and promote its efficiency. Secondly, the growing number of archives is reducing the retrieval efficiency of archives management website. In this paper, the ant colony optimization algorithm is employed to classify the data mining and applied to the quick retrieval of big data. At the same time, the complexity of the optimized algorithm and retrieval efficiency are analyzed. The results show that the retrieval time and efficiency are improved in the big data environment.

关键词： SSH framework improved ant colony optimization algorithm Big data retrieval

来源：评论

学校读者我要写书评

暂无评论

A PARALLEL ant colony optimization algorithm BASED ON FINE-GRAINED MODEL WITH GPU-ACCELERATION

引用

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2009年第11A期5卷 3707-3716页

作者： Li, Jianming Hu, Xiangpei Pang, Zhanlong Qian, Kunming Dalian Univ Technol Sch Elect & Informat Engn Dalian 116023 Liaoning Prov Peoples R China Dalian Univ Technol Inst Syst Engn Dalian 16023 Liaoning Prov Peoples R China

Fine-grained parallel ant colony optimization algorithm (FGACO), though a popular and robust strategy for solving complicated optimization problems, is sometimes inconvenient to use as its population size is restricted by heavy data communication and the parallel computers are relatively difficult to use, manage, maintain and may not be accessible to most researchers. In this paper, we propose a FGACO method based on GP U-acceleration, which maps parallel ACO algorithm to GPU through the compute unified device architecture (CUDA). The analytical results demonstrate that, the proposed method increases the population size, speeds up its execution and provides ordinary users with a feasible FGACO solution.

关键词： ant colony optimization algorithm Parallel process CPU CUDA Fine-grained

来源：评论

学校读者我要写书评

暂无评论

Identification of constitutive parameters for fractional viscoelasticity

引用

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2014年第1期19卷 311-322页

作者： Zhao Xiao Yang Haitian He Yiqian Dalian Univ Technol Dept Engn Mech State Key Lab Struct Anal Ind Equipment Dalian 116024 Peoples R China

This paper develops a numerical model to identify constitutive parameters in the fractional viscoelastic field. An explicit semi-analytical numerical model and a finite difference (FD) method based numerical model are derived for solving the direct homogenous and regionally inhomogeneous fractional viscoelastic problems, respectively. A continuous ant colony optimization (ACO) algorithm is employed to solve the inverse problem of identification. The feasibility of the proposed approach is illustrated via the numerical verification of a two-dimensional identification problem formulated by the fractional Kelvin-Voigt model, and the noisy data and regional inhomogeneity etc. are taken into account. (c) 2013 Elsevier B.V. All rights reserved.

关键词： Parameters identification Inverse problem Viscoelasticity Fractional derivatives ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis of Evolutionary Stability of Funds Flows in Financial Networks

Analysis of Evolutionary Stability of Funds Flows in Financi...

引用

IEEE Congress on Evolutionary Computation

作者： Ke Yang Weiyi Liu Hong Wu Kun Yue Dept. of Comput. Sci. & Eng. Yunnan Univ. Kunming China

ISBN: (纸本)9781479974931

Recently, there has been much more attention focusing on the evolving networks, whose application domains include Web networks, social networks, communication networks and etc. In this paper, we focus on a financial network, where nodes represent participants of a financial market. Due to lending activities, funds are transferred from one participant to another, and credit-debt relationships between them are formed. With repeated activities, flows of funds are shown in a financial network We analyze the evolution of funds flows based on evolutionary game theory. Using Lyapunov stability method, we prove that funds flows converge to a relatively stable state, and prove a bound on the convergence time. Finally, we design an ant colony optimization algorithm for a financial network, and use experiments to simulate the evolving process of funds flows.

关键词： evolving network financial network funds flows evolutionary game evolutionary stability ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Vehicle Routing Problem based Model and ant colony optimization algorithm for Group Charge Problem of Ingot Casting

Vehicle Routing Problem based Model and Ant Colony Optimizat...

引用

21st Chinese Control and Decision Conference

作者： Huang Hui Tu Nai-wei Ma Tian-mu Zheng Bing-lin Chai Tian-you Minist Educ Key Lab Proc Ind Automat Shenyang 110004 Peoples R China

ISBN: (纸本)9781424427239

Group charge problem of ingot casting is one of iron & steel production planning and scheduling problems. Compares with the steel-making - continuous casting's group charge problem, the ingot casting's group charge problem has the difference in the process constraint and planning rules. On the basis of analyzing the difference between group charge problem of ingot casting and group charge problem of steelmaking, VRP model for group charge problem of ingot casting is established in consideration of technological regulation and process constraint. Aiming at characteristic of model, ant colony optimization (ACO) algorithm is proposed for solving the model. The experimental result using practical production data shows the proposed model and algorithm are effective and feasible.

关键词： ingot casting charge plan vehicle routing problem ant colony optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Aco and Ga Based Fault-Tolerant Scheduling of Real-Time Tasks on Multiprocessor Systems - A Comparative Study 8

Aco and Ga Based Fault-Tolerant Scheduling of Real-Time Task...

引用

8th IEEE International Conference on Intelligent Systems and Control (ISCO)

作者： Kumar, Abhaya Panda, Sunita Pani, Subhendu Kumar Baghel, Vikas Panda, Ankita Samal Sambalpur Univ Sambalpur Orissa India DRIEMS Dept ETE Cuttack Orissa India OEC Dept CSE Bhubaneswar Orissa India IIT Sch Elect Sci Bhubaneswar Orissa India Texas A&M Univ Dept CSE College Stn TX 77843 USA

ISBN: (纸本)9781479938377

Fault-tolerant scheduling of real-time (RT) tasks in multiprocessor environment is essentially a NP-hard problem. This basically involves allocating a set of tasks to a set of processors so as to minimize the makespan and ensure tasks to meet their timing constraints. Many traditional heuristic approaches, such as earliest deadline first (EDF) and least laxity first (LLF) have been adopted to find optimal solution to this scheduling problem. However, conventional approach to achieve fault-tolerance (FT) in scheduling RT tasks based on traditional heuristic approach suffers from poor performance and results in inefficient processor utilization. Nature-inspired heuristic algorithms are gaining increased acceptance among researcher for solving real world NP-hard combinatorial optimization problems. This paper presents a comparative study of the novel primary-backup (PB) based fault-tolerant scheduling (PBFTS) technique for RT tasks in multiprocessor environment using two popular nature-inspired heuristic algorithms: the ant colony optimization (ACO) and the Genetic algorithm (GA). Exhaustive simulation reveals that the PBFTS algorithm based on GA and ACO both outperform the traditional PBFTS schemes in terms of performance, system utilization and efficiency. However, the comparative study also shows that the ACO based scheme surpasses the GA based scheme in terms of speed of execution whereas GA based scheme displays superior convergence with respect to ACO counterpart.

关键词： Real-time system Primary-backup approach Fault-tolerance Genetic algorithm ant colony optimization algorithm Heuristic based scheduling approach

来源：评论

学校读者我要写书评

暂无评论

An ACO-Based Trust Inference algorithm 9

An ACO-Based Trust Inference Algorithm

引用

International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)

作者： Shi, Leyi Wang, Yao Liu, Xin China Unveris Petr Coll Comp & Commun Engn Qingdao Shandong Peoples R China

ISBN: (纸本)9781479941735

The trust value between two nodes is important for their interactions in social network. In this paper we propose an ACO-based trust inference algorithm. First, we use the ant colony optimization algorithm to find two trust trains with high trust value between any two nodes, since the most accurate information comes from the node with the highest trust value. We optimized the corresponding parameters of the ACO algorithm to make it adaptive to our problem. Indirect trust value between two nodes is calculated according to direct trust value and trust chains got by ACO. The statistical analysis indicates that our algorithm gains more accuracy of trust value computing compared with a classical trust algorithm.

关键词： social network social trust ant colony optimization algorithm trust trains

来源：评论

学校读者我要写书评

暂无评论

AB-Chord: An Improved Chord Based on ant colony optimizationand Bi-directional Lookup Routing 6

AB-Chord: An Improved Chord Based on Ant Colony Optimization...

引用

6th International Symposium on Parallel Architectures, algorithms, and Programming (PAAP)

作者： Zhao, Limin Shen, Hong Li, Yidong Wu, Jun Beijing Jiaotong Univ Sch Comp & Informat Technol Beijing Peoples R China Sun Yat Sen Univ Sch Informat Sicnece & Technol Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781479938445

Chord is a popular and successful topology for P2P data sharing. However, the conventional chord has an obvious drawback - it fails to consider the physical topology of the P2P network for designing the lookup solution, which may bring tremendous delay to network routing. In order to address the drawback and further speeds up searching for local resources, we propose an improved chord based on the ant colony optimization algorithm and Bi-directional lookup routing method in this paper. We first apply the ant colony optimization algorithm for building the chord ring to match the topology between the overlay network and physical network. We then develop a bi-directional lookup routing mechanism to further speed up searching for local resources. Simulation results show that our improved chord scheme is significantly more efficient than the conventional chord method.

关键词： P2P Chord ant colony optimization algorithm Bi-directional Routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：