递归

Many traditional compiler optimizations fall into this category: copy and constant propagation, redundant expression elimination, dead code elimination, peephole optimizations, function inlining, tail recursion elimination and so forth.

许多种传统的编译器优化方式都可以归结于这两种方法，比如说：copy and constant propagation（用常数取代程序中不变化的变量），冗余表达式消去，死代码消去，Peephole优化，Inline函数，尾部递归消去（展开在程序尾部的递归，减少堆栈消耗

Graph′s depth first search recursive algorithm and n-order Legendre polynomial recursive algorithm are to equivalent non-recursive algorithms.

利用该组规则将图的深度优先搜索和n阶勒让德多项式的递归算法转换成了等价的非递归算法。

As to the multiple classification algorithms of large size rule set, we introduce a algorithms named recursive flow classification and this algorithms use the linear buffer to implement recursive map.

接着本文介绍了应用于大规模规则库的快速分类算法的解决方案——递归流分类，该算法是一种利用线性存储区分块递归映射的算法。

We describe TML, a metalanguage intended for proof development and program design environments.

以此为基础，将递归定义和递归元程序设计机制融于一体。

We study the recursive structure of the twisted-cube connected network sufficiently, and prove that the twisted-cube connected network is an n regular graph with connectivity n: point out that the twisted-cube connected network is a cube-free network, which is an essential distinction with the hypercube and other variations of the hypercube; prove that the diameter of n dimensional twisted-cube connected network is [ (n+1)/2] , which is almost the half of hypercube's.

首先对其结构的递归性进行充分地研究，证明它是连通度为n的n正则图；指出扭立方体连接网络无立方体子图，这是扭立方体连接网络与超立方体及其其它变种的本质差别；证明了n维扭立方体连接网络的直径为[（n+1）/2]，它几乎是超立方体直径的一半；最后，给出超立方体及其变种的等价定义，并对它们的结构递归性、网络参数和拓扑性质等作了简单的分析、综合和比较。

As we know,Newton's interpolation polynomial is based on divided differences which can be calculated recursively by the divided-difference scheme while Thiele's interpolating continued fractions are grared towards determining a rational function which can also be calculated recursively by so-called inverse differences.

大家都知道，牛顿的插值多项式是基于均差的，可以递归出均差，而Thiele插值连分式是一个有理插值，也可以递归地计算，即所谓的逆。

This idea comes from the appearance of the curse of dimension in computational process, for example, in Markov decision processes, its not practical for improving policy computation using the general policy iteration or value iteration method.

当系统的计算出现维数灾难时，比如在Markov决策过程的求解问题中，如果系统的动作空间非常之大，那么利用一般的策略递归算法或值递归算法，来进行策略的改进计算是不实际的。

Methods to seek the result of the recursion equation are analyzed in the article, and the difference and application range of the methods are compared, then how to express algorithm complexity and its adjacent rank are analyzed.

分析了递归方程常用解法，比较了各个解法的区别及使用范围，并研究了如何表示递归方程对应的算法复杂度的渐进阶。

It is shown that two-component Wadati-Konno-Ichikawa equation, i.e. a generalization of the wellknown WKI equation is obtained from the motion of space curves in Euclidean geometry, and it is exactly a system for the graph of the curves when the curve motion is governed by the two-component modified Korteweg-de Vries flow. At the same time, a n-component generalization to the WKI equation is obtained. Also, starting from the motion of curves, mKdV and its symmetry recursion operator is exhibited explicitly; two- and n-component mKdV systems are obtained. It is shown that WKI systems are gauge equivalent to mKdV systems. The two-component WKI equation admits an infinity number of conservation laws and a recursion formula for the conserved densities is given by considering an eigenvalue problem together with introducing an appropriate transformation.

在二维和三维欧氏空间上，我们从空间曲线运动出发，推导出了mKdV方程以及它的用以生成高阶对称的递归算子；推导出了多元mKdV方程以及二元和多元WKI方程，并证明了WKI系统和mKdV系统的规范等价性；尔后，通过考虑特征值问题，并引入一个恰当变换，给出了二元WKI方程的用以计算无穷多守恒密度的递归公式，从而证明了二元WKI方程的守恒可积性；系统地分析了两种mKdV方程的Painleve性质，并分别给出了两种不同形式的二元和n元mKdV方程的共振点出现的规律。

Analysis of recursive algorithm, so that you understand the meaning and the process of recursion.

详细说明：递归算法的解析，让你了解递归的内涵和过程。

With Death guitarist Schuldiner adopting vocal duties, the band made a major impact on the scene.

随着死亡的吉他手Schuldiner接受主唱的职务，乐队在现实中树立了重要的影响。

But he could still end up breakfasting on Swiss-government issue muesli because all six are accused of nicking around 45 million pounds they should have paid to FIFA.

不过他最后仍有可能沦为瑞士政府&议事餐桌&上的一道早餐，因为这所有六个人都被指控把本应支付给国际足联的大约4500万英镑骗了个精光。