在算法上

At first, this article introduces the background and main methods of DoS attacks, and discusses the advantages and disadvantages of some traditional methods for traceback.

在对节点采样标记算法分析的基础上，设计出本文自己的反向节点采样标记算法，改进后的算法在性能与效率上有显著提高。

First, a new model, TSTG (Timed Symbolic Transition Graph) is presented along with its semantics theory. An algorithm deciding timed bisimulation is developed based upon the idea of symbolic bisimulations. Model checking algorithms has played an very important role in verifying systems.

在分析与验证算法的设计方面，在新的计算模型基础上，我们分析了实时传值进程间各种不同互模拟的特点以及判定方法；尤其针对时间互模拟，根据符号互模拟的思想，本文给出了一个时间符号迁移图上的判定算法并证明了算法的正确性。

Since any frequent itemset is a subset of a maximal frequent itemset (an itemset is maximal frequent if it has no superset that is frequent), this paper proposes the DMFI (Discovery of Maximal Frequent Itemsets) algorithm for mining all the maximal frequent itemsets from data sets. This algorithm searches the maximal frequent itemsets in data sets from both bottom-up and top-down directions in the meantime. This paper proposes an algorithm that evaluates the boundaries on the support and confidence of uncalculated itemsets by exploiting the information provided by the calculated itemsets.

本文在经典关联规则的基础上，提出了一系列扩展的关联规则开采算法：发现关联规则的难度体现在发现频繁项目集上，事实上最大频繁项目集（其所有的超集都为非频繁项目集的频繁项目集）的集合已经包含了所有的频繁项目集，本文提出一种发现最大频繁项目集的算法DMFI(Discovery Maximal Frequent Itemsets)，该算法采用自底向上和自顶向下相结合的搜索策略对数据空间进行有效的搜索。

In Chapter 2, we consider the error bound and the auxiliary problem algorithm for the generalized linear complementarity problem over a polyhedral cone: First, we give an absolute and a relative global error bound for GLCP and nondegenerate GLCP, respectively, and then we explore the properties of the solution set of the problem, based on which we establish another absolute and relative error bound for GLCP which is much exacter compared with the result above.

第二章主要研究了闭凸锥上广义线性互补问题的误差界及基于其上的一个求解GLCP的辅助问题算法：(1)给出了GLCP的全局绝对误差界和在有非退化解时的全局绝对误差界及其相对误差界；(2)对GLCP的解集结构进行了探讨，并利用得到的结果给出了GLCP的另一个全局绝对误差界和相对误差界估计；(3)我们提出了一个求解GLCP的辅助问题算法，并证明在适当条件下该算法具有全局收敛性。

On the base of the developments and the characteristics, a new commingled algorithm that is Probability Clonal Selection Particle Swarm Algorithm is put forward, and the application process of the commingled algorithm is presented after the commingled theory is analyzed.

接着，研究了算法的融合机理，并对各自的算法进行了改进，在改进的基础上，依据三种智能优化算法的特点，提出了一种新的融合算法，即概率克隆选择微粒群算法，并对其进行了理论分析，给出了融合算法的应用流程。

We first review the development of decomposition algorithm, discuss and analyze the basic D-W and Benders decomposition algorithm and nested algorithm based on them., and compare them with the normal simplex method.

本文首先对分解算法的发展过程及其主要算法进行了较为全面的回顾，并对基本的 D-W 分解算法，Benders 分解算法和在此基础上的嵌套分解算法进行了较为详尽的讨论和分析，以及与普通单纯形算法的比较等等。

Innovations and improvements in the algorithms are mainly included as: 1 The phonetic classification algorithm is applied into the Sinusoidal Model based coding scheme, the speech characteristics in Mandarin are utilized, so the coding rate of the vocoder is reduced, speech quality is maintained, and the flexibility in designing vocoders is improved.

在对算法的研究上，主要的创新和改进表现在以下几个方面： 1）将分类算法应用到其于正弦模型的编码算法中，并利用汉语的语言特点，使声码器总的码率得到降低，音质得到保持，同时使声码器设计上的灵活性得到提高。

For a variety of hybrid flexible flowshop process route of the problem of production scheduling, analysis of production process planning and shop scheduling system integration principle, set up the target model, by a simple genetic algorithm to improve, in the integrated model set up based on the algorithm research, put the post-evolutionary genetic algorithm and improved simulated annealing algorithm an organic combination of algorithm optimization mechanism to enable the integration and optimization of the structure complement each other to form a more efficient hybrid optimization algorithm, and to solve the problem.

针对混合柔性流水车间多种工艺路线的生产调度问题，分析了生产工艺计划与车间调度系统的集成原理，建立目标模型，通过将简单遗传算法加以改进，在建立集成模型的基础上，对算法进行研究，把进化后的遗传算法和改进的模拟退火算法有机结合，使算法优化机制融合和优化结构互补，形成较为高效的混合优化算法，并对问题进行求解。

Based on the split window method, the classification of the ground land cover types, and the given spectral emissivities range in thermal infrared bands for each ground class and the fact that the actual land surface temperatures are the same for all thermal bands of MODIS, the land surface temperature were determined by means of maximum correlation and least square fit.

因此，本文在地表温度遥感定量反演的局地分裂窗算法的基础上，依据MODIS的多个热红外通道，其中的任意两个通道组合，通过分裂窗算法得到的地表温度都应该相等这样一个事实，在对地物进行分类的基础上，给定地物的波段比辐射率的范围，借助于两组温度之间的最大相关和最小方差，通过迭代的方式得到地表温度和分裂窗算法所使用的MODIS热红外通道的波段比辐射率。

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，极大地减少了构网前对所有参加构网的离散点进行排序的工作量。此外，通过对凸包顶点数据进行分区管理，在搜寻凸包支撑线时，能预先确定出支撑点的范围，减少了搜索工作量，提高了三角网的合并速度。

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.

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