This paper is mainly concerned with the way how to construct a data link layer which is adaptable to Ethernet of tree topological in TV cable.
如何构造适应视缆树形拓扑的以太网数据链路层，是本文论述的重点。
The method exploits regularities both in the communication phases and in the topological communication structure of a binomial tree.
这一方法不仅利用二项树通信步中的规则性，而且利用了二项树拓扑结构的规则性。
After that a linear skeleton topological similarity measure algorithm based on skeleton tree is detailed.
本文给出了一种基于骨架树的线性骨架拓扑相似性度量算法。
The execution rate of topological reconstruction is enhanced by introducing the AVL tree and half edge data structure.
平衡二叉树和半边匹配数据结构的引入，提高了拓扑信息重建的速度。
The topological relation of the loops can also be determined by setting up tree structure and then the cutting area can be decided on.
在此基础上建立树状数据结构，确定环的拓扑关系，从而确定加工区域。
Furthermore, we also obtain a few equivalent conditions which a tree map is strongly not-chaotic and a few equivalent conditions which a piecewise monotone tree map has topological entropy zero.
此外，还得到了树映射是强非混沌以及逐片单调树映射的拓扑熵为零的几个等价条件。
In this paper we discuss the topological entropy of a tree map and obtain several equivalent conditions for a tree map with positive topological entropy.
本文讨论树映射的拓扑熵，得到树映射具有正拓扑熵的几个等价条件。
Existing decision tree building algorithm assumes that all topological relations occur with equal probability, but this situation is extremely rare in practice.
在第二类拓扑查询中，现有的决策树生成算法假定所有拓扑关系拥有相同的出现率，这种情况在实际中是非常少见的。
The paper builds tree-model of RNA molecules and utilizes frequent sub tree mining algorithm to mine common topological patterns among RNA secondary structures.
本文对RNA分子建立树形模型，利用频繁子树挖掘算法挖掘RNA二级结构中的公共拓扑模式。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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”这三种求有向树组的典型方法进行分析之后，提出了一种生成有向树组的拓扑方法。
This paper examines the reconfiguration planning problem of tree-like topological modular robots and defines some of the general nomenclature.
本论文主要对树状拓扑结构的模块化机器人的重构规划问题进行了研究，定义了构型重构的基本概念，提出了分支重构规划算法。
This paper examines the reconfiguration planning problem of tree-like topological modular robots and defines some of the general nomenclature.
本论文主要对树状拓扑结构的模块化机器人的重构规划问题进行了研究，定义了构型重构的基本概念，提出了分支重构规划算法。
应用推荐