在算法上

Based on the former chapter, one method based on fundamental matrix and crossrate is proposed in this chapter to render novel image considering the character of fundamental and cross-rate invariant in the perspective project, which utilized the correspondence relationship between the given two images and projective invariant between images to render novel image.

该方法通过将基本矩阵的稳定性求解问题转化为一个有条件的极值求解问题，结合遗传算法良好的全局寻优特点，将该方法很好地引入到基本矩阵的求解中，并取得了良好的实验结果。（5）第五章在上一章的基础上，综合基本矩阵和透视投影中的交比不变性的特点，提出了一种基于基本矩阵和交比的生成新图象的方法，这种利用已知两幅图象之间存在的匹配关系和新图象和已知图象存在的透视不变量，来生成新图象。

In this paper, an golden section algorithm based on traditional BP algorithm is given out to improve velocity of convergence about network study.

在传统的BP算法基础上，采用黄金分割法改进网络学习收敛的速度，并运用于压缩机系统故障的诊断上，获得了满意效果。

The other is based on carefully arranged computation process to reduce communication of whole overlapped domain in one line of grid points.

之后，在仔细对其中的计算过程进行分析的基础上，给出一种只需要一条网格线上分量通信的实现算法，大大减少了通信量，且通信不随重叠度的增加而增加。

Secondly, it is not the same fractal diagram by the same codes of IFS to produce fractal diagram. The two graphs are extraordinary similar, but they are different in detail. The problem is researched and the algorithm which calculates the intersection points of two graphs created by the same coefficient of the IFS is proposed. The curve described changing of the intersection points number is drawn. The conclusion is that the curve fluctuates in the tiny range and is smooth when it is seen as a whole. In fact, the curve is a fractal curve.

其次，针对同一IFS迭代码两次迭代绘制得到的分形图并非完全相同这一问题展开研究，提出了IFS分形覆盖相交交点变化曲线的概念，给出了覆盖相交交点变化曲线的绘制算法，在此基础上进一步研究了分形覆盖相交交点变化曲线的变化率情况，得到了分形覆盖相交交点变化曲线宏观上比较光滑，但实际上小范围内异常波动的实验结果。

The S box was constituted with the multiplication inverse element affined transformation in GF(2) of all elements of limited field GF(28),with S box s nonlinear byte changed,ciphered text attained the ideal status of the even of difference and the linear of deviation,and increased the capability of the AES algorithm of anti beating the difference cipher of analysis and linear cipher of analysis.

S盒由有限域G F(28)上所有元素的乘法逆元及在域G F(2)上的仿射变换构成，经过S盒的非线性字节代换，密文的差分均匀性和线性偏差都达到较理想的状态，提高了A E S算法抗击差分密码分析及线性密码分析的能力。

The theoretical analysis and experimental results show that the result of the first one has bug error with optimal results, and the second one is superior to the former, and the third one is best, which can get the optimal result based on least upper bound of error probability.

证实了"基于最小错误概率上界特征提取"是目前可以用迭代算法完成的最好的特征提取，而"基于马氏距离特征提取"在错误概率上界上升很小的代价下，简化了计算量，也是一种可行的方法。

For the interpolation problems in which the nodes are on one or more algebraic manifolds, we pointed out the interpolation bases of the lowest degree w.r.t.a graded term order and gave a new algorithm. We also gave a estimation for the degree of the interpolation polynomial.

我们针对插值节点位于一个或几个代数流形上的插值问题，从理论上指出了插值问题在某一分次序下最低次的插值基并给出了新的算法，同时也对插值多项式的次数作了估计。

We mainly give a simple brief introduction to Morse theory and Morse function, and introduce a two-dimensional manifolds on the Morse-Smale complex.

在此基础上，提出了一种对二维流形上的Morse-Smale复形顶点进行优化从而达到优化四边形形状的算法。

Firstly got the sequence of the contour points with one pixel width of the image to be assembled.

首先求出待匹配图像单像素宽的轮廓曲线上像素点的坐标序列，然后利用轮廓上各点和与其相差六个点的像素点之间的位置关系及行列坐标差的平方代数和对轮廓进行表示，得到两轮廓曲线的表示序列后；接着采用寻找两轮廓表示序列的最长公共子序列的方法进行匹配，并在匹配过程中引入了"断点续配"的概念，有效提高了算法的容错性。

In this paper, the concept of multimedia digital watermark is introduced. The present state of this technology is summarized. The hypothesis test procedures of two different algorithms using DCT are analysed, and threshold choice problem is discussed. Computer simulation is done to confirm the conclusions made.

本文介绍了多媒体数字水印的概念，对当前的技术现状进行了简单的综述，重点研究了两种DCT 域上的数字水印算法的检测过程，在此基础上对两者的性能和特点进行了分析，并且进行了实验仿真验证。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。