基于层面信息的路径优化

根据分层物体快速成型（LOM）中零件逐层累积的特点，从缩短加工时间、提高制件效率方面着手阐述了路径优化的必要性，针对LOM机的运动机理和软件数据结构，给出了扫描路径优化的原理，将图论中的便宜算法用于LOM机的扫描路径优化。     

一种求解资源受限工程调度问题的遗传算法

针对资源受限工程调度问题的特点，设计了一种改进的遗传算法，对算法的编码方式和解码规则，适值函数，遗传算法、初始种群的产生方法进行了详细的说明，利用被普遍应用的标准问题对该算法进行了大量的测试，分析了算法参数和问题参数对算法效果的影响，取得了令人满意的结果。     

知识库中精确知识的判定算法

研究了知识库中挖掘它所包含的精确知识的方法，给出知识库的相关概念及精确知识的定义，讨论了一种在所定义的知识库中提取并判定精确知识的算法．     

EQUILIBRIUM ALGORITHMS WITH NONMONOTONE LINE SEARCH TECHNIQUE FOR SOLVING THE TRAFFIC ASSIGNMENT PROBLEMS

This paper presents a unified bination algorithms （such as FrankWolfe problems. Global convergence results are framework of the nonmonotone convex comAlgorithm） for solving the traffic assignment established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the non- monotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.     

可变分区存储管理方式的模拟

论述了如何用C语言模拟可变分区存储管理方式的过程。形象地展示了操作系统中可变分区存储管理中采用的最佳适应算法的分配与回收过程，达到了理论与实践相联系的目的。     

Seismic 3D Prestack Time Migration on Parallel Computers

Ｓｅｉｓｍｉｃ３ＤＰｒｅｓｔａｃｋＴｉｍｅＭｉｇｒａｔｉｏｎｏｎＰａｒａｌｌｅｌＣｏｍｐｕｔｅｒｓ￥ＬｉｕＰｉｎｇ＆ＣｈｅｎＹｕｎｈｅ（ＷｕｈａｎＤｉｇｉｔａｌＥｎｇｉｎｅｅｒｉｎｇｉｎｓｔｉｔｕｔｅ，ＷｕｃｈａｎｇＰ．Ｏ．Ｂｏｘ７４２２３，Ｐ．Ｒ．...     

A Nonprecedence－based Query Schedule Algorithm on Heterogeneous Multiprocessor System

ＡＮｏｎｐｒｅｃｅｄｅｎｃｅ－ｂａｓｅｄＱｕｅｒｙＳｃｈｅｄｕｌｅＡｌｇｏｒｉｔｈｍｏｎＨｅｔｅｒｏｇｅｎｅｏｕｓＭｕｌｔｉｐｒｏｃｅｓｓｏｒＳｙｓｔｅｍ￥ＨｅＪｕｎ；ｂａｎｇＤｉｎｇｘｉｎｇ＆ＺｈｅｎｇＷｅｉｍｉｎ（ＤｅｐａｒｔｍｅｎｔｏｆＣｏｍｐ...     

系统结构模型分部的底层要素法

本文从系统的底层要素出发，提出并证明了底层要素存在性、底层要素后果集并集的完全性以及它们在同一部分的充分必要条件，由此导出了系统结构模型分部的算法，实际应用进一步说明了这一方法的有效性。     

一类自适应松弛算法的算法模型

对于一类自适应松弛算法,本文提出了一个算法模型。在一些通常的假定下,证明了该模型生成的序列的收敛性定理。     

The Young-Householder algorithm and the least squares multidimensional scaling of squared distances

It is shown that replacement of the zero diagonal elements of the symmetric data matrix of approximate squared distances by certain other quantities in the Young-Householder algorithm will yield a least squares fit to squared distances instead of to scalar products. Iterative algorithms for obtaining these replacement diagonal elements are described and relationships with the ELEGANT algorithm (de Leeuw 1975; Takane 1977) are discussed. In large residual situations a penalty function approach, motivated by the ELEGANT algorithm, is adopted. Empirical comparisons of the algorithms are given.An early version of this paper was presented at the Multidimensional Data Analysis Workshop, Pembroke College, Cambridge, July 1985. I want to thank Jan de Leeuw and Yoshio Takane for bringing the ELEGANT algorithm to my attention and for clarifying its rationale and notation. My thanks go also to Stephen du Toit for help with the ALSCAL computations reported in Section 7.