算法的

This approach not only inherits the advantages of absolute density based algorithms which can discover arbitrary shape clusters and are insensitive to noises , but also efficiently solves the following common problems: clustering results are very sensitive to the user-deflned parameters, reasonable parameters are hard to be determined, and high density clusters are contained fully in coterminous low density clusters. With this approach, incremental clustering can also be supported effectively by defining the affected sets and seed sets of the updating objects in this approach.

聚类算法的有效性问题主要表现在三个方面：其一，聚类算法大多要求用户输入一定的参数，例如希望产生的簇的数目，而这些参数通常难以确定，特别是针对高维空间中稀疏分布的实际应用数据集，用户几乎无法给出合适的算法参数，因此非专业用户需要与数据分析专家密切配合才能保证获得理想的聚类结果，导致算法的使用极为不便；其二，聚类结果对于输入的参数值过于敏感J，往往参数值的一些轻微变化却产生聚类结果的很大差异；其三，对于高维的实际应用数据集，其数据分布往往是稀疏的、杂乱的，很难为算法选择全局的参数进行准确的聚类分析，使得聚类的质量难以保证。

The disquisition brings forward three principle in combination arithmetic designing and combination arithmetic choice. There is currency, countability and less information redundancy. And the disquisition analyses the relation of them. The three principle is the dominant ideology in combination arithmetic designing.

组合算法的选择与应用组合算法评价依据复杂性选择应用本文提出了在组合算法设计和组合算法选择方面所应当遵循的三个原则，即通用性、可计算性和较少的信息冗余量，并初步分析了它们之间的相互关系。

Furthermore, a new algorithm based on Fourier-transform technique combining with different calculations is proposed, which is suitable to measure steps. The new algorithm overcomes the disadvantages of old one needing datum reference and plane of reference, increasing this algorithm's utility.

基於傅里叶变换的波长移相算法，提出了结合差分运算的适合於台阶测量的新算法，克服了已有算法中需要参考基凖和参考面的缺点，提高了算法的实用性。

CBFEC emphasizes direct correspondence of concepts in EC with its software architecture for ease of understanding and using; minimal coupling with specific problem structure for easy adaptation it to solve a large number of wholly different problems; interface-centered design for extendibility. To achieve those objects, the problem-solving method of EC is analyzed and the problem-solving procedure of EC is divided into three interactive aspects: population-based stochastic searching mechanism, problem specific information to implicitly guide the stochastic searching, and the observation and control of the computation procedure of EC. Then the key concepts of EC are identified in those three aspects; the normal implementations of those concepts are summarized; the interfaces represents those concepts in software are abstracted; the collaborations of components through those interfaces are designed. CBFEC is implemented on mainstream component software platform COM/DCOM (Component Object Model/Distributed COM from Microsoft), which includes interfaces definitions, commonly using EC components implemented those interfaces, such as Simply EA component, Steady State EA component, EA component, EA component, Population component, Tournament Selection component, Linear Ranking Selection component, Nonlinear Ranking Selection component, Random Number Generator component, etc, and the collaborations of those components through those interfaces.

具体的做法是把演化计算看作是基于组件的软件工程的一个应用领域：首先分析了演化计算求解问题的一般思路和方法，把演化计算问题求解过程分为："设计基于群体的随机搜索机制"、"研究问题的性质并以此隐含地定义算法的搜索方向"和"求解过程的观察与控制"三个部分；然后分别找出各个部分中的关键概念，总结这些概念现有的一般实现方法，抽取其本质，以此结合设计模式来定义组件软件的接口；通过分析演化计算各个概念之间的相互联系来设计组件软件间通过接口的进行交互的方式；最后还在目前一种主流组件软件开发平台COM／DCOM（微软提出的组件对象模型）的基础上实现了常用的演化计算组件，如简单演化算法组件、稳态演化算法组件、演化算法组件、演化算法组件、种群组件、锦标赛选择策略组件、线性排名选择策略组件、非线性排名选择策略组件、随机数发生器组件等等。

Since the B-spline is a locally supported function, the smoothing formula can be strictly limited in a neighborhood of each point. The smoothing surface defined by the smoothing formula has the same convexity as that of the original image. Secondly, the edge points are detected by either computing the local extremum points of the directional derivative or computing zero-crossing of the second-order directional derivative of the smoothing surface. Finally, an example of an edge detector is given.

针对反卷积视觉模型的病态性，增加了适当的约束，给出了基于低松弛迭代格式的快速自适应滤波算法，对于一个N×N输入图象，由于变换核的局部支撑性质以及低松弛迭代格式的引入，使得快速自适应滤波算法的计算复杂度降为象素个数N〓的线性量阶N〓，就最小二乘算法的复杂性而言，优于不动点迭代算法的O以及基于FFT的预处理共轭梯度算法的O。

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.

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

Aiming at these problems, an expectation maximum based MAP algorithm is proposed and the performance is analyzed. The proposed algorithm avoids large matrix operations by using the EM algorithm to decompose the MIMO channel estimation problem into a series of single input single output problems. Besides, a joint estimation is carried out over multiple OFDM symbols in order to enhance the data transmission efficiency and the estimative performance of the proposed algorithm.

该算法利用EM算法把多输入输出信道估计问题化简为一系列独立的单输入输出问题，避免了大规模矩阵运算，降低了MAP算法的计算复杂度；为进一步改善MAP算法的数据传输效率及其估计性能，可通过对多个连续的OFDM符号进行联合信道估计。

The theory and the implementation of the genetic algorithms are discussed in detail. The question on how to choose the crossover probability, the mutation probability, the scale of population and the numbers of the generation is discussed. Then, the mathematics model of the optimal design is established. Exerting the finite element of elastic base beam and using FORTRAN to write the GAFORTRAN program. The program includes the common genetic algorithms and the modified genetic algorithms.

详细介绍了遗传算法的理论和实现技术，探讨了交叉概率、变异概率、群体规模、进化代数等变量的选取问题，建立起了基于遗传算法的深基坑支护结构设计的优化模型，结合弹性地基梁有限元法，利用FORTRAN语言编制了GAFORTRAN优化程序，程序中包括普通遗传算法和改进遗传算法。

The reconstruction problem is ill-posed, so two optimal criterions, the least module and the smoothness criterion base on Tikhonov regularization technique, are introduced into reconstruction algorithm. Many regularization parameters choice strategies are investigated, and the TPA(Two—Parameter Algorithm) strategy which is based on the Morozov discrepancy principles, is implemented in two regularization reconstruction algorithms.Numerical experiment results show that the nonnegative and smoothness constraint condition can overcome the difficulty of iteration semiconvergent, preconditioned technique can improve convergence rate and reconstruction accuracy, smoothness regularization criterion can meliorate ill-posed problem of reconstruction and enhance iteration stability, and the TPA is an effective strategy of regularization parameters choice.

数值试验表明：在共轭梯度法中引入非负约束和光滑约束改善了迭代的"半收敛"性，非负约束保证了解的非负性，光滑约束抑制了重建解的振荡现象，约束算法的重建精度与无约束算法相比大幅度提高；在约束共轭梯度重建算法中引入预优技术，可以加快算法的收敛速度，提高迭代的稳定性和重建精度；引入光滑准则的正则化技术可以有效改善图像重建问题的不适定性，加快迭代的收敛速度，提高迭代的稳定性和图像重建质量，计算正则参数的TPA算法在闪光照相图像重建中是有效的。

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.

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