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

Congress on Evolutionary Computation (CEC)

作者： Leith, C Takahara, G Queens Univ Dept Math & Stats Kingston ON K7L 3N6 Canada

ISBN: (纸本)0780378040

We propose a new framework for ant-based routing algorithms which addresses the trade-off between effective and timely discovery of optimal routes, and the desire to keep data traffic flowing smoothly. The approach utilizes a database of stored delay estimates on routes to build separate routing tables for ants and data packets. This decoupling results in better control of responsiveness to load or topology fluctuations since the tables can evolve at different rates, according to different rules. The presented architecture also features guaranteed loop-free routes for data packets.

关键词： ant algorithm dynamic routing updates with memory control of responsiveness loop-free routes

来源：评论

学校读者我要写书评

暂无评论

Tracing denial of service origin: ant colony approach

Tracing denial of service origin: Ant colony approach

引用

EvoWorkshops 2006

作者： Chen, Chia-Mei Jeng, Bing Chiang Yang, Chia Ru Lai, Gu Hsin Natl Sun Yat Sen Univ Dept Informat Management Kaohsiung 804 Taiwan

ISBN: (纸本)3540332375

Denial-of-Service (DoS) attacks with fake source IP addresses have become a major threat to the Internet. Intrusion detection systems are often used to detect DoS attacks. However, DoS attack packets attempt to exhaust resources, degrading network performance or, even worse, causing network breakdown. The proposed proactive approach is allocating the original attack host(s) issuing the attacks and stopping the malicious traffic, instead of wasting resources on the attack traffic. ant colony based traceback approach is presented in this study to identify the DoS attack original source IP address. Instead of creating a new function or processing a high volume of fine-grained data, the proposed IP address traceback approach uses flow level information to identify the origin of a DoS attack. The proposed method is evaluated through simulation on various network environments. The simulation results show that the proposed method can successfully and efficiently find the DoS attack path in various simulated network environments.

关键词： IP traceback NetFlow DoS ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis on a mobile agent-based algorithm for network routing and management

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2003年第3期14卷 193-202页

作者： Sum, J Shen, H Leung, CS Young, G Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Japan Adv Inst Sci & Technol Grad Sch Informat Sci Tatsunokuchi Ishikawa 9231292 Japan City Univ Hong Kong Dept Elect Engn Kowloon Hong Kong Peoples R China Calif State Polytech Univ Pomona Dept Comp Sci Pomona CA 91768 USA

ant routing is a method for network routing in the agent technology. Although its effectiveness and efficiency have been demonstrated and reported in the literature, its properties have not yet been well studied. This paper presents some preliminary analysis on an ant algorithm in regard to its population growing property and jumping behavior. For synchronous networks, three main results are shown. First, the expected number of agents in a node is shown to be no more than (1 + max(i){\Omega(i)\})km, where \Omega(i)\ is the number of neighboring hosts of the ith host, k is the number of agents generated per request, and m is the average number of requests. Second, the expected number of jumps of an agent is shown to be no larger than (1 + max(i){\Omega(i)\}). Third, it is shown that for all p greater than or equal to (1 + max(i){\Omega(i)\})km, the probability of the number of agents in a node exceeding p is not greater than integral(p)(infinity) P(x)dx, where P(x) is a normal distribution function with mean and variance given by Mean = (1 + max(i){\Omega(i)\})km,Var. = 2km(1 + max(i){\Omega(i)\}) + (km(2)(1 + max(i){\Omega(i)\})(2) / (1+2 max(i){\Omega(i)\}). The first two results are also valid for the case when the network is operated in asynchronous mode. All these results conclude that as long as the value max(i){\Omega(i)\}) is known, the practitioner is able to design the algorithm parameters, such as the number of agents being created for each request, k, and the maximum allowable number of jumps of an agent, in order to meet the network constraint.

关键词： mobile agents routing algorithms networking routing ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Cryptography Theory-Based Generating Method for Secure ECs

引用

Tsinghua Science and Technology 2017年第5期22卷 499-510页

