• 数据库生成类型DatabaseInterfaceDesigner将自动定义一个名为row

    When the Type Tree is generated for a database table, a group named Row is automatically defined by the database Interface Designer.

    youdao

  • 路由拓扑来表示个路由其他所有路由的所有路径假定路由拓扑生成

    It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.

    youdao

  • 本文研究了由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.

    youdao

  • 相比于传统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.

    youdao

  • 本文作者分析讨论路由协议生成构建方法基础上进一步对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.

    youdao

  • 研究了由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.

    youdao

  • 基于生成树钥匙分配方案各种方法提供有效用户删除方法的同时努力用户钥匙存储最小化。

    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.

    youdao

  • 我们最小生成树两个推断出一些古老单倍型,并推测在冰期时湖北我国的西南地区可能是该物种的避难所

    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.

    youdao

  • 仿真结果表明:与传统LEO卫星网络路由算法相比,该算法具有较低计算复杂度生成播路由具有较小的开销

    Simulations show that the computing complexity and the tree cost are lower than the traditional multicast routing algorithm for LEO satellite networks.

    youdao

  • 通过比较生成数目可以判断任意数目节点相对重要性

    The relative importance of two groups of nodes in the graph can be compared with respect to the number of spanning trees.

    youdao

  • 传统聚合包括三个主要步骤,分别候选生成选择匹配

    The traditional Aggregated Multicast was divided the problem into three sub-problems, namely, candidate tree generation, tree selection and group-to-tree mapping.

    youdao

  • 从图中去掉节点以及相关联链路后,所得到的图对应的生成数目越少,则表明节点越重要

    The most vital nodes are those whose removal with their incident links most drastically decreases the number of spanning trees.

    youdao

  • 本文在王氏代数”、“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.

    youdao

  • 本文在王氏代数”、“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.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定