A practical minimum distance method for syntax error handling

We present a method for recovering from syntax errors encountered during parsing. The method provides a form of minimum distance repair, has linear time complexity, and is completely automatic. A formal method is presented for evaluating the performance of error recovery methods, based on global minimum-distance error correction. The minimum-distance error recovery method achieves a theoretically best performance on 80% of Pascal programs in the weighted Ripley-Druseikis collection. Comparisons of performance with other error recovery methods are given.     

区熔单晶硅生产操作指导专家系统

本文介绍区熔单晶硅生产操作指导专家系统。首先，系统实现了连续图象的自动变周期、定瞬间采样，并提出一种新的区域扩张增量图象处理算法．其次，叙述了知识的获取过程及类规则，提出分布的多库结构，并实现了不确定性推理．最后，开发了区熔单晶硅生产操作指导专家系统，实现了从数据和图象采集、处理、事实获取、推理到给出操作指导一体化。     

抗坏血酸对核乳胶性能的影响

文章介绍抗坏血酸对核乳胶灵敏度、灰雾密度及潜影衰退性能的影响，并与日本富士ＥＴ－７Ｂ型乳胶的潜影稳定性能在不同温度和相对湿度条件下作相应比较。     

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.     

局部剩余偏移与常速叠前偏移成像

如果需要将一个特定局部时空域中的地震反射波归位到它们的实际位置,则我们不必在整个时空域而只需在这个局部时空域对其进行偏移,同样能达到波场归位的目的。其差別仅是采用的速度不同而已.这样能大大地减小偏移的作用区域。采用这种局部偏移的方法进行常速叠前偏移结果的剩余速度偏移,可以完全消除叠前偏移剖面上由于速度变化引起的倾斜反射界面的错断现象。这样在进行叠前偏移时可采用较少的速度个数,减少叠前偏移的计算量。采用该方法作剩余速度偏移可以减少波场成像时的计算量,从而使得常速叠前偏移成为一种处理效果好、处理效率高的实用处理技术。     

Successive pattern classification based on test feature classifier and its application to defect image classification

A novel successive learning algorithm based on a Test Feature Classifier is proposed for efficient handling of sequentially provided training data. The fundamental characteristics of the successive learning are considered. In the learning, after recognition of a set of unknown data by a classifier, they are fed into the classifier in order to obtain a modified performance. An efficient algorithm is proposed for the incremental definition of prime tests which are irreducible combinations of features and capable of classifying training patterns into correct classes. Four strategies for addition of training patterns are investigated with respect to their precision and performance using real pattern data. A real-world problem of classification of defects on wafer images has been dealt with by the proposed classifier, obtaining excellent performance even through efficient addition strategies.     

长输管道建设物流管理新模式——物资配送

长输管道工程是以线路管道与沿途站场为主要内容的建设工程,其物资配送有着不同于一般物流管理的特点,点多线长,且交通不便.文章结合西南成品油管道建设工程的物资配送实践,总结出长输管道物资配送的类型,并从机构设置、计划编制、台账和报表管理等方面介绍了物资配送的管理内容及经验,实践证明,这种物资配送方法不但使业主的物资管理人员大为减少,而且使长输管道工程的物资供应更加及时有序.     

稀疏气泡流动的粒子跟踪测速技术研究

采用动态阈值技术实现了对气泡图像的正确分割，利用灰度加权方法提高了气泡颗粒的定位精度。根据稀疏气泡流动图像的特点，提出了一种新的基于相关的粒子跟踪测速算法（2-HPTV）。通过进行两时刻中围绕待研究气泡所取的两个小的诊断窗口的相关运算，成功实现了气泡颗粒的轨迹追踪。实验表明本文算法较传统的PIV技术在测速精度上有很大程度的提高，与4帧粒子跟踪测速算法相比，降低了对摄像机帧频的要求，具有较强的实用性。     

Some results on generalized residual entropy

Shannon’s entropy plays an important role in the context of information theory. Since this entropy is not applicable to a system which has survived for some units of time, the concept of residual entropy has been developed in the literature. Here we generalize the residual entropy by choosing a convex function ? with ?(1) = 0. In this paper, some orderings and aging properties have been defined in terms of the generalized residual entropy function and their properties have been studied. Quite a few results available in the literature have been generalized and some distributions (viz. uniform, exponential, Pareto, power series, finite range) have been characterized through the generalized residual entropy.     

On denoising and compression of DNA microarray images

We address the problems of noise and huge data sizes in microarray images. First, we propose a mixture model for describing the statistical and structural properties of microarray images. Then, based on the microarray image model, we present methods for denoising and for compressing microarray images. The denoising method is based on a variant of the translation-invariant wavelet transform. The compression method introduces the notion of approximate contexts (rather than traditional exact contexts) in modeling the symbol probabilities in a microarray image. This inexact context modeling approach is important in dealing with the noisy nature of microarray images. Using the proposed denoising and compression methods, we describe a near-lossless compression scheme suitable for microarray images. Results on both denoising and compression are included, which show the performance of the proposed methods. Further experiments using the results of the proposed near-lossless compression scheme in gene clustering using cell-cycle microarray data for S. cerevisiae showed a general improvement in the clustering performance, when compared with using the original data. This provides an indirect validation of the effectiveness of the proposed denoising method.