• Back to Node 0 (Coordinating Node).

    回到节点0(协调节点)。

    youdao

  • Now add an attribute to the class and name it left. Set its Type to Node.

    现在一个属性命名left其值TypeNode

    youdao

  • Node 2 sends its integer to node 1, and node 4 sends its integer to node 3.

    节点2自己整数发送给节点1,节点4将自己的整数发送给节点3

    youdao

  • Whatever the resulting outcome will be, the machine eventually proceeds to node 6.

    不管产生结果如何机器最终都会进行节点6

    youdao

  • Data resources are copied as a whole file from node to node to create replicas.

    数据资源通常是以完整的数据文件为单位节点间进行拷贝。

    youdao

  • There are a few changes to node in comparison with the earlier Visual Studio 2003 support

    早的VisualStudio 2003 支持版本相比节点一些变化

    youdao

  • In this case, processor 0 is attached to logical node 0, processor 1 to node 1, and so on.

    例中处理器0属于逻辑节点0,处理器1附属于节点1,以此类推。

    youdao

  • If you expand the Calls To node, all members that call the selected member are displayed.

    如果展开[呼叫目标]节点会显示呼叫选取成员所有成员

    youdao

  • One time, you may be directed to node 1. Another time, you may be directed to node 2, and so on.

    可能转发节点1而另一次可能转发到节点2等等

    youdao

  • Furthermore, it sends application messages to node Appl2 and database requests to the database node DB.

    另外节点Appl2发送应用程序信息,向数据库节点DB发送数据库请求

    youdao

  • Make sure that you are able to ping and connect freely from node to node on all respective networks.

    确保能够自由地所有相应网络节点节点ping连接

    youdao

  • One caveat to node removal: the node must be running in order for this automatic removal process to proceed.

    关于删除节点一个警告就是要进行自动删除过程必须顺序运行节点。

    youdao

  • One type of robustness is simple robustness, in which the protocol ADAPTS to node and link fail-stop failures.

    一种健壮类型简单健壮性,协议适应节点链路的异常终止错误。

    youdao

  • Applying the classical graph drawing algorithms to node localization in wireless sensor networks is a novel idea.

    经典画图算法应用无线传感器网络节点定位问题一个全新的思路。

    youdao

  • With a light green color, a large arrow pointing at the linked-to node, and an enhanced thickness to emphasize the linkage.

    一个较大的亮绿色箭头指向链接节点,使用增强线强调链接

    youdao

  • How to apply WLSE to node localization algorithm and choose proper weight coefficient to reduce location error are introduced.

    介绍了如何加权最小二乘估计应用节点定位以及如何合理地选择加权系数降低定位误差

    youdao

  • 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

    youdao

  • To apply genetic algorithms to node ordering, a novel genetic coding and fitness function suitable to node ordering are proposed.

    采用遗传算法进行节点优化编号,提出了适合节点优化编号的遗传编码适应值函数

    youdao

  • For one thing, any methods I might have added to node objects would potentially conflict with tagnames in the generic XML documents that gnosis.xml.objectify parses.

    只有一个原因使添加节点对象所有名称都可能与 gnosis.xml.objectify 解析一般 XML文档中的标记名发生冲突

    youdao

  • If you want to theme a node of a specific type, you make a copy the node.tpl.php file and change the filename to node -.tpl.php, where is the name of the node type.

    如果希望特定类型节点进行主题化,那么要复制node. tpl .php文件文件名改为node - . tpl . php,其中节点类型的名称

    youdao

  • The security issue in wireless sensor networks is greatly different from other conventional networks due to node characteristics and specific security requirements.

    由于传感节点特性特殊的安全需求,传感网络安全问题传统网络相比,很大的不同

    youdao

  • To have template extend another template just add "extends" property and set it's value to point to node you want to extend (both relative and absolute path works).

    模板扩展另一个模板添加扩展属性设置指向节点延长(相对绝对路径作品)。

    youdao

  • 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.

    其他地址自动配置协议相比本文提出的策略可以快速完成地址配置,需要进行重复地址检测开销很少。

    youdao

  • 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实现另一个交互流。

    youdao

  • In these foundations, the recursion theory of depth first traversal, database technology and visual programming technology are employed to computer memory, which is expressed to node relations.

    基础上采用深度优先遍历递归理论数据库技术,实现了流域节点间关系的计算机存储

    youdao

  • All of these are transparent to you, as you still end up with a node that has the name you want.

    所有这些对于来说都透明最终得到的是一个具有所希望名称节点

    youdao

  • One of its purposes is to register for all notifications which occur on that cell, node, or server.

    目的之一就是注册单元节点服务器发生所有通知

    youdao

  • We know that the zero does not count as a node, if per se I actually had managed to hit zero in drawing that, the correct answer would be the bottom one there.

    我们知道0不能算作一个节点如果确实零点画成了0,那正确答案应该下面那个

    youdao

  • We know that the zero does not count as a node, if per se I actually had managed to hit zero in drawing that, the correct answer would be the bottom one there.

    我们知道0不能算作一个节点如果确实零点画成了0,那正确答案应该下面那个

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定