期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Threat Modeling-Oriented Attack Path Evaluating Algorithm
1
作者 李晓红 刘然 +1 位作者 冯志勇 何可 《Transactions of Tianjin University》 EI CAS 2009年第3期162-167,共6页
In order to evaluate all attack paths in a threat tree,based on threat modeling theory,a weight distribution algorithm of the root node in a threat tree is designed,which computes threat coefficients of leaf nodes in ... In order to evaluate all attack paths in a threat tree,based on threat modeling theory,a weight distribution algorithm of the root node in a threat tree is designed,which computes threat coefficients of leaf nodes in two ways including threat occurring possibility and the degree of damage.Besides,an algorithm of searching attack path was also obtained in accordence with its definition.Finally,an attack path evaluation system was implemented which can output the threat coefficients of the leaf nodes in a target threat tree,the weight distribution information,and the attack paths.An example threat tree is given to verify the effectiveness of the algorithms. 展开更多
关键词 attack tree attack path threat modeling threat coefficient attack path evaluation
下载PDF
Improved ant colony optimization algorithm for the traveling salesman problems 被引量:22
2
作者 Rongwei Gan Qingshun Guo +1 位作者 Huiyou Chang Yang Yi 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第2期329-333,共5页
Ant colony optimization (ACO) is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem (TSP) is amo... Ant colony optimization (ACO) is a new heuristic algo- rithm which has been proven a successful technique and applied to a number of combinatorial optimization problems. The traveling salesman problem (TSP) is among the most important combinato- rial problems. An ACO algorithm based on scout characteristic is proposed for solving the stagnation behavior and premature con- vergence problem of the basic ACO algorithm on TSP. The main idea is to partition artificial ants into two groups: scout ants and common ants. The common ants work according to the search manner of basic ant colony algorithm, but scout ants have some differences from common ants, they calculate each route's muta- tion probability of the current optimal solution using path evaluation model and search around the optimal solution according to the mutation probability. Simulation on TSP shows that the improved algorithm has high efficiency and robustness. 展开更多
关键词 ant colony optimization heuristic algorithm scout ants path evaluation model traveling salesman problem.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部