Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

青霉素发酵过程的智能优化控制

本文在分析青霉素发酵补糖工艺的要求和存在的问题基础上,设计出智能控制算法,采用集散系统实现在线优化控制,经实际应用,效果明显。     

可移动机器人的运动学模型与控制原理

本文首先对可移动机器人的运动学进行了分析，建立了运动学模型与控制结构图，然后采用时域分析法对此系统进行了校正，最后通过对此系统的仿真与时测实验，对各校正环节的参数进行了整定。     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.     

LMG200型可调高滚筒式露天采煤机

介绍了可调高滚筒式露天采煤机的结构特点及在露天煤矿应用所产生的效益和其广 阔的发展前景。     

冷媒充填机的PLC控制

介绍了冷媒充填机控制系统的组成和工作原理，着重叙述了西门子S7－200可编程控制器与触摸屏结合的控制方式，使系统的性能得到较大的提高。     

并行哈夫曼编码器的硬件设计与实现

文章设计了一种并行编码的哈夫曼硬件编码器，它采用了流水线和并行编码方法，使得在一个时钟周期内可以编码一个字节的数据，在编码时显著降低了工作频率。文章给出了关键部分的实现方案并分析了实验结果。     

一种新的TDRSS扩频调制方式的研究

本文讨论跟踪及数字中继卫星系统（TDRSS）一种新通信体制，即并行MSK扩频系统，发射端采用长短码正交扩频的平衡调制，接收端采用一种简单解扩方式简化了并行MSK信号的解调，同时用短码全“1”引导长码同步的方法大大减小了长码的捕获时间，实验结果证明了良好的伪码同步性能。     

线切割加工轧辊孔型模板提高精度的方法

详细论述了利用线切割机加轧辊孔型模板中易出现的几种影响加工精度的因素及消除方法，以达到提高模板精度。     

数控机床逐点比较法插补直线分析

通过分析四方向逐点比较法的基本原理及基本特点说明其插补精度比较低的原因,提出提高插补精度的方法——八方向逐点比较插补法。