1·If the black holes in a binary system merge, then an even stronger pulse of gravitational waves radiates away from the system.
如果双黑洞结合在一起，那么更强的引力波脉冲波将从这个双黑洞的二元体系辐射开来。
2·The relation presented in this step of the example illustrates only part of a typical UML to RDB mapping, as it deals only with binary associations.
示例的这一步骤中表达的关联只表明了典型的UML到RDB的映射的一部分，因为它只处理二元关联。
3·It is a declaration of absolute interdependency among the things that we understand in binary terms but that we take somehow one to be causative of the other when we think about them.
这是在宣布事物之间的绝对的相互性，我们能在二元关系上理解这些事，但是我们惯常于把一个是当成另一个的原因。
4·The heart of this problem is the declaration of the decision variables as binary variables.
这个问题的核心是将决策变量声明成二元变量。
5·So, in principle, you can determine for each one of those stars the velocity in orbit, the radius of their orbit and, of course, the period of the binary system.
所以从原则上来说，你们可以决定任何,恒星在轨道中的速度，轨道的半径以及，当然，二元体系的周期。
1·Now, the decision tree, if I branch left, it's a binary tree.
现在，这个决策树，如果我走左边的分支，这是一棵二叉树。
2·Enhanced JFS2 USES a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.
增强的JFS2在执行索引节点搜索时使用二叉树表示形式，与JFS使用的线性方法相比，这种方法要好得多。
3·Red-black tree is a self-balancing binary search tree.
红黑树 是一个自平衡的二叉查找树。
4·As I said, binary trees are a very efficient and fast way of sorting.
正如我所说，二叉树排序是一种非常有效且快速的方法。
5·You clearly understand the characteristics of a binary tree.
让你清晰的了解到二叉树的特点。