基本算法

But these methods limited by the expense of computing fundamental matrices and trifocal tensors or of the nonlinear optimization involved in computing epipolar tangencies. Through the studies of the invariants of the single axis motions, computational theories have been developed in this thesis to provide practical solutions for the problem of structure and motion from fitting the corresponding points in the whole sequence to its conic locus or conics for short.

在最近的研究中，一些研究人员利用视觉几何的方法从非定标的图象中对单轴旋转运动进行分析，提出了利用基本矩阵和三焦距张量求解单轴旋转运动中的关键参数——旋转角度的算法，但是该算法需要计算一系列相邻2图象的基本矩阵和一系列相邻3图象的三焦距张量，由于每个基本矩阵的自由度为7，每个三焦距张量的自由度为18，导致算法参数数量非常之大。

The main content of this thesis includes six parts. First of all, it is a comprehensive systematic introduction about RSA algorithm including the present application situation and principle of RSA algorithm----producing big prime numbers and secret keys, the encryption arithmetic for information and the decryption for secret information, which establish the theory foundation for achieving concrete; secondly, it introduces some basic conception of RSA digital signature and theory of digital signature realizing process; thirdly, it introduces the basic principle of MD5 algorithm; fourthly, it states design and realization of RSA digital signature in detail. The main modules includes producing RSA secret keys, implementation of RSA encryption algorithm and decryption algorithm, producing message digest and realizing digital signature and verification by RSA; the fifth, it carries on testing entirely, analyzing and improving for this system;The sixth, it analyses the security of RSA digital signature and points out the development direction of RSA digital signature.

本文主要研究的内容包括：第一，对RSA算法进行了全面系统的介绍，包括RSA算法的应用现状和原理—大素数的产生、密钥对的产生、对明文的加密运算和密文的解密运算，为具体实现打下了理论基础；第二，介绍了RSA数字签名的一些基本概念和数字签名的理论实现过程；第三，对MD5算法基本原理的介绍；第四，详述了RSA数字签名的设计与实现，主要实现的模块包括RSA密钥的产生，RSA加密算法和解密算法的实现，消息摘要MD的生成以及利用RSA算法实现数字签名和签名的验证；第五，对该系统进行了整体的测试和分析改进；第六，分析了RSA数字签名的安全性，指出了RSA数字签名的发展方向。

The method this paper discussed was based following theoretic analysis: Square and multiplication of large integer are two basic operations in modular exponential m_ary algorithm. The main operations of m_ary algorithm of point multiplication in elliptic curve encryption were doublings and point addition. The steps of m_ary algorithm in point multiplication was similar to modular exponential.

其基于以下理论分析：模幂m_ary算法的基本运算为大数乘法，其中包括大数平方算法和一般大数乘法；椭圆曲线加密算法中点乘的m_ary算法步骤与模幂的m_ary算法相同，后者的基本运算为倍乘和加法。

The results show that the two kinds of basic ant colony algorithm have better performance than classical K-means algorithm and hierarchal clustering algorithm, the two kinds of extended algorithm have better performance than corresponding basic ant colony algorithm.

实验结果表明，两种基本蚁群算法的聚类效果优于经典的K_means算法和层次聚类算法；两种改进的算法又分别优于相应的基本蚁群算法，达到了算法改进的目的。

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分形压缩的数学基础是不动点定理与拼贴定理，本文根据基本的自动分形编码方法，建立数学模型对其进行推导，得到了用普通数学的极限理论解释分形编码的数学表达式，从而对由基本分形编码得到的解码图像中的像素点的值给出了确定的表达式。

Based on the existed theory of mareoids and fuzzy matroids, this thesis studies the closed regular fuzzy matroid and its fundamental sequence, the fuzzy base and its algorithm of closed fuzzy matroids, the fuzzy circuit and its algorithm of closed fuzzy matroids and so on. The main contributions of this thesis are as follows: 1 The necessary and sufficient condition of closed regular fuzzy matroid and a property of its fuzzy dual matroid are found by studying some properties of closed regular fuzzy matroid. 2 By studying some properties of fuzzt bases of closed fuzzy matroid, the necessary and sufficient condition of judging fuzzy bases of closed fuzzy matroids and some corollaries are found. In the end, an algorithm of obtaining a fuzzy base is given. 3 By studying some properties of fuzzt circuits of closed fuzzy matroid, some necessary and sufficient conditions of using its fundamental sequence to express fuzzy circuits are found. An algorithm of obtaining a fuzzy circuit is given. 4 By studying the fundamental sequence of closed regular fuzzy matroid, some necessary and sufficient conditions of fundamental sequence of closed regular fuzzy matroid are found.

本文在现有拟阵和模糊拟阵理论的基础上，研究了闭正规模糊拟阵及其基本序列，闭模糊拟阵的模糊基及算法、模糊圈及算法等内容，现分述如下： 1研究了闭正规模糊拟阵的一些性质，得到了闭正规模糊拟阵的充要条件及其模糊对偶拟阵的一个性质； 2研究了闭模糊拟阵模糊基的性质，找到了闭模糊拟阵模糊基的充要条件和几个推论，最后还给出了求模糊基的算法； 3研究了闭模糊拟阵模糊圈的性质，找到了用基本序列来表达模糊圈的几个充要条件，并给出了求模糊圈的算法； 4研究了闭正规模糊拟阵的基本序列，找到了闭正规模糊拟阵的基本序列的几个充要条件。

Firstly, the mapping of high level programming language to hardware description language is described, some principles of the conversion of algorithm to state machine are also proposed; Secondly, the basic raster graphics algorithms for drawing 2D primitives are introduced, including self-adaptive algorithm of singl...

首先讨论了高级语言描述到硬件描述语言的映射，提出了算法到算法状态机抽象的规律；然后，介绍了现有的基本图形生成算法，包括直线的自适应算法、三角形边相关扫描算法，宽直线线刷子算法及改进的圆形、椭圆的生成算法，同时讨论了加速算法的研究现状；接下来具体讨论了基本图形的硬件实现，给出了各算法的状态机流程图、接口定义和实现框架，并且从理论角度给出了二次曲线加速算法的证明；最后采用EDA工具对VHDL程序进行仿真、综合并实现。

Active attack cryptanalysis based and fully scalable FGS encryption algorithm Aimed to the weakness of the current selective encryption algorithms in the sense of cryptanalysis, we design a active spacial—temporal correlation attack scheme and propose a both encryption strategies on base-layer and enhancement-layer. Not only the general FGS stream encryption is dealt with but also the case of FGST (fine granularity sealable temporal) is also well addressed.

2基于主动攻击安全的充分可扩展FGS加密算法针对目前压缩视频流加密算法所经常采用的选择加密方法，通过进行主动时域、空域相关性攻击，指出该类算法存在的问题，包括对于FGS基本层单独加密的安全分析，然后设计实现了基本层和增强层同时加密的安全策略，为保证FGS充分可扩展功能，算法同时还支持细粒度时域可扩展编码FGST(fine granularity scalable temporal)的情况。

The genetic algorithm proposed in this paper is called pseudo parallel genetic algorithm, which is designed by author. This kind of search way improves the basic genetic algorithm.

本文用到的遗传算法是由作者自行设计的伪并行遗传算法，该算法是对基本遗传算法的改进，在收敛速度和全局搜索能力方面远远优于基本遗传算法。

Based on the analysis of basic characteristics and basic contents of Genetic Algorithm , some defects of GA will be pointed out.

在分析了遗传算法基本特征和基本研究内容的基础上，分析了遗传算法的基本缺陷，提出了遗传算法的几个改进方法。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。