查询词典 recursive relation

Especially, its operation does not depend on packet dropping. In chapter 5, we have analyzed the relation between link rate and link price of the Newton-like algorithm, which is proposed by Low et al to solve the utility function. And then we reduce the convergence procedure of Newton-like algorithm to a simple recursive procedure along a convex curve after the reduction and mathematical derivation. Thus, we found the reason that leads to the severe fluctuation of the sending rate during its convergence procedure, and then proposed our improved algorithm.

在第五章，我们在对Low等人提出的用于解决效益函数的Newton-like算法的链路速率与链路价格之间关系的深入分析的基础上，经过简化和数学推导，我们将其收敛过程归结为沿着一个凸曲线的非常简单的收敛过程，由此找到了导致Newton-like算法收敛过程中信源速率振荡剧烈的原因，在此基础上，我们提出了一个改进的链路算法。

The recursive language relation formula is given in four synthesis operations, by which the language of synthesized system can be obtain and both liveness and deadlock-freeness of resultant system can be determined.

描述了四种合成操作中合成网系统与各子网系统之间的并发语言关系，给出了相应的递归语言关系式。

To be able to compute the running time , one needs to be able to add up the times taken in each iteration of a loop and to solve the recurrence relation dening the time of a recursive program.

算法光能给出正确的计算结果是不够的，它必须在合理的时间和空间内完成才是有用的。

In this paper,a new algorithm is given by means of the complexification of the knots,i.e. the node in the plane is considered as a complex point,the vector as a complex vector,and then based on the construction of vector valued Thiele type rational interpolants and the backward three term recurrence relation for vector valued continued fractions,the recursive algorithm is obtained by appropriate transformation.

文章利用插值型值点复数化的方法讨论并给出了二元向量值有理插值的一种新算法，即把平面上的插值结点视为一个复数，所对应的向量视为一个复向量，使用一元Thiele型向量值有理插值公式的构造方法和向量连分式的向后三项递推关系式以及适当的变换，最后导出了这种递推算法。

Hypercube has many advantages, such as smaller diameter, simple routing algorithm, many parallel paths between any two nodes, and fault-tolerance, on the other hand that the Hypercube nodal degree increased logarithmetically to the number of nodes has limited network population. So we propose a constant nodal degree hierarchical topology to remedy the weakness of Hypercube and take advantages of Hypercube most. Given the definition of FCCN we analyse the basic properties including nodal degree , number of links , extensibility and diameter (maximum network communication delay). Also we proposed a simple and self-routing algorithm applied in FCCN. Although the self-routing algorithm is not optimal, but at more than 82% case it can get the shortest path, and the percent is larger and larger increased with network levels. By the self-routing algorithm the internodal distance is calculated to evaluate the network communication delay more clearly. The average internal distance is in order of the cubic root of the network population that is almost same as logarithmetically relation in a few thousands. FCCN is a highly scalable network due to its recursive construction.

首先在比较了基本互连网络的基础上，看到超立体网络的杰出性能，包括网络直径小、寻路算法简单且为自寻路算法、容错能力好等等，但是由于其节点度随网络的规模的增加而按对数关系增长，使得超立体网络的应用规模受到极大限制，所以为了能最大限度利用超立体网络的优点的同时弥补其节点度方面的不足，作者提出了节点度等于常数4的FCCN网络结构，来最多地利用立方体网络的优点；然后在对FCCN网络进行严格的定义后，分析了网络的节点度、链路数、延伸特性、网络的直径（决定网络的最大通讯延迟）等，并提出了适于FCCN网络的简单的自寻路算法，计算自寻路算法可得到最短路径的比例，看到在多于82％以上的情况自寻路算法都是最优的，而且比例随网络层数的增加而增加；应用所提出的自寻路算法计算了可以更加准确反映网络通讯延迟的参数—网络平均节点距离，计算得到此参数与网络大小的立方根成正比，此比例关系在网络的规模在几千节点以内与对数关系的网络几乎一样；FCCN网络是一高度可扩展结构，这是因为FCCN的递归构成方式，使得网络在增加节点时其原有的拓扑结构可以保持不变，不需对网络进行重新设计，为网络的实用扩展提供了条件；理论分析得出FCCN网络是一种高度可扩展高性能网络的结论。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。