Abstract:From the properties and limitation of traditional model in system software, we introduce the concept of persistent object memory, and then propose a hierarchical model of object-oriented software system to make its implementation universal and portable. At last, around this hierarchical model, we attempt to discuss the object-oriented system software in a uniform point.

Abstract:The LogC language and environment is designed to support knowledge inferences for intelligent problem solving. This paper describes the LogC motivatives and some of design features.

Abstract:In this paper,a collision-free path planning for a multi-joint robotic arm based on topological method is presented. The problems of how to partition the Configuration Space,how to judge the connectivity between connected blocks and how to search for a path are mainly discussed,finally an experimental result is given to show the feasibility of the planning method.

Abstract:In this paper, the notion of transformational programming language is introduced. The new language constructs-"transformation module" and "transformation control directive" are defined. They play the key roles in the transformational programming languages. We explain that a transformation module can be used to describe a partial implementation of an abstract data type and a transformation control directive can be used to apply a transform defined by a transformation module to an abstract variable and the related operators in a program.Some of the important issues,such as abstraction,expressiveness and flexibility of reprentation in the transformational programming language and correctness of the rtansformational program are discussed in the later part of this paper.

Abstract:This paper presented a theory of object-oriented association data model (CIM-OSA DM) for the CIM environment. After brief introduction of CIM-OSA DM , it focused on the formal definition about the fundamental concepts of the model, including object, class, and semantic association among classes. From the united point of view of object and class,it further defined the conditions of equal objects and equal classes. The definitions of sub-object and sub-class were also given formally. Some important characteristics of sub-object and sub-calss were proved.Finally,the concepts of object algebra and some operations on object were exploited.

Abstract:After Analyzing existing protocol validation techniques, we propose a FSM simplified method and an error-first search algorithm. Based on this strategy,an automated protocol validation system (APVS) in which protocols are specified in ESTELLE is developed and discussed.

Abstract:A complex object is an abstraction and description of a complex entity of the real world. Many applications such as CIMS, CAD and OA need to define and manipulate complex objects. In this paper, a definition of the model of complex objects is given, and the concurrency control mechanism of complex objects in WHYMX object-oriented database system is described.

Abstract:This paper describes recent development in explanation-based learning (EBL),including its mechanism;several important up-dated research issues on EBL, such as formalization of operationality, typical EBL procedure explanation and genelization; straleziestowards domain theory problems, also the auther has proposed some ideas on characters, overall development and continuing research direction for EBL.

Abstract:This paper introduces an automatic program generator for testing compiler, which acceptes the context-free grammar of the compiled language as its input. According to the features of the language, we represent its basic elementes with some table-structures , and solve the context-sensitive problem of language effectively by operating on them. The generator can automatically produce not only the programmes that overlay all grammar conditiones, but also the programmes which have some special grammar conditiones but also the programmes which have have some special grammar conditions for users.The generator itself has some features in its generation-strategy,generation_algorithm and deravation-principle.

Abstract:The algorithm is given for deciding whether a string s is a substring of the string which is in a regular language L. That also means assuming s is a string over 2, L is a regular language over 2. s is a substring of the string in L, if and only if s is a substring of the string which belongs to the set V_n= {w∈∑ |w∈L, |w|≤2n+k-2} where k =| s | , n is a nature number.