有时，检查器还能够从节点名字推断出等价节点。
At times, a checker can infer equivalent nodes from the node names.
每个节点通常承载不超过一个或两个的相关应用程序，因此链路授权大致等价于驻留在其中的应用程序的授权。
Each node typically hosted no more than one or two related applications so authorizing a link was roughly equivalent to authorizing the application residing there.
清单5与清单3等价，但所用的本地节点标识与清单4中的相同。
Listing 5 is equivalent to Listing 3, but the same local node IDs are used as in Listing 4.
FD集中根据左部等价形成划分，划分的各子集根据左部的依赖关系形成一个有向图，有向图中每一个节点的FD可能是一个符合BCNF的子模式的FD，其关键字就是各子集的等价左部。
Digraph will be constructed by using the dependence of the left of subset's FD. Some nodes will help to decompose a subschema of BCNF. The key of the subschema is the left or left's equivalence.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
论述了负荷特性对相对电距离指标的影响，并与电压稳定性负荷节点指标进行了比较，论证了两种方法的等价性。
The influence of load characteristics to the relative electrical distance index is discussed and compared with the voltage stability load bus index. The equivalence of both indexes is proved.
可以说，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.
应用推荐