节点内

A deadlock free plane self-adapting routing method in a two-dimensional torus network belongs to the distributing high performance fault tolerance computing technology field, characterized in that each physical passage between nodes are divided into two virtual passages which are both two-way passages and distributed to four virtual sub network of the two-dimensional torus network; the virtual passage distribution strategy avoids the deadlock formed among the sub networks and between the sub networks and has greater self-adapting.

二维torus网络无死锁的自适应路由方法属于分布式高性能容错计算技术领域，其特征在于，把节点之间的每条物理通道被划分为两条虚拟通道，这两条通道均为两向通道，并分配到二维torus网络的四个虚拟子网中，利用虚拟通道分配策略避免了各子网内以及各子网间可能形成的死锁，同时达到更高的自适应性。

Based on method of moment and field-circuit coupling theory, nodal method of analysis in circuit theory is applied to the power parameters calculation of grounding grids. The inner self-resistance and self-inductance of conductors, mutual inductance between conductors, and displacement current of conductors are taken into account.

基于矩量法和场路结合的思想，将电路中的节点电压法用于接地网工频参数计算中，该方法不仅考虑了接地导体的内自阻抗和自感，而且考虑了导体间的互感，导体的位移电流。

If a process language implements a construct like e.g. UML super states, events on a nested node can be propagated to the enclosing superstate.

如果流程语言实现了一个构造如 UML 超 state ，内嵌的节点上的事件可以传播到封闭的超状态。

In an ultramicroscopic view, the units of cluster value network minifies to the linkages of value chains, the network connections are specified as the linkage connections among value chains, and the network resource is the combination of logistic flow, knowledge flow and capital flow within the cluster.

本文认为，在超微观的视角下，集群价值网(来源：ABC论文9b网www.abclunwen.com)络节点缩小为企业价值链环节，网络联结细化为企业间价值链环节的联系，而网络资源是集群内物流、知识流和资金流的集合。

The weak formulation permit is satisfied not point by point, finite element method balances only at node neighborhood, in unit balance is not required, in analytical method single check from infinite series does not satisfy the equation, but infinite number of points satisfy the equation, and then the weak formulation of dual system of Hamilton equations was educed.

基于基本方程和边界条件的弱形式，给出相应的广义变分和不同形式的有限元所采用的弱条件，说明弱形式允许不是逐点满足，有限元法只在节点邻域平衡，在单元内不要求平衡，解析法用无穷级数中单取一项也不满足方程，也是无穷多项在积分下满足，进而导出对偶体系弱形式哈密尔顿方程。

The one or more impairments are compensated for by employing an optimization process in the optical network such that the optical signals from the source or sources of the impairments are controllably adjusted at any particular node in the network.

对此一个或多个的减损，用光网络内的优化过程进行补偿，使来自减损的一个或多个光源的光信号，可控地在网络的任一特定节点上加以调整。

The paper discusses the initial disordered wireless sensor networks,establishes some communication model for the nodes,and gives a time-slot assignment algorithm which realizes the time-slot assignment distributedly for 2-hop sensor nodes.

本文针对网络初始阶段混乱无序的情况，建立了初始数据通信模型，进而提出一种时隙分配算法，分布式地实现两跳内节点的时隙分配。

We prove the correctness and optimality of this design by showing that it is able to locally recognize all 1-hop localizable nodes.

我们通过展示该方法能在局部范围内识别所有的一跳可定位节点来证明其正确性和最优性。

Nowadays most of researches on the multicast routing are how to generate multicast tree. In case of multicast tree failure, there need to re-route all of nodes behind the failure point so much as re-build the whole tree, this will deteriorate Quality-of-Service, on the other hand, it is insufferable in some multicast applications. We proposed a Fault-Tolerant multicast scheme to resolve this problem. Our scheme creates backup paths crosswise in the ramose node. It can reduce additional cost greatly and recover the failure of multicast tree rapidly.

现在关于多播路由的研究大多着眼于多播树的生成，一旦多播树出现故障，就需要对故障点以下的所有多播接收节点进行重新路由甚至对整个多播树进行重新构造，这一方面降低了服务质量，另一方面有些多播应用不允许长时间的中断，对此本文提出了一种多播容错方案，采用在分枝节点之间建立备份路径的措施，可以在很大程度上减少额外的代价，能够在最快的时间内恢复多播树的故障，并使得恢复后的多播树形状基本上没有改变。

Nowadays most of researches on the multicast routing are how to generate multicast tree. In case of multicast tree failure, there need to re-route all of nodes behind the failure point so much as re-build the whole tree, this will deteriorate Quality-of-Service, on the other hand, it is insufferable in some multicast applications. We proposed a Fault-Tolerant multicast scheme to resolve this problem. Our scheme creates backup paths crosswise in the ramose node. It can reduce additional cost greatly and recover the failure of multicast tree rapidly.

现在关于多播路由的研究大多著眼于多播树的生成，一旦多播树出现故障，就需要对故障点以下的所有多播接收节点进行重新路由甚至对整个多播树进行重新构造，这一方面降低了服务质量，另一方面有些多播应用不允许长时间的中断，对此本文提出了一种多播容错方案，采用在分枝节点之间建立备份路径的措施，可以在很大程度上减少额外的代价，能够在最快的时间内恢复多播树的故障，并使得恢复后的多播树形状基本上没有改变。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。