一阶

For the given endpoint interpolation conditions, a new approximation method of multidegree reduction is presented. Using Chebyshev polynomial approximation theory, the nearly best uniform approximation under the interpolation conditions of endpoints can be obtained.

对于给定的首末端点的各阶插值条件，给出了一种新的一次降多阶逼近算法，应用Chebyshev多项式逼近理论达到了满足端点插值条件下的近似最佳一致逼近。

A fast algorithm for calculating the inverse and Moore-Penrose inverse of the permutation factor circulant matrix is presented. Then, a fast algorithm for the product of the permutation factor circulant matrix is given. Finally, The least-square solutions of inverse problems and the optimal approximation problems for the permutation factor circulant matrix are discussed.

首先给出了一种求n阶置换因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法，然后给出了计算两n阶置换因子循环矩阵之乘积阵的一种快速算法，最后给出了其反问题的最小二乘解的存在性定理及它的一般表示，并证明了逼近矩阵的存在唯一性且给出它的具体表达式。

Finally the terminal rule of Genetic Algorithms has been proposed and the implementation of random number maker has been presented. Developed a genetic algorithms based system identification technique. Using this technique globally optimized models for linear and nonlinear system can be identified without the need of a differentiable cost function or linearly separable parameters.

然后提出了一种基于遗传算法的模型降阶方法，可一致地应用到连续系统和离散系统的模型降阶；最后提出了一种基于遗传算法的多目标通用控制器设计方法，可以满足不同的控制策略，而不是某一种特定的控制策略，计算机仿真结果充分验证了方法的正确性和有效性。

We construct an explicit finite difference approximation for the equation by using the equivalence relation between Riemann-Liouville fractional derivative and Grünwald-Letnikovmake fractional derivative.

再利用Riemann-Liouville分数阶导数与Grtinwald-Letnikov分数阶导数之间的等价关系，构造一显式有限差分近似，这一离散格式可以解释为一个随机游走模型，并且收敛于稳定的概率分布。

The objective of this study is aimed at the implementation of parallelized numerical quadrature routines. The algorithm we choose for numerical quadrature routines is the so called "Adaptive Romberg Tree integration scheme"(abbr."ARTint") proposed by Lin et. al.[1997]. This numerical quadrature scheme can arrange the function evaluation points adaptively in accordance with characteristic of the trend of variation in integrand function values. When the accuracy of the numerical quadrature value is requested to be increased, a newer and larger set of function evaluation points must be incurred. The main advantage of ARTint method is the inclusion of all function evaluation points used in previous stages. It is this feature of ARTint method that makes it a quadratue scheme with prominent computation efficiency.

本研究在探讨数值积分程式之平行化，所使用的演算法为林聪悟与林佳慧[1997]一书所提出的「Romberg树自动布点数值积分」架构，此一数值积分方法能以适应被积函数值变化情形方式自动安排积分点来进行数值求积计算，在提高阶数以获得更高精度积分值的过程中，此一方法只须再计算新增加积分点的函数值，搭配先前已计算过的函数值的重覆运用即可获得更精确的数值积分估计值，如此将能减少升阶过程中函数求值计算的次数，有效率地完成单重积分的数值计算。

In this paper,based on an improved orthogonal expansion in an clement , using the new idea of Ref.[3] ,a new error expression of n-degree Hermite finite element approximation to one-dimensional 4-degrec 2-point bounded problem and 2-degree ordinary differential problem, and then optimal order superconvergence for their first derivatives is obtained.

本文针对在改进的单元正交性估计的基础上，利用文[3]提出的新想法，得到一维四阶两点边值问题和二阶常微初值问题的n次赫米特有限元u_h∈C~1的新误差估计式，以及导数误差的最佳阶超收敛，并且两者有相同的超收敛结果。

A responder's rebid of the cheapest two of an unbid minor is artificial, forcing, and promising at least game-invitational strength opener's priorities over such a bid are: show three-card fit for responder's original suit, show four-card length in the unbid major, show a minimum with the cheapest other bid, show a maximum descriptively with anything else; responder's next bid is forcing unless it is two of his original suit, two notrump, or a raise to three of the major just bid by opener

a应叫者的二阶最便宜的未叫低花再叫为人为，逼叫，且保证至少有邀请成局的力量开叫者再叫的优先级为：以3张支持应叫者的第一次花色，叫出未叫高花保证4张，叫其它最便宜的花色为示弱，叫以上未提及花色为示强；应叫者的下一次叫品为逼叫，除非是二阶自己原花色、2NT、或三阶加叫开叫花色。

Firstly, an inverse eigenvalue problem for Jacobi matrices is presented: we could construct the Jacobi matrix T if we know the spectral data: the eigenvalues of T and the eigenvalues of T_1 and of T_2, where T_1 is different to the k × k leading principal submatrix of T only at the position, while T_2 is different to the × remain submatrix only at the (1, 1) position.

首先给出的是一类Jacobi阵的逆特征值问题，即给定三组实数：一组是Jacobi阵的n个特征值，一组是只修改了最后一个对角元的它的前k阶顺序主子阵的特征值，最后一组是修改了第一个对角元的后n—k阶余子阵的特征值，用这些给定的特征值来确定相应的Jacobi矩阵。

First,the determinant is regarded as a function of or- der n and denoted by D;Second,the determinant is expanded by row or by column,then the relation in both of Dand subdeterminants will be examined in details to set up certain a recursion,generally speaking,it must be a homogenous or a non homogenous recursion;fi- nally the coefficients of the general solution are found out with the aid.

给出了用递归关系方法求任意 n 阶行列式的值的一般方法：首先，把已知的 n 阶行列式看作为阶数 n 的一个函数，记为 D；其次，按行或按列展开这个行列式，并仔细观察存在于余子式及 D里的关系，建立关于 D的某一递归关系，此关系总为一个齐次的或非齐次的递归关系；最后，借助于 D(0)、D(1)和D(2)等求出递归关系的通解的系数。

They have several meters of paleosol developed on the top of overbank silt, suggesting that the abandonment of each terrace due to river incision occurs during the transition from glacial to interglacial climates and there may be a link between the production of terraces and glacial-interglacial climatic cycles. However, it is not every glacial-interglacial transition during the last 1,240ka that terrace can form and preserve.

黄河各阶地河漫滩顶部都有一层古土壤发育表明黄河下切形成阶地发生在古土壤开始发育的冰期向间冰期的过度阶段，但是并非1，240ka以来的每次冰期—间冰期的气候交替都能引起黄河下切形成阶地。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。