set of node的例句大全

The Crypto node plug-in is a set of nodes that performs asymmetric cryptography using the PGP RSA algorithm.

Crypto节点插件是一组使用PGP RSA算法执行非对称加密的节点。

a node that anchors a hierarchical set of nodes.

锚定节点分层组的节点。

The leftmost location step selects a set of nodes relative to the context node.

最左侧的定位步骤选择一组相对于上下文节点的节点.

One factor is a new set of characteristic equations for the saddle-node bifurcation point which is of dimension n+ 1, instead of 2n+ 1, which is traditionally required in n-dimensional decoupled paramter-dependent power flow equations.

特点是：①对于一n维潮流方程，计算其鞍型分叉点所需求解的是n＋1维特征方程，而不是常规求解方法中的2n+1维特征方程。

In the pre-established the multicast tree, we have proposed choosing the edge nodes far away the source node as the destination node for choosing the destination nodes set. In addition, we have explained the advantages of choosing the two methods.

在预先建立多播树方面，对目的节点集选择，提出选择将源节点较远的边缘节点作为目的节点，并说明了这种选择方式的两个优点。

We want a well-defined set of properties for each type of node.

我们需要为每种节点类型提供一组定义良好的属性。

Get the list C of compute nodes from xCAT, and for each node n in C, set the time T ( n) when n is eligible for provisioning to the current time.

从xCAT获得计算节点的列表C，并且对于C内的每个节点n，若n具有供应给当前时间的资格，就设置时间T（n）。

UD-TDMA algorithm transforms the solution of the number of concurrent communication node into solving the theoretical issues of maximal independent set. It designs a distributed algorithm to obtain a maximal independent set of concurrent node and to determine the node slot distribution and the transmission cycle.

UD-TDMA算法将求解并发通信节点个数问题转化为求解极大独立集的理论问题，设计分布式算法获得每轮发送节点的极大独立集，进而确定节点时隙分配和发送周期。

By improving the traditional node traversing method, this algorithm can work out the minimum path set containing both nodes and links with the help of network topology.

该算法对传统的节点遍历法加以改进，算法基于网络拓扑图一步求出同时包含节点和链路的最小路集。

This thesis analyses some key problems involved in applying sensor network in target tracking, which are Deployment, Coverage and Node Localization. And the thesis also brings forward a set of innovative solutions to settle down these associated problems.

本文详细分析了将自组织传感器网络应用于目标跟踪应用所必须解决的多个关键问题&布局、覆盖和节点定位，并针对这些相互关联的问题提出了一套较完整的创新性解决方案。

every node in the hierarchy has a minimal set of attributes.

层次结构中的每一节点都具有一组基本属性。

for instance, i could use the xml-data reduced (xdr) specification's set of datatypes to annotate the node in listing 1.

例如，我可能使用了XML数据简化（XML-DataReduced，XDR）规范的数据类型集合对清单1中的节点进行了注释。

for instance, i could use the xml-data reduced (xdr) specification's set of datatypes to annotate the node in listing 1.

例如，我可能使用了XML数据简化（XML-DataReduced，XDR）规范的数据类型集合对清单1中的节点进行了注释。

the result of the rdf. complete function call is a node set of statement elements.

plete函数调用的结果是Statement元素的一个节点集。

the way of crack elimination is to set the vertex of higher resolution node to the edge of conterminous lower resolution node.

另外，通过将较高分辨率节点的顶点移到相邻较低分辨率节点的边界上的方法消除裂缝。同时，进行了实验研究。

the evaluation of a location path expression results in a node-set containing the nodes specified by the location path.

计算位置路径表达式所得到的节点集，将包含位置路径指定的节点。

you might prefer to sort the original node-set, store the sorted nodes in a variable, and select the first ten members of the sorted set.

也许您更愿意对原来的节点集排序，将排序后的节点存储到变量中，然后选择前十个成员。

Meanwhile, a method and an exploring process for constructing the initial complex form are also brought forward on the basis of characteristics of unit mesh node set and upbuilt mesh complex form method for discrete variable optimization design.

提出了根据单位网格结点集的特征构建初始复合形的方法和探索过程，建立了离散变量优化设计的网格复形法；

Average load of actual network environment should be less than the maximum rate of bottleneck node. Theoretical value of buffer possession is less than the value that is set in the actual network environment.

实际网络流量的平均负载不应大于瓶颈节点向网络发送的最大速率；分支节点缓冲占有量的理论值要小于实际网络环境中所应设置的值。

For a given initial set, the part analysis the probability value of the node affected by rumors with the time increasing, and obtains the conclusions of the expected value of the terminal set As.

对给定的初始集合，随着时步增加，分析被谣言传播影响的节点的概率值，并得出了有关最终集合As的期望值的一些结论。