逼近

A human model using polynomial convolution surface is presented which is modeled by articulated skeletons convolved with some kernel function. The convolution surface and curve correspondence theorem under orthogonal projection is presented. The human contour is approximated with a convolution curve and 3D human pose can be estimated using a nonlinear optimization algorithm.

首先建立了一种新颖的多项式密度卷积曲面人体模型，该模型由连接体线骨架与某种卷积核卷积而成，整个曲面是一张连续曲面，调节多项式和半径参数可以让人体任意变形；给出了正交投影下卷积曲面和曲线对应的概念和相关定理，为二维的图像轮廓和三维人体模型之间建立对应关系；根据正交投影下卷积曲面与曲线对应定理，用卷积曲线去逼近人体的图像轮廓曲线，从而估计和恢复出三维人体运动姿态。

Based on the rule that all the coordinate value of the basic vector is integral in coordinate plane, an algorithm for approaching the reference vector in coordinate plane was drawn out, which is easy to be realized by arithmetic and rounding operation.

本文根据基本矢量在两相坐标平面的坐标都是整数的规律，总结得到了在两相坐标平面下对参考电压矢量进行逼近的算法，该算法只需要进行简单的四舍五入与加减运算，易于实现。

After briefly reviewing the classification and history of curve and surface modeling, we discuss the characters, applications and representative work on three types of geometric approximation. And we present a survey of the vertex correspondence problem and the vertex interpolation problem in 2D and 3D shape blending modeling and key frame animation.

作者简要回顾了曲线曲面造型的分类和发展历史，论述了曲线曲面造型中所遇到的三类几何逼近问题的特点、应用和代表性工作，并就用于二维和三维形状混合造型的几何插值方法从顶点对应和顶点插值两方面做了一个系统的综述。

We make use of them by multiple linear cryptanalysis method, present an algorithm and analyze its success rate theoretically.

结合多重线性密码分析的方法，利用这两个较好的线性逼近我们提出了相应的攻击算法，并从理论上分析了其成功率。

It got into shadows on the road, and lay cunningly on its back to trip him up.

那玩艺儿也钻进路上的影子里，狡猾地躺着，想绊他摔筋头，又一直跟在身后，而且越来越逼近了。

A projection method is used to smooth out start and end points of the ruling line sets. With predefined Euclidean 6 space distances, the problem of ruled surface approximation from line sets in Euclidean 3 space can be converted into a least square B-spline curve fitting issue in Euclidean 6 space.

利用"投影"光顺法对齐直母线段族首末端点，再通过定义欧氏6空间下的距离函数，将欧氏3空间下的直线族逼近直纹面问题转换成欧氏6空间下B样条曲线最小二乘拟合问题。

The method uses Cartesian grid for the majority of flow field with special treatment to cells cut by the solid boundary, thus not only retains the advantage of Cartesian grid's high solving speed, but also ensures the high precision near the boundary, which avoids the distortion coming from scalariform mesh with traditional difference method.

该方法在流场主要区域采用笛卡尔网格，而对与固体边界相交处的单元采用特殊的处理。这样既保留了笛卡尔网格求解速度快的优点，同时在边界处又保证了精度，避免了传统差分法处理该类问题需采用阶梯形网格逼近而导致的失真问题。

In Chapter 3, by using the technique of finite dimensional approximation of Seiberg-Wittentheory, the equivariant K-theory and some other methods, we study the problem of topologicalrestriction when there are smooth groups acting on Spin 4-manifolds such as the alternatinggroup A_5, cyclic group Z_6 and symmetric group S_3 with actions of odd type, consequently weimprove Furutas 10/8 theorem under the condition of group actions.

第三章运用Seiberg-Witten理论的有限维逼近技巧和等变K-理论等工具，研究了Spin 4-流形X上分别存在光滑交错群A_5、循环群Z_6和奇型三阶对称群S_3作用时，X的拓扑限制问题，在群作用下改进了Furuta的10／8定理。

In this chapter proposed the repetition iteration algorithm through the training sequence and its the corresponding array data-in repetition useenlarges the TD-SCDMA channel in the iteration step, may approach theoptimum result under the short data length, take the LMS algorithm asthe example simulation result indicated this method is feasible, mayeffectively improve the TD-SCDMA system smart antenna the performance.

本章中提出的重复迭代算法通过把TD-SCDMA信道中训练序列及其对应阵列输入数据重复使用加大迭代步数，可以在短的数据长度下逼近最佳结果，以LMS算法为例的仿真结果表明该方法是可行的，可以有效改善TD-SCDMA系统智能天线的性能。

A way of TOPSIS for multiple target decision is applied to space with matrix elements,and we can make comprehensive evaluation of information system according to the relative distance between evaluation index matrix and best solution matrix and worst solution matrix.

再将多目标决策中的逼近理想解法应用到以矩阵为元素的空间中，按照与理想解和负理想解的相对接近度去对信息系统作出综合评价。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。