检索结果-南通市图书馆

ant colony algorithm for Solving QoS Routing Problem

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2004年第4期9卷 449-453页

作者： SUNLi-iuan WANGLiang-jun WANGRu-chuan DepartmentofComputerScienceandTechnology NanjingUniversityofPostsandTelecommunicationsNanjing210003JiangsuChina

Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least\|cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss\|constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective.

关键词： ant colony algorithm QoS unicast routing

ant colony algorithm for Path Planning Based on Grid Feature Point Extraction

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai Jiaotong university(Science) 2023年第1期28卷 86-99页

作者：李二超齐款款 College of Electrical and Information Engineering Lanzhou University of TechnologyLanzhou 730050China

Aimed at the problems of a traditional ant colony algorithm,such as the path search direction and field of view,an inability to find the shortest path,a propensity toward deadlock and an unsmooth path,an ant colony algorithm for use in a new environment is ***,the feature points of an obstacle are extracted to preprocess the grid map environment,which can avoid entering a trap and solve the deadlock ***,these feature points are used as pathfinding access nodes to reduce the node access,with more moving directions to be selected,and the locations of the feature points to be selected determine the range of the pathfinding field of ***,based on the feature points,an unequal distribution of pheromones and a two-way parallel path search are used to improve the construction efficiency of the solution,an improved heuristic function is used to enhance the guiding role of the path search,and the pheromone volatilization coefficient is dynamically adjusted to avoid a premature convergence of the ***,a Bezier curve is used to smooth the shortest path ***,using grid maps with a different complexity and different scales,a simulation comparing the results of the proposed algorithm with those of traditional and other improved ant colony algorithms verifies its feasibility and superiority.

关键词： ant colony algorithm mobile robot path planning feature points Bezier curve grid map

Rescheduling of observing spacecraft using fuzzy neural network and ant colony algorithm

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2014年第3期27卷 678-687页

作者： Li Yuqing Wang Rixin Xu Minqiang Deep Space Exploration Research Center Harbin Institute of Technology

This paper aims at rescheduling of observing spacecraft imaging plans under uncertainties. Firstly, uncertainties in spacecraft observation scheduling are analyzed. Then, considering the uncertainties with fuzzy features, this paper proposes a fuzzy neural network and a hybrid rescheduling policy to deal with them. It then establishes a mathematical model and manages to solve the rescheduling problem by proposing an ant colony algorithm, which introduces an adaptive control mechanism and takes advantage of the information in an existing schedule. Finally, the above method is applied to solve the rescheduling problem of a certain type of earth-observing satellite. The computation of the example shows that the approach is feasible and effective in dealing with uncertainties in spacecraft observation scheduling. The approach designed here can be useful in solving the problem that the original schedule is contaminated by disturbances.

关键词： ant colony algorithm Planning and scheduling Rescheduling Spacecraft observing Uncertainty

T-QoS-aware based parallel ant colony algorithm for services composition

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2015年第5期26卷 1100-1106页

作者： Lin Zhang Kaili Rao Ruchuan Wang College of Computer Nanjing University of Posts and Telecommunications Institute of Computer Technology Nanjing University of Posts and Telecommunications Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Key Lab of Broadband Wireless Communication and Sensor Network Technology Nangjing University of Posts and Telecommunications

In order to make cloud users get credible, high-quality composition of services, the trust quality of service aware(TQoS-aware) based parallel ant colony algorithm is proposed. Our approach takes the service credibility as the weight of the quality of service, then calculates the trust service quality T-QoS for each service, making the service composition situated in a credible environment. Through the establishment on a per-service T-QoS initialization pheromone matrix, we can reduce the colony’s initial search time. By modifying the pheromone updating rules and introducing two ant colonies to search from different angles in parallel,we can avoid falling into the local optimal solution, and quickly find the optimal combination of global solutions. Experiments show that our approach can combine high-quality services and the improvement of the operational success rate. Also, the convergence rate and the accuracy of optimal combination are improved.

关键词： services composition trust service quality ant colony algorithm parallel

Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2008年第5期19卷 939-944页

作者： Wang Yanxia Qian Longjun Guo Zhi Ma Lifeng Coll. of Automation Nanjing Univ. of Science and Technology Nanjing 210094 P. R. China

A weapon target assignment （WTA） model satisfying expected damage probabilities with an ant colony algorithm is proposed. In order to save armament resource and attack the targets effectively, the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted. The effect of this WTA model is not maximizing the damage probability but satisfying the whole assignment result. ant colony algorithm has been successfully used in many fields, especially in combination optimization. The ant colony algorithm for this WTA problem is described by analyzing path selection, pheromone update, and tabu table update. The effectiveness of the model and the algorithm is demonstrated with an example.

关键词： weapon target assignment ant colony algorithm optimization.

Simulating the Folding Pathway of RNA Secondary Structure Using the Modified ant colony algorithm

在线全文

学校读者我要写书评

暂无评论

Journal of Bionic Engineering 2010年第4期7卷 382-389页

