Abstract:The study on complex object data model and its logic data language has received a lot of attention in recent years. In this paper, a complex object data model COMis proposed, and the syntax of its declarative query language, called CO-DATAI.OG, ispresented. In the respect of semantics, the concepts such as universe, base, interpretation, satisfaction, and model are defined, then based on the lattice property of COM Instances the model intersection theorem, the theorem on existence of the least model, andthe fixpoint characteristic of the least model are proved. Therefore the semantic theoreticalframework is reconstructed.

Abstract:An approach of blending edges and venices of a polyhedron with NURBS surfaces that are C' continuous along their common boundaries is presented in this paper. In general, the edge blending is a bit easier, but the vertex blending is more difficult. The approach presented in this paper can unify the transaction of these two cases. Compared with other method presented, first, NURBS surface can represent the edge blending surface (constant radius blending or variable radius blending) precisely; second, In blending the vertex, they depart the blending surfaces of its adjacent edges, so they don't need to meet with each other, then "supplementary surfaces" are generated to make C' transitions between them. They generate the blending surfaces by constructing boundary curve networks with C' continuity, then according to the continuity rule, generating the NURBS surfaces.

Abstract:The software prototyping approach was proposed as a new paradigm to remedy some drawbacks in traditional life-cycle model. The challenge is to develop a suitableintegrated prototyping environment which enables the developer to specify and construct aprototype easily. Therefore, the authors designed and implemented an object-oriented integrated software prototyping environment (SPE) on VAX Ⅱ/GPX workstation. This paper presented the design, the implementation and the main characteristics of SPE. The users and designers can draw a precise and correct requirement specification and verify the possibility of the application system design after running a prototype.

Abstract:This paper introduces WHYMX object-oriented data base system suitablefor a certain of domains such as CIMS, CAD, Al and GIS. WHYMX gives the theoreticaldescription of aggregation and generalization standardization, presents the concurrencecontrol strategy, the storage management strategy and the object management mechanismof complex objects. WHYMX supports nested transaction and management of large storage object. WHYMX adds the operations of tuple--based and value--oriented in the objectdescription. Therefore, it has many advantages of the object--oriented data model and therelation data model.

Abstract:In order to describe the discovery process of synthesis and analysis,a composition-decomposition based approach to machine discovery is presented in the paper, which defines the concepts of composition--decomposition operator, composition-decomposition function, function discovery, function maintenance and so on, and this paper also gives a function discovery algorithm and a function maintenance algorithm. As an application of the approach, the process of functional knowledge discovery is studied in terms of functiondiscovery and function maintenance.

Abstract:Combining object oriented model with value-based model would help getting the merits of both models. In this paper, based on NF² relational model with composited tuple identity, the operations of projection if and natural join keeping the nested structure of relations, are given. From this, the authors have studied the semantics and formallied definition for class, subclass, attribute inheritance in NF² relational model, introducing a special attribute R" and concept of S-subclass, discussed the common sub class and multiple inheritance. All of the discussions are based on composited tuple identity, possessing the features in O-O model.

Abstract:This paper presents a set of deadlock-free routing constraints in hypercubes based on the buffer technique, and describes their corresponding deadlock-free routing algorithms. The performance evaluation shows that the routing efficiency is dependent on both self-adaptability and complexity of the algorithms.

Abstract:In this paper, the concept of generalized Horn sets is defined, the completeness of generalized input resolution, the completeness of generalized input symmetric paramodulation,and the completeness of generalized input directed paramodulation under some conditions are proved on generalized Horn sets. The lifting lemma of generalizedparamodulation is also given.