1) minimum critical set
最小关键集
1.
The minimum critical set is the most important information that network attack graph shows.
分析攻击图分析中求解攻击图最小关键集的方法和作用。
2) minimal critical attack set
最小关键攻击集
1.
This paper focuses on analyzing attack graph model in system security evaluation,and in combination of attack difficulty,proposes the ant algorithm to obtain minimal critical attack set in specific attack graph.
攻击图是网络安全分析人员常用的分析工具之一,文章重点研究了基于攻击图模型的系统安全分析架构,并结合攻击难度提出了应用蚁群算法,在攻击图中获取最小关键攻击集的优化解。
3) Least association rule set
最小关联规则集
4) Minimum essential information infrastructure
最小关键信息基础设施
5) the candidate key of minimum cardinality
最小基数候选关键字
6) keywords set
关键词集
1.
After contrasted two search engine ranking algorithm PageRank with HITS based on link analysis and to solve the problem of the original PageRank algorithm to halve the PageRank value of the page itself,this paper presents an improved algorithm to distribute the PageRank value in light of the link weight of the web pages based on keywords set.
对比分析了基于链接分析的搜索引擎排序算法PageRank和HITS,针对原有PageRank算法采用的平分页面自身PageRank值的策略,提出了按基于关键词集的网页关联比重分配PageRank值的改进算法。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条