递归的

These constructional methods can be used to treat many problems, the numerical results show that the given interval extension has smaller excessive width relative to the range of the functions over a domain. For univariate differentiable functions, the definition of interval slope is extended from the first order to high order according to their differentiability, and iterative formula of high-order interval slope computation is also developed.

对多元函数，在不要求函数的可微性及有关Lipschitz常数的条件下，给出了分量函数区间展开的斜率算术运算规则；利用函数局部凸或凹的运算特点，通过递归计算建立了多元函数区间扩张的构造方法。

In section 3 and section 4, We obtain other Kirkman frames by giving weights to some types of GDDs with block size at least 4. Finally, through using recursive and"filling hole"constructions, we give a complete solution to the embedding problem of resolvable minimum coverings of pairs by triples.

在第三节与第四节中，我们利用已知的特别有用的一些Kirkman frames、再利用已知存在的区组长至少为4的可分组设计通过加权后构造出另一系列Kirkman frames，最后通过递归和填洞构造法，解决了λ=1时可分解最小覆盖三元系的嵌入问题。

If one makes some omissions in Chapter 4, for example, the proof of the theorem of Lindemann—Weierstrass, one is likely to have several weeks left after the completion of this material.

并且在讲授过程中可以不讲引言中有关递归定理的证明，第一章的有关自由群的小节，第二章和第三章的最后一节。

In Chapter two, Based on analysis some important methods of edge detection, a new detection approach via IIR exponential smoothing filter and nonlinear Laplacian operator is presented, which is suited to stereo vision. In order to implement the method and improve its practical value in application, a fast algorithm with structure recurred filter is developed.

第二章在总结分析了现有边缘检测技术的基础上，以立体视觉为应用背景，有目的的提出了一种基于IIR指数平滑滤波与非线性Laplacian算子的边缘检测方法，为了提高实用性，导出了一组递归滤波器方式的快速实现算法。

The problem of set partitions in combinatorial mathematics is conside-red, and the following three points are emphasized:(1) the non-recursivealgorithm for computing the number of partitions of an N-Set, P;(2)the algorithm for mapping the partition vector V to the partition sequencenumber D;(3) the algorithm for mapping the partition sequence number Dto the partition vector V.

本文对组合数学中的集合划分问题进行了一些探索，试图回答下面三个问题：①集合划分方法数P的非递归算法，②划分向量V映射到划分序号D的算法，③划分序号D映射到划分向量V的算法。本文以划分的构造树为基础，加以变换，得到数目树和分块树，由此求得P，以及K块划分方法数P_K。

Based on the above work, a method is presented for translating LFC function definitions into the intermediate representation, which includes analyses of recursive parameters and definition forms of functions, parameter substitution, representation translation of patterns and expressions, transformation of function definitions from incomplete construction forms to complete construction forms, and pattern-matching translation.

在此基础上，设计了LFC函数定义到中间表示形式的翻译和变换方法，包括对函数递归参数和定义形式的分析，参数一致化，模式和表达式表示形式的翻译，部分构造式到完全构造式的变换，和模式匹配翻译等。

Firstly,different control strategies for sensor management are modeled by the real language measure. The legal behavior of control strategy modeled by FSA can generate a partially ordered set of controlled languages. Then an identification method of the language measure parameters based on an FSA model is proposed. The language measure creates a total ordering on the performance of the controlled languages.

首先，建立传感器管理控制策略的有限状态自动机模型，通过对可控制事件的非使能设定，描述不同控制策略；提出语言测度参数的递归估计方法与停止规则，并根据有限状态自动机模型产生语言的测度获得各种传感器控制策略的性能指标。

The changing rule of the hardness of SZ-01 photosensitive resin surface after curing with temperature, illumination distance, and illumination time was studied with orthogonal experiment and recurrent neural network methods. A group of reasonable technique parameters were found with genetic algorithm optimization, which can make the hardness of photosensitive resin after curing the highest.

综合利用正交试验和递归神经网络的方法，研究了光敏树脂SZ-01在光固化成形后表面硬度随着环境温度、光照距离及光照时间的变化规律，并利用遗传优化设计的方法，找到了一组合理的工艺参数组合，使得光敏树脂固化后的表面硬度达到最大。

Different polynomial coefficient combination of amplitude changes is selected as the input signal to minimize the compensation error. A dynamic coefficient polynomial model is given with simplified coefficient estimation algorithm based on direct learning architecture.

动态系数多项式具有多组系数，随着输入信号幅度的变化，多项式选取不同的系数组合，从而降低非线性补偿的误差；文中讨论了动态系数多项式模型的构造方法，并且给出了基于直接学习结构的简化递归系数估计算法。

In this paper a recursion equation of butterfly FFT is represented according to which a program is given.

实际应用中全部点的FFT算法是冗余的，为解决少数点的FFT算法，文章导出了蝶形FFT的递归方程，给出实现少数点应用程序，进而提出直接多项式方法，较全部点迭代FFT算法具有更高的效

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 。