文章从双语句对的译文等价树中抽取翻译等价对。
In this paper, translation equivalences are extracted from translation corresponding trees of bilingual sentence pairs.
根据这些算法和关系代数等价定理，给出了对关系代数查询树进行逻辑优化的规则，并证明了逻辑优化的正确性。
With these algorithms and the equivalence theory, the several rules to logically optimize the accessing trees were presented and the correctness for the logical optimization was proved.
针对差别矩阵求约简过程中合取范式向析取范式等价转换的难题，提出一种基于差别矩阵构造约简树的有效方法。
Aiming at the problem of equivalent conversion from conjunctive normal form to disjunctive normal form, an effective algorithm was proposed to construct reduction tree based on discernibility matrix.
该实现算法以QC树的结构为基础，结合深度优先算法和等价类的覆盖关系对QC树进行维护和查询。
The implementation maintains and queries QC-tree based on the structure of QC-tree, combining the deep first algorithm and cover of equivalent classes.
此外，还得到了树映射是强非混沌以及逐片单调树映射的拓扑熵为零的几个等价条件。
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.
可以说，2-3-4树中的3 -节点等价于红-黑树中有一个红色子节点的父节点，4 -节点等价于有两个红色子节点的父节点。
You can say that a 3-node in a 2-3-4 tree is equivalent to a parent with a red child in a red-black tree, and a 4-node is equivalent to a parent with two red children.
可以说，2-3-4树中的3 -节点等价于红-黑树中有一个红色子节点的父节点，4 -节点等价于有两个红色子节点的父节点。
You can say that a 3-node in a 2-3-4 tree is equivalent to a parent with a red child in a red-black tree, and a 4-node is equivalent to a parent with two red children.
应用推荐