作者： Jun Yu~(1,2),Changhai Zhang~(1,2),Yuanning Liu~(1,2),Xin Li~(1,2) 1.College of Computer Science and Technology,Jilin University,Changchun 130012,P.R.China 2.Key Laboratory of Symbolic Computation and Knowledge Engineering (Ministry of Education,China) Jilin University,Changchun 130012,P.R.China [a] College of Computer Science Technology Jilin University Changchun 130012 P. R. China [b] Key Laboratory of Symbolic Computation Knowledge Engineering (Ministry of Education China) Jilin University Changchun 130012 P. R. China

A new method for simulating the folding pathway of RNA secondary structure using the modified ant colony algorithmis *** a given RNA sequence,the set of all possible stems is obtained and the energy of each stem iscalculated and stored at the initial ***,a more realistic formula is used to compute the energy ofmulti-branch loop in the following *** a folding pathway is simulated,including such processes as constructionof the heuristic information,the rule of initializing the pheromone,the mechanism of choosing the initial andnext stem and the strategy of updating the pheromone between two different *** by testing RNA sequences withknown secondary structures from the public databases,we analyze the experimental data to select appropriate values *** measure indexes show that our procedure is more consistent with phylogenetically proven structures thansoftware RNAstructure sometimes and more effective than the standard Genetic algorithm.

关键词： RNA secondary structure folding pathway ant colony algorithm

Research on UAV cloud control system based on ant colony algorithm

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2022年第4期33卷 805-811页

作者： ZHANG Lanyong ZHANG Ruixuan School of Intelligent Science and Engineering Harbin Engineering UniversityHarbin 150001China

In the cloud era, the control objects are becoming larger and the information processing is more complex, and it is difficult for traditional control systems to process massive data in a timely manner. In view of the difficulty of data processing in the cloud era, it is extremely important to perform massive data operations through cloud servers. Unmanned aeriel vehicle(UAV) control is the representative of the intelligent field. Based on the ant colony algorithm and incorporating the potential field method, an improved potential field ant colony algorithm is designed. To deal with the path planning problem of UAVs, the potential field ant colony algorithm shortens the optimal path distance by 6.7%, increases the algorithm running time by39.3%, and increases the maximum distance by 24.1% compared with the previous improvement. The cloud server is used to process the path problem of the UAV and feedback the calculation results in real time. Simulation experiments verify the effectiveness of the new algorithm in the cloud environment.

关键词： ant colony algorithm potential field method cloud server path planning

ant colony algorithm based restoration routing for WDM networks

在线全文

学校读者我要写书评

暂无评论

微计算机信息 2008年第33期 99-101页

作者： JIAN Yao-bo RUAN Shuang-chen YANG Chun-yong(Institute of Optoelectronics Science and Engineering,Huazhong University of Science and Technology,430074 Wuhan China)(College of Electronic Science and Technology,ShenZhen University,518060 Shenzhen China)(College of Electronics & Information Engineering,South-central University for Nationalities,430074 Wuhan China)

ant colony algorithm-restoration algorithm(ACA-RA)is a novel simulated evolutionary *** is a population-based approach,which allows positive feedback to be used as the primary search mechanism and provides a new method for compli-cated combinatorial optimization *** this paper,selecting strategy,local searching and information modification are *** improved algorithm is used to search optimal restoration routes in case various failures take place in WDM *** valid result is proven by an algorithm simulation in a practical network CHINANET.

关键词： wavelength division multiplexing ant colony algorithm wavelength routing open shortest path first algorithm breath-first-search algorithm

An Improved Image Steganography Security and Capacity Using ant colony algorithm Optimization

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第9期80卷 4643-4662页

作者： Zinah Khalid Jasim Jasim Sefer Kurnaz Department of Electrical and Computer Engineering Altinbas UniversityIstanbul34000Turkey

This advanced paper presents a new approach to improving image steganography using the ant colony Optimization(ACO)*** steganography,a technique of embedding hidden information in digital photographs,should ideally achieve the dual purposes of maximum data hiding and maintenance of the integrity of the cover media so that it is least *** contemporary methods of steganography are at best a compromise between these *** this paper,we present our approach,entitled ant colony Optimization(ACO)-Least Significant Bit(LSB),which attempts to optimize the capacity in steganographic *** approach makes use of a grayscale cover image to hide the confidential data with an additional bit pair per byte,both for integrity verification and the file checksumof the secret *** approach encodes confidential information into four pairs of bits and embeds it within uncompressed grayscale *** ACO algorithm uses adaptive exploration to select some pixels,maximizing the capacity of data embedding whileminimizing the degradation of visual *** evaporation is introduced through iterations to avoid stagnation in solution *** levels of pheromone are modified to reinforce successful pixel *** results obtained through the ACO-LSB method reveal that it clearly improves image steganography capabilities by providing an increase of up to 30%in the embedding capacity compared with traditional approaches;the average Peak Signal to Noise Ratio(PSNR)is 40.5 dB with a Structural Index Similarity(SSIM)of *** approach also demonstrates very high resistance to detection,cutting down the rate by 20%.Implemented in MATLAB R2023a,the model was tested against one thousand publicly available grayscale images,thus providing robust evidence of its effectiveness.

关键词： Steganography steganalysis capacity optimization ant colony algorithm