In the direct methods, the final destination node is selected in one step.
直接方法在一个步骤中选择最终目标节点。
This function takes the source node and copies it over as a child under the destination node.
此函数接受源节点，并将其作为子节点复制到目标节点下。
In the iterative methods, the final destination node is determined through several iteration steps.
迭代的方法通过几个迭代步骤确定最终目标节点。
The destination node may be in another document, in which case the subtree is copied between documents.
目标节点可以在另一个文档中，在这种情况下，在两个文档之间复制子树。
You create a pure vector-based drawing here and render a line here from source node to destination node.
您创建了一个纯粹基于矢量的绘图，并且显示了一条从源节点到目标节点的连线。
Then the destination node jointly decodes the messages from the source and relay nodes. We call such a procedure as a network LDPC code.
目的节点可以利用源节点和中继节点的信息进行联合译码，我们称之为网络LDPC编码。
The time the datagram remains on the Internet is measured in hops, where one hop represents one gateway on the datagram's path to the destination node.
数据报在因特网上保持的时间以跳跃点(hop)衡量，其中一个跳跃点表示数据报通向目的地节点路径上的一个网关。
Using iterative and maximum a posteriori decoding method, the information can be obtained at the destination node by decoding the codes received in different time.
目的节点采用迭代最大后验概率译码，利用多个时刻收到的码字恢复源 节点发送信息。
The invention can realize the high-precision positioning within a local range (100-meter radius), and the power consumption of the positioned destination node is low.
本发明能够在局部范围内(100米半径)实现高精度定位，并且被定位目标节点功耗低。
Through the location information of the destination node, L-ZRP could determine the packet forwarding domain so that it could limit the scope of the packet forwarding.
通过目的节点的位置信息，L -ZRP能够确定一个包转发域，以此来限制包转发的范围。
By utilizing equipments like Optical Cross Connect (OXC), WDM network could provide end-to-end light-paths to source-destination node pairs and re-use wavelength resources.
通过引入光交叉连接oxc，光网络可以通过波长选路为节点对提供端到端的光通道，进而实现波长的重用。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
This algorithm was based on MPH algorithm. It added the destination node to the tree step by step based on satisfying the delay constraint and increasing the multicast tree cost least.
该算法基于MPH算法的基本思想进行扩展，在满足时延限制条件和多播树代价增加最小的基础上，逐步将目的节点添加到多播树上。
Focusing on the AODV routing repair strategy and based on the hop count on the base path and the destination node, HAODV maintenances a repair area around the base path within certain number of hops.
该协议在路由发现以后，以所发现的路径做为基础路径，在其周围一定跳数范围内维护了一个路径修复区域。
Focusing on the AODV routing repair strategy and based on the hop count on the base path and the destination node, HAODV maintenances a repair area around the base path within certain number of hops.
该协议在路由发现以后，以所发现的路径做为基础路径，在其周围一定跳数范围内维护了一个路径修复区域。
应用推荐