Abstract:An Object Oriented Database Management System (OODBMS) provides a query language that allows end users to define and manipulate database interactively. Besides, it must have host language interfaces for embedding query statements in C, FORTRAN, PASCAL or other languages. This paper presents the implementation of such ahost language interface -C-OSDL. In particular, the authors focus on the algorithms to translate C-OSDL commands into SoL statements and a method to manage cursor hierarchy for navigational re

Abstract:Story Parsing Grammar(abbr. SPG)based story understanding approach,proposed by the author, is a formal method orienting the deep level meaning of the story to understand the syntax, semantics and pragmatics of the story. SPG is highdimensional and context - sensitive. In order to strengthen SPG s descriptive ability and widen SPG s representative scope, a special kind of production, called unordered production, is defined and introduced into SPG. Concequentially, influences of unordered production on SPG are discussed.Moreover the charateristics of the unordered production in SPG are discussd.The syntactic parsing algorithm of a subclass of SPG with unordered productions is given at last.

Abstract:Most of Microcomputers based on Intel 80386/486 CPU can run the XENIX Operating System. But the XENIX kernel have to be modified, expanded, and exploited tomeet the need of users in China. Even since 1979, the authors study and develop UNIX and UNIX-like systems, and have more experiences. The authors have exstracted the XENIX kernel source code from the object code, by the computer-aided tools. In this paper, the exstraction method, the tools and the details for exstraction procedure are described.

Abstract:P-VLSI, an integrated automatic synthesis system for VLSI design, is able to automatically synthesize a parallel algorithm to its CMOS implementation. This system synthesizes and optimizes the design by program transformation, while adopting systolic array as VLSI architecture and using a functional programming language FP/B for description. FP-VLSI system supports formal VLSI design method and guarantee the correctness of the result.

Abstract:A new heapsort algorithm is given in this paper. Its practical value is that the efficiency of it is two times as high as that of the former algorithm.Also,its theoretical significance lies in the order and the main term coefficient of the complexity being of optimal performance.

Abstract:Large and complicated distributed real-time systems require more flexibility, predictability and reliability besides strict timing constraints. This paper presents a configuration specification language UECspec, which is a description tool for distributed real-time application systems and is used to describe the logical network structure, communication linkage relations among processes and the real-time properties of processes at the application level of a distributed real-time system UECnet. The UECnet sy

Abstract:This paper discusses the characteristics of the reusable components and introduces a new reusable component specification language (Recos). Recos supports object orienteddesign and it provides function abstraction and generic mechanism.

Abstract:From the view of software system development theory and practical working experience,this paper issued a general architecture for an information management and decision support system which is developed in a microcomputer network environment. The function of this kind of structure model to the declining of software maintenance and to the preventing of software crisis is also put forward.

Abstract:This paper describes FFP system supported by DC-LISP language, including interpreter and editorial system which is connected. The paper is mainly explained to characteristic and method of implementation.

Abstract:This paper presents an algorithm which transform a generalized left-linear recursion into more efficient rules,and shows the correctness of the given algorithm. A generalized left-linear recursion contains one or more IDB predicates and its definition is essentially generalized from that of left-linear recursions. As the algorithm for the evaluation of left - linear recursions, the algorithm we present here follows the magic-sets paradigm of a rewriting phase followed by semi -naive bottom-up evaluation. The efficinecy of the transformed rules is also discussed in this paper.