双室充氮包装机的技术改进

分析了原机型的性能特点和不足之处,介绍了改进方案。     

高坝通航技术在水口工程的新发展

水口水电站坝高101m,航运过坝采用一线三级船闸和一线垂直升船机。水口升船机是当时国内已建和在建同类升船机中总体规模最大的升船机,也是我国第一座自行设计、制造、施工和安装的大型升船机。在塔楼结构动力分析和试验研究、塔楼滑框倒模施工、升船机整体模型试验研究、承船厢整体制造和浮运、船厢安全锁定装置和船厢对接密封装置试验研究、整机安装及联调试验等方面充分体现了水口升船机的建成是高坝通航技术的新发展。     

Measurement Problems in Optical Monitoring Systems

A probabilistic image model is proposed. According to the model, the noise of the boundaries has the principal effect on the precision with which the dimensions of optical monitoring objects are measured. Results of theoretical and experimental investigations of measurement precision are presented. An approach to the determination of monitoring reliability and the selection of the resolution of a machine vision system based on structural requirements is formulated.     

DXDK-70型包装机常见故障分析处理

我公司使用天津华特DXDK-70型包装机4台，在生产中出现的主要问题及解决方法作了详尽阐述，以供同行探讨。     

辊式拉拔模用于连续拉拔机组的新技术

针对进口连续拉拔机组，独创设计了可配套使用的二连式辊模，并首次很好地解决了惯用模在辊模后的安装问题，是一种很有前途的新技术。     

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型可调高滚筒式露天采煤机

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