1) universal set
通用集合
2) universal cut
通用割集
1.
Combinational equivalence checking method based on universal cut and special cut;
结合通用割集和专用割集的组合电路验证方法
4) general Dyson sets
通用Dyson集
5) Universal Diversity Technology
通用分集
6) connected set
连通集合
1.
These algorithms are either based on the density connected chains,or weighted density,or the gravity based connected sets.
随着聚类分析的蓬勃发展,涌现出了许多聚类算法,其中最重要的算法之一是基于密度的空间聚类以及其多种变种——基于密度连通链、基于加权密度、基于引力连通集合的算法。
2.
A connected set is constructed on the special fractal set (generalized Sierpinski rug), and whose Hausdorff dimension is ln10/ln9; then a differential function is constructed on the connected set to prove that the connected set is a Whitney s critical set.
在特殊的分形集(广义的Sierpinski地毯)上构造一个Hausdorff维数为ln10/ln9连通集合,然后在该连通集合上构造一个可微函数,利用该函数证明了该连通集合是一个Whitney临界集。
3.
Firstly,a connected set E was constructed on the Sierpinski gasket which was self-similar set resulted from nine contraction function with contraction ratio of 1/8 and satisfied the open set conditions, and whose Hausdorff dimension was ln9/ln8;secondly,a differential function was constructed on the connected set E to prove that E was a Whitney′s cri.
首先 ,在 Sierpinski垫中构造一个连通集合 E,E是由 9个压缩比为 1 /8的压缩函数生成的自相似集且满足开集条件 ,它的 Hausdorff维数为 ln9/ln8;其次 ,在连通集合 E上构造一个可微函数 ,利用该函数分 3种情形证明了 E是一个 Whitney临界集 。
补充资料：基本割集矩阵(见网络图论)
基本割集矩阵(见网络图论)
fundamental cut-set matrix
Jl匕en ge〕1〕日zhen基本割集矩阵(fundamental eut一setnla一trix)见网络图论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条