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.     

二阶A型Cooper变换的增强型

对二阶Ａ型Ｃｏｏｐｅｒ变换进行增强，放宽可用性条件，并证明了其正确性，最后举例说明其应用。     

On the stability preserving property of the double bilinear transformation on a class of 2-D transfer functions

This paper addresses the BIBO (bounded-input bounded-output) stability of a class of discrete 2-D quarter-plane filters in the presence of nonessential singularities of the second kind (NSSK's) on the unit bidisk. Conditions under which the double bilinear transformation (DBT) preserves stability are derived. The results presented here also extend the class of systems whose stability can be predicted. Use of the inverse DBT to produce a continuous equivalent of the discrete 2-D transfer function allows easy application of a continuous-domain equivalent of a criterion developed by Dautov. The necessary and sufficient condition for stability derived in this work provides a simple check for the class of systems under consideration. From this class of systems, it is also possible to construct stable pairs of mutually inverse transfer functions.     

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.     

铝电解槽料箱排气管结构的优化改造

简要介绍了铝电解槽料箱排气管在原设计上存在的缺陷和不足，针对缺陷产生的原因进行了结构优化改造。     

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

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

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.     

Validation of a Method of Determination of Apparent Diffusivity Versus Composition in Solids

A method is presented for computing the values of apparent diffusivity in solids with respect to the concentration of the diffusing substance (water or sodium chloride). This method does not require any assumption upon the mathematical relationship between diffusivity and concentration. It can be applied to experimental measurements of local concentration versus position within the solid (profiles) with relatively few measurements (circa 10) and a mathematical smoothing of the experimental data by using an artificial neural network model. The method was first validated on simulated data obtained by using a constant diffusivity value and on experimental profiles when the relation between diffusivity and concentration was given. It was then applied to original experimental moisture profiles obtained by putting gelatin gels with different initial moisture contents into contact for up to 14 days. The method was also successfully applied to five sets of experimental moisture and sodium chloride profiles taken from the literature and obtained from different food products. Apparent diffusivities calculated by our method were found in agreement with those obtained by authors using different numerical methods to compute the diffusivity values.     

Apollonius tenth problem via radius adjustment and Möbius transformations

The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationship among given circles and the desired Apollonius circles. Hence, the given three circles in this paper do not make any assumption regarding on the sizes of circles and the intersection/inclusion relationship among them. The observations made provide an easy-to-code algorithm to compute any desired Apollonius circle which is computationally efficient and robust.     

多处理器系统中的数据局部性及其优化技术研究

数据局部性是多处理器系统中的重要研究方向之一。结合该领域目前国内外研究现状和我们近一阶段的研究进展，讨论了多处理器系统中的数据局部性及其优化问题。针对现有局部性度量模型存在的不足，提出了一种增强的可用于层次式并行计算机体系结构的局部性度量模型。在静态和动态局部性优化技术方面，分别探讨了基于投影分层的数据变换框架和基于瞬时访问信息的动态页迁移策略，并展开了系列相关的讨论。另外，针对利用数据局部性时必须解决的一个关键问题--存储一致性问题，进行了深入的研究，提出了以操作系统为中心的线程存储一致性模型。