目的节点;目标节点
destination───n.目的地,终点
node───n.(Node)人名;(法)诺德;n.节点;瘤;[数]叉点
lingual node───舌结
destination country───前往目的地国;到达国
ending destination───终点目的地
lymph node───[解剖]淋巴结;n.淋巴腺,淋巴结
top destination───首选目的地
holiday destination───度假目的地;度假胜地
dermatopathic node───皮肤病结节
This function takes the source node and copies it over as a child under the destination node.───此函数接受源节点,并将其作为子节点复制到目标节点下。
the iterative methods, the final destination node is determined through several iteration steps.───迭代的方法通过几个迭代步骤确定最终目标节点。
direct methods, the final destination node is selected in one step.───直接方法在一个步骤中选择最终目标节点。
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 destination node may be in another document, in which case the subtree is copied between documents.───目标节点可以在另一个文档中,在这种情况下,在两个文档之间复制子树。
The data can be "relayed" from the source node to the destination node with the help of the nodes' mobility.───利用节点本身的移动性,将数据从源节点“接力搬运”到目的节点,实现源节点和目的节点的间接通信。
Shortest path problem from one origin node to one destination node in dynamic networks is an unsolved hard problem.───动态网络中两节点间最短路径问题是目前尚未解决的一个难题。
When the destination node receives the frame the FCS number is recalculated and compared with the FCS number included in the frame.───当目的地节点接收到这讯框,FCS数字被重新计算及和包含在这讯框内的FCS数字比较。
In the iterative methods, the final destination node is determined through several iteration steps.───迭代的方法通过几个迭代步骤确定最终目标节点。
- degree of completion
- declaration of shipment
- day code
- damn it everything
- destination node address
- degree of compression
- declaration of the poll
- day countdown
- deny access for a to b
- degree of concentration
- damn it plz
- destination office
- declaration of trust
- day counter
- deny access for sb
- damn it possible
- destination offset address
- degree of condtriction
- declaration of war one piece
- day craft
- deny access for sb to