Abstract:Color composition is a fundamental step for direct volume rendering in scientific visualization.A new technique is proposed in this paper for compositing colors.By this method,a transparent degree ruler based on a transparent degree unit is built,and it is independent of the view point.After the transparent degrees of all media are transferred to relative steps based on the transparent degree ruler, a new compositing' color method is presented to eliminate a lot of repeated calculations to improve the efficiency of visualization.

Abstract:By the standard transaction model(composed of read and write operations),the scheduler can not exploit the semantics of application programs,thus not enhancing concurrency effectively.In this paper,a new transaction model based on SQL language are presented, which can exploit the semantics of high-level operations.Depending on the the transaction model and Two-Phase Locking method,the authors design a concurrency control mechanism-Condition-Locking, which can,(1)prevent phantoms from database,(2)exploit semantic information of application programs and the knowledge of the integrity constraints of the database system to enhance. cononrrency,(3)reduce the chances of producing deadlock.Hence,it is a practical concurrency control mechanism.

Abstract:In this paper,in view of the weakness of staticness and locality in the rational agents'theory of Rosenschein and the lack of description of single agent in the computational ecology of Huberman,the authors introduce the time parameter, on the basis of the rationality assumptions of the system, to give a formal description of the interaction between the rational agents and the system in a class of open DAI system,using the probability and the differential equation,so as to research the properties of dynamical behavior of open systems.

Abstract:Client/Server computing has very strong impact on the architectures of present software systems. Especially in the database area,nearly all object-oriented databases(OODBs)adopt this architecture. This paper surveys the client/server architectures of OODB systems, and in particular focuses on OODB's page-server architecture,including it's three important variants,and their efficiency improvement strategies as well.

Abstract:This paper specifies the importance of Open Distributed Artificial Intelligence,discusses the openness of open DAI systems,and analyzes Adaptation and Conflict Resolution, two key techniques in open DAI researches,in detail.

Abstract:Real-time database transactions show greatly different from traditional database transactions.The differences are mainly displayed in aspects of complex structures,timing property,dependencies and correctness of transactions.This paper first analyzes the application properties and the requirements of real-time database transactions,and presents a uniform framework of various complex transaction structures, and then discusses with emphasis on a variety of dependencies between real-time transactions:structural dependency,data dependency,behavior and temporal dependency,as well as real time transaction correctness in result,behavior,structure and temporal behavior.

Abstract:This paper is about a neural tree network(NTN)model.A supervised competitive learning algorithm is presented to grow this architecture,which can effectly solve the complex multicategory classification.A simulation result also presented on handwrited numberic recognition shows effectiveness of this classifier.

Abstract:On the basis of representing the packing components and space with a new type of octree data structure,this paper presents an effective heuristic method for arbitrary shaped 3D-packing problems. By forming the octrees of packing space and packing objects in the same octree family, the octree of each object can be looked as a node of octree of packing space in certain level,and a series of heuristic rules are used to find a"best fitnode" for each object octree in space octree.Finally,a hypothesis example with 8 arbitrary shaped objects is given and the calculation process is described in detail,and the obtained result is very promising.

Abstract:Tree Grammar is a kind of highly dimensional grammar which can be used to represent the rules for creating 2 D and up objects.Tree Grammar will be extensively applied to Pattern Recognition and Visual Language.This paper introduces the concepts of I-abeded Tree,Connection and Labelled Tree Grammar based on related concepts of Tree Grammar.It also presents two algorithms for matching and recognizing labelled trees and provide a method to generate the parser for labelled tree grammars.