算法

Key words:the three dimensional contact problem with friction;nonlinearcomplementary;nonsmooth equations;generalized derivative;nonsmoothmethod;convergence analysis

给出了三维摩擦接触问题的一个非光滑混合不动点模型及算法，这种算法无须求导数，没有引进任何额外变量，并且可视为一种三维摩擦接触问题的迭代法，利用非光滑分析和不动点理论对算法做了分析，给出了算法的不动点理论背景及算法的理论分析，为模型解的存在性及算法收敛性提供分析依据，最后给出了相应的数值算例。

The using of the technologies of DOA in the orientation estimating of interference is discussed, then an evolutive ESPRIT algorithm is put forward which avoids the eigendecomposition and is easily achieved. To the MUSIC algorithm, an easy eigendecomposition algorithm for Hermitian matrix is presented. It breaks away form the complex matrix decomposition such as QR algorithm. Basing on the whole matrix, the algorithm makes use of the multiplication operation of matrix and vector, which attains simpleness and is fit for DSP. In the field of DOA estimating of correlation interferences, spatial smoothing algorithm consumes too many array units.

讨论了DOA技术在干扰源方位估计中的应用，提出了一种ESPRIT演变算法，该算法避开了特征值分解，实现简便；在MUSIC算法的实现中提出了一个Hermitian矩阵特征值分解算法，该算法摆脱了复杂矩阵分解，从矩阵整体出发，主要的运算是矩阵与矢量的乘运算，算法简单，非常适合DSP芯片实现；在相关源的DOA估计中，空间平滑技术使阵元的损失非常大，本文提出了一种进一步降低阵元消耗的平滑技术—随机空间增益法，其在运算量上的增加很小，但对于相干源的去相关确是有效的。

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算法和层次聚类算法；两种改进的算法又分别优于相应的基本蚁群算法，达到了算法改进的目的。

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.

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

The main results of this research are as follows:(1) A parallel algorithm for solving dense matrix linear equations on distributed-memory multi-computer is presented. Convergent velocity of this algorithm is better than parallel Jacobi method"s, and parallelism is better than Gauss-Seidel method"s. According to theoretical analysis, convergent conditions are given. Moreover numerical experiments indicate that results agree with theory.

主要完成了如下研究工作：(1)提出了一种求解系数矩阵为稠密矩阵的线性方程组的适合于MIMD分布式存储的并行迭代算法，该算法设计上兼取了Jacobi算法并行性好的优点和Gauss-Seidel算法收敛速度快的长处，并且在理论上给出了该算法成立的收敛性条件，并通过数值计算验证了此算法结果与理论相符合。

Furthermore, based on Two-term local quadrat variance algorithm, a scale decomposing method is pointed out. This thesis also evaluates the question that whether we can apply scale decomposing results into gully ordering results for getting gully ordering system keeping the same scale characteristics results.The primary works and contributions of this thesis are summarized as follows:1. Three term local strip lacuanrity algorithm (3TLSL)This thesis shows that the gliding algorithm of Lacunarity has several shortcomings, such as it can only focus on the current analysis window, and is easily influenced by some local irregular values.

更多。本文进行的主要研究工作如下：1、流域沟谷网络多尺度分析模式与算法研究首先，为解决空隙度的滑动框算法只考虑当前窗口、易受局部异常值影响的缺陷，本文提出了顾及邻域空间关系的3阶局部条形窗口空隙度(Three-term Local Strip Lacuanrity，3TLSL)算法，并以模拟沟谷网络为例，对比分析了3TLSL算法与滑动框算法的结果，研究结果显示，3TLSL算法在分析结果的精确性、可靠性、有效性等方面均有明显的提高。

An algorithm based on the square-root unscented Kalman filter is proposed for weight estimation of the neural network, which can overcome the BP algorithm's drawbacks of slow learning speed, high computational complexity and the likeliness to make the study fall into the local minimum points.

