算法

The paper includes the constitutes of system hardware, image pretreatment, the achievement of parameter detection artithmetic. The main work is as follow: The pater makes use of vanguard genetic algorithms in image segmentation, uses vanguard genetic algorithms to get the image threshold. Using this method we may get different grey vehicles from the background exactly. Used the support vector machine theory to conduct the vehicles automatic sorting simulation research, the simulation result had proven this method could quite be accurate carries on the vehicles type the recognition; Improved based on the background automatic renewal hypothesized examination region algorithm, enhanced timeliness and the accuracy which the vehicles examines; And to has carried on the specify based on the hypothesized examination region imagery processing algorithm realization; In the paper also introduced withdraws the algorithm based on the gradation continuous movement vehicles characteristic to carry on the vehicles the characteristic to withdraw as well as to use the localization method which colored filter same gradation chart processing unifies to carry on the realization method which the vehicles license plate locates.

本文根据智能交通控制与仿真对于交通流量、车辆到达率、车辆速度等交通信息检测的需求，基于视频图像进行了交通信息处理的算法研究与实现，主要工作包括以下几个方面：将先锋遗传算法应用到图像阈值分割中，利用先锋遗传算法寻求全局最优阈值，可以比较准确的将图像中不同灰度的车辆从背景中分离出来；采用支持向量机理论进行了车辆自动分类的仿真研究，仿真结果证明该方法能够比较准确的将车辆的类型进行识别；改进了基于背景自动更新的虚拟检测区域算法，提高了车辆检测的实时性和准确性；并对基于虚拟检测区域的图像处理算法实现进行了详细说明；论文中还介绍了基于灰度连续性的运动车辆特征提取算法进行车辆的特征提取以及采用彩色过滤器同灰度图处理相结合的定位方法进行车辆牌照定位的实现方法。

The thesis also draw several conclusions as follows:(1) Orthogonal experiment design method can be viewed as a special case of genetic algorithm, i. e. a genetic algorithm with a fixed initial population, an oriented-mutation operator and one evolution epoch.(2) In terms of running steps, genetic algorithm is more complex than orthogonal experiment design method.

论文首次对正交试验设计法和遗传算法这两种独立发展起来的方法进行比较研究，提出(1)正交试验设计法是遗传算法的一种特例，即是一种初始种群固定的、只使用定向变异算子的、只进化一代的遗传算法；(2)遗传算法产生的优化解优于正交试验设计法产生的优化解，且遗传算法处理交互作用项的效率高于正交试验设计法；(3)遗传算法的步骤比正交试验设计法复杂，所需的试验次数也要多。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

In the system of anti-active-interference, we introduce the FBLMS algorithm which can overcome the drawback of exacerbation of the convergence properties in the domain of time due to eigenvalue spread of input signal correlation matrix and improve the processing rate because of the parallel properties of the FBLMS algorithm. After discussing the properties of the FBLMS algorithm and its developed algorithm, the paper presents the result of computer simulation and proves the reasonableness and feasibility of canceling the active interference in frequency agility fuse.

在捷变频引信抗有源干扰系统中，引入了频域自适应滤波算法FBLMS，可以克服输入信号相关矩阵特征值分散所导致的时域横向滤波算法收敛特性恶化的缺点，并且，由于算法的并行处理特性，大大提高了算法的实时处理性能，本文在分析了频域FBLMS算法的性能和改进算法后，给出了计算机模拟仿真结果，验证了对捷变频引信有源干扰抑制的合理性和可行性。

First, two preprocess algorithms are designed to decompose a communication request set into some continuous cyclic sequences. Then the permutation group is used to represent the ring network with fixed converters and an algorithm is proposed to classify the wavelength channels into some groups.Based on these on these ideas,a wavelength assignment algorithm is presented.For an optical ring with any fixed conversion mode,the algorithm can giv a good assignment scheme.

