在算法上

A nerve net controller have been designed on the basis of the hardware design of the AC servo system and system model. The controller include two forward nerve net with three layers . One is designed to identify the AC servo system model and another is to control. The controller use special learning algorithm which to control system at the same time and improve its constringency pace through introducing new MFBP algorithm. The intelligent control algorithmic is programmed using C++ language after the controller have been designed .

在该交流伺服系统硬件设计和系统数学建模的基础上，设计了神经网络自适应控制器，这个控制器包括两个三层的前馈神经网络，一个神经网络用于非线性系统的辨识，另一个神经网络作为控制器，此控制器采取边学习边控制的工作方式，并采用一种新型的MFBP算法实现了控制算法的快速性，在控制器设计完成的基础上，利用C++语言具体实现智能控制算法的编写。

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编程实现了这三种算法。

The optimal models and algorithms for making up pairs and non-pairs locomotive turn-around diagram are given out. Specially, a more efficient way to consider both the optimum and the equilibrium of this problem is also presented as follows: at first formulate the network flow model of this problem and solve it by the method of the minimal cost flow and then use the labeling method to readjust the solution.

对成对和不成对机车周转图编制问题进行了探讨，给出了其最优配置的数学模型和算法；在此基础上，提出了把均衡性与最优化综合考虑的不成对机车周转图的改进算法——首先建立网络流模型用最小费用流算法求得问题的初始最优解，然后用标记法对该解进行调整，使其在最优的基础上达到均衡。

That is to utilize general MPI programming environment, program on the NHBL parallel computational model, analyze and predicate the running cost of program by using the cost function of this model, and analyze the scalability of program by using the time-scale scalability metric. Finally, we analyze the numeric algorithm example---matrix multiplication and the nonnumeric algorithm example---PSRS sorting on Dawning-1000 MPP and NHPCC-cluster NOW system by using the integrative method.

提出了将并行计算模型、算法、编程进行一体化的研究的方法，即利用通用的标准的MPI编程环境，将编程建立在NHBL并行计算模型上，并且利用该并行计算模型的评价函数进行分析、预测程序的运行代价，再利用时间比例的可扩放性分析方法来分析程序的可扩放性性能；最后我们用PSRS排序算法和矩阵乘法这两个典型的数值和非数值的算法，在曙光-1000并行机和NHPCC-Cluster工作站集群上进行了一体化的分析。

For regular topology surface, intermediate surface local texture mapping are used; for irregular topology surface, subdivision surface local texture mapping are used. So different topology surface using different texture mapping methods can solve the contradiction between texture effect and processing speed when they are dealt with by single method. The three judge conditions of texture distortion in the process of mapping onto the sphere surface are discussed and the exiting algorithms of mapping are analyzed, the new algorithms of mapping onto the sphere surface are presented. In order to enhance the realistic of graphics, a new function of wood texture is presented. OpenGL is also introduced in this papers and some realization examples of texture mapping based on OpenGL under the environment of VC++ and POV-RAY are presented in some chapters.

对于简单拓扑表面，利用改进的两步纹理映射，对于复杂拓扑表面利用新的面片分割算法，初步解决了颜色纹理中速度与走样之间的矛盾；通过对球面纹理时纹理不变形的三个判断条件的研究，分析了现在各种球面纹理映射算法，并在此基础上提出了一种基于等面积的半球面纹理映射算法，明显减少了球面纹理的纹理变形；针对现有的木纹纹理中，两种表示木纹的颜色差距表现出的颜色突变问题进行研究，提出对这两种颜色进行线性插值或二次插值，使生成的木纹纹理颜色更加连续，更加逼真；在VC++环境下，通过调用Open GL的图形库及在Pov-Ray软件环境下，实现了参数化纹理、球面纹理、凹凸纹理及木纹纹理等各种算法。

This article in by has in the foundation which the method studies, is easy in view of the standard genetic algorithms in the solution Vehicle Routing Problems to appear precociously, is easy to fall into the partial optimal solution shortcoming, makes the improvement to the traditional genetic algorithms, proposed the multi- populations genetic algorithms.

本文在已有方法研究的基础上，针对标准遗传算法在解决车辆路径问题上容易出现早熟，容易陷入局部最优解的缺点，对传统的遗传算法进行改进，提出了多种群遗传算法（Multiple_population Genetic Algorithms）。

ZhuWenyu implemented the above two algorithms on a PC, testing 3640471 with AKSalgorithm and 4295884871 with the first AKS-Bernstein algorithm in about 2478.94hours and 28.35 hours respectively. She concluded that it's almost impossible tojudge the primality of a given integer directly with AKS algorithm, and testifiedthat the first AKS-Bernstein algorithm improves the AKS algorithm, but it's notyet suitable for use in practice, either.

朱文余在微机同禧3206c/850上用C语言实现了AKS算法及上述改进，前一算法对3640471进行测试约需2478.94小时，而后者对4295884871进行测试约需28.35小时，从而指出在实际运用中直接利用AKS算法进行素性测定几乎不可能，而AKS-Bernstein第一算法比AKS算法有一些改进，但仍不实用。

Based on reduced method,a parallel partitioning algorithm for the system of fuzzy linear equations is proposed in this paper,which is applied in MIMD asynchronous communication model.

在简化方法的基础上，提出了在MIMD模型上采用异步通信模式求解模糊线性方程组的分布式并行分割算法，算法有效地平衡了负载，并分析了算法的时间复杂性和通信复杂性。

This article proposed one kind of improvement algorithm in this foundation, this algorithm has defined a filter balance factor formula, according to this formula, we readjustment filter balance factor value appropriately, through controlsling the LMS filter coefficient's freezing and the restoration, we solute echo puzzle perfectly; In the telephone condition examination algorithm aspect, in view of the busy signal examination algorithm which has has only been able to examine the busy signal, but cannot examine the dial tone, hang the staccato the deficiency, this article improves its algorithm to enable it to apply these aspects, make it can be better used in the actual system application.

本文在此基础上提出了一种改进算法，该算法定义了一个滤波器平衡因子的计算公式，根据此公式，适当调整滤波器平衡因子的阀值，通过控制LMS滤波器系数的冻结和恢复，很好的解决了回声的困扰；在话机状态检测算法方面，本文针对已有的忙音检测算法只能检测忙音，而不能检测拨号音、挂断音的不足之处，研究改进其算法使之能够应用到这些方面，更好的为实际系统的应用服务。

The double decomposition polygon clipping method is brought forward based on polygon trapezoidal decomposition. By analyzing its time complexity, the case it applicable to and its accuracy, it is pointed out that the new clipping method has a lower complexity than the old methods and does not make mistakes in the case SutherLand-Hodgman algorithm would.

在多边形梯形剖分的基础上提出了双剖分多边形裁剪算法，并对算法的时间复杂度、适用范围和处理的正确程度进行分析，指出该算法的时间复杂度低于以往算法，在处理非自交叉的多边形时结果正确，不存在类似SutherLand-Hodgman等算法处理出错的问题。

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.

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