算法化

Firstly, it discusses the principle of adaptive interference chancellor, including broad band signal and narrow band signal; Secondly, it analysises one common algorithm used in adaptive interference chancellor, that is, LMS algorithm and its anamorphosis algorithm especially normalized LMS algorithm pointing out their relationship. After then, the paper talks about the structure and reality of canceling broad band noise in narrow band signal and narrow band noise in broad band signal and gives it's result simulation analyzing the factors affecting the power of the algorithm. In the last party, it gives the hardware design and assembly language software design using TMS32OC3 1, including the result of simulating.

首先，本文讨论了自适应干扰对消的原理，并对窄带信号和宽带信号两种进行了分别分析；然后本文对自适应干扰对消中常用的算法—LMS算法进行了分析，同时也讨论了LMS算法的变形算法，尤其是归一化LMS算法，并指出了这些算法的相同和不同之处；此后，本文讨论了窄带信号中的宽带干扰对消和宽带信号中的窄带干扰对消的结构及实现方法并给出了住址的结果，分析了影响干扰对消效果的因素；在论文的最后，给出了用TMS320C31实现窄带信号中的宽带干扰对消的硬件设计和汇编程序设计，以及汇编语言程序的结果，并就此结果与高级语言程序的结果作了比较。

Using the concept of Boolean functions and combinatorics theory comprehensively, we investigate the construction on annihilators of Boolean functions and the algebraic immunity of symmetric Boolean functions in cryptography:Firstly, we introduce two methods of constructing the annihilators of Boolean functions, Construction I makes annihilators based on the minor term expression of Boolean function, meanwhile we get a way to judge whether a Boolean function has low degree annihilators by feature matrix. In Construction II, we use the subfunctions to construct annihilators, we also apply Construction II to LILI-128 and Toyocrypt, and the attacking complexity is reduced greatly. We study the algebraic immunitiy of (5,1,3,12) rotation symmetric staturated best functions and a type of constructed functions, then we prove that a new class of functions are invariants of algebraic attacks, and this property is generalized in the end.Secondly, we present a construction on symmetric annihilators of symmetric Boolean functions.

本文主要利用布尔函数的相关概念并结合组合论的相关知识，对密码学中布尔函数的零化子构造问题以及对称布尔函数代数免疫性进行了研究，主要包括以下两方面的内容：首先，给出两种布尔函数零化子的构造方法，构造Ⅰ利用布尔函数的小项表示构造零化子，得到求布尔函数f代数次数≤d的零化子的算法，同时得到通过布尔函数的特征矩阵判断零化子的存在性：构造Ⅱ利用布尔函数退化后的子函数构造零化子，将此构造方法应用于LILI-128，Toyocrypt等流密码体制中，使得攻击的复杂度大大降低；通过研究(5，1，3，12)旋转对称饱和最优函数的代数免疫和一类构造函数的代数免疫，证明了一类函数为代数攻击不变量，并对此性质作了进一步推广。

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算法在闪光照相图像重建中是有效的。

According to disadvantage of AS that the speed low of convergentiss and easily entering the stagnation,improving the AS in some aspect by the way that importing pheromone windows that the value of pheromone cannot exceed the window,only deposit the pheromone on the edge that belongs to the iteration shortest solution path,releasing additional pheromone to the edge belongs to the so-far shortest solution path,judging the situation of convergent and to reinitialize pheromone,optimizing the solutions by local search procedure at the end of every iteration,modifying the transition probability by add some problem specific parameters and so on.

本文主要运用蚁群优化算法(Ant Colony Optimization，ACO)来求解VRP。针对蚁群算法收敛性比较差，易于停滞的缺陷，通过使用信息素窗口限制、信息素的最大最小值，只更新信息素迭代中最好解，增加了精英的蚂蚁，信息素重新初始化之前先判断出汇聚情况，在每次迭代过程中加入局部的搜索进行优化，在对蚁群算法进行了优化时考虑选择概率当中加入与问题的相关参数等措施，从而使蚁群算法的收敛性得到大大提高，避免了算法的停滞现象。

Then based on the analysis of running time of binary algorithm and its imroved variant, I present a parallel algorithm of scalar multiplication, and analyze the running time of that parallel algorithm.

通过分析二进制算法及作为其改进算法的2~T -ary算法、加减链算法的运行时间的影响因素，论文继而提出了将2~T -ary算法并行化的算法，并对该并行算法的运行时间进行了理论上的分析。

The method solves the limitation of converging to the local infinitesimal point in medical image segmentation,and adopts the initial algorithm to assure the initial searching scope of genetic algorithm which is better accommodable than standard genetic algorithm with fuzzy C-means clustering,speeding up the convergence of genetic algorithm.

该算法除了解决模糊C均值聚类算法在医学图像分割中容易陷入局部最优解的问题，而且采用的初值化算法比标准的遗传模糊C均值聚类算法能确定更合适的遗传算法的初始搜索范围，从而加速了遗传算法的收敛过程。

As a differential detection is used between the intercarrier, the proposed algorithm overcome the high sensitivity to timing error of conventional algorithm and is robust to multi-path. The effect of sample frequency offset can't be ignored in a continuous OFDM system of a large number of subcarriers. The estimation precision of the conventional algorithm is low and the realization is complex. A joint estimation of sample frequency offset and fine frequency offset based on difference operation is proposed. As averaging use a large number of samples in a maximum likelihood algorithm, the estimation precision is very high. The use of difference operation cancel the effect of carrier frequency offset, and the proposed sampling frequency estimation algorithm is robust to carrier frequency offset.

最后，本文对连续系统中的采样频率和载波频率精同步技术进行较为深入的研究，由于子载波数目大的连续OFDM传输系统中，采样频率偏差不可忽视，以往的采样频率估计方法精度低、实现复杂，因此本文提出了一种基于差分处理的采样频率偏差和精载波频率偏差联合估计算法，利用了最大似然算法进行采样频率偏差的估计，由于采用了差分处理方法，消除了载波频率偏差对采样频率偏差估计的影响，采用的最大似然算法对大量样点进行平均化处理，所以，相对以往算法，提出的联合算法估计精度高，而且采样频率偏差估计对载波频率偏差具有鲁棒性。

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 dendrogram sharpening has been applied to the cluster analysis to form the algorithm of cluster analysis with dendrogram sharpening.

聚类过程中，将树状锐化算法运用到层次聚类算法过程中形成了树状层次锐化聚类算法。

With this measure, a new method for calculating the minimum embedding segment dimension of a linear segment sequence is proposed. With this method, the MESD of the linear segment representation of a real financial time series is calculated.

该方法实现了对时间序列的基于基本变化形态的合理分割，保证转换后的每一个符号都能代表一个基本的、相对独立的变化模式，为最终挖掘结果的有效性和可视化提供保证；同时，针对数据挖掘数据量大，对算法的计算效率和在线性能要求高的特点，提出了一个实现时间序列分段线性化的增量式更新算法；并利用神经网络模糊聚类算法实现了完全数据驱动的在线聚类分析。

But we don't care about Battlegrounds.

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

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

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