递归的

An increment feedback control law is then developed and proved to balance the pendulum-angle and drive the cart to track an arbitrary position without estimating the parameter uncertainties .

通过对系统输出的递归分解迭代设计，构成了扩展状态空间上的复杂非线性滑模，结合增量反馈控制，无需对系统不确定性的估计，可以稳定摆的倒立并将小车驱动到任意的距离。

Also asymptotic behavior of intermediate point of the error is studied and proved and, and the result is extended to Taylor's formula o...

然后研究了这种误差中的"中间点"的渐近性，给出了"中间点渐近性"的递归性的证明。本文并将讨论的结果推广到了多元Taylor公式。

Based on the existed method for interpreting line drawings, we put forward a kind of recursive method for computer interpretation of line drawings under orthographically axonometric projection. Our method can be used to interpret to the hidden-parts-drawn and the natural line drawings.

在已有基于点与平面的相对位置关系解释线框图研究成果的基础上，提出一种计算机递归解释线框图的方法，主要针对的是正轴测投影线框图的计算机解释。

Based on the correlative constraints between vertices and straight lines on a planar object, we have proposed a new recursive method for computer interpretation of linedrawings under orthographically axonometric projection.

在建立了相关约束关系式的基础上，提出一种基于点与直线的相对位置关系递归解释线框图的新方法，主要针对的是正轴测投影线框图的计算机解释。

We proposed the simplest structure of 2-D bilinear transformation digital circuit, we proposed four approaches of the realizations:(1) Realization of 2-D discrete domain difference equations;(2) 2-D FFT realization;(3) Digital hardware implementation;(4) by 2-D recursive digital structure to realize them.

在第七章，我们则重点研究了二维数字滤波器的实现问题。我们对第六章提出的2-D双线性变换电路又作了进一步的简化，获得了一种最简结构的二维双线性变换数字电路，该电路仅有二个延时器和一个乘法器。在第七章里，我们提出了二维跳耦型数字滤波器的四种实现方法：(1)二维时域差分方程实现；(2)二维FFT实现；(3)数字硬件实现，(4)用2-D递归数字结构实现。

In this paper,An algorithm on the generation and coding of all binary trees with a given number of nodes is proposed.

本文提出一个对给定的结点数，所有二叉树的生成和编码的详尽算法，该算法平均时间复杂度为O（nlog_2n），并给出了完整的采用回溯方法的高效非递归Pascal源程序。

As the algorithm for the evaluation of left - linear recursions, the algorithm we present here follows the magic-sets paradigm of a rewriting phase followed by semi -naive bottom-up evaluation.

和左线性递归计算算法一样，本文提供的算法遵循魔集的模式：首先改写规则，然后用半扑质的自底向上算法计算新规则。

An entropy-based complexity metrics is presented, and the complexity of entities, dependency relationships and business models can be calculated recursively by calculating the complexity of BMUs.

提出一种基于熵的复杂性度量方法，通过计算基本模型单元的复杂度递归得到实体、依赖关系及模型的复杂性。

It can retrieve a page of a site and follow all links recursively to retrieve all the site URLs.

它可以检索网页的网站，并按照各个环节递归检索的所有网站的网址。

Therefore, the paper proposes a new approach to analyze dependencies among recursive subprograms.

利用该文提供的方法可得到比较精确的递归子程序间的依赖关系。

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。