Abstract:This paper sums up a method for modelling development and puts forward a tool MTOOL to support the method, according to the authors researching practices in the fields of software development methodologies and tools during recent years. It induces the developing procedure and depicting means of the modelling method, introduces MTOOL s components and working procedure in detail, and gives the main grammar contents of a model specification language (MSL). The designing ideas and implementing techniques conced about MTOOL are discussed.

Abstract:This paper proposed a method using knowledge and knowledge process point of view by which every parts of IDSS can be unified,based on the method IDSS can be conveniently interfaced and easy constructed.Now we are researching a IDSS called NCIDSS based on the method,which has a lot of charactristic different to other IDSS.

Abstract:This paper presents the inductive method for synthesizing programs from traces in NDIPS system. The matching identification algorithm is applied to the traces, generated by problem mechanism or provided by users, to form the recursive relations, and to synthesize the target programs. Its theory and implementation are discussed, and the synthesizing process of hanoi program is presented for the illustration.

Abstract:This paper classifies Distributed Problem Solving applications into Hierachi-cal-structured Problems and Flat-structured Problems, gives a formal description of the two-dimensional Flat-structured Problem, discusses its centralized and distributed solving approaches and analyzes their computational complexities. Theoretical analyses show: (1) the centralized knowledge-based solving is practicable. (2) the distributed solving is advantageous in increasing solving speed and reducing memory requirement.

Abstract:The structure measure is very important to prove the confluence of term rewriting system. This paper discusses the effective definition approach of structure measure. For this,the notion of compressed path ordering is introduced. It is easy to show whether or not a compressed path ordering is the structure measure of given term rewriting system.

Abstract:According to the requirement of the statistical and scientific database applications, the operators on the databases are defined in the paper. The operators are based on the semantic data model MICSUM[3] and form the algebra on the set of C-relations, atomic summary tables and compound summary tables which are the basic operation objects in MIC-SUM[3]. The algebra called MS algebra. The MS algebra extends the relational algebra with extended operation semantics, the extended set of operation objects and new algebraic opera-tors that support the statistical analysis queries.MS algebra is a theoretical framework for statistical and scientific database query languages.

Abstract:Over the years many sort algorithms have been produced, and the time complexity of unchangeable long-records place algorithms still is O(N²). It can t satisfy needs of large-scale information treatment. On the basis of Refs. [1,2], the new algorithm is mentioned in this note to enhance the sort speed. In this algorithm, the keywords is mapped to array element subscript and we don t carry out two operations of comparision and exchanges of keywords. Its time complexity is O(N), and the algorithm is appropriate to widely used large-scale information treatment in the future.

Abstract:In this paper,a fast sorting method of separating segment is given. For given N data recordings,the maximum mean of sorting time is O(N). The experiment results from mean distribution data recordings and normal distribution data recordings with three sorting methods on IBM-PC are given.

Abstract:The semi-join relational operation is augmented and a new method for solving cyclic queries in distributed databases is described in the paper. This new method can fully reduce all the relations in a cyclic query. 5n-4 times of data transmission is required to carry out this new method, where n stands for the number of nodes in the query graph.