首先，提出了两个对环网上的请求集合预处理的算法，这两个算法可以将请求集合分解成一些连续的循环序列；然后，采用置换群来描述具有固定波长转换器的光环网，基于这种数学表示，提出了对环网上的波长信道进行分解的算法；基于这些算法，进一步提出了一个波长分配算法，该算法对于环形光网上的任意固定转换模式都能给出一个较好的波长分配方案。

Firstly, according to the difficulties in the optimization of chemical engineering and the intrinsic disadvantage of deterministic optimization algorithms, this work analyzed the importance and advantage of stochastic algorithms, and proposed some important aspects in research on them. Secondly, genetic algorithm was applied to two problems of data driven modeling, one of which was combination problem, the other was mixed integer nonlinear programming. Thirdly, systemic investigations were made on the basic structure, dynamic behavior and modifications of particle swarm optimization. Lastly, two kinds of proposed PSO algorithms were applied on calculation of phase equilibrium, which is nonconvex optimization.

本文首先根据化工优化中存在的困难和确定性优化算法内在的缺点，分析了随机优化算法的重要性，并提出研究随机优化算法应注意的问题；其次，将遗传算法应用于两个数据驱动建模问题，一为组合优化问题，一为混合整数优化问题；再次，从粒子群优化算法的基本结构、运动行为、改进方法做了系统的研究：最后，将提出的两种改进粒子群优化算法应用于相平衡计算问题，为非凸全局优化问题。

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数字签名的发展方向。

In chapter 2 we propose a linear equality constraint optimization question , the new algorithm is combined with the new conjugate gradient method(HS-DY conjugate gradient method)and Rosen"s gradient projection method , and has proven it"s convergence under the Wolfe line search.In chapter 3 we have combined a descent algorithm of constraint question with Rosen"s gradient projection, and proposed a linear equality constraint optimization question"s new algorithm, and proposed a combining algorithm about this algorithm, then we have proven their convergence under the Wolfe line search, and has performed the numerical experimentation.

在第三章中我们将无约束问题的一类下降算法与Rosen投影梯度法相结合，将其推广到线性等式约束最优化问题，提出了线性等式约束最优化问题的一类投影下降算法，并提出了基于这类算法的混合算法，在Wolfe线搜索下证明了这两类算法的收敛性，并通过数值试验验证了算法的有效性。

At the early iteratives, the mutation rate is bigger and the aim is to make particles to explore smaller and isolate region and to avoid the algorithm trapping to the local optimum. While the algorithm runs, the mutation rate will be decreased to reduce the disturbing to the particles. IPSO adopts a new method that congregates some neighboring individuals to form multiple sub-populations in order to lead particles to explore new search space. Additionally, our algorithm incorporates a mechanism with a simple and easy penalty function based on the largest distance between the particle and the boundary of the feasible region to handle constraint.

IPSO采用了一种新型的变异策略，变异概率随着算法的运行是动态变化的：在算法运行初期，变异概率大，其目的是使算法不但能够探测到目标空间中的孤立区域，而且避免搜索陷入局部极值；在算法运行后期，变异概率逐渐变小，以减少对粒子的扰动；算法通过将部分具有邻近距离的粒子聚集成核形成多子群引导种群中粒子的飞行；采用一个简单的基于粒子与可行域边界最远距离的罚函数处理约束的机制，使得算法高效实现。

By reviewing of the existing algorithms in CGE model, such as Scarf fixed point method, Newton-Raphson method, Tatonnement method, Johanson-Euler method, projected Lagrange method, genetic algorithm and simulated annealing algorithm, this paper expound each algorithm's principle and main problems, pointed out their respective strengths and weaknesses, and finally made a detailed comparative analysis.

本文通过对现有的求解算法进行综述，包括传统的Scarf不动点算法、牛顿迭代法、Tatonnement算法、Johanson-Euler法、投影拉格朗日算法，以及近期兴起的遗传算法和模拟退火算法，扼要说明它们的求解原理及存在的问题，指出各自的优缺点并作了详尽的比较分析与探讨，对于致力于推进CGE建模与仿真求解技术瓶颈突破的研究者们具体重要的参考意义。

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.

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