1) minimal hitting set
极小碰集
1.
In this paper,an improved genetic algorithm (called MGA) is used to compute minimal hitting sets.
采用改进的遗传算法求解极小碰集问题。
2.
Furthermore, the computing procedure is formalized by combining SE-tree with closed nodes to generate all the minimal hitting sets.
提出一种利用与元素相关联的冲突集个数计算碰集的新方法,并结合带有终止节点的集合枚举树SE-tree形式化地表达计算过程,逐步生成所有的极小碰集。
2) minimal hitting set
最小碰集
1.
Computing minimal hitting sets with logic array in model-based diagnosis;
基于模型诊断中用逻辑数组计算最小碰集
2.
In the model-based diagnosis, a key step is to compute the minimal hitting sets from the minimal conflict sets, because the minimal hitting sets of all the conflict sets are the faults of an investigated system.
在基于模型的诊断中,利用冲突集计算最小碰集是其关键的步骤,因为所有冲突集的最小碰集就是所考察系统的诊断。
3.
This algorithm takes the minimal hitting sets of multi-fault state sets as fault states to generate the optimal single-fault strategy.
该算法以多故障状态集的最小碰集作为生成最优单故障策略的故障状态,生成最优单故障策略;以诊断决策树中各叶节点的多故障状态集为评判标准,确定系统的状态,完成多故障假设下的系统故障诊断;与连续使用单故障策略的方法相比,该方法提高了测试效率。
3) extremely small subset
极小子集
1.
By means of the methodology of rough set,different attribute classification methods for decision systems are first analyzed in this paper,and the attribute significance as well as the extremely small subset of the attribute relative reduction caused by a classification variety is discussed.
应用粗糙集的方法,分析决策系统中不同的属性分类方法,以及不同分类方法引起的属性重要性与属性相对约简极小子集的变化情况,寻求属性分类方法与属性约简结果相互影响的内在因素,给出高效的属性分类方法和合理确定约简子集的策略,生成策略对应软件的实现算法,并运用软件实现算法来选取相对约简子集。
4) minimal cut
极小割集
5) minimal set
极小集
1.
The authors introduce two new concepts of L - nested sets which are based on the concepts of minimal set and maximal set where L is a completely distributive lattice.
在L是完全分配格时,借助极小集与极大集的概念引入L集合套概念,它们是[1]中集合套概念的推广,但不同于[1]中的L集合套。
2.
In F lattice,sixteen cut sets of l fuzzy set and corresponding decomposition theorems have been given by the use of maximal set and minimal set.
在 F格 L中 ,利用极小集与极大集可以对 L- fuzzy集给出 1 6种截集的定义及相应的分解定理 ,本文用 3条公理对 1 6种截集给出公理化描述 ,从而揭示了每种截集最本质的三条性
3.
The attractor M which attracts any bounded set the following facts are proved:i) every motion on M is almost periodic;ii) for a∈M, γ(a) =ω(a) is a minimal set.
就修正的Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程的可吸引任何有界集的吸引子Ｍ证明了：ｉ）Ｍ上的运动都是几乎周期的；ｉ）对ａ∈Ｍ，〔γ（ａ）〕＝ω（ａ）是极小集。
6) strongly minimal set
强极小集
1.
This paper studies relations between strongly minimal sets in any model of a complete theory.
研究了完全理论的模型中强极小集之间的关系,并证明了如果T是一个完全理论,Ψ1(x)和Ψ2(x)是T的两个强极小公式,则Ψ1(x)可以被Ψ2(x)X-表示,或Ψ2(x)可以被Ψ1(x)X-表示,或Ψ1(x)和Ψ2(x)独立。
补充资料：极小集
极小集
minimal set
极小集【而顽加目set;MH皿“M~oeM肋撰c卿1 l)R~nn空间中的极小集是极小曲面(而月面目51止自仗)的推广极小集是Rier姐nn空间M”中的灭维闭子集X。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条