算法

Adaptive α-β filter algorithm was introduced, and then it was compared to ISR filter algorithm and Kalman filter algorithm, the mean square deviation of distance, position, speed and direction of these algorithms on the flight line was analyzed to discuss the specific use of the three filters in straight-line flight and about-ship straight-line flight.

介绍了一种改进的α-β滤波算法，然后将它和最小二乘滤波算法、卡尔曼滤波算法进行比较，对三种算法跟踪空中目标的直线飞行、改变航向的直线飞行两种情况的距离、方位、速度和航向等参数的均方差加以分析，证明了改进的。

First, we analyze the time complexity, space complexity and compression ratio of RFID data compression which uses traditional compression algorithm.

本文首先分析传统压缩算法在RFID数据上的应用，所需的时间复杂度，空间复杂度以及平均压缩效率；其次，分析改进型的压缩算法在RFID数据上的应用，所需的时间复杂度，空间复杂度以及平均压缩效率，通过对两种压缩算法的分析比较，体现改进压缩算法的有效性，并讨论小型企业和大型企业运用改进算法存储RFID数据的一些不同之处。

Three methods to build soft-sensor model of Radial Basis Function neural network (K-means clustering algorithm, mixed Genetic Algorithm, mixed hierarchical Genetic Algorithm) is investigated and verified in simulation.In the condition of setting hidden layer's node numbers, K-means clustering algorithm and mixed Genetic Algorithm can satisfy online prediction of component content.

研究了三种建立RBF网络软测量模型方法(K-均值聚类算法、混合遗传算法、混合递阶遗传算法)，并进行仿真试验验证。K-均值聚类算法与混合遗传算法在预先设定隐含层节点数的情况下能满足组分含量在线估计。

Dijkstra algorithm and matrix iterative algorithm are important algorithms of the shortest route problem.In order to find which of the two algorithms is more efficient,the two algorithms were discussed,and their program flows were introduced.

Dijkstra算法和矩阵迭代算法都是最短路径问题的经典算法，为了研究这2种算法的计算效率，介绍了2种算法的基本思路和程序流程；通过对时间复杂度、结果和时间的关系指标进行多次计算，表现2者之间的效率差异。

The correlation analysis and identification algorithm is used widely in engineering. The basic principle of the algorithm is discussed first. Then the Fibonacci sequence is introduced into the algorithm,and the variable step method based on the modified Fibonacci sequence is used to optimize the model parameters.

相关分析辨识算法在工程上是一种常用的参数辨识算法，文章在介绍该算法基本原理的基础上，将Fibonacci数列引入该算法，并在算法中采用基于修正的Fibonacci数列的变步长方法寻优模型参数。

Then the Fibonacci sequence is introduced into the algorithm,and the variable step method based on the modified Fibonacci sequence is used to optimize the model parameters.

相关分析辨识算法在工程上是一种常用的参数辨识算法，文章在介绍该算法基本原理的基础上，将Fibonacci数列引入该算法，并在算法中采用基于修正的Fibonacci数列的变步长方法寻优模型参数。

In this thesis, the theories and methods of GA are analyzed in detail , the trend of GA in recent times is briefly discussed. Because of the importance of image segmentation, two methods of color image segmentation based on GA are proposed. One is the surface of thresholds image segment method, the other is entropic threshold method. Two algorithms are realized through VC++ 6.0. After that, we compare the characteristics of two algorithms and prove that GA can be very well applied to solving image optimal problems.

本篇论文比较详细地论述了遗传算法的基本理论、方法，指出了算法的研究现状，由于图象分割的重要性，提出了两种基于遗传算法的彩色图象分割方法，即阈值曲面分割方法和最佳熵阈值分割方法，通过VC++6.0编程得到了实验验证，比较了两种算法的性能，证明遗传算法完全适用于图象的优化问题。

Constraint-based MiniCon algorithm is proposed. This algorithm adds a step of view selection. As a result, the problems of missing query rewritings and generating redundant query rewritings in traditional MiniCon algorithm in presence of domain constraints are solved, and the accuracy and completeness of the algorithm is ensured.

该算法在传统的MiniCon算法中增加了一步视图选择，解决了传统的MiniCon算法中丢失查询重写和生成冗余查询重写的问题，保证了算法的正确性和完备性，并给出了相应的算法分析和实例分析。

The double decomposition polygon clipping method is brought forward based on polygon trapezoidal decomposition. By analyzing its time complexity, the case it applicable to and its accuracy, it is pointed out that the new clipping method has a lower complexity than the old methods and does not make mistakes in the case SutherLand-Hodgman algorithm would.

在多边形梯形剖分的基础上提出了双剖分多边形裁剪算法，并对算法的时间复杂度、适用范围和处理的正确程度进行分析，指出该算法的时间复杂度低于以往算法，在处理非自交叉的多边形时结果正确，不存在类似SutherLand-Hodgman等算法处理出错的问题。

Simulated anneal and Tabu are extensively applied in the field, in which, Genetic Algorithms is most general one. In the former study of the optimizing for motor, people often focused on cross operator and variation operator, which was based on the G.A.

在以往的以遗传算法为优化设计主要算法的研究中，偏向于对交叉算子与变异算子进行改进以提高遗传算法的效率，即对遗传算法的本身进行改进，从而产生了很多种类的混合遗传算法。

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.

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