Node types are returned as integers, and allow you to handle each node appropriately; an element (type 1) has a name, but no value, whereas a text node (type 3) has a value but no name.
节点类型以整数返回，并且允许您适当地处理每一个节点；一个元素(类型1)有名称没有值，但是一个文本节点(类型3)有值没有名称。
The title of each paragraph can be imagined to be the heading nodes under the root node (level 1).
每一个段落的名字可以被想象为根节点下的标题节点(层次1)。
Look back at Figure 1, and imagine each node is a person and each diagram is a team design.
请回顾图1，想象一下每一个结点就是一个人，每一个图表就是一个团队设计。
A property of this node is its unique identifier — a 1 to 12 character label.
此结点有一个属性，即它的唯一标识符——由1到12个字符组成的标签。
Now node 1 has two partial sums.
现在节点1有两个部分和了。
For each element in such a pattern, a -1 or + 1, there is a node object in an array of nodes.
对应于这类图案中的每一个元素，- 1或者+ 1，在节点数组中都有一个节点对象。
As illustrated in Figure 1, each node is connected to two networks.
如图1所示，每个节点均连接至两个网络。
In this case, processor 0 is attached to logical node 0, processor 1 to node 1, and so on.
本例中，处理器0将附属于逻辑节点0，处理器1附属于节点1，以此类推。
Throughput scaling from 2 adapters/1 node to 4 adapters/2 nodes was computed for each send message size.
对于每种消息大小，分别计算从2 个适配器/1 个节点到4 个适配器/2 个节点的吞吐量变化。
Node 2 sends its integer to node 1, and node 4 sends its integer to node 3.
节点2将自己的整数发送给节点1，节点4将自己的整数发送给节点3。
From the new cluster node Menu, type "1" to create a new cluster.
从新集群节点菜单，键入“1 ”创建新的集群。
One time, you may be directed to node 1. Another time, you may be directed to node 2, and so on.
一次可能转发到节点1，而另一次可能转发到节点2，等等。
In Figure 1, the state machine starts at node 1.
在图1中，状态机从节点1开始。
As a result, we just used yum to pull it down and perform the installation on an edge node [1].
因此，我们只是使用yum把它拉下来，然后在edge节点[1]上执行安装操作。
where d(n) for a hidden node n, turns on (1) how much n influences any given output node; and (2) how much that output node itself influences the overall error of the net.
其中d(n)是隐藏节点 n 的函数，让我们来看（1）n对任何给出的输出节点有多大影响；（2）输出节点本身对网络整体的误差有多少影响。
This node is connected to Task 1, symbolized by a yellow rectangle with rounded corners.
此节点连接到Task1，后者用黄色的圆角矩形表示。
Method 1: Set up the backup node.
方法1：设置备份节点。
The rope counterpart simply creates a new concatenation node, which is an o (1) operation.
rope版本的连接操作则只是创建一个新的连接节点，这是个o(1)操作。
Table 1 illustrates a node named abcdefgh00 with five host names.
表1说明了一个名为abcdefgh00的节点具有五个主机名。
Finally, notice the last child node of the departments node in Figure 1.
最后，注意图1中departments节点的最后一个子节点。
For the document in Listing 1, PRODUCTS is the root node.
对于清单1中的文档，PRODUCTS是根节点。
In Figure 1, the name of the root node is org.
在图1中，根节点的名称为org。
In the present implementation at least, if this sum is less than zero, the net sets the node to -1, and if it is greater than or equal to zero, the net sets the node to + 1.
至少在当前的实现中，如果这个和小于0，网络就将节点设置为- 1，如果它大于或等于0，则网络将节点的值设置为+ 1。
Then you can define the master replicate using -m option to specify the master node as g_pkcdr.1.
然后可以使用- m选项定义主复制，将主节点指定为g_pkcdr . 1。
Install WebSphere Application Server base on the node ha3 (steps 1-9 above, only) with the following information.
在节点ha3上根据如下信息安装WebSphereApplicationServer中心(只需进行步骤1 - 9)。
The dijit.tree.ForestStoreModel in Listing 1 connects a root node with multiple root items in a diji.tree.
清单1 中的 dijit.tree.ForestStoreModel 将一个根节点和diji.tree 中的多个根条目连接起来。
Yup, so one total node, 2 minus 1 is 1, and that means since l is equal to 1, we have one angular nodes, and that leaves us with how many radial nodes?
一个节点，2减去1等于1,因为l等于1,我们有一个角向节点，那剩下径向节点有多少个呢？
On node 1, the cluster members named clus1_1 and clus1_2 are an example of horizontal clustering on one node.
在节点1上，集群成员clus1_1与clus1_2是该节点上水平集群化的例子。
In this simple configuration, all nodes simply reside on the same node (see Figure 1).
在这个简单的配置中，所有节点都驻留在同一个主机上(见图1)。
Node 1 adds these partial sums to get the final sum.
节点1对这些部分和进行求和，从而得出最终的总和。
应用推荐