1) Mult-level minimal dominating
多层极小支配集
1.
The novel mult-level minimal dominating clustering arithmetic is the reprove of the random clustering arith-metic,we discussed the arithmetic of minimal dominating set,and developed a improved predigestion arithmetic of near minimal dominating set,reduced the workload of compute the minimal dominating set.
提出了对随机聚类方法加以改进的新型多层极小支配集聚类算法,首先讨论了图论中的极小支配集算法,并根据实际需要提出了一种改进的简化近极小支配集的算法,大大降低了计算极小支配集的复杂程度,然后讨论了极小支配集应用在无线传感器网络聚类的实现,最后验证了该算法在能耗方面的性能改进。
2) minimum 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.
通过引入极大独立集和极小支配集概念,基于图着色思想提出一种新的适合于无线自组网的极小连通支配集算法,从理论上证明了该算法的正确性和高效性,也通过仿真实验分析了该算法在多种情况下的实际性能,仿真结果表明新算法在簇头和主干节点数目方面具有较好的性能,特别在节点密集的网络环境中更加突出。
3) minimal dominant set
极小支配集
1.
In this paper, through the use of the disjunctive normal form and the principal disjunctive normal form, we propose some general algorithms concerning the grand minimal dominant set, the minimum dominant set, the minimal edge dominant set, and the minimum edge dominant set of graphs.
给出了利用命题逻辑公式的析取范式和主析取范式求图的全部极小支配集和最小支配集以及全部极小边支配集和最小边支配集的一般算
2.
By establishing graph model of mine ventilation network,monitoring scope was applied as the theory base,flowing time between nodes was used as monitoring level,optimum methane sensor placement could be resolved with coverage as the selection standard based on Dijkstra arithmetic and minimal dominant set arithmetic.
通过建立矿井通风网络的图论模型,提出将监测范围作为传感器部署的理论依据,以节点间风流流经时间作为监测等级,应用覆盖度作为优选最佳测点标准,基于D ijkstra算法和极小支配集算法求得传感器的最佳布点。
4) minimal independent dominating set
极小独立支配集
1.
The minimal independent dominating set was settled by calculating maximal independent set,and with the set the algorithm and mathematical model of a virtual backbone network were provided.
对规模较大、移动较频繁的MANET(Mobile Ad hoc Networks),用独立支配集构建虚拟骨干网,克服骨干节点之间必须维护连通性的问题,使得拓扑变化较快时骨干网的重构能快速实现;利用极大独立集的求解得到极小独立支配集,并给出基于该支配集的虚拟骨干网数学模型及算法;通过仿真验证算法的有效性、低复杂度和自恢复能力。
5) 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.
通过引入极大独立集和极小支配集概念,基于图着色思想提出一种新的适合于无线自组网的极小连通支配集算法,从理论上证明了该算法的正确性和高效性,也通过仿真实验分析了该算法在多种情况下的实际性能,仿真结果表明新算法在簇头和主干节点数目方面具有较好的性能,特别在节点密集的网络环境中更加突出。
6) MWMCDS
极大权最小连通支配集
补充资料：多层沉积层
分子式：
CAS号：
性质：由两种或两种以上相继沉积的金属构成的沉积层。这些沉积层可以由不同特性的同一金属或不同金属构成。如为了提高镍镀层的防护性，有时采用双层镍或三层镍镀层。又如为防护-装饰目的采用的铜/镍/铬三层镀层。
CAS号：
性质：由两种或两种以上相继沉积的金属构成的沉积层。这些沉积层可以由不同特性的同一金属或不同金属构成。如为了提高镍镀层的防护性，有时采用双层镍或三层镍镀层。又如为防护-装饰目的采用的铜/镍/铬三层镀层。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条