算法

on the research of primary cable routing, an automated primary routing algorithm based on Dijkstra algorithm is put forward, which can generate automatically the primary radiate distribution planning graph of the area to be planned.b In the research of secondary cable routing, a heuristic search algorithm—production system reasoning of artificial intelligence is put forward in this paper to solve the problem of load allocation in outlet cables of main supply sources.

在初级布线的研究中，本文提出基于最短路Dijkstra算法的自动初级布线算法，该算法能对一个待规划的城区分片自动形成初步的城区辐射配电网规划图。

The threshold segmentation arithmetic is based on the histogram of infrared image. Combining with the local window way, the arithmetic realizes the result of division.

该算法是一种基于红外图像直方图的阈值分割算法，利用了直方图的凹凸性，再结合局部窗算法最终实现运动目标的分割。

Then, the sequence voltages of the slack bus is replaced, and finding the positive sequence power flow several times until convergence comes off. Compared with the three-phase Newton-Raphson method, the Jacobian matrix with the proposed algorithm is of much lower order. The computation of finding the negative sequence component from the coupling power is only division arithmetic.

本文算法中修正方程式的雅可比矩阵阶数同单相潮流算法相同，是传统三相潮流算法的1/3，而通过耦合功率求解负序分量的计算，仅仅是简单的除法运算，计算量远远小于高阶矩阵的处理，因而总体上，与传统方法相比，大大降低了计算量。

A new Weibull Stress arithmetic in which Gaussian point is as a calculation unit is proposed. It can get more accurate result than the arithmetic in which Element is as a calculation unit.

1本文提出了以高斯点为单位计算韦布尔应力的新算法，在相同的有限元网格划分情况下，该算法比目前国际上通用的以单元为单位计算韦布尔应力的算法计算精度更高。

This paper summarizes the background and advantage of data mining, as well as the significance of data mining in the scientific research management of colleges and universities firstly, and then discusses the theory of data mining, association rules and the ideas of main algorithm, analyzes the classic Apriori algorithm and its existing problems as well as the basic solutions. After that, this paper proposes Multi-Dimensional Apriori algorithm which is designed specially for the mining of this paper; Then describes the structure of scientific research data mining system, defines subject-oriented mining tasks, including: mining the data about research projects, mining the data about papers, mining the data about academic writings. The association mining process is implemented by programing, a number of stimulating association rules are found, interpreted and analyzed.

本文首先综述了数据挖掘的研究背景、意义以及数据挖掘技术在高校科研管理中的应用现状和意义，然后在对数据挖掘相关理论、关联规则思想及主要算法进行讨论，分析经典Apriori算法及其存在的问题、基本解决方案后，提出了适合本文挖掘的多维Apriori算法的设计方案，并应用于本文挖掘中；接着论文介绍了科研数据的关联挖掘系统的结构，确定了面向主题的挖掘任务，包括：科研项目信息的挖掘、论文信息的挖掘、学术专著信息的挖掘等；设计了关联规则的实施过程，并通过程序编码得以实现，获得了多条有启发性的关联规则，并对其进行了解释与分析。

Because of the local astringency of genetic algorithm, an improved recurrence search algorithm is presented based on the essential genetic algorithm.

针对遗传算法存在的局部收敛性，设计了一种循环搜索遗传算法，算法融入了保优策略和自适应调整等方法。

Hence we first propose a globally optimized random search algorithm and prove its asymptotic global convergence; then to improve its convergence velocity and reduce implementation complexity, we propose a practical sub-optimal random search algorithm and analyze its implementation complexity.

为此本文首先给出了一种用于OFDM符号估计的全局最优随机搜索方法，并证明了其渐进全局收敛特性；同时为了改进全局最优的随机搜索算法的收敛速度和实现复杂度，提出了一种可实现的次优的随机搜索算法，并结合实现分析了所提的次优随机算法的计算复杂度。

Chapter 9: We report a large quantity of numerical experiments of 13 different algebraic multigrid algorithms for solving the Poisson equation, anisotropic equation, equation with cross-derivative terms, general matrix problems with large off-diagonal positive entries, biharmonic equation, Toeplity matrix, elasticity systems, finite element discretization of the Laplacian and even 3D problems. Particular attention is focused on asymptotic convergence factors and CPU-time consumed. Numerical results for many different types of practical problems demonstrate the efficiency and robustness of the proposed algebraic multigrid methods.

第九章：在各种代数多重网格算法的基础上，进行了大量的数值试验，具体给出了十三种不同的代数多重网格方法求解泊松方程，各向异性方程，带混合导数项的方程，带有大的非对角正元素的一般矩阵问题，重调和方程，托普利兹矩阵，弹性力学方程组，拉普拉斯算子的有限元离散，甚至三维问题的较为丰富的数值结果，重点关注它们的渐近收敛因子和所需的CPU时间，来源于不同类型问题的计算结果既为代数多重网格理论分析和算法的改进提供了很实用的资料，同时也证实了本文给出的代数多重网格算法的效绩和稳健性。

The paper provides a discarding connection management algorithm, which discards the redundant connection by computation and ensures the maximal attainability of message simultaneously.

该解决方案由丢弃连接管理算法(discarding connection management algorithm，简称DCMA)实现，还给出了算法实例和对算法的讨论。

Combine the advantage of immune clone algorithm and imitate anneal algorithm, put forward task of a kind of reseau to attemper optimize model and algorithm.

结合免疫克隆算法和模拟退火算法的优点，提出了一种网格任务调度优化模型和算法。

For a big chunk of credit-card losses; the number of filings (and thus charge-off rates) would be rising again, whether

年美国个人破产法的一个改动使得破产登记急速下降，而后引起了信用卡大规模的亏损。

Eph. 4:23 And that you be renewed in the spirit of your mind

弗四23 而在你们心思的灵里得以更新