Node 2 sends its integer to node 1, and node 4 sends its integer to node 3.
节点2将自己的整数发送给节点1，节点4将自己的整数发送给节点3。
Whatever the resulting outcome will be, the machine eventually proceeds to node 6.
不管产生的结果如何，机器最终都会进行到节点6。
There are a few changes to node in comparison with the earlier Visual Studio 2003 support
与较早的VisualStudio 2003 支持版本相比，节点有一些变化
In this case, processor 0 is attached to logical node 0, processor 1 to node 1, and so on.
本例中，处理器0将附属于逻辑节点0，处理器1附属于节点1，以此类推。
One time, you may be directed to node 1. Another time, you may be directed to node 2, and so on.
一次可能转发到节点1，而另一次可能转发到节点2，等等。
Converts a Point to node (local) space coordinates. The result is in Points.
特别注意：节点坐标系的原点默认是其左下角位置。
Data resources are copied as a whole file from node to node to create replicas.
数据资源通常是以完整的数据文件为单位在节点间进行拷贝。
Make sure that you are able to ping and connect freely from node to node on all respective networks.
确保能够自由地在所有相应的网络上从节点到节点ping和连接。
Furthermore, it sends application messages to node Appl2 and database requests to the database node DB.
另外，它还向节点Appl2发送应用程序信息，向数据库节点DB发送数据库请求。
One type of robustness is simple robustness, in which the protocol ADAPTS to node and link fail-stop failures.
一种健壮性类型是简单健壮性，即协议能适应节点和链路的异常终止错误。
Applying the classical graph drawing algorithms to node localization in wireless sensor networks is a novel idea.
将经典的画图算法应用到无线传感器网络节点定位问题是一个全新的思路。
With a light green color, a large arrow pointing at the linked-to node, and an enhanced thickness to emphasize the linkage.
一个较大的亮绿色箭头指向链接的节点，使用增强的粗线来强调链接。
Due to node resource constraints, research focuses on achieving minimum path length of indirect pairwise key construction.
由于节点资源受限，如何尽可能减小建立间接对偶密钥的路径长度是该类算法的研究焦点之一。
How to apply WLSE to node localization algorithm and choose proper weight coefficient to reduce location error are introduced.
介绍了如何将加权最小二乘估计应用于节点定位以及如何合理地选择加权系数以降低定位误差。
Then, it goes through a loop cycle until it satisfies a certain condition and ultimately goes to node 5 -- the final node in the flow.
然后，它一遍遍执行一个循环，直到满足某个条件才最终进行到流中的最后一个节点 ― 节点5。
To apply genetic algorithms to node ordering, a novel genetic coding and fitness function suitable to node ordering are proposed.
采用遗传算法进行节点优化编号，提出了适合节点优化编号的遗传编码和适应值函数。
The security issue in wireless sensor networks is greatly different from other conventional networks due to node characteristics and specific security requirements.
由于传感节点的特性和特殊的安全需求，传感网络的安全问题与传统网络相比，有很大的不同。
Compared with other address auto-configuration protocols, this protocol assigns unique address to node rapidly without performing duplicate address detection. So the overhead is very low.
与其他地址自动配置协议相比，本文提出的策略可以快速完成地址配置，不需要进行重复地址检测，开销很少。
If the machine gets to node 2, the interaction at this node repeats itself until it fully meets a preset condition and then goes to the final node, node 5, to implement another interaction flow.
如果机器到了节点2处，那么这个节点处的交互将一直重复自身，直到它完全满足预置条件才转到最后的节点，即节点5处来实现另一个交互流。
Back to Node 0 (Coordinating Node).
回到节点0(协调节点)。
The technique is called the Green function method. The method can be used to calculate efficiently the node-to-node resistances or impedances in substrate models.
该方法可用于衬底模型中节点间电阻值或阻抗值的计算，其计算效率较高。
A step has been taken toward enabling such node-to-node communication, courtesy of a consolidated radio with an on-chip antenna.
内置天线的强化无线电收发器，使之朝着点对点通讯迈进了一步。
A step has been taken toward enabling such node-to-node communication, courtesy of a consolidated radio with an on-chip antenna.
内置天线的强化无线电收发器，使之朝着点对点通讯迈进了一步。
应用推荐