Abstract:Synthetic image of human body is an important task in computer graphics, in which hair generation technique is especially attractive. The key point in hair generation is its fine shapes and large quantity. A method for describing 3D texture space with two concepts, curved texel and texid, i.e. 3D texture solid, is presented for hairs. The authors also give mathematical expressions of curved texels and texids for the different hair styles. Texids and curved texels are structural organizations of 3D textures. Scenes with 3D textures are made up of texids and curved texels, and a texid can be divided into curved texels, which indicates the structure of 3D texture space, and solves the modeling problem of 3D texture surfaces. The application value of structural modeling for hair description is proved through several examples.

Abstract:Shot organization is very important in content-based video retrieval, but in most cases automatic shot organization methods fail to give satisfactory results, thus human-involved interactive organization is required. In this paper, a new shot organization method called similarity sequence is proposed, which reorders the r-frames of shot and makes similar r-frame appear near each other in the generated sequence, thus provides an effective interactive organizing interface. To compare the performance of different sequences, a distance measure called similarity distance is proposed, upon which a gene algorithm calculating similarity sequence is developed and applied to r-frame sequence reordering in shot organization. Basic ideas and algorithm modules are given in detail, also with experimental results and analysis.

Abstract:The performance of parallel database systems is closely related to the declustering methods of databases. In the recent years, many declustering methods have been proposed. But most of them cannot support dynamic databases. A new dynamic and multidimensional declustering method called DCMD(dynamic coordinates module declustering) is proposed in this paper. DCMD not only supports dynamic databases but also has the advantages of multidimensional data declustering. DCMD consists of a component for initially declustering databases and a component for dynamically adjusting data distribution. The first component, which is a random algorithm, is to declustering databases initially among multiple processing nodes. The second component, which is composed by a splitting algorithm, a merging algorithm and two heuristic scheduling algorithms, is to support the dynamic adjusting of the database distribution among multiple processing nodes during running time. Experimental and theoretic results show that DCMD can efficiently support parallel processing of dynamic databases.

Abstract:In this paper, the authors discuss a known on-line transaction processing testing benchmark TPC-C, and its design and implementation on an object-oriented database management system——Fish. Based on the testing results, the evaluation and analysis on the major factors that affect the database system performance are given.

Abstract:In this paper, an approximate algorithm of obtaining morphological templates is described, and the bi-directional orthogonal decomposition of the two dimensional morphological templates is realized. The decomposition of morphological templates is a useful technique for enhancing the computational efficiency of morphological image processing operations. The recognition algorithm of the intersection points and the end points of the lines in engineering drawings based on the morphological templates is also proposed in this paper.

Abstract:An object-based logic calculus is outlined in this paper, which is built on the trace calculus based on dynamic entities with local states. Compared with dynamic entities, objects have more good properties, such as encapsulation. To formalize the concept of encapsulation, a new concept of valid action is introduced. It is only through these valid actions declared by the very object that the state of the object can be accessed or modified. An axiomatization of the object calculus as an extension of the axiom system of the trace calculus is also contributed in this paper. Finally, the object semantics description and property deduction are shown.

Abstract:In this paper, some important theories of structured object calculus using the results contributed by Goguen are proved. These theories ensure to build up the description of new objects from the description of the existing objects and verify the global system with theories deduced from existing objects as lemma. In addition, the object reification on the basis of object encapsulation is studied, and a structured object calculus is achieved.

Abstract:In the recent years, the importance of supporting dynamic configuration in distributed systems has been widely recognized by many researchers. A new model ExGOM(extended graph-oriented model) supporting dynamic configuration by improving and extending GOM (graph-oriented model) is proposed in this paper. ExGOM supplies abundant configuration functions based on graph constructs. The user can define dynamic changes of the system architecture in the configuration file, or by using the configuration functions in the programs. This is a significant attribute so that the model can support unpredicted(non pre-planned) dynamic configuration. Also in this paper, the system architecture of the model implemented by a multi-agent mechanism is presented.

