算法的

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算法，并对影响、提高并行算法的若干因素进行了分析。

GA often uses C or Visual C++ to compile codes, so the program is not only long and cockamamie but also the efficiency is low and the velocity is slow. This paper uses software Matlab powerful calculating ability and many functions to compile programs, then encapsulate and link those programs to run without Matlab environment. At last use Visual C++ friendly alternate function to compile in-out interface.

针对遗传算法常用C或Visual C++编写源代码，程序庸长繁琐，效率不高，运行缓慢的特点，本文采用Matlab强大的数值计算能力和众多的库函数编写算法；然后封装和链接程序，使Matlab编写的算法能够完全脱离Matlab的编程环境；利用Visual C++良好的人机交互功能，用Visual C++编写算法的输入输出接口界面。

This paper introduced code theory and the common RS codec algorithm, the implementation of RS encoder, then detailedly analyse the decoder realization of BM algorithm and ME algorithm, then bring forward implementation and improvement of a pipeline structure errors and erasures correcting RS decoder on ME algorithm, compromise the decoder complexity and delay to reduce the complexity and raise the maximum operating frequency. Finite-field multipliers optimize codec circuit.

本文首先介绍了编码理论和常用的RS编译码算法，提出RS编码器实现方案，详细分析了译码器的ME算法和改进BM算法的实现，针对ME算法提出了一种流水线结构的纠删纠错RS译码器实现方案，在译码器复杂度和延时上作了折衷，降低了译码器的复杂度并提高了最高工作频率，利用有限域乘法器的特性对编译码电路进行优化。

By combining topological scan and definition of reasonable paths, the numbers of shortest path calculation is significantly reduced and improved versions of classical Dial's single-pass algorithm are presented. The efficiency of Dial's algorithm remains, while the definition of "reasonable paths" is improved.

算法将基于拓扑遍历的最短路算法与合理路径的选择相结合，有效减少了最短路的计算次数，提出了与经典Dial算法的单步法计算工作量相等的算法，改进了合理路径的定义并提高了计算精度。

After providing the genetic simulated annealing algorithm, the efficiency and accuracy of GSA algorithm is tested and compared.

在给出遗传模拟退火(genetic simulated annealing，简称 GSA)算法和算法各个参数的同时，对算法的性能和求解精度进行了测试。

RSSI-based location is a hotspot in nowadays. This paper presents RSSI-based triangle and centroid location algorithm and trilateration algorithm, and analyses the average positioning error produced by this two methods. Simulation experiments prove that triangle and centroid location algorithm can obviously improve the location accuracy compared to trilateration algorithm.

基于RSSI的定位技术是现阶段研究的热点，本文提出了基于RSSI的三角形质心定位算法和三边测量法，并对两种算法所产生的平均定位误差进行仿真分析，仿真结果表明基于RSSI的三角形质心定位算法比基于RSSI的三边测量定位算法的定位精度有较大提高。

The equal distance 3-improved-coverage number of beacon sending position is presented according the acreage of ROI.Then a simple method is put forward to calculate the coordinates of the sending positions in rectangular ROI.Aiming at the shortage of the existent sequence algorithm,when beacon moves according to the path and emits RF signals at every position,the ant colony algorithm is applied to the position sequence so as to get the beacon sending position.Further,in this algorithm the sensors could work out their position with trilateration.

根据ROI面积给出了等距三重优化覆盖此ROI所需要的信标发射位置数量计算方法；随后对矩形ROI提出了一种简单的信标发射位置确定方法；针对现有的遍历发射位置点的路径遍历算法的不足，提出了一种新的应用蚁群算法的信标发射位置点的遍历算法，并利用该算法对基于三边测量方法进行传感器节点定位。

And this paper also presents the klo-RANSAC technique,to extract rotational surface from the noise and the back ground data,which improves the performance and robustness greatly.

算法使用基于特征约束的klo-RANSAC（k-local-RANSAC）算法将特征点从自由曲面背景以及噪声中提取和分离，进一步提高了算法的收敛速度与健壮性。

After the basic theory of ACA is introduced,a multiprocessors scheduling policy based on an improved ant colony algorithm is proposed in this paper.

在介绍蚁群算法基本原理以及探讨该算法的缺陷基础上，针对多处理器任务调度问题，提出了一种基于改进型蚁群算法的调度策略。

Based on analyzing the algorithms of Delaunay triangulation creation in domestic and abroad, in view of the situation of building DTM and the need of realizing railway 3D visual design, a divide-and-conquer algorithm to build DTM is presented, the algorithm use square grids to manage disordered points, to form triangular meshes in grids, DTM can be obtained by merging the triangular meshes, so that the work of sorting of the disordered points before building DTM is reduced greatly; moreover, the algorithm utilize subarea to control the vertices of convex hull so that the range which support points locate in can be predefined when searching support points, the workload of searching support points can be reduced and the speed of merging two triangulations is raised.

在分析了国内外构建DTM算法的基础上，针对DTM算法的现状及铁路线路三维可视化设计的需要，创立了一种构建DTM的分治算法。算法引入方格网管理离散点数据，在格中构建三角网，然后再将这些三角网合并形成DTM，极大地减少了构网前对所有参加构网的离散点进行排序的工作量。此外，通过对凸包顶点数据进行分区管理，在搜寻凸包支撑线时，能预先确定出支撑点的范围，减少了搜索工作量，提高了三角网的合并速度。

But we don't care about Battlegrounds.

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

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

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