算法

The main contributions of this paper include,(1) introduces the backtracking mechanism into traditional GEP methods and proposing a new algorithm named GEP with backtracking strategy.(2) Proposes the concept of Backtracking Checkpoint and designing Geometric Proportion Increased Checkpoint Sequence and Accelerated Increased Checkpoint Sequence to restrict the backtracking process.(3) Extends the GEPBS algorithm by introducing a Retrogression Factor to control the percentage of backtracking.(4) Proves the effectiveness of the new algorithm by two extensive experiments, which show that new method increases the max fitness by 49.2

本文的主要工作包括：（1）在传统GEP算法中引入回溯机制，提出基于回溯策略的GEP算法（GEP with backtracking strategy ，GEPBS）；（2）提出回溯检查点概念，设计了等比递增检查点序列和加速递增检查点序列用于约束回溯过程；（3）扩充基于回溯的GEP算法，设计了退化因子，提出了按比例回溯策略（GEP with proportional backtracking strategy， GEPPBS）（4）通过两个实验验证了新算法的有效性，在相同条件下较传统算法的适应度最大提高了49.2％，成功率最高提高了4倍

Then this paper makes a deep analysis on the HWMP proposed in 802.11s, points out some defects in root selection and proactive tree generation and makes improvements as follows: it proposes a distributed root selection algorithm to improve the simple direct configuration of root in the draft; it also proposes a ETX-based proactive tree generation algorithm to improve the simple minimal spanning tree based on hop count in the draft.

接着本文选取802.11s草案中提出的HWMP协议进行了深入分析，指出了该协议在根节点选取算法和预先树生成算法中的不足，分别对其做出了改进：提出的分布式根节点选取算法对草案中简单的直接指定根节点做出了改进；提出的基于ETX路由权值的预先树生成算法对草案中简单的基于最小跳数的预先树生成算法做出了改进。

In this paper,an algorithm to find the initial solution of linear programming is provided.

本文给出了一个求解线性规划问题初始解的算法，该算法是将作者原算法稍加修改而成，与原算法配套组合，即构成一个完整的求解一般线性规划问题的强多项式算法。

The algorithm adopts classical bilinear interpolation algorithm in the area of image other than the edges;concurrently the stairway detection is further made according to the outcomes of Canny edge detection to sift out the horizontal and vertical edges which will not produce jaggies distortion;but in edge areas where severe jaggies distortion will occur when using classical algorithm,the stairway thinning-based interpolation algorithm is implemented.This interpolation algorithm keeps stairways from being enlarged when zooming out the image,hence the goal of reducing jaggies distortion is achieved.

该算法在图像的非边缘区域采用经典的双线性插值算法；同时根据Canny边缘检测的结果，进一步进行阶梯检测，滤除不会产生锯齿失真的竖直和水平边缘；而在使用经典算法会产生严重锯齿失真的边缘区域，运用基于阶梯细化的插值算法；该插值算法在放大图像的同时，抑制边缘中的阶梯被放大，从而达到减少锯齿失真的目的。

All the existing algorithms can be classified into three main methods: traveling wave location, single terminal location and two terminal location, the principle and application condition of each algorithm are presented and discussed.

根据各测距算法采用的原理不同，将现有的各种测距算法分为行波测距、单端测距和双端测距三类，然后逐类对各种算法的理论基础和应用条件上进行了分析、对比和讨论，并在此基础上总结得出了各测距算法的优点及存在的问题，指出了每种测距算法的适用范围和应用局限性。

Experiments indicate that,the arithmetic utilizing assistant matrix resolves the problem that even magic square can not figure out compared with Lauber arithmetic and De la Hire arithmetic,and can realize all even magic squares' resolution compared with using Greece Latina phalanx arithmetic.On the other hand,the arithmetic has sameness time complex degree and approving capability in figuring out odd magic square.

实验结果表明，利用辅助矩阵，该算法和劳伯利算法、哈利算法相比，解决了偶数阶魔方阵无法求解的问题，和利用希腊拉丁方阵算法相比，可实现全部偶数阶魔方阵的求解；另一方面，该算法在奇数阶魔方阵求解时具有相同时间复杂度和满意性能。

