Abstract:CASE C+ + is an object oriented programming language of fully compatible with C+ + and supporting persistent object, which is originally designed and implemented in the object oriented CASE environment Jade Bird 2 System. In Jade Bird 2,it is the manipulation language of OMS (object management system) and the programming language of integrated tools. At the sametime, it is also the end users' programming language. The paper briefly introduces the background of designing CASE C+ + at first.Then it focuses the discussion on the new added language components in CASE C+ +,such as persistent object; share of the class definition;link declaration and content of object. At last, the method of implementation is described.

Abstract:The idea in design and implementation of NDOOP, which is an object oriented extension of Pascal, is introduced in this paper. NDOOP is a superset of Pascal. It not only supports sufficiently object oriented programming but also follows in the spirit of Pascal.

Abstract:To achieve higher instruction—level parallelism, the constraint imposed by a single control flow must be relaxed. Control operations should execute in parallel just like data operations. In this paper, we present a new software pipelining method called GPMB (Global Pipelining with Multiple Branches) which is based on architectures supporting multi—way branching and multiple control flows. Preliminary experimental results show that, GPMB performs as well as modulo scheduling, and for branch—intensive loops, GPMB performs much better than software pipelining assuming the constraint of one two—way branching per cycle.

Abstract:Automatic generation of software systems is the stream of the 90s in software engineering．Efficient management and flexible addition of special real—time devices is the basic function indispensable to any special real—time computer system．Moreover，their types and classes，and their quantity and quality are increasing with each passing day．How to overcome special real—time peripheral drivers’liability to variation is the key to automatic generation of any special real—time system．The paper relates to the prelimi—nary result of our study of automated drivers of special real—time devices．with focus on the inner construction and implementation of the semi—automatic generator of special real—time device drivers，RTDG(real time device generator)．which the authors develop on their own，and on a practice—tested application example．The stage result from our study of automatic generation of special real--time peripheral drivers has already passed the au—thentication on ministry level．

Abstract:This paper introduces the idea of input functional expansion into a type of general associative memories, and proposes a new least squares functional link associative memory model, the performance of the model is optimized through noise input patterns.The experimental, results show the associative effect of the proposed model is better than those of the Kohonen s model and the Murakami s model.

Abstract:This paper described the architecture and functions of NPAB l, a parallel algorithm s library. It explained the style of designing these parallel algorithms with two examples as well.

Abstract:This paper presents a binary search algorithm on the path of a heap. If a heap is used to realize priority queue, logn+a3(n) + 1 comparisons are sufficient to replace the maximum element in the heap by the algorithm.

Abstract:This paper introduces a symmetric file system based on the nonsymmetric hardware architecture of BJ 1 parallel computer. Its main design and implementation considerations are discussed in detail. Not reducing the old efficiency, this file system provides a convenient interface for users and implements the multiple channel communications between units by using the pipe method.

Abstract:Satisfiability (2SAT) is a determinable problem in polynomial time. This paper proves a sufficient and necessary condition for 2SAT problem, and presents a new polynomial algorithm for 2SAT problem. In addition, if one 2 CNF expression is satisfiable, the algorithm for solution can give every solution without backtracking. This paper tries to give some idea for other problem through the study of 2SAT problem.

Abstract:Constraints reflect relationships among a group of objects or among p arts of an object. Current object oriented paradigm does not support the explicitly expressing and computing. This paper introduces a method to explicitly express constraints using objects. The purpose ofit is to keep the language model simple when introducing constraints.Problems are also discussed with possible solutions.