基本算法

The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques.

全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。

This article introduces three kinds of line cliping algorithms from the basic algorithm philosophy, the algorithm description,the algorithm steps and so on. Then it used the VC programming to realize these three algorithms on the basis of analysing the characteristics and the performance of three algorithms .

本文从算法基本思想、算法描述和算法步骤等方面介绍了三种直线段裁剪算法，在对三种算法的特点和性能进行分析的基础上，使用VC编程实现了这三种算法。

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位整数。

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.

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

Analysis on the Astringency of a Hybrid-Domain Basis Function Based on Exponential Series Function;2. Research the Corn Production Efficiency of China Based on Malmquist Model and Astringency;3. The background of application of genetic algorithm to reservoir optimal operation and its astringency are introduced.

介绍了遗传算法在水库优化调度中的应用背景及算法的收敛性，讨论了水库优化调度中遗传算法的基本应用步骤以及存在的问题，给出了算法的各种改进方法，并对遗传算法的应用前景进行了展望。

Ant colony algorithm is a simulation of ant foraging behavior of heuristic process This paper introduces the concept of ant colony algorithm and its development trends, analysis of the basic principles of ant colony algorithm to establish a general mathematical model of ant colony algorithm, presented its typical application.

蚁群算法是一种模拟蚂蚁觅食过程行为的启发式算法，本文介绍了蚁群算法的概念及其发展趋势，分析了蚁群算法的基本原理，建立了一般的蚁群算法数学模型，提出了它的典型应用。

Based on the summarizing of the exiting algorithms of the texture mapping and antialiasing, this paper goes deeply into the basic theory and processing of texture mapping. The texture compress algorithm which can satisfy the need of the memory and time is given for the stochastic sampling in the inverse texture mapping; the geometry transformation in the texture mapping are discussed and the concepts of the unitary parametrization and the patch parametrization is proposed, some kinds of the unitary parametrization methods of parametric surfaces and the geometry transformation in the patch parametrization are also presented; in order to solve the aliasing in the parametrization of intermediate surface-sphere in two-part texture mapping, an area-preserving transformation is presented also; to improve the quality of the graph the aliasing in the texture mapping is analyzed from the aspect of signal process, and the modified summed-area tables algorithms is proposed; the distortion of the scanline conversion algorithms under perspective transformation is analyzed and the proper interpolation algorithm is presented so the aliasing problem of the polyhedral object after the unitary parametrization is efficiently solved.

本文在总结现有的纹理映射和反走样算法的基础上，深入研究了纹理映射的基本原理与过程，根据反向纹理映射对纹理随机采样的特殊要求，提出了一种可满足存储空间和寻址时间的纹理压缩存储算法；通过对纹理映射中几何变换理论的进一步深入探讨，提出了整体参数化和面片参数化的概念，并给出了参数化曲面的各种整体参数化方法和面片参数化的几何变换形式；针对现有的两步映射算法所存在的中间曲面—球面的参数化问题，提出一种等积映射方法，较好地实现了由非参数化面片拼接而成的多面体表面的纹理映射；从信号采样的角度深入分析了纹理映射中走样产生的原因，提出了改进的区域求和表算法，使图形生成的效果有所提高；还分析了一般的扫描线算法在透视变换中所存在的问题，提出了一种正确的插值算法，从而解决了整体参数化后多面体表面纹理映射的几何变形问题。

A Multi-Species Cooperative PSO algorithm is developed using the ideas of species dividing in the bionomical world. The algorithm is shown to have guaranteed convergence to the global optimum. Furthermore, the training strategies of RBF network structures and weights based on the MCPSO aigorithm is proposed. Simulation results show that the algorithm is effective in such fields as chaotic time-sequence forecasting, system identification, speech signal processing and etc.

在分析基本微粒群算法和协同微粒群算法特点的基础上，借鉴生态学中的种群划分思想，设计出一种多种群协同进化微粒群算法，并分析了该算法的收敛性能；在分析径向基函数神经网络结构的基础上，提出了基于多种群协同进化微粒群算法的径向基函数神经网络结构和权值优化设计策略，并在混沌序列预测、系统辨识、语音信号处理等应用仿真实验中验证了算法的有效性。

Hypercube has many advantages, such as smaller diameter, simple routing algorithm, many parallel paths between any two nodes, and fault-tolerance, on the other hand that the Hypercube nodal degree increased logarithmetically to the number of nodes has limited network population. So we propose a constant nodal degree hierarchical topology to remedy the weakness of Hypercube and take advantages of Hypercube most. Given the definition of FCCN we analyse the basic properties including nodal degree , number of links , extensibility and diameter (maximum network communication delay). Also we proposed a simple and self-routing algorithm applied in FCCN. Although the self-routing algorithm is not optimal, but at more than 82% case it can get the shortest path, and the percent is larger and larger increased with network levels. By the self-routing algorithm the internodal distance is calculated to evaluate the network communication delay more clearly. The average internal distance is in order of the cubic root of the network population that is almost same as logarithmetically relation in a few thousands. FCCN is a highly scalable network due to its recursive construction.

首先在比较了基本互连网络的基础上，看到超立体网络的杰出性能，包括网络直径小、寻路算法简单且为自寻路算法、容错能力好等等，但是由于其节点度随网络的规模的增加而按对数关系增长，使得超立体网络的应用规模受到极大限制，所以为了能最大限度利用超立体网络的优点的同时弥补其节点度方面的不足，作者提出了节点度等于常数4的FCCN网络结构，来最多地利用立方体网络的优点；然后在对FCCN网络进行严格的定义后，分析了网络的节点度、链路数、延伸特性、网络的直径（决定网络的最大通讯延迟）等，并提出了适于FCCN网络的简单的自寻路算法，计算自寻路算法可得到最短路径的比例，看到在多于82％以上的情况自寻路算法都是最优的，而且比例随网络层数的增加而增加；应用所提出的自寻路算法计算了可以更加准确反映网络通讯延迟的参数—网络平均节点距离，计算得到此参数与网络大小的立方根成正比，此比例关系在网络的规模在几千节点以内与对数关系的网络几乎一样；FCCN网络是一高度可扩展结构，这是因为FCCN的递归构成方式，使得网络在增加节点时其原有的拓扑结构可以保持不变，不需对网络进行重新设计，为网络的实用扩展提供了条件；理论分析得出FCCN网络是一种高度可扩展高性能网络的结论。

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 分解算法和在此基础上的嵌套分解算法进行了较为详尽的讨论和分析，以及与普通单纯形算法的比较等等。

Do you know, i need you to come back

你知道吗，我需要你回来

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

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