算法的

We improved the merit function in quasi-feasible interior point method and used the exponential function that is the more general function to prove the existence of one order optimality point in feasible problem. We discussed the inner and outer algorithms and made the convergence theorem.

在算法中改进了拟可行内点法中的值函数，使用指数形式的更一般函数，用此值函数证明了可行性问题的一阶最优性点的存在性，并通过对内部算法及外部算法的讨论得到了算法的收敛性定理。

Combined these several traditional optimal path algorithms and ant foraging behavior, a new algorithm was introduced, that was Ant Colony Algorithm.

在以上几种经典最优路径算法的基础上结合蚂蚁觅食行为引入新的算法——蚁群算法(Ant Colony Algorithm，ACA)。

This algorithm is written by the most fundamental genetic algorithm,benefit the beginner to know the structure of genetic algorithm

本算法采用最基本的遗传算法编写，有利于初学者掌握遗传算法的构成。

The Galerkin FEM equations are deduced in detail. And the property of convergence are discussed. The PICCG method is improved in which the merits of PICCG and ICCG method are combined.

详细推导了E-E-ψ法的Galerkin有限元方程，并讨论了其收敛过程，对PICCG算法作了改进，组合了PICCG法和ICCG算法的优点，称为PICCG算法。

To solve the problem, a pre-classification algorithm of measured data is introduced and a new algorithm is developed to divide unmeasured data into determinable and indeterminable data, using matrix projection algorithm.

采用已测数据预分类的方法，对其进行了修正。在此基础上，将矩阵投影算法引入到了未测数据分类中，提出了基于矩阵投影算法的未测数据分类算法。

Finally,it studies deeply inLayer Ⅲ(MP3),designs and achieves the MP3 algorithms of coding anddecoding.

最后，文章重点研究了MPEG-1音频标准中的第3层算法(MP3算法)，设计并实现了MP3算法的编码与解码。

Based on the minimum path error interpolation method, a new circular interpolation algorithm is proposed, which is of simplity, short run time and positive deviation.

基于最小偏差插补算法的基本思想，提出了一种新的圆弧插补递推算法，该方法算法简单、行速度快、具有正偏差特性。

This thesis analysis the design principles and security and studies the critical algorithm of element inverse in the AES. Also the thesis presents an implementation for AES upon the DSP and PC platforms.

本文分析了AES算法的设计原理与安全性，探讨了AES算法中关键性的求逆问题，在PC机和DSP上实现了AES算法。

Modifications to the conventional layer by layer optimization method make it possible to avoid computing Hessian Matrix and its inverse form, thus it can decrease computational complexity dramatically. Simulation results for some practical problems such as function approximation and XOR problem, have demonstrated improvements over classical back-propagation algorithm and conventional layer by layer optimization algorithm.

本文在传统逐层优化算法上的改进避免了反复计算 Hessian 矩阵及其逆矩阵，因而可以减少计算量，对一些应用问题，如函数逼近、异或等问题的仿真实验证实了新的算法比经典的 BP 算法以及现存的逐层优化算法的训练速度更快、可靠性更好。

Numerical experiments were conducted on real AVIRIS data to validate the effectiveness of the proposed algorithm. The detection results were compared with those detected by the classical RX algorithm and KRS which did not suppress the backguound information. The results show that the proposed algorithm has better detection performance, lower false alarm probability and lower computational complexity than other detection algorithms.

为了验证算法的有效性，利用真实的AVIRIS数据进行了实验研究，并与经典RX算法、未抑制背景的特征空间核RX算法的检测结果相比较，结果表明基于背景残差数据的检测算法具有良好的检测性能和较低的虚警，而且运算复杂度较低。

But we don't care about Battlegrounds.

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

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

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