算法

One is tradition algorithm,which consists branch and bound method,improving loop method,cupidity algorithm,MST algorithm,MM algorithm,insertion method.Another is modern optimization algorithm which consists simulated annealing algorithm,artificial immune algorithm,genetic algorithm,ant colony algorithm,particle swarm optimization,Tabu Search,Hopfield neural network.The third is algorithm of DNA computing which is designed by authors.

第一种为传统算法，包括分支定界法、改良回路法、贪婪算法、MST算法、MM算法、插入法等；第二种为现代优化算法，包括模拟退火算法、人工免疫算法、遗传算法、蚁群算法、粒子群优化算法、禁忌搜索算法、Hopfield神经网络算法等；第三种为论文提出的DNA计算算法。

Furthermore, the first-order optimality condition and its equivalent reformulations for generalized semi-infinite max-min programming with a non-compact set are presented using the lower-Hadamard directional derivative and subdifferential.2. Chapter 3 studies the gradient-type methods for unconstrained optimization problems. Section 1 proposes a new class of three-term memory gradient methods. The global convergence property of the method is established. Furthermore, in order to improve the convergence property of the method, a new class of memory gradient projection methods is presented with the property that the whole sequence of iterates converges to a solution to the problem under the conditions such as pseudo-convexity and continuous differentiability of objective function. In section 2, two new classes of methods, called gradient-type method with perturbations and hybrid projection method with perturbations, are proposed. In these methods, non-monotone line search technique is employed, which makes them easily executed in computer.

第3章研究了无约束优化问题的梯度型算法，第1节提出了一类新的三项记忆梯度算法，讨论了算法的全局收敛性，进一步提出了一类新的具有更好收敛性质的记忆梯度投影算法，并证明了该算法在函数伪凸的情况下具有整体收敛性，第2节在非单调步长搜索下提出了带扰动项的梯度型算法及其混合投影算法，这两类算法的一个重要特征就是步长采用线搜索确定而不象许多文献中那样要求步长趋于零，这样更容易在计算机上实现，在较弱的条件下证明了这些算法的全局收敛性，数值算例表明了算法的有效性。

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法，而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点；给出了保证计算有界的一个充分条件，我们的条件大大弱于Mdrrill条件，我们的算法也可用来计算Eaves不动点；给出了集值非线性互补问题存在解的一个充分条件，此时可利用Leray-Schauder不动点算法来求解；向量标号算法以往是计算集值映射不动点的唯一有效算法，我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

After the concept lattice have been built, the way of building concept with incremental algorithms is more convenient than batch algorithms with various dataset updates.The efficient algorithm among batch construction has been suggested by Bordat which generates both the concept set and the Hasse diagram of the lattice.

批处理算法主要用于在数据量较小或给定的数据集上的概念格的建造；此类算法主要有：Bordat的算法，Chein的算法，Gantcr的算法，Nourine的算法等；增量算法除了能实现批处理算法的功能外，对一已建成概念格，但是概念格的形式背景是动态的数据，当数据变动时需要重新建格，此时增量算法是更有利的算法。

Finally, it analyses the time complexity of the algorithm and researches how it is influenced by culture operator.3、The paper presents the evaluation standard of the GA's application capability. Basing on characters such as continuity, multi-peak, vibration, randomicity as well as large-scale, five functions are selected to test search ability and robustcity of co-evolution algorithm. Finally, it analyses the simulation result and researches the influence of algorithm brought by culture operators.4、Basing on the concept of collection overcast, it researches the task distribution issue and constitutes delaminated math model on task distribution issue. It puts out the co-evolution algorithm of subtask's decomposing. The experiment compare IGA、SGA to CN and validates the efficiency of co-evolution algorithm on the NP completeness issue.5、Being aim at the optimization issue of load of antenna near ground, it combines many GA strategies and puts forward strategic meme. And it puts out co-evolution algorithm of load of antenna design. And it emulates the optimization design of load of antenna near ground. Finally, it valuates the co-evolution algorithm's efficiency on the continuum search issues of multi-variable and multi-peak value.6、Being aiming at the knowledge of image model matching, it adopts single meme and real code. It puts out fast co-evolution matching algorithm strategy. Basing on NPROD resemble measurement, I emulate the indiscrimination model matching and discrimination model matching. Finally, it valuates the co-evolution algorithm's efficiency on the real code and real time search issue.

分析了算法的时间复杂度，研究了文化算子对算法时间复杂度的影响。3、提出了GA的应用性能评价标准，从连续性、多峰性、随机性、振荡性、广域性多个角度出发选择五个测试函数，对共同进化算法的搜索性能和鲁棒性作了函数优化的性能测试，分析了仿真结果，研究了文化算子对算法的影响。4、基于集覆盖的概念，研究了MAS中的任务分配问题，建立了任务分配问题的分层数学模型，给出了子任务分解共同进化算法，实验比较了IGA、SGA、CN，验证了共同进化算法对NP完全问题的有效性。5、针对近地天线加载优化设计问题，结合多种改进GA策略，提出了策略型拟子，给出天线加载设计的共同进化算法，对有耗半空间对称偶极子天线加载优化设计作了仿真实验，验证了共同进化算法对多变量多峰连续搜索问题上的有效性。6、针对图像模板匹配问题的领域知识，采用单类拟子和实数编码，给出快速共同进化匹配算法策略，基于NPROD相似度测度，仿真试验了无差别和有差别模板匹配，验证了共同进化算法对实数编码和实时性搜索问题上的有效性。

As well, ACA outperforms GA in performance on average. 2. Through the analysis and studying of Ant colony algorithm and Flow shop scheduling problem, a construction graph is introduced. Two ant colony algorithms are proposed and analyzed for solving the flow shop scheduling problem with the objective of minimizing the flowtime. The Initialization of parameters and updating of trail intensities and probability is described respectively and a newly local search technique is proposed. Last is the experiment and the comparison shows that the PACA performs better than the FACA in the case of relatively large-sized problems than in the case of relatively small-sized problems.

通过对基本蚁群算法的实现过程和流水调度问题进行研究，给出了求解流水调度问题的解构造图，提出了两种蚁群算法来求解以总流程时间最小为目标的流水调度问题-FACA 蚁群算法和PACA 蚁群算法，分别给出了FACA 蚁群算法和PACA 蚁群算法的参数初始化方式、相对应的信息素更新方法和概率分布规则，并提出了局部搜索模式，最后进行模拟试验，对这两种算法进行比较，试验结果表明：对于较大规模的问题，PACA 蚁群算法要优于FACA 蚁群算法，而对于较小规模的问题，FACA 蚁群算法优于PACA蚁群算法。

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程序进行仿真、综合并实现。

After summarizing the waveform relaxation methods and domain decomposition, we finish some research on optimal Schwarz waveform relaxation algorithm as follows: In the first part, we apply Schwarz waveform relaxation methods on telegraph equation system to get optimal transmission conditions to speed up the algorithm.

在对波形松弛算法以及区域分解进行了综述性介绍后，本文对Schwarz波形松弛迭代算法具体进行了以下研究：首先，本文将在电报方程系统上应用Schwarz波形松弛迭代算法，通过强制加入新的局部传输条件分别给出了两种加速算法并通过定理保证了其优化后的收敛性，进而得到优化Schwarz波形松弛算法，然后通过数值试验对传统Schwarz波形松弛算法与优化Schwarz波形松弛算法进行了比较，研究了收敛率与优化系数的关系，找到了使算法最优的系数取值；最后得出优化后的Schwarz波形松弛算法优于常规Schwarz波形松弛算法的结论。

In this paper, a lot of research works of algorithms of mining CAD has been done. Many important mine specialty graph operation algorithms have been put forward. The main results are as follows: polygons cut out algorithm, two close polygons mutual, merge and subtract algorithm, polygon vector fill, any vector polygons area calculating and sequence polygons or multifold which has the direction and region area calculating, curve smoothing, graph element search for any region, graph element attrib collect in any region, parallel polygon or vector intersection-point push out or pull in, ore reserves and grade calculating for any type polygon, mine spatial data searching and boundary line tracking and automatic link algorithm etc.

论文在矿山图形算法研究方面做了大量的工作，提出了许多有价值的矿山专业图形运算算法，主要算法有：多边形裁剪算法、闭多边形的加、减、并算法、多边形的矢量填充算法、任意有向多边形、有向多连域、有向多边形序列面积算法、多种曲线光滑算法、任意区域的图元搜索算法、任意区域图元属性提取算法、多边形平行外推/内缩算法、任意多边形储量品位计算、矿山空间数据搜索算法、界线的自动追踪和连接等。

Moreover, A hybrid algorithm, ALHybrid, which is made of the algorithm LIDBSO and the algorithm AprioriIpv, is designed. Two algorithm, MQC_Apriori and MQC_LIDBSO, are given to mining multiple level quantitative association rules with item constrains. Two algorithm, PMARⅡ and PMARⅢ, which are based on different sequential mining algorithms, are given for parallelling mining association rules. In order to solve the mining association rules problem when we add a set of data to a database or delete a set of data from a database, two incremental updating algorithm, EUAR and EUAR, are given. Three incremental updating algorithm for association rules mining, DIUAⅠ, DIUAⅡ and DIUAⅢ, are dedigned to solve the three kinds of association rules incremental updating problem in distributed databases.

另外，文中还设计了一个算法LIDBSO与算法AprioriIpv相结合的混合采掘算法ALHybrid；对于多层次、带约束、多值属性关联规则的采掘问题，给出了两个采掘算法：算法MQC_Apriori和算法MQC_LIDBSO；在关联规则的并行采掘方面，还设计了两个基于不同顺序关联规则采掘算法的并行算法：算法PMARⅡ和算法PMARⅢ；在关联规则的增量式更新问题上，还给出了两个改进算法：算法EUAR和算法EUARˉ，分别用于解决当数据库增加或删除一个数据集合时的关联规则增量式更新问题；针对分布式数据库中的关联规则增量式更新的三类问题，提出了三个增量式更新算法：算法DIUA Ⅰ、算法DIUAⅡ和算法DIUAⅢ。

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.

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