算法的

In this paper we propose an approach to augment the algorithm described before to improve their performance by defining the conditional probability distribution of different composition of continuous and discrete attributes, and implement these new modified algorithms in Weka. To reduce the storage complexity of the AODE algorithm, we used the selective ensemble method to modify it.

在本文中我们提出了通过有效地定义条件概率分布来改善基于朴素贝叶斯分类器的改进算法的性能的方法，并在Weka的框架下实现了我们提出的改进算法，同时考虑到AODE算法较高的空间复杂度，我们利用选择性集成的思想对AODE算法进行了改进，以降低其存储空间复杂度。

To overcome the premature of simple genetic algorithm, the calculating efficiency of SGA is improved by the following two ways; Firstly, in order to ensure convergence of algorithm and reduce influence factor of convergence, elitist selection and adapted crossover and mutation operator are adopted. Secondly, because this study deals with finding minimize volume of structure, to quicken convergence of this problem, in line with mechanics criterion the paper carry out mutation to some genes in chromosome according to variations of internal force. This will let algorithms to search answer with our hoping directions.

针对基本遗传算法存在早熟的问题，本文主要从两个方面进行了改进，首先为了保证算法的收敛和减少影响算法收敛因素，采用了最优保护策略和自适应的交叉和变异算子；其次，由于本文研究内容涉及求结构最小体积问题，为了加快此类问题的收敛速度，本文结合结构优化中的力学准则，对个体染色体中的某一段基因按照内力变化进行变异操作，使得算法按一定方向进行搜索最优解。

This paper is that dynamically demonstrates the six algorithms implementation auxiliary teaching software of the data structure It may adapt the different demand that the reader demands the algorithm data-in and the process execution control mode.

本论文是一个动态演示数据结构中六个算法执行过程的辅助教学软件，它可适应读者对算法的输入数据和过程执行的控制方式的不同需求，在计算机的屏幕上显示算法执行过程中，可以显现数据的逻辑结构或存储结构的变化状况或递归算法执行过程中栈的变化状况。

This paper is that dynamically demonstrates the six algorithms implementation auxiliary teaching software of the data structure It may adapt the different demand that the reader demands the algorithm data-in and the process execution control mode. During the demonstration of the algorithm implementation on the computer screen, it can appear the change status of the data logical organization or the memory structure change condition or the stack change condition in the recursion algorithm implementation.

本论文是一个动态演示数据结构中六个算法执行过程的辅助教学软件，它可适应读者对算法的输入数据和过程执行的控制方式的不同需求，在计算机的屏幕上显示算法执行过程中，可以显现数据的逻辑结构或存储结构的变化状况或递归算法执行过程中栈的变化状况。

Taking into account different network environments, this scheme uses default route in path setup procedure.

本文针对现有方案的不足，提出了三个方面的改进：(1)针对HAWAII路径更新算法的不足，设计了一种基于Default Route的路径更新算法DRB和它的增强算法，该算法在充分考虑各种网络环境的基础上，将default route用于HAWII的路径更新过程。

Encryption Algorithm simple description : DES is a block cipher algorithm, his 64 for a pair of data encryption Encryption algorithm principle :The password system may divide into 2 big kinds from the principle, namely single key password system and double key password system.

加密算法的简单描述：DES是一种分组加密算法，他以64位为分组对数据加密。加密算法的原理：密码体制从原理上可分为2大类，即单钥密码体制和双钥密码体制。

In the dissertation, a new quadratic architecture 2FBA was proposed. To minimize the area, we developed a deterministic array optimization algorithm. It, like simulated annealing algorithms, has the property of climbing out of local optimums.

本论文还提出了一个新的二次布图结构：2FBA，为了减小其布图面积，我们提出了一个确定性的阵列优化算法，此算法的结果和模拟退火算法的结果类似，具有绕开局部最优的能力，然而，它的计算时间比模拟退火算法少得多。

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设计中体现了面积复用和流水线操作的设计思想。

The enhancement comprises: key evolution algorithm, characterization factor matrix, and the key distribution and update algorithm.

提出了对分组加密算法的改进，主要包括密钥进化算法、特征因子子矩阵和密钥的分发与更新算法。

Based on constraint satisfaction,an entirely feasible scheduling is obtained by constraint propogation technology and heuristic repair method and is regarded as initial solution for tabu search algorithm.Current solution is optimized by neighborhood transformation on a critical path.The final optimizal solution is improved by adopting a global neighborhood swapping strategy.

该算法基于约束满足思想，通过约束传播技术和启发式修复算法，得到可行调度作为禁忌搜索算法的初始解；再进行关键路径上的邻域变换，优化当前解；并采用一种全局邻域交换策略，扩大搜索空间，改善优化结果。

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.

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