算法

By use of the ergodic property of chaos movement and the inversion of genetic algorithm, a chaos genetic algorithm was proposed. Its basic principle lies in the small disturbance of which extent is adjusted during searching to child generation group using the chaos variable.

摘 要：利用混沌优化的遍历性和遗传算法优化的反演性，提出了混沌遗传算法，其基本思想是把混沌变量加载于遗传算法的变量群体中，利用混沌变量对子代群体进行微小扰动，随着搜索过程的进行逐渐调整扰动幅度。

From the ergodicity and the regularity of chaotic behavior,it is conclude that the algorithm has the asymptotical convergence property.

基于变分不等式的等价形式，构造了一种混沌搜索算法来直接求解变分不等式问题，根据混沌行为的遍历性和规则性，可以得到算法的渐进收敛性。数值试验结果表明，该算法是一个有效的方法

Emulation analysis makes clear as a result, as a result of compensatory Kaerman filter wave algorithm considered the impact of relevant observation error integratedly, accordingly, when flowing epoch number is more than 500 when, flowing precision of filter wave algorithm wants compensatory Kaerman the flowing algorithm of excel tradition.

仿真分析结果表明，由于补充卡尔曼滤波算法综合考虑了相关观测误差的影响，因此，当平滑历元数大于500时，补充卡尔曼滤波算法平滑精度要优于传统的平滑算法。

General esprit algorithm good time, the calculation algorithm is a subspace trouble, I changed some matrix algorithm.

一般的esprit算法好的时间比较大，在计算子空间是算法比较烦，我改了一些矩阵算法。

Some methods are discussed to speed up the K-MEANS clustering algorithm with Euclidean and Mahalanobis distance norm.

同时，归纳并整理了一整套基于欧氏距离和马氏距离的K均值快速算法，为了解决传统基于距离函数算法的样本顺序相关问题，提出了针对两类问题的顺序无关聚类算法。

The modular inverse operation by extended Euclidean algorithm and the binary extended Euclidean algorithm are analyzed, and the improved modular inverse operation by binary extended Euclidean algorithm is presented in this paper.

基于现有的求最大公因子的方法，分析利用扩展欧几里德求模逆的方法，以及二进制扩展欧几里德算法，提出了利用二进制扩展欧几里德算法求模逆的方法，给出了几种算法性能比较的测试环境和测试结果。

With the experimental data, operation time of contour extraction of binary image represented by rectangle NAM is 0.31 to 0.86 times of that of image represented by matrix, operation time of Euler number computing of binary rectangle NAM image is 0.11 to 0.63 times of that of the pattern algorithm, operation time of connected component labeling of binary image represented by rectangle NAM is 0.08 to 0.37 times of that of image represented by matrix, 0.05 to 0.12 times of that of image represented by quadtree.

实验数据表明，采用矩形NAM表示的二值图像轮廓提取算法的执行时间是矩阵表示的0.31至0.86；矩形NAM表示的欧拉数计算执行时间是模板算法的0.11至0.63；矩形NAM表示的连通区域标记算法执行时间是矩阵表示的0.08至0.37，四元树表示的0.05至0.12。

Its mathematical foundation has been studied, several normal forms have been introduced, the deduction methods of Star algorithm have been dealt with and the expansion theorem which attaches Star algorithm to Boolean difference ha...

文章较详细地陈述了在组合网络诊断方面的应用；通过典型例子介绍了求测试码的算法，并与流行的D算法、布尔差分法、ESP法等进行了比较。事实表明星算法具有某些优点。本文还指出了在网络其它方面应用的可能性。

In this paper, we will discuss how to improve the algorithms of the exponentiation calculation and the modular calculation to increase the calculating speed of RSA.

本文将讨论改进大数乘幂算法和取余算法，发提高RSA算法的运算速度。

Through analysing muddleheaded time alignment, build the network of the 3 make a present of before the layer that has many concealed node, be based on extensive to change a gender to consider to use lop algorithm to train, in node of concealed of part of the expunction on the foundation that assures to forecast precision in order to reduce network complexity, the overall situation that uses genetic algorithm to have searchs actor ability to train a network afresh, benefit appliance has algorithm of BP of the local ability that find actor to train this network again.

通过分析混沌时间序列，建立具有多个隐节点的3层前馈网络，基于泛化性考虑采用剪枝算法练习，在保证猜测精度的基础上消去部分隐节点以降低网络复杂性，利用遗传算法具有的全局寻优能力重新练习网络，利用具有局部寻优能力BP算法再次练习该网络。

But we don't care about Battlegrounds.

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

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

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