- 更多网络例句与执行节点相关的网络例句 [注：此内容来源于网络，仅供参考]
-
When a node wants to communicate with a neighbor only known its link-layer address, it performs address resolution.
当一个节点想要与一个只知道链路层地址的邻居通信，它执行地址解析。
-
A multi-agent/mobile-agent platform, which stems from computational infrastructure agent grid has been designed and prototyped. As a node of grid, on each platform simulations of evolutionary processes of multi-nodes synchronous processing associated with individual inter-generation communication and individual migration between elementary populations can perform coadaptation based cooperative coevolution of the multi-population as a whole system, such as the case of the three species ecological system.
各网格节点的计算环境都支持单/多种群进化过程仿真，可分别执行不同的演化算法，模拟特定参数集合制约下的协适应共进化过程，如三物种生态系统的可持续进化，已由多节点同步执行算法、代间通讯及子群间个体转移进行演化过程仿真。
-
In this paper, a statistical method is used to obtain the node\'s idle time interval. On the basis of ensuring the successful implementation of the task, which has facilitated improved scheduling efficiency. In addition, select the nodes that are suitable for task scheduling depend on time by adjusting confidence coefficient dynamically.
本文通过统计的方法来获取节点的空闲时间区间，为提高资源的利用率，在保证任务成功执行的基础上，充分利用网络资源，动态调整置信度，选取在时间上适合于任务调度的节点。
-
The OnKeyUp event is where this is performed, it checks to see if the key is the escape key, and cancels the drag if it is, also returning any dragged over nodes to their original state.
该OnKeyUp事件正是这样一个被执行时，它检查看看是否关键是逃避的关键，并取消拖动如果是这样，也拖累了返回任何节点到其原始状态。
-
Following plan institute are shown, in AND-split node every concurrent branch can produce new child Token, when child the father Token that it can visit through its after Token arrives at AND-join node, repass father Token alls over all previous its child the executive case that Token can win current and intercurrent branch comes true amalgamative.?
如下图所示，在 AND-split节点每个并发的分支都会产生一个新的子 token，当子 token到达 AND-join节点后即可通过其访问到它的父 token，再通过父 token遍历其子 token即可获得当前并发分支的执行情况并实现合并。？
-
A method of constructing a repair path around a non-available component in a data communications network having, as components, nodes having a network address and links there between comprises the step, performed at a participating node, of receiving from a notifying node in the network, a notification identifying the notifying node and components through which the notifying node can be reached.
公开了一种在数据通信网络中构造绕过不可用组件的修复路径的方法，该数据通信网络具有作为组件的具有网络地址的节点和其间的链路，该方法包括以下步骤：在参与节点处执行从网络中的通知节点接收标识通知节点和通过其可以到达通知节点的组件的通知。
-
The major tasks of an HISN include the content format translation for original users and data tunneling for handoff users.
此节点会针对初始使用者执行内容格式转换，针对交手使用者执行资料通道。
-
Further more, we discuss four related issues:(1) Through reducing the number of operations in history buffer, we can optimize the efficiency for running continuously;(2) Support Undo operation for collaborative document editor through involving a delete counter for each object;(3) Introduce a new timestamp model to support concurrent operations in a single site for shared data;(3) Through involving a NOOP operation and executing transaction operation with all related NOOP operations to guarantee transaction operation is serialized.
进一步，本文讨论了一致性维护的四个相关问题：（1）通过精简操作的历史队列，实现算法持续执行时的效率优化；（2）通过引入对象节点的删除计数器，实现对文档的协同编著中的Undo操作支持；（3）介绍了一个新的支持单站点上共享数据的并发操作的时间戳模型；（4）通过引入空操作NOOP且保持事务操作和相应的NOOP操作同时执行，保证事务操作的序列化。
-
In this paper a novel ontology-based data semantic fusing frame named ODSF is introduced, the basic element of ODSF is dataset its semantic is obtained by the mapping between the domain ontology and dataset. ODSF adopts nested relation model to represent the schema information of dataset, and realizes the data fusing from coarse-grained level to the small-grained level by wrapping the datasets registered in virtual database as a new dataset. We also present the semantic model of ODSF, query executing process and algorithm of virtual database, so ODSF can provide the semantic supported and QoS supported data access for user. The experiments demonstrate our work and show the feasibility and effectiveness of ODSF and its key techniques.
本文提出了基于本体的语义数据容融合方法ODSF；该方法中的基本元素是数据对象，通过数据对象和领域本体之间的映射关系来表达数据对象的语义，使用嵌套关系模型来表达数据对象的模式信息，通过一个网格节点中集成的所有数据对象作为下一个节点的数据对象来实现数据资源由粗到细的融合；定义了ODSF的语义模型，给出了虚拟数据库的查询执行过程和算法，可以为使用者提供具有语义支持、服务质量保障的数据访问服务；通过原型系统验证了ODSF中理论和关键技术的正确性和可行性。
-
In short, the relation between nodes can be formally decided by DDF, the firing order is restricted to guarantee the correctness of program, so the introduction of DDF in embedded software design greatly benefits effective modeling, formal analysis, correct improvement, software optimization and implementation.
这样，DDF可以形式化地确定各种节点间的关系，并限定节点的执行次序以保证程序的正确性，将DDF用于嵌入式软件设计将极大地有助于有效的软件建模、形式化的分析、正确的设计改进、软件优化以及实现。
- 更多网络解释与执行节点相关的网络解释 [注：此内容来源于网络，仅供参考]
-
CALLOUT：标注
这样您就可以处理可能从目标服务返回的所有定义响应(输出和错误). 对于标注(callout)节点,可以将 Service Invoke 配置为重试目标服务调用,或使用在 SMO Header 或原语属性中指定的端点地址 URL 执行动态调用.
-
choice：选项
1)在选项(choice)之后加入需要合并后执行的活动节点. 2)在并行流中,从每个需要合并的分支用连接(link)连接到合并后需执行的活动. 1)通过循环(while)来实现,用变量来控制循环的逻辑.
-
corner effect：角效應
这就是街角效应(Corner effect). 在这种情况下,如果切换不能执行得很快的话,呼叫可能会丢失. 在文献中使用了位置辅助的中继和切换算法,在这个系统中,移动节点被认为可以估计出它的地理位置并具有建立和附近节点直接连接的能力,
-
deputy：代理
每个新的进程是创建在其父进程所处的site上,如果被迁移的进程fork一个子进程,它将同时创建一份代理(deputy)和body的拷贝. 每个用户创建的进程将运行在用户home节点上的执行环境中. 迁移进程将尽可能的使用本地资源,
-
emanate：发出
若在丛集重组的最后一刻收到延迟投票和心跳,则会产生问题. 解决方案:已修正API程式码,能正确处理在丛集严格的(strict)子集上执行的套件. 问题:若中止本机节点,则所有发出(Emanate)的丛集相关变更会初始化为空的字串.
-
idle：空闲的
备份 节点不执行任务,被认为是 空闲的(idle);这种配置有时被称为 冷备份(cold standby). 这样的配置需要高度的硬件冗余. 本系列文章关注的重点是冷备份配置. 接管(Takeover)配置:一种更高级的配置,在这种配置中,
-
execution order of node：节点执行次序
execution of order 执行订单 | execution order of node 节点执行次序 | execution priority 执行优先级,执行优先权
-
passive：被动
只有资源组在其上处于活动状态的节点才会以"并发主动"(concurrent active) 模式启用该卷组;其他节点将以"被动"(passive) 模式启用该卷组. 在"被动"模式下,不允许对该卷组执行高级操作. 注意:NFS 锁功能仅限于两节点的集群.
-
rebuild：重新生成
选择"配置属性"树型节点中的"链接器" "命令行";在"附加选项(D)"编辑框中添加如下指令:/opt:ref,icf;按"确定"退出;重新生成(Rebuild)项目;系统符号文件指 Windows 操作系统依赖的那几个重要的 DLL/SYS 和可执行文件对应的符号文件,
-
shortest path algorithm：最短路径算法
因为节点无需重复执行 路由算法 提供链路费用的最新信息 298 数据通信与网络教程 下载 7.2.3 Dijkstra算法 D i j k s t r a算法 ,有时也称为 最短路径算法 (Shortest Path Algorithm )或 正向搜索算法 (Forward Search Algorithm) ,