1) dominating set
支配集
1.
Through researching into the independent and dominating set in graph theory, this paper has put forward a concept of independent-dominating set and has expounded and proved the internal relationship among the following three concepts: independent-dominating set , maximal independent set and minimal dominating set.
通过对图论中独立集和支配集的深入研究，提出了独立支配集的概念，论证了独立支配集同极大独立集及极小支配集之间的内在联系，并在此基础上给出了独立支配集的最佳求解算法，从而圆满地解决了图论中独立集及支配集的求解问题，对图的着色及匹配等问题的研究均有相当重要的借鉴意义。
2.
Based on the theoretical analysis of the sensing coverage property of the minimal dominating set, the relationship between point coverage and area coverage in geometric graph is established.
根据分析结果,基于构建连通支配集CDS(connected dominating set)的RuleK算法,提出了一种与节点位置无关网络连通性覆盖协议LICCP(location-independent connected coverage protocol)。
3.
In wireless ad-hoc networks,routing based on connected dominating set is a promised approach,where the searching space for route is reduced to nodes in the dominating set.
在ad-hoc网络中,基于最小连通支配集(minimumconnecteddominatingset---MCDS)的路由方法是一种有效的分层路由方法,它将路由搜索主要集中在连通支配集内。
2) non-dominated set
非支配集
1.
This paper improves the approach of constructing non-dominated set in NSGA-Ⅱ.
在NSGA-Ⅱ算法的基础上,对NSGA-Ⅱ构造非支配集的方法进行了改进,用擂台赛法则构造非支配集,当非支配集小于种群大小时,采用随机算子在可行域内随机产生新的解个体填充到下一代父种群中,形成了一种新的多目标遗传算法。
2.
Most MOEAs employ clustering to keep the diversity and variety of solutions and construct the non-dominated set to make algorithms efficient.
在进化算法中一般采用构造非支配集的方法来保持算法的运行效率和解集的分布性;采用聚类技术来计算和维持解群体的分布性和多样性。
3.
It is a very important step to construct non-dominated set of evolutionary population for the Multi-Objective Genetic Algorithm(MOGA).
多目标遗传算法的一个重要步骤就是构造非支配集,本文提出了一种基于快速排序的非支配集构造方法,提高了非支配集构造效率,并且在Deb提出的NSGAⅡ的基础上,改进了其种群构造策略,设计了一类新的多目标遗传算法。
3) independent-dominating set
独立支配集
1.
Through researching into the independent and dominating set in graph theory, this paper has put forward a concept of independent-dominating set and has expounded and proved the internal relationship among the following three concepts: independent-dominating set , maximal independent set and minimal dominating set.
通过对图论中独立集和支配集的深入研究，提出了独立支配集的概念，论证了独立支配集同极大独立集及极小支配集之间的内在联系，并在此基础上给出了独立支配集的最佳求解算法，从而圆满地解决了图论中独立集及支配集的求解问题，对图的着色及匹配等问题的研究均有相当重要的借鉴意义。
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 dominating set
最小支配集
1.
TSGA for solving minimum dominating set;
禁忌遗传算法求解最小支配集
2.
Observable node set, two concepts of observable set and observable matrix of WAMS, and a new rule to compute the state of observable node are put forward in this paper based on the minimum dominating set theory and linear measurement model of power system.
基于最小支配集理论和电力系统线性量测模型,提出了可观测节点集合、WAMS可观测矩阵两个概念以及一种新的节点可观测性计算规则。
6) weighted dominating set
加权支配集
1.
So, a topology aggregation method based on weighted dominating set was considered which uses the bandwidth as the weight to satisfy the demand of bandwidth of the networks.
为此,本文对利用加权支配集的网络拓扑聚合方法进行了研究,构造了以带宽为权的支配集,使聚合后的网络在带宽方面具有更优的性能,并设计了一种计算复杂度为O(n),信息复杂度为O(Δn)的最小权支配集的并行近似算法。
补充资料：〖ZK(〗各证集说诸方备用并五脏六腑集论合抄〖ZK)〗
〖ZK(〗各证集说诸方备用并五脏六腑集论合抄〖ZK)〗
内科著作。1卷。原题清叶桂(天士)家传，撰年不详。此书汇集内科杂证70余种，方剂近200首。每证各为一论，阐明疾病性质、病因、症状、治则及方药。论后每引经说，概括病机。所列方药服法亦皆详备。又列“五脏六腑论”一章，引用《内经》、《难经》，逐一论述五脏六腑之形象、部位、表里关系、病症及治法。本书内容多录自《临证指南》，恐系后人伪托叶氏之作。现存抄本
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条