查询词典 nodes

Traditional page clustering algorithm based on DOM tree edit distance is not suitable for the complex Document Object Model tree structure pages created from dynamic templates. In this paper, an improved Web page clustering algorithm was proposed based on partial tag tree matching. In the proposed algorithm, the appropriate weights were assigned to the nodes according to their effects on the layout of Web pages and the level difference between template nodes and non-template nodes.

传统的基于DOM树编辑距离的网页聚类算法不适合文档对象模型树结构复杂的动态模板网页，提出了一种基于局部标签树匹配的改进网页聚类算法，利用标签树中模板节点和非模板节点的层次差异性，根据节点对布局影响的大小赋予节点不同的匹配权值，使用局部树匹配完成对网页结构相似性的有效计算。

Comparing the information on hop count between the measured nodes and beacon nodes, the quick self-locating of measured nodes was implemented.

研究了通过比较被测节点与信标节点之间的跳数信息，实现被测节点快速自身定位的方法。

A new network routing algorithm is proposed, which follows calculation rues of logic algebra and calculates routes with depression of order transformation of incidence martrix. For network with m nodes, m-2 times depression of order transformation operations can get all routes between two nodes. Furthermore, it accords with the communication transmission rules and avoids the close loop routes.

提出一种网络路由新算法，是按照逻辑代数运算规则，以关联矩阵降阶变换方式计算，对于有m个节点的网络，只需m-2次距阵降阶变换运算，就能够算得网络两节点间全部路由，且不会出现闭环路由问题，完全符合通信传输规则。

From the detailed simulation results and analysis,for the emulational frame based on minimum zone set,the route discovery mechanism of DSR is independent of nodes mobility,every once,the source node acquires a route to a target node which its relative position is alterant,the routing time is steady but not be effected by nodes mobility,the conclusions are obvious helpful for reducing route tip and increasing routing efficiency.

通过对选取总路由流量，路由平均跳数、平均路由发现时间的实验数据分析发现，对于基于最小区域集的仿真框架，DSR的路由发现机制并不受节点移动性的影响，每次源节点获得一条到达相对位置已改变目的节点的新的路由的时间并不受节点的移动性影响而趋于稳定，可明显减少路由跳数，增加路由计算效率。

Both the number of input nodes and hidden nodes was 5.Refrence solution was mixure of aminopyrine and antipyrine.

输入节点数和隐含节点数均为5，测定参比液为氨基比林和安替比林的混合液。

There are more lymph nodes in certain areas of your body, for example in your armpit there are around 30-50 small nodes.

有更多的淋巴结在某些领域的您的身体，例如在您的腋下有大约30-50小节点。

The main idea about it is that the messages passed on the bipartite graph of LDPC are based on the probability differences, and the renewal of both check nodes and message nodes is carried out on the special addition domain.

提出了一种新的基于差分的译码算法，其主要思想是：在LDPC码的二部图上所传递的消息是概率的差分值，而对于校验节点和消息节点的更新都是在特定的加法域中进行。

Because the route table of any nodes only stores the route information for its cognation nodes and some special group, the cost of storage is very low and the route performance is high.

该算法充分利用基三分层互连网络的层次特性，其路由表中仅保存各节点的同族节点和部分组的路由信息，路由表所占存储空间小，路由效率高。

Firstly, we prove that if we select nodes properly, and let the distance between these nodes sufficiently small, cubic polynomial spline can approximate a continuously differentiable function, which with continuous derivatives of second order and discontinuity of the first kind in the derivatives of fourth order, to any desirable accuracy. This result lays a theoretical foundation for representing trajectories by splines and double orthogonal basis.

一是证明了适当选取节点并使节点距充分小时，三次多项式样条可以逼近具有二次连续导数的分段四次连续可微函数到足够的精度，这一结论为用样条和双正交基表示弹道打下了理论基础。

The CrossHatch shader is a good example of how a Surface Shader can be used to pipe information from other nodes, including other material nodes, to a surface via its Shading Group.

交叉阴影着色方式是一个好例子，一个表面的SHADER能用于去如何从其它节点导入信息，包括其它材质节点，经过它自己的材质网络到一个表面。

Dixie itself is a nickname for the American South.

Dixie 本身是美国南部的别称。

I think John Terry epitomises that and a big reaction is what we will be looking for.

而我认为特里就是这样一个典型，他正是我们期望看到的那个领秀。