Ant colony optimization (ACO for short) has been proved a successful meta-heuristic by a huge of empirical studies. This paper discusses the termination criteria of ACO and therefore provides research ideas to other m...
详细信息
Ant colony optimization (ACO for short) has been proved a successful meta-heuristic by a huge of empirical studies. This paper discusses the termination criteria of ACO and therefore provides research ideas to other meta-heuristics. A general discussion about four types of termination criteria has been firstly discussed in this article. Then some measures of convergence based on pheromone have been introduced. And a new termination criterion based on Bayesian approach is presented. Finally a new convergence proof for a class of ACO algorithms is presented.
The traveling salesman problem (TSP) is among the most important combinatorial problems. Ant colony optimization (ACO) algorithm is a recently developed algorithm which has been successfully applied to several NP-hard...
详细信息
The traveling salesman problem (TSP) is among the most important combinatorial problems. Ant colony optimization (ACO) algorithm is a recently developed algorithm which has been successfully applied to several NP-hard problems, such as traveling salesman problem, quadratic assignment problem and job-shop problem. Association rule (AR) is the key in knowledge in data mining for finding the best data sequence. A new algorithm which integrates ACO and AR is proposed to solve TSP problems. Compare with the simulated annealing algorithm, the standard genetic algorithm and the standard ant colony algorithm, the new algorithm is better than ACO.
In his paper, Prof. Ye Dongyi pointed out that the reduction approach introduced by Hu Xiaohua etc. will give wrong result in some situation. In this paper we come to a conclusion by analysis that the reduction approa...
详细信息
Currently, there are many researches focusing on grid scheduling and more and more scheduling algorithms were proposed. However, those algorithms are not satisfied with the requirement of the grid for ignoring its cha...
详细信息
ISBN:
(纸本)9781595937575
Currently, there are many researches focusing on grid scheduling and more and more scheduling algorithms were proposed. However, those algorithms are not satisfied with the requirement of the grid for ignoring its characteristics of dynamics, autonomy, distributing, etc. Therefore, this paper proposes an adaptable dynamic job scheduling approach based on historical information (ADJSA). This approach adjusts the predicting model automatically by using the recent jobs execution historical information and then selects the appropriate resource to execute the job considering dynamic and real-time factors of the Grid.
By use of the properties of ant colony algorithm and genetic algorithm, a hybrid algorithm is proposed to solve the traveling salesman problems. First, it adopts genetic algorithm to give information pheromone to dist...
详细信息
ISBN:
(纸本)7900719229
By use of the properties of ant colony algorithm and genetic algorithm, a hybrid algorithm is proposed to solve the traveling salesman problems. First, it adopts genetic algorithm to give information pheromone to distribute. Second, it makes use of the ant colony algorithm to get several solutions through information pheromone accumulation and renewal. Finally, by using across and mutation operation of genetic algorithm, the effective solutions are obtained. Compare with the simulated annealing algorithm, the standard genetic algorithm, the standard ant colony algorithm, and statistics initial ant colony algorithm, all the 16 hybrid algorithms are proved effective. Especially the hybrid algorithm with across strategy B and mutation strategy B is a simple and effective better algorithm than others.
We propose a new 3D image segmentation method based on prediction, block-matching and partial 3D constraint in this paper. The algorithm only needs to set a few key points in the first image. We use intensity informat...
详细信息
We propose a new 3D image segmentation method based on prediction, block-matching and partial 3D constraint in this paper. The algorithm only needs to set a few key points in the first image. We use intensity information and block-matching to optimize the initial condition, and consider the 3D object's characteristics at the same time. By using the partial 3D constraints we can get the result of 2D and 3D smoothness. Experimental results validate its usefulness in 3D image segmentation.
The paper proposes a new network intrusion detection system based on fuzzy neural network by redesigning the intrusion detection system's architecture and arithmetic. In order to overcome the difficulty of specify...
详细信息
ISBN:
(纸本)7900719229
The paper proposes a new network intrusion detection system based on fuzzy neural network by redesigning the intrusion detection system's architecture and arithmetic. In order to overcome the difficulty of specifying the membership function of rules depending on experiences of experts in multi-dimension space.,neural network is introduced to distinguish non-linearly input/output characteristics of complex system and to generate rule sets and membership functions automatically. The new architecture adopts the network processor to collect and analyse the data in the low layer of network.,and to establish a prototype system. This system demonstrated in this experiment appears to be better intrusion detection ability, moreover, which is able to detect unknown attack and plays down false alarms.
An adaptive strategy based stable link selection algorithm is proposed in this paper, in which the stable neighbor metric and local movement metric are defined. On the basis, the stability probability of each link is ...
详细信息
An adaptive strategy based stable link selection algorithm is proposed in this paper, in which the stable neighbor metric and local movement metric are defined. On the basis, the stability probability of each link is computed adoptively to find the most stable link or route in a route discovery. The simulation results show that our algorithm can effectively adapt to the network conditions, and outperforms the longevity factor based algorithm as well as the residual lifetime based algorithm in selecting stable links.
With the deeply research on intrusion detection techniques and the widely use of intrusion detection products, the study of evaluation techniques of intrusion detection systems became important. In the paper, relative...
详细信息
ISBN:
(纸本)7900719229
With the deeply research on intrusion detection techniques and the widely use of intrusion detection products, the study of evaluation techniques of intrusion detection systems became important. In the paper, relative works of the evaluation of intrusion detection systems was introduced. The primary aspects of intrusion detection systems in an evaluation were discussed. An evaluation system for intrusion detection systems was proposed. In the system, a supervisor module controls the whole system. The supervisor module schedules the traffic control module and the attack emulation module. The data in the evaluation environment are recorded and input to the evaluation module. The functions such as emulation of network traffic and host usage, emulation of attacks and evaluation report generation are implemented.
In this paper we propose a novel edge-based, fast and effective stereo matching method. If utilizes various geometrical and local area constraints as well as structural information among edge segments to perform a con...
详细信息
In this paper we propose a novel edge-based, fast and effective stereo matching method. If utilizes various geometrical and local area constraints as well as structural information among edge segments to perform a constraint-directed matching. By employing a heuristic lab.lling technique, the combinatorial search for isomorphic graphs is greatly reduced in the matching process. The implementation and experimental results are presented to show the efficacy of the proposed method.
暂无评论