1) minimum total weight
最小总权
1.
In this paper we consider the circuit of minimum total weight problem.
讨论权守恒的有向图中最小总权圈问题,分别给出求解一般情况下最小总权圈的最优算法和经过特定点或特定边情况下最小总权圈的最优算法。
2) Least privilege
最小特权
1.
Implementation and Automatic Testing of Least Privilege Principle on Linux;
基于Linux的最小特权管理机制及其安全测试自动化的研究
2.
This paper described a framework for implementing dynamically modified least privilege security policy,which combined role s duty separation property and domain s function separation property.
最小特权机制可为安全操作系统提供恰当的安全保证级。
3.
These algorithms were only applicable to specified least privilege control policies,and had such defects as semantic conflicts and no defined security-objectives.
多数支持POSIX权能机制的安全操作系统提出了各自的权能遗传算法,但这些算法都只适用于特定的最小特权控制策略,并且存在语义冲突、安全目标不明确等问题,不能有效支持多种安全需求不同的特权策略。
3) least privilege
最小授权
1.
Present researches only compared the expressiveness of policies, but never considered the policy’s structure and the granularity of authorization, which makes it difficult to support the dynamic policy and satisfy the least privilege requirement.
现有的研究只关注安全策略的描述能力,却忽略了对策略结构与授权粒度的分析,从而无法全面满足动态策略支持与最小授权要求。
4) Minimum weight
最小权
1.
That is how to get a spanning subgraph which has a k-unicycle partition with minimum weight in a weighted graph, and how to add minimum edges to get a spanning supgraph with k-unicyclic partition in a graph, if the graph doesn t have a spanning subgraph with the partition.
本文进一步研究基于k-单圈划分的优化问题,即在一个赋权图中求一个最小权可k-单圈划分的支撑子图,以及对一个不存在k-单圈划分支撑子图的图,如何添最少的边使得它有k-单圈划分的支撑子图。
5) minimal weight method
最小权法
1.
The minimal weight method to solve λ level short Hamilton cycle of weight graph G(n,m) is obtained by analysis of the features of the shortest Hamilton resulted from extended.
提出短哈密顿回路的概念,分析由延长而形成最短哈密顿回路的特点,得出求权图G(n,m)λ阶短哈密顿回路的最小权法。
6) Weighted minisum problem (MSP)
最小加权距离总和问题(MSP)
补充资料：因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权
因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权：公民、法人的姓名权、名称权，名誉权、荣誉权、受到侵害的有权要求停止侵害，恢复名誉，消除影响，赔礼道歉，并可以要求赔偿损失。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条