作者： Chao Wang Feng Hu Huanguo Zhang Jie Wu the Key Laboratory of Specialty Fiber Optics and Optical Access Networks School of Communication and Information EngineeringShanghai University the Department of Computer and Information Sciences Temple University the Key Lab of Aerospace Information Security and Trusted Computing Wuhan University

ant Colony Optimization （AGO） has the character of positive feedback, distributed searching, and greedy searching. It is applicable to optimization grouping problems. Traditional cryptographic research is mainly based on pure mathematical methods which have complicated theories and algorithm. It seems that there is no relationship between cryptography and ACO. Actually, some problems in cryptography are due to optimization grouping problems that could be improved using an evolutionary algorithm. Therefore, this paper presents a new method of solving secure curve selection problems using ACO. We improved Complex Multiplication （CM） by combining Evolutionary Cryptography Theory with Weber polynomial solutions. We found that ACO makes full use of valid information generated from factorization and allocates computing resource reasonably. It greatly increases the performance of Weber polynomial solutions. Compared with traditional CM, which can only search one root once time, our new method searches all roots of the polynomial once, and the average time needed to search for one root reduces rapidly. The more roots are searched, the more ECs are obtained.

关键词： ECs Weber polynomial evolutionary algorithm ant algorithm complex multiplication

来源：评论

学校读者我要写书评

暂无评论

algorithms for degree-constrained Euclidean Steiner minimal tree

引用

Journal of Systems Engineering and Electronics 2008年第4期19卷 735-741页

作者： Zhang Jin Ma Liang Zhang Liantang School of Management Univ. of Shanghai for Science and Technology Shanghai 200093 P. R. China Computer and Information Engineering Coll. Univ. of Henan Kaifeng 475001 P. R. China

A new problem of degree-constrained Euclidean Steiner minimal tree is discussed, which is quite useful in several fields. Although it is slightly different from the traditional degree-constrained minimal spanning tree, it is also NP-hard. Two intelligent algorithms are proposed in an attempt to solve this difficult problem. Series of numerical examples are tested, which demonstrate that the algorithms also work well in practice.

关键词： degree-constrained Euclidean Steiner minimal tree simulated annealing ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Gathering identical autonomous systems on a circle using stigmergy

引用

DISTRIBUTED COMPUTING 2012年第6期25卷 461-472页

作者： Kozlov, Dmitry N. Univ Bremen Dept Math D-28334 Bremen Germany

In this paper we provide a protocol solving the problem of gathering of identical autonomous systems (aka ants) on a circle. In our biologically inspired model the autonomous systems are unable to communicate directly, instead they employ the mechanism of pheromone marking. The gathering on a circle is not always solvable, however our protocol will terminate in finite time if ants are in a general initial position. Since the gathering problem on a line is unsolvable for obvious reasons for any non-degenerate initial position, this implies that if the ants are in generic initial position they will be able to decide in finite time whether they are on a line or on a circle. We give asymptotic bounds for the time our protocol needs to terminate, and show that for fixed number of ants, the termination time of any protocol can be arbitrarily long. Finally, our protocol may be adopted to the case of asynchronous drop-downs and starting times of the autonomous systems.

关键词： Distributed algorithm Protocol Gathering problem Swarm intelligence Pheromone communication Geometric algorithm ant algorithm

来源：评论

学校读者我要写书评

暂无评论

An innovative automated storage and retrieval system for B2C e-commerce logistics

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2010年第1-4期48卷 297-305页

作者： Hu, Kuan-Yu Chang, Tian-Sheng Tajen Univ Dept Mkt & Distribut Management Yan Pu Hsiang 907 Pingtung Taiwan Natl Pingtung Univ Sci & Technol Grad Sch Management Innovat & Technol Pingtung Taiwan

Flexible and timely warehousing activities provide a strong foundation for logistic systems. However, increasing B2C e-commerce with a variety of small internet orders may have a tremendous impact on warehousing. Automated storage/retrieval systems (AS/RSs) are a valid alternative for warehousing. Typical AS/RSs design and control problems in a static environment and cannot effectively manage parcel, small, and irregular items. This study proposes a new AS/RS that is more efficient and flexible for handling B2C e-commerce logistics. An auto-access multilevel conveying device (IMCD) with three-dimensional movement is integrated into the AS/RS. The ant colony system algorithm locates near-optimal routes for the IMCD. Typical travel distance/time measures evaluate the performance of an S/R device running on a warehouse floor. However, the performance index in this study looks at the IMCD's travel time with three-dimensional movement in completing a batch order. To validate the new AS/RS, two simulation experiments were conducted to examine the effects of three-dimensional velocity and rack shape. Finally, this study compares a typical S/R system with the new AS/RS and makes recommendations for practical applications and further research.

