1) minimal essential set
极小本质集
1.
The paper introduces the concept of minimal essential set of the solution set of quasi-variational inequality,and it is proved that there exists at least one minimal essential set of the solution set for every quasi-variational inequality (satisfying some conditions).
引入了拟变分不等式解集的极小本质集的概念,并证明了每个拟变分不等式(满足一定条件)的解集至少存在一个极小本质集。
2.
It is proved that there exists at least one minimal essential set of equilibrium points of the economy and every minimal essential set is connected.
进一步研究了生产经济平衡的稳定性 ,讨论了生产经济平衡“集合值”的稳定性 ,证明了生产经济平衡点集至少存在一个极小本质集且每一极小本质集是连通的 ,从而能够给出本质连通分支的存在性·
2) essentially polar set
本性极集
1.
In this paper,we find necessary and sufficient conditions that any compact set is essentiallyb polar set of α- self - similar Markov processes and consider some relationships the polar set with essentially polar set and semipolar set.
本文我们给出了任意紧集不是自相似马氏过程的本性极集的充要条件，并讨论了自相似马氏过程极集，本性极集，半极集之间的关系。
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) 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形式化地表达计算过程,逐步生成所有的极小碰集。
补充资料：极小集
极小集
minimal set
极小集【而顽加目set;MH皿“M~oeM肋撰c卿1 l)R~nn空间中的极小集是极小曲面(而月面目51止自仗)的推广极小集是Rier姐nn空间M”中的灭维闭子集X。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条