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的缺陷团是十分有效的。     

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

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

一种遗传-梯度混合算法

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

A NEW ALGORITHM FOR ADAPTIVE LATTICE FILTERAND ITS APPLICATION IN THE SPEECH LINEARPREDICTIVE SYNTHESIS

In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on a stage-by-stage basis is presented. Experimental results show that the algorithm has higher convergence rate and lower misadjustment as compared with the other algorithms. The LSP coefficients calculated by the algorithm have been used to carry out speech linear predictive synthesis, resulting in better results than PARCOR coefficients.     

热敏绘图仪驱动模块及曲线输出通用算法

热敏绘图仪驱动模块由状态诊断、表头输出、曲线输出三部分组成。曲线输出的核心是曲线输出通用算法,它分三步进行:超界判断,填充字节和线型处理。该算法能完成对离散值的曲线处理、线型变换和超界处理。它不仅适用于热敏绘图仪的曲线记录,也适用于曲线的屏幕显示。     

参考信号频率自调整的数字相敏检波器算法的研究

本文提出了一种不需要外接同频参考信号的数字相敏检波器算法。该算法首先提取计算机产生的参考信号与被测信号频率的差值，然后根据该差值调整参考信号的频率直到满足要求。本文还讨论了数字相敏检波器的幅频特性，仿真试验表明理论分析与实际结果是一致的。该算法可以用于同频参考信号不能获得时正弦信号的幅度和相位测量。     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.