The main work and innovation1 In general , a image compression method has different effect to different image . Some are fit for image which has much high frequency . Some are fit for image which has much low frequency .This paper analysis the applicability of fractal algorithm . In this dissertation , an improved algorithum is given . The basic algorithum without eight change and the joint use of quantitative coding , The compression ratio and PSNR can be adjusted , and it can get more quickly speed of coding .2 To a group of exact fractal code , the decoding image can be any resolution .With this characteristic ,choose the proper domain block and range block,this paper get an algorithum which can get higher decoding PSNR and speed than the basic fractal algorithum.3 Give a new method to calculate the scale factor . The calculation of basic algorithum is complex and enormous . The factor of scale is an important variable of the basic algorithm. Now there are two methods to calculate the factor of scale .A new method was given to calculate the factor of scale. The calculation load and complexity are reduced by the new method. Compared with the basic algorithm , the method can reduce coding time.4 The basic fractal algorithum is based on the Collage theorem and contraction mapping theorem . A mathematic model based on basic fractal algorithum is given .

本文的主要工作及创新点主要包括以下几点：1一般情况下，一种图像压缩的方法对不同特点的图像，压缩效果会有所不同，本文利用分形压缩编码对不同特点的图像进行编码，分析了分形编码对不同图像的编码适用性，利用去掉8种变换的分形编码算法与简单的均匀量化编码方案相结合，得到了一种可以调节压缩比与解码质量的分形编码方案，该提高编码速度6倍以上。2分形编码的特点之一是分形解码的分辨率无关性，即对于一组分形编码可以将其解码到任意分辨率下，本文利用分形编码的这一特点，结合不同的量化编码方案，选择合适的定义域块与值域块及适当的编解码分辨率，得到了一种提高解码质量，编码速度提高12倍以上的加速算法。3比例因子是基本分形算法中的一个重要变量，目前有两种计算比例因子的方法，文中给出了一种新的求比例因子的方法，该方法简化了求比例因子的计算，从整体上减小了基本分形算法的计算量，简化了算法4分形压缩的数学基础是不动点定理与拼贴定理，本文根据基本的自动分形编码方法，建立数学模型对其进行推导，得到了用普通数学的极限理论解释分形编码的数学表达式，从而对由基本分形编码得到的解码图像中的像素点的值给出了确定的表达式。

There is mutual contradiction between direction estimation of user's signal and power allocation among all users in the beamforming algorithm. A twice game beamforming algorithm based on game theory is proposed to deal with it. Beamforming game algorithm mathematics model is constructed. During the first game, direction of signal and power allocation are mapped the game theory as "player", which are modeled as the problem of maximin function and obtain direction estimation first. Then during the second game, power allocations of different users are described as a multi-user game. Power updated algorithm is designed. The existence and uniqueness of the Nash equilibrium in the twice game beamforming algorithm based on game theory are proved by mathematics derivation.

摘要针对波束成形算法中，用户的信号方向估计值和用户之间的功率分配存在着相互矛盾，本文提出了一种基于博弈论的二次博弈波束成形算法，构建了波束成形博弈算法数学模型，首先在第一次博弈的时候，将波束成形算法中的信号方向和功率分配映射为博弈论数学模型中的"局中人"，将其建模为函数的极大极小值求解问题，先求解出信号方向；然后在第二次博弈的时候，将不同用户的功率分配过程描述为一个多用户的博弈过程，设计了功率分配更新算法，通过数学推导论证了纳什平衡点的存在性和唯一性。

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

In this thesis, it introduces the development, research and database of bioinformatics first, then some methods of alignment are described,such as dot matrix sequence comparison,dynamic programming algorithm for sequence global alignment,Smith-Waterman algorithm31ast algorithm,MUMmer,PatternHunter and so on.

本文对生物信息学的发展、研究内容、生物数据库做了简单的介绍，对序列比对的各种算法：点阵法、动态规划全局比对算法、Smith—Waterman算法、启发式Blast算法、MUMmer、PatternHunter算法等做了描述，并从运行速度和敏感性两个角度进行了比较。

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.

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