Abstract:In this paper, the concept of CWP(combined wavelet packets) is proposed. CWP can be obtained from COWB(combined orthonormal wavelet bases) which is composed of several orthonormal wavelet bases having the same space structure in a multiresolution analysis view. Compared with traditional wavelet packets, CWP have not only better frequency localization, but also waveshape variation. The wavelet coefficients can be computed by a fast algorithm which computes in the frequency domain and uses FFT.

Abstract:To enable group members carry out work cooperatively, CSCW(computer supported cooperative work) systems may deal with distribution issues, solve the application-specific problems, and provide user-centered cooperation support as well. These result in the complexities of CSCW systems. However, describing the behavior of systems formally is a key step in the process of system development. In order to describe the behavior of CSCW systems clearly and make it possible to verify some specific properties of the system, this paper proposes a temporal logic based description model for CSCW systems. In this model, a CSCW system consists of running entities and information objects, and the system behavior is represented by the interactions between entities described using a temporal logic language——XYZ/E. This model can guide the analysis and design of CSCW systems.

Abstract:The focus of this paper is on how to use the parallel dataflow technique to optimize and process queries on parallel databases. A set of algorithms for implementing the query optimizers of parallel database systems based on the parallel dataflow technique, such as the algorithms for generating parallel dataflow graph from a query, the algorithms for processor assignment, and the algorithms for scheduling and executing the parallel query plan, are proposed. A parallel query optimizer using the algorithms are presented also in the paper. The algorithms and the optimizer have been used in a prototype parallel database system designed by the author. It is shown that the proposed algorithms and the optimizer are very efficient and effective for optimizing and processing queries on parallel databases.

Abstract:This paper is introduced improvement the algorithm ALG_DIV and QF that decompose and factor the Boolean functions. In this paper, the “divide and conquer” strategy is used to reduce the computing complexity and to improve the computing efficiency of the process to decompose and factor the Boolean functions. The improved algorithm can get a near optimal multilevel logic forms of the Boolean functions.

Abstract:To design an image database system with content-based retrieval, the data model must be first addressed. In this paper, a new data model for image database systems with content-based retrieval is presented . It is designed on the base of hyper semantic data models. The model incorporates properties of object-oriented data model with semantic data models and some concepts of AI. For modeling image database with content-based retrieval more suitable, it introduces some image data types and type constructors to describe the prototype image structure.

Abstract:Method and method inheritance are the kernel concepts of object-oriented. This paper introduces the concept and definition of methods in CDOL(constraint deductive object language). Methods are defined by rules. They are used as interface of objects, but they can also be used to achieve abstraction of computation and sharing. The inheritance and polymorphism of methods can be realized through typing and unification.

Abstract:Starting with the concept of Ideal, the paper presents their properties when Ideals are taken as the semantic model for types. Under the ideal model of types, the paper discusses the semantics for polymorphic types in a mechanism for abstraction and encapsulation of languages named Garment, including parametric polymorphic types and constrained polymorphic types. Finally, the semantic soundness of typing rules in Garment is proved within the Ideal model.

Abstract:Spatial layout automation is one of the research directions in intelligent CAD domain. The aim is to provide tools for designers to solve the layout problems emerged in building planning, facility planning, VLSI floor planning, product packaging and such like the fields. Human designers can interact with the tools and find some new creative solutions. The graph theoretic method is one of the main approaches in the research of spatial layout. One of the difficulties in layout design is the representation of layout knowledge and constraints. Former layout models can not fully represent layout knowledge and constraints. The drawbacks of former models lead the design process uncontrolled. This paper represents a normal-constraint-graph model and a hierarchical-constraint-graph model that can be used in 2D or 3D layout design. The two models combined can be used to represent the detailed knowledge and constraints in layout design. Thus, it can overcome the drawbacks of the former layout models. In this paper the condition of the existence of the solution of normal and hierarchical constraint graphs is discussed and the layout-plan-generation method based on the normal and hierarchical constraint graphs is given.

Abstract:This paper is proposed a new multiattribute index method named hB^*-tree on the basis of hB-tree. When an index node overflows, the first step is to avoid splitting if splitting will lead to poor balance degree. Therefore the node utilization of hB*-tree is improved. The DAG problem of hB-tree is also reduced by careful selection of extracted k-d-subtree. If a splitting still produces DAG structure, the hB^*-tree is reorganized to be a strict tree. The authors show that hB^*-tree has reasonable space utilization and access costs.

Abstract:This paper presents a learning algorithm of Hopfield’s discrete-time associative memory. The algorithm adds the dimensions of training patterns, so it can store any given training patterns set. Experimental results also demonstrate the effectiveness of the approach.

Abstract:In this paper, an interval wavelets neural networks is proposed as an alternative to feedforward neural network for approximating arbitrary nonlinear functions. Different from the past ones, the present work has main characteristics as follows: (1) using interval wavelet space as the basic learning space of neural networks, the authors have solved the problem in which basic space does not match the space of learnt signals. (2) As interval wavelets theory is used, the authors have overcome the discontinuity problem caused by enlarging learnt signals in order to adapt basic space of neural network. The number of neurons is decreased, which is greatly notable in high-dimensional situations. (3) The activity functions of neurons are not the same functions.

Abstract:“Telemedicine” is the product of high advanced computer communication technology and medical engineering technology. Coming into network-information era, the development of networked multimedia makes it possible to study and implement the remote medical system. The authors proposed and realized the first complete distributed and open model of remote medical system in China. This paper is mainly based on the work in Shanghai Medical University. And in this paper, the authors described some important technical details and some special features of this model. Also in this paper, the authors make some prospects of the use of remote medical system in China.

Abstract:This paper is proposed the time expenditure of network through a network communication delay model and guarantees the feasibility of real-time communication. An algorithm of the extend CSMA/CD(carrier sense multiple access/collission detection) protocol is also presented to implement the real-time transmission of data or message.

Abstract:In this paper, the author analyses the mechanism that VCGA(variants of canonical genetic algorithms) may sometimes produce premature convergence, suggests a hybrid approach called HVCSDA(hybrid VCGA combined with steepest descent approach), and generalizes HVCSDA in order to broad its application. The approach can make the time series of super individual best maintained leave the state of premature convergence near to the global optimal solution. Two simulation examples show the efficience of HVCSDA and its generalization. In the benchmark problem of the 30 cities TSP(traveling salesman problem), the lenghth of routing is 6.82 by the HVCSDA's generlization. It is better than one that is 6.99 by new, modern heuristic search method——TABU search.

Abstract:Inductive types in Martin-Lof type theory have simple interpretations in classical set theory. The calculus of constructions however does not enjoy such a model. This paper shows how inductive types in the calculus of constructions can be interpreted in the category of omega sets.