为一个数据库表生成类型树时,DatabaseInterfaceDesigner将自动定义一个名为row的组。
When the Type Tree is generated for a database table, a group named Row is automatically defined by the database Interface Designer.
用路由拓扑来表示从一个路由组到其他所有路由组的所有路径,并假定路由拓扑是一棵生成树。
It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.
本文研究了由MSN节点组成的应用层组播网络,提出了度约束最小直径生成树问题,并给出了求解该问题的BCT算法。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
相比于传统MRA算法,该算法生成的组播树中源点到组播成员节点的平均延时大约为前者的90%。
The average delay from the source to all destinations in the tree generated by the algorithm is about 90% of the traditional MRA algorithm.
本文作者分析讨论了组播路由协议的生成树构建方法,在此基础上进一步对IP组播技术中核心的组播路由协议和算法进行了分析。
This paper intends to discuss the way to construct the spanning tree, on which the algorithm for routing protocol, which is the kernel of the IP multicasting, shall be analyzed.
研究了由MSN节点组成的应用层组播网络,讨论了度约束最小直径生成树(D - MDST)问题,并给出了求解该问题的BCT算法。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for Degree-constrained Minimum Diameter Spanning Tree (D-MDST) problem.
基于生成树组播钥匙分配方案的各种方法在提供有效的用户删除方法的同时努力将用户钥匙存储最小化。
All kinds of different methods based on rooted-tree multicast key distribution schemes make efforts to minimize the user key storage while providing efficient member deletion.
我们在最小生成树的两个组中推断出一些古老单倍型,并推测在冰期时湖北和我国的西南地区可能是该物种的避难所。
Furthermore, older haplotypes were detected in the two groups, respectively. Possible refugia are inferred in western Hubei Province and SW China during the glacial period.
仿真结果表明:与传统的LEO卫星网络组播路由算法相比,该算法具有较低的计算复杂度,生成的组播路由树具有较小的开销。
Simulations show that the computing complexity and the tree cost are lower than the traditional multicast routing algorithm for LEO satellite networks.
通过比较生成树的数目,可以判断图中任意数目的两组节点的相对重要性。
The relative importance of two groups of nodes in the graph can be compared with respect to the number of spanning trees.
传统的聚合组播包括三个主要步骤,分别是候选树生成,树选择和组树匹配。
The traditional Aggregated Multicast was divided the problem into three sub-problems, namely, candidate tree generation, tree selection and group-to-tree mapping.
从图中去掉节点以及相关联的链路后,所得到的图对应的生成树数目越少,则表明该组节点越重要。
The most vital nodes are those whose removal with their incident links most drastically decreases the number of spanning trees.
本文在对“王氏代数”、“k -树组”和“MINTY”这三种求有向树组的典型方法进行分析之后,提出了一种生成有向树组的拓扑方法。
Having analysed the "W-algebra", "K-tree terms" and "MINTY", the three typical methods of generating direct tree terms, the paper advances a new topological one.
本文在对“王氏代数”、“k -树组”和“MINTY”这三种求有向树组的典型方法进行分析之后,提出了一种生成有向树组的拓扑方法。
Having analysed the "W-algebra", "K-tree terms" and "MINTY", the three typical methods of generating direct tree terms, the paper advances a new topological one.
应用推荐