算法的

The main contribution and valuable results of this dissertation can be listed as following:At the beginning, through analyzing the process of color image segmentation and comparing the results of "color image segmentation using fuzzy C-means and eigenspace projections" and "color image segmentation using histogram multithresholding and fusion",the advantages and drawbacks of these two methods are found.

本文研究的主要内容为：首先，对彩色图象分割过程进行分析，并对两种彩色图象分割算法即模糊c-均值和特征空间投影算法、直方图多阈值及融合算法的分割结果进行比较，从算法本身分析了其优缺点。

The method this paper discussed was based following theoretic analysis: Square and multiplication of large integer are two basic operations in modular exponential m_ary algorithm. The main operations of m_ary algorithm of point multiplication in elliptic curve encryption were doublings and point addition. The steps of m_ary algorithm in point multiplication was similar to modular exponential.

其基于以下理论分析：模幂m_ary算法的基本运算为大数乘法，其中包括大数平方算法和一般大数乘法；椭圆曲线加密算法中点乘的m_ary算法步骤与模幂的m_ary算法相同，后者的基本运算为倍乘和加法。

This paper studies QinJiuShao algorithm for fast computation of high-rank polynomial,analyses fast algorithm of modular exponentiation in RSA,and gives its implementation.

介绍了用于快速计算高次多项式值的"秦九韶算法"，并用类似思路分析了RSA算法中方幂模快速实现算法，最后给出了该算法的具体实现。

At the early iteratives, the mutation rate is bigger and the aim is to make particles to explore smaller and isolate region and to avoid the algorithm trapping to the local optimum. While the algorithm runs, the mutation rate will be decreased to reduce the disturbing to the particles. IPSO adopts a new method that congregates some neighboring individuals to form multiple sub-populations in order to lead particles to explore new search space. Additionally, our algorithm incorporates a mechanism with a simple and easy penalty function based on the largest distance between the particle and the boundary of the feasible region to handle constraint.

IPSO采用了一种新型的变异策略，变异概率随着算法的运行是动态变化的：在算法运行初期，变异概率大，其目的是使算法不但能够探测到目标空间中的孤立区域，而且避免搜索陷入局部极值；在算法运行后期，变异概率逐渐变小，以减少对粒子的扰动；算法通过将部分具有邻近距离的粒子聚集成核形成多子群引导种群中粒子的飞行；采用一个简单的基于粒子与可行域边界最远距离的罚函数处理约束的机制，使得算法高效实现。

Ant colony algorithm is a simulation of ant foraging behavior of heuristic process This paper introduces the concept of ant colony algorithm and its development trends, analysis of the basic principles of ant colony algorithm to establish a general mathematical model of ant colony algorithm, presented its typical application.

蚁群算法是一种模拟蚂蚁觅食过程行为的启发式算法，本文介绍了蚁群算法的概念及其发展趋势，分析了蚁群算法的基本原理，建立了一般的蚁群算法数学模型，提出了它的典型应用。

The using of the technologies of DOA in the orientation estimating of interference is discussed, then an evolutive ESPRIT algorithm is put forward which avoids the eigendecomposition and is easily achieved. To the MUSIC algorithm, an easy eigendecomposition algorithm for Hermitian matrix is presented. It breaks away form the complex matrix decomposition such as QR algorithm. Basing on the whole matrix, the algorithm makes use of the multiplication operation of matrix and vector, which attains simpleness and is fit for DSP. In the field of DOA estimating of correlation interferences, spatial smoothing algorithm consumes too many array units.

讨论了DOA技术在干扰源方位估计中的应用，提出了一种ESPRIT演变算法，该算法避开了特征值分解，实现简便；在MUSIC算法的实现中提出了一个Hermitian矩阵特征值分解算法，该算法摆脱了复杂矩阵分解，从矩阵整体出发，主要的运算是矩阵与矢量的乘运算，算法简单，非常适合DSP芯片实现；在相关源的DOA估计中，空间平滑技术使阵元的损失非常大，本文提出了一种进一步降低阵元消耗的平滑技术—随机空间增益法，其在运算量上的增加很小，但对于相干源的去相关确是有效的。

In the comparison experiments with genetic algorithm,immune genetic algorithm,basic particle swarm optimization algorithm and so on,IPSO performs well with best solution and fastest convergence speed.

在与遗传算法、免疫遗传算法、基本微粒群等算法的仿真比较试验中，该算法不仅搜索到了最好的近优解，而且收敛速度最快。

Association rules mining is a very active field in data mining and there are many algorithms today. In this field, the most classical algorithm is Apriori put forward by Agrawal et. al and it is used widely. The paper analyzes the advantages an disadvantages of Apriori, AprioriTid and AprioriHybrid algorithm in mining association rules. To solve the bottle of AprioriHybrid algorithm, a Support-Matrix method to rapidly verify the 2-frequent itemsets is put forward. To accelerate the speed of verify the k-frequent itemsets, a simple and highly efficient method of minimizing the trade database is given. All these two methods improve the efficiency of AprioriHybrid method.

关联规则挖掘是数据挖掘中一个非常活跃的领域，当前有许多种算法，最经典并被广泛使用的是Agrawal等人提出的Apriori算法及其衍生算法，本文分析了Apriori，AprioriTid和AprioriHybrid算法的优缺点，针对AprioriHybrid算法的瓶颈提出一种使用支持度矩阵对频繁2项集快速验证的方法，并给出一种简单易行，而又高效的逐步缩减交易数据库的方法，加快对候选频繁k项集的验证速度，从而提高了AprioriHybrid算法的效率。

The results of two inversion algorithms indicate that RAGA is superior to SGA. RAGA inversion is an applicable method for both of simple and complex velocity model.

二种算法的反演计算结果说明，加速遗传算法性能优于标准遗传算法，无论针对简单速度模型还是复杂速度模型，加速遗传算法都是适用的。

Riemannian Space. The parameter space in blind source separation is Riemannian Space. Natural gradient has many better characters compared with normal gradient.

自适应盲分离算法中的系数空间是黎曼空间，本文将自然梯度下降法应用于Infomax算法可以改进算法的性能，有利于算法的数值稳定性和提高算法的收敛速度。

But we don't care about Battlegrounds.

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

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

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