关键词： E-commerce logistic Automated storage and retrieval system Material handling device ant algorithm

来源：评论

学校读者我要写书评

暂无评论

SIMiner: A Stigmergy-Based Model for Mining Influential Nodes in Dynamic Social Networks

引用

IEEE TRANSACTIONS ON BIG DATA 2019年第2期5卷 223-237页

作者： Li, Weihua Bai, Quan Zhang, Minjie Auckland Univ Technol Sch Engn Comp & Math Sci Auckland New Zealand Univ Wollongong Sch Comp & Informat Technol Wollongong NSW 2522 Australia

With the widespread of the Internet, the on-line social network with big data is rapidly developing over time. Many enterprises attempt to develop their business by utilizing the power of on-line social networking platforms. A considerable amount of work has focused on how to select a set of influential users to maximize a kind of positive influence in static social networks. However, networks evolve, and the topological structure changes over time. How to mine and adapt the influencers in a dynamic and large-scale environment becomes a challenging issue. In this paper, a collective intelligence model, i.e., stigmergy-based influencers miner, is proposed to investigate influential nodes in a fully dynamic environment. The proposed model is capable of analysing influential relationships in a social network in decentralized manners and identifying the influencers more efficiently than traditional seed selection algorithms. Moreover, it is capable of adapting the solutions in complex dynamic environments without any interruptions or recalculations. Experimental results show that the proposed model achieves better performance than other traditional models in both static and dynamic social networks by considering both efficiency and effectiveness.

关键词： ant algorithm stigmergy multi-agent system influence maximization

来源：评论

学校读者我要写书评

暂无评论

A multicast routing algorithm based on searching in directed graph

引用

APPLIED MATHEMATICS AND COMPUTATION 2011年第7期218卷 3723-3732页

作者： Sun Zhixin Xu Yuhua Gong Jing Ren Zhiguang Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing 210003 Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Peoples R China

Aiming at constructing a delay and delay variation bounded Steiner tree in the real-time streaming media communication, in this paper, we discuss a multicast routing algorithm based on searching a directed graph (MRASDH). During the process of the construction of the multicast tree, some nodes and links in the network topology do not affect the outcome of the constructed tree. Therefore, based on the thought of shrinking the search space through deleting these non-relative nodes and edges to the utmost, the ant algorithm is utilized to generate a directed sub-graph of the network topology for each destination node, in which each node owns a bounded out-degree. And all these sub-graphs can be merged into a new directed graph that serves as the new search space. In the new space, the simulated annealing algorithm is applied to obtain a multicast tree that satisfies the condition for the optimization. The performance analysis and simulation results demonstrate that this algorithm can effectively construct a delay and delay variation bounded multicast tree. They also show that the algorithm have lower time complexity than the current ones, which means a much better result would be achieved when the system scale rises greatly. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Multicast routing algorithm Delay and delay variation bounded Directed graph ant algorithm Simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

ants can colour graphs

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 1997年第3期48卷 295-305页

作者： Costa, D Hertz, A ECOLE POLYTECH FED LAUSANNE DEPT MATHF-1015 LAUSANNESWITZERLAND

In the last few years researchers have shown how insect colonies can be seen as a natural model of collective problem solving. The analogy between the behaviour of ants looking for food and the well known travelling salesman problem has recently given rise to promising solution methods. We present in this paper an evolutionary search procedure for tackling assignment type problems. The algorithm repeatedly constructs feasible solutions of the problem under study by taking account of two complementary notions, namely the trace factor and the desirability factor. The use of such search principles will be illustrated for graph colouring problems. The results obtained have proven satisfactory when compared with those existing in the literature.

关键词： ant algorithm assignment type problem collective performance evolutionary method graph colouring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：