Abstract:In the film, television and many other videos, exciting video sections are usually reflected by their frequent shot changes, and such sections are the most frequently objects in retrieval of this kind of video. In this paper, a method on retrieving videos according to their shot change frequencies is presented. Scene transition analysis has done on real videos, and video segmentation algorithm for both cut and dissolve are developed. To lessen the influence of error and missing shot segmentations, a robust calculation method of shot frequency on shot sequence acquired is proposed. Basic ideas and algorithm modules are given in detail, also with the experimental results on film video and analysis.

Abstract:The tone variation patterns is very important for speech synthesis. To extract more accurate patterns, a prototype system called SpeechDM has been implemented for learning. In this paper, the relative research and data mining are specified at first, the modules are introduced in detail, and some experimental results are also given.

Abstract:In order to obtain the grammar relations between the words in Chinese sentences and analyze Chinese correctly, the authors present an extended LR algorithm based on phrases in this paper.

Abstract:The traditional approach for estimating parameters in Gaussian mixture models (GMM) based on maximum likelihood is a kind of unsupervised learning method, its shortage is that the parameters in GMM are derived only by the training samples in one class without taking the effect of sample distributions of other classes into account, hence, its recognition is usually not ideal. In this paper, an approach is presented for estimating parameters in GMM based on the maximum cross entropy of different classes, this method takes the discriminations of samples in different classes into account. To increase the possibility of obtaining the global optimal solution, this paper proposes an approach for estimating the optimal parameters in GMM based on evolutionary programming. An experiment has been carried out using the method for the text-independent speaker recognition, the results have shown that the recognition accuracy is higher than that of the traditional approach. The method has also fast convergent speed.

Abstract:How to embody the requirements of collaboration in designing processes is an important issue in developing collaborative design systems. In this paper, a hierarchical operation model for collaborative design is presented. A mental component called joint endeavor and a set of communication primitives are devised for the half-automated agents in the model to meet some of the requirements in collaborative design. An implementation structure for the hierarchical operation model is also given. A collaborative object diagram design system (CODDS) is introduced as an example of this collaborative design model.

Abstract:Large-scale parallel computing is a hot spot of current research. Because most of the scientific calculation is data parallel calculation, people would like to solve real problems by means of data parallelism. As for data parallel calculation, one of the critical factors that influence the running performance is the status of data distribution. In this paper, the authors analyze the data distribution algorithm of a prevalent object-oriented data parallel language——pC++ and point out the weaknesses of it. Then they present an improved algorithm. The results of the experiment show that it is superior to the former algorithm.

Abstract:Learning from examples is to obtain a general rule through induction from a given set of positive and negative examples of a concept, which may describe all the positive examples, and reject all the negative examples of that concept. According to the extension matrix theory, to discover the equations which satisfy all positive examples on the background of negative examples may be considered as to find a path within the matrix of negative examples. In order to deal with the multi-class problems with overlay, an improved extension matrix algorithm has been proposed in this paper. The heuristic search based on average entropy has been used to get the approximate solutions of the shortest equation. The potential function is used to estimate the probability density function of the overlay area between positive and negative examples, so that the non-linear interfaces of the interclass areas may be obtained. The improved algorithms have been applied to handwritten Chinese character recognition and its effectiveness has been proved through comparison study and analysis.

Abstract:A real-time model for two-headed mirrored disks with autonomous heads is proposed in this paper. Two-headed disks (THD) in this system have two independent arms which can seek cylinder autonomously. Three real-time disk-scheduling algorithms are presented for such disk systems. According to simulation experiments, the algorithm which is called ignore missed deadlines (IGM-EDF) has the best performance, because IGM-EDF does not process those real-time requests which have missed deadlines. The comparison between two-headed mirrored disk with fixed heads(FTMD) and the disk system with autonomous heads (ATMD) is also analyzed in this paper. Because two heads in THD can seek cylinder independently, the performance of ATMD is better than that of FTMD.

Abstract:Task scheduling is one of the key problems in distributed real-time systems. The task scheduling in real-time systems is introduced in this paper. Having taken some practical circumstances in DRT-UNIX system into account, an algorithm of task scheduling is proposed and the merits of the algorithm are analysed.