1) connected row set assignment
连通行集合分配
2) allocation of behavior set
行为集合分配
3) 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临界集 。
4) connected dominating set
连通支配集
1.
Efficient algorithm for finding minimum connected dominating set in wireless sensor networks;
传感器网络中高效的最小连通支配集求解算法
2.
An algorithm for constructing efficient connected dominating sets in wireless sensor networks;
一种在无线传感器网络中构造有效连通支配集的算法
3.
A rerouting scheme using connected dominating set in large-scale disaster scenario;
大规模灾害条件下基于连通支配集的重路由方案
5) minimum connected dominating set
最小连通支配集
1.
Finding a minimum connected dominating set for a network graph is of great importance in practical applications.
寻找出一个网络图的最小连通支配集有重要实际应用背景,然而如何找到它却是一个NP难题。
2.
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory,and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价,而在任意图中求解最小连通支配集是NP完全问题。
3.
For the NP-hard problem of constructing minimum connected dominating set(MCDS) in Ad hoc networks,this paper proposed a novel distributed MCDS constructing algorithm called DMCA.
针对无线自组织分组(Ad hoc)网络中最小连通支配集(MCDS)创建NP难问题,提出了一种分布式的最小连通集创建算法DMCA。
6) minimum connected dominating set
极小连通支配集
1.
Using the concept of minimum dominating set,maximum in-dependent set,new graph coloring theory based minimum connected dominating set algorithm was proposed to construct virtual backbone in wireless ad hoc networks.
通过引入极大独立集和极小支配集概念,基于图着色思想提出一种新的适合于无线自组网的极小连通支配集算法,从理论上证明了该算法的正确性和高效性,也通过仿真实验分析了该算法在多种情况下的实际性能,仿真结果表明新算法在簇头和主干节点数目方面具有较好的性能,特别在节点密集的网络环境中更加突出。
补充资料：单连通和多（复）连通超导体（simplyandmultiplyconnectedsuperconductors）
单连通和多（复）连通超导体（simplyandmultiplyconnectedsuperconductors）
单连通超导体一般指的是不包含有非超导绝缘物质或空腔贯通的整块同质超导体，若有非超导绝缘物质或空腔贯通的超导体则称为多（复）连通超导体。从几何学上讲，在超导体外表面所包围的体积内任取一曲线回路，这回路在超导物质内可收缩到零（或点），且所取的任意回路均可收缩到零而无例外，则称单连通超导体。若有例外，即不能收缩到零，则称多连通超导体。例如空心超导圆柱体，则在围绕柱空腔周围取一回路就不能收缩为零。多连通超导体可有磁通量子化现象（见“磁通量子化”）。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条