1) gateway dominating set
网关支配集
1.
The node that can logically communicate with the nodes in other clusters has the ability to be gateway,and the set of these nodes is defined as gateway dominating set relative to cluster-head.
逻辑上能和其他簇内节点通信的节点都可以做网关,这些节点相对于簇首节点称为网关支配集。
2) Dominance-based Rough Sets
基于支配关系的粗糙集
3) 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)的路由方法是一种有效的分层路由方法,它将路由搜索主要集中在连通支配集内。
4) 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Ⅱ的基础上,改进了其种群构造策略,设计了一类新的多目标遗传算法。
5) dominance relation
支配关系
1.
Based on preference order information carried by criteria and dominance relation between them,(deduction) of ordered information rules was solved.
利用含序粗集方法,依据标准的优先序信息及标准间的支配关系,解决了推导含序信息规则问题。
2.
By extending tolerance relations to fuzzy tolerance relations and introducing dominance relations, the present paper further decomposes the tolerance class of a fuzzy tolerance relation into pure fuzzy tolerance class positive fuzzy tolerance class and negative fuzzy tolerance class .
本文在容差关系扩展为模糊容差关系的基础上引入支配关系对模糊容差关系的容差类进行进一步分解,分为模糊纯容差类、模糊正容差类、模糊负容差类,并分别定义上下近似集,进而提出了模糊容差关系粗糙集的分解。
6) payment gateway
支付网关
1.
Design and exploitation of the payment gateway system of Huaxia bank;
华夏银行支付网关系统的设计与开发
2.
The Application and Research of the Payment Gateway in the Fields of Modern Electronic Commerce;
支付网关在现代电子商务领域的应用与研究
3.
The payment gateway is one of the most important parts in electronic commerce because the safety of payment determines the success or failure of electronic commerce.
电子商务是目前发展最快的产业，支付安全性决定了电子商务活动的成败，因此，支付网关是电子商务中最重要的环节。
补充资料：网(有向集)
网(有向集)
net (directed set)
网(有向集)[吐(山n兄扭d滋);ceTI.」 一个有向集(dim曲沮set)到一个(拓扑)空间中的映射.M.H.Bo益uexoacK班益撰[补注】一个空间的拓扑能够完全用收敛性来描述.然而，这需要比序列收敛性概念更一般的收敛性概念.所需要的正是网的收敛(conVe耳笋川沈ofne匕).拓扑空间X中一个网S:D~X收敛到一个点s‘X，如果对、在X中每一个开邻域U，网S最终在U中(c记ntuallyinU).最后的短语是指存在一个m任D，使得对D中所有的n)m，S(”)6U. 网的收敛理论以Moore一51而th收敛(入玉刃祀一Smith田n祀r罗“笼)而闻名({All).
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条