The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

A protocol for performance evaluation of line detection algorithms

Accurate and efficient vectorization of line drawings is essential for any higher level processing in document analysis and recognition systems. In spite of the prevalence of vectorization and line detection methods, no standard for their performance evaluation protocol exists. We propose a protocol for evaluating both straight and circular line extraction to help compare, select, improve, and even design line detection algorithms to be incorporated into line drawing recognition and understanding systems. The protocol involves both positive and negative sets of indices, at pixel and vector levels. Time efficiency is also included in the protocol. The protocol may be extended to handle lines of any shape as well as other classes of graphic objects.     

图象中心加权中值滤波的改进与应用

中心加权中值滤波具有较好的边缘保持特性及快速实现的特点，但滤噪能力低于其它中值滤波。此文探 讨对中心加权中值滤波的改进方法，提出了中心加权分级实现的思想，使之同时具有边缘保持、快速滤波和噪声去 除的理想效果。     

A Neural Network Model of Caenorhabditis Elegans: The Circuit of Touch Sensitivity

The paper presents a neural network model of the touch sensitivity circuit of the nematode Caenorhabditis elegans. We describe a serie of simulations in which neural networks are trained, using a genetic algorithm, to reproduce the habituation of the nematode's touch sensitive behavior. A lesion study of the network allows to make a direct comparison between the fine functioning of the model and the data collected in real organisms. The model accords well with the known neurobiological data and it suggests some hypotheses about the functioning of the neural circuit and of single neurons.     

LZW压缩算法解析及应用设计

ＬＺＷ压缩算法是一种无限压缩算法，它主要是用一种代码来表示数据流中出现的重复串，以达到压缩的目的。     

货郎担问题最优并行启发式算法

本文给出了满足三角不等式的货郎担问题的并行启发式算法，在ＳＩＭＤ ＣＲＥＶ ＰＲＡＭ并行机上该算法使用Ｏ（ｎ＾３／ｌｏｇ＾２ｎ）台处理器需Ｏ熄ｌｏｇ＾２ｎ）时间，这里ｎ是给定城市的个数，因而该并行算法是最优的。     

A Progressive Radiosity Algorithm for Scenes Containing Curved Surfaces

Based on the theory of light energy transfer between two differential diffuse surface areas, a generalized radiosity approach is presented. Unlike the conventional radiosity method, curved surfaces are subdivided into triangular surface patches, radiosity is assummed to be vary across each triangular surface patch. By adopting linear interpolation scheme over each triangular surface patch, we have established a complete set of approximated radiosity equations. Their unknowns are radiosities of differential surface areas located at all vertices of surface patches. The generalized radiosity equation has also been extended to non-diffuse environments. Theoretical analysis and experimental results demonstrate the great potential of this method,     

划分IC缺陷团的聚类算法

大量实验表明了在集成电路（IC）制造过程中形成中的缺陷团之间具有很强的相关性，然而现用于划分缺陷团的方法均忽略了缺陷之间的相关性。因此，得到了缺陷分布规律不能有效地反映缺陷在圆片上的分布，为了提高IC成品率和可靠性仿真和设计的精度，提高缺陷分布模型的准确性，该文提出了划分缺陷团的聚类算法，该方法依据缺陷形成的动力学基础，充分考虑了缺陷团之间的相关性，实验证明该算法用于划分IC的缺陷团是十分有效的。     

基于遗传算法的门限自回归模型在浅层地下水位预测中的应用

提出了建立门限自回归模型的一种简便通用的方法，用遗传算法可同时优化门限值和自回归系数．实例计算的结果说明了其可行性和有效性．该方法在各种工程时序预测中具有广泛的应用价值     

一种遗传-梯度混合算法

本文提出一种函数全局优化的遗传-梯度混合算法。该算法由选择、交叉和诱导变异算子组成。通过对自适应滤波和前向神经网络权值训练两个典型问题的数字仿真，表明该算法是一种快速有效的全局优化算法。