提出一种利用平方根无轨迹卡尔曼滤波进行神经网络权值估计的算法，该算法可以克服BP算法存在的学习速率缓慢、计算量大、容易使学习陷入局部极小等缺点以Mackey-Crass混沌时间序列作为神经网络输入，运用SR-UKF算法、UKF算法、BP算法仿真神经网络。

The paper analyses material transportation problem and give the solvable methods; analyses delivery vehicle route problem, and then construct its corresponding mathematical model and present a heuristic algorithm based on C—W algorithm; analyses the optimum scheduling problem of trucks, and then construct its corresponding mathematical model and put forward a new algorithm; analyses the Postal Transportation Problem which will perhaps be used in supply chain of manufacturing system, and then construct its corresponding mathematical model and present an approximation algorithm.

分析了制造系统供应链中供需平衡、供需不平衡、有转运等各种情况下的物资调运问题，给出了求解方法；分析了制造系统供应链配送作业中的配送车辆路线问题，建立了相应的数学模型，提出了一种基于C-W算法的启发式算法，该算法较好地解决了有时间约束的配送问题；分析了制造系统供应链中的货运卡车优化调度问题，建立了相应的数学模型，提出了一种基于表上作业法的求解算法；分析了制造系统供应链中有潜在利用价值的邮政运输方式问题，在详细描述了该问题的基础上，建立了相应的数学模型，提出了一种近似求解算法，该算法较好地解决了邮政运输方式这样的多种物流、多种运输方式，有严格时限和众多外部约束的特大型、复杂、并行的交连系统的计划调度问题。

Association rules mining is a very active field in data mining and there are many algorithms today. In this field, the most classical algorithm is Apriori put forward by Agrawal et. al and it is used widely. The paper analyzes the advantages an disadvantages of Apriori, AprioriTid and AprioriHybrid algorithm in mining association rules. To solve the bottle of AprioriHybrid algorithm, a Support-Matrix method to rapidly verify the 2-frequent itemsets is put forward. To accelerate the speed of verify the k-frequent itemsets, a simple and highly efficient method of minimizing the trade database is given. All these two methods improve the efficiency of AprioriHybrid method.

关联规则挖掘是数据挖掘中一个非常活跃的领域，当前有许多种算法，最经典并被广泛使用的是Agrawal等人提出的Apriori算法及其衍生算法，本文分析了Apriori，AprioriTid和AprioriHybrid算法的优缺点，针对AprioriHybrid算法的瓶颈提出一种使用支持度矩阵对频繁2项集快速验证的方法，并给出一种简单易行，而又高效的逐步缩减交易数据库的方法，加快对候选频繁k项集的验证速度，从而提高了AprioriHybrid算法的效率。

A fine-grained genetic algorithm based algorithm which is for the parameters optimization problem of agent model is proposed. The fine-grained genetic algorithm is used to solve the parameters optimization problem of agent model. As to the parameters optimization problem of the agents colony model, the first step is to define the concept of "the parameters mode of the combat agents colony" to describe the parameters of the combat agent colony model. Then the genetic algorithm is used to solve the optimization problem with the parameters mode of the combat agent colony model as the genetic individual. Besides the algorithm, the algorithm dispatch tactic is also considered. And the two level sequence dispatch tactic and the two level nesting dispatch tactic are put forward for those complex parameters optimization problem. At last, the model parameters optimization under antagonism codition is studied. The means to solve this problem is to translate it into a kind of antagonism problem, then use the competitive co-evolutionary genetic algorithms to solve it.

其中：提出了一种基于细粒度模型的作战智能体模型参数优化求解算法，用细粒度模型遗传算法求解作战智能体模型参数优化问题；提出了"作战智能体群体参数模式"的概念，对作战智能体群体模型参数进行形式化描述，再以作战智能体群体参数模式为遗传个体，应用遗传算法求解作战智能体群体模型参数的优化问题；研究了上述优化问题求解算法的调度策略，提出了分层模型参数优化算法的双层顺序调度策略和双层嵌套调度策略，解决复杂的模型参数优化问题；将对抗条件下作战模型参数的优化问题转化为一种对抗性问题，应用竞争性共同进化遗传算法，进行求解。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。