算法

In this paper, a carrier frequency synchronization algorithm based on autocorrelation has been introduced and realized in FPGA firstly, especially the Cordic algorithm and its realization. Secondly, two symbol synchronization algorithm based on crosscorrelation and autocorrelation are introduced and implemented in FPGA, then the comparison between them is made in the view of realization. Besides, the methods of area diplex and pipelining are embodied in implementation scheme of FPGA.

本文首先介绍了一种基于自相关的载波频率同步算法，给出了它的FPGA实现方案，重点讲述了其中用到的Cordic算法及其实现；然后介绍了分别基于互相关和自相关的两种符号同步算法，给出了各自的FPGA实现方案，从实现的角度比较了两种算法的优缺点，并且在FPGA设计中体现了面积复用和流水线操作的设计思想。

Ant colony algorithm is a novel evolutionary algorithm originally designed for discrete optimization problem, and has good performance.

蚁群算法作为一种较新的随机性算法在离散组合领域取得了较好的效果，本文对这种算法进行了研究，并提出了一种改进的蚁群算法。

A novel hybrid algorithm, which combines predictor-corrector primal-dual interior point method and genetic algorithm, is presented for dynamic and static reactive optimization in this dissertation. The algorithm fully make use of the advantage of interior point method in solving successive optimization problem and the advantage of genetic algorithm in solving discrete optimization problem. The original problem is divided into three parts: total successive problem, discrete problem and successive problem.

结合内点法和遗传算法，本文提出了一种新颖的混合算法用于求解动、静态无功优化问题，算法充分利用了内点法易于求解连续优化问题和遗传算法易于求解离散优化问题的优势，将原优化问题分解为初步的连续优化问题、离散变量优化问题、连续变量优化问题这三个子问题分别求解。

The main contributions of this dissertation are In chapter 2, we propose a scientific visualization system modal which is based on large-format display technology and Client-Commware-Server structure. In chapter 3 and chapter 4, we accomplish two large-scale scientific visualization systems. In chapter 5 and chapter 6, we propose HFFT on hexagon and parallel dodecahedron domains, and reduce the computational complexity from O and O to O and O . Lastly, we propose a parallel HFFT on distributed memory computers.

本文的主要贡献如下：提出了使用大屏幕显示技术、适用于大规模科学计算可视化系统的Client-Commware-Server模型；实现了油藏数值模拟和分子模拟两个大规模科学计算的可视化系统；给出了二维三方向六边形区域、三维四方向十二面体区域上的HFFT算法，将变换的计算复杂度分别从直接计算的O和O量级降到了快速算法的O和O量级；最后，本文给出了一种基于分布式存储的并行HFFT算法，并对影响、提高并行算法的若干因素进行了分析。

Then, we study Rough Set Theory approach to KDD, develop two algorithms for deriving Reduct and propose the integration of domain knowledge into Rough Set Theory to mining multiple-level rules.

本文在分析了传统的关联规则挖掘算法的基础上，给出了几个挖掘算法和一个递增修正算法；提出了模糊关联规则的概念及其挖掘算法；研究了结合背景知识的多层次关联规则的挖掘方法。

The result shows that the method is effective in improving the computational convergence and overcoming the premature of simple genetic algorithm in some degree.

结果表明，自适应遗传算法在保持简单遗传算法优点的同时，有效地提高了算法的收敛性，并在一定程度上克服了简单遗传算法的早熟问题。

It is used to the process of fault identification and classification for fault diagnosis of a chemical reactor, the results show that the algorithm has the advantage of high parallel, high effective of computing, rapid convergence, robust and credibility of the identification result.

该算法作为一种高效的算法，可以对于不同领域的问题，通过方便的引入不同的判断准则，从而使本算法能够适应不同的问题要求。特别地，该算法可以广泛的应用于模式识别与聚类分析中。

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-均值和特征空间投影算法、直方图多阈值及融合算法的分割结果进行比较，从算法本身分析了其优缺点。

Consider both feature about streams encipher and elliptic curve encipher , encryption process would divided into two steps to carry out , brings up a fresher Triaxiality CA Stream Encipher Algorithms Use Ellipse Curve Cipher Key, analysed some significance natures about the fusion algorithm, and performanced the fusion algorithm.

结合二者的特点，将加密过程分为两个阶段进行，提出了一种新的加密算法—用椭圆曲线加密密钥的三维CA流加密算法；分析了该算法的一些重要性质，对该算法进行了实现工作。

For overlapping domain decomposition method, we prove the geometric convergence for continuous algorithm in the sense of energy norm by means of projection theory, analyze the convergence rate of the algorithm in detail. And we also discuss the discretization of the algorithm and its finite element implementation. Some numerical experiments are also given.

对重 叠型区域分解算法，利用投影理论，证明了连续型算法在能量模意义下的几何收敛性，详细地分析了算法的收敛速度，也讨论了算法的离散化及有限元处理，并给出了相应的数值实验。

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.

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