Abstract:Rough set theory proposes a formal definition of knowledge and provides a series of tools to deal with knowledge. However, in the algebraic representation of this theory, it is difficult to understand the essence of rough set theory, and efficient algorithm of knowledge reduction has not been found. In this paper, a relationship between knowledge and information is set up, and then based on the relationship an information representation of the concepts and operations about rough set theory is given. Finally, the equivalence properties between information representation and algebraic representation of knowledge reduction are proved. These conclusions are helpful for people to understand the essence of rough set theory and essential to seek new efficient algorithm of knowledge reduction.

Abstract:A parallel computation supporting environment named PCSE(parallel computation supporting environment) is described in this paper. By introducing from two process operation primitives——FORK and JOIN, any program whether written in procedure programming language or logic programming language can be executed in parallel, PCSE provides an excellent software interface for the users to carry out on high-speed calculation. At present, PCSE supports FORTRAN, C and PROLOG applications executed in parallel.

Abstract:A parallel computation supporting environment named PCSE(parallel computation supporting environment) is described in this paper. By introducing from two process operation primitives——FORK and JOIN, any program whether written in procedure programming language or logic programming language can be executed in parallel, PCSE provides an excellent software interface for the users to carry out on high-speed calculation. At present, PCSE supports FORTRAN, C and PROLOG applications executed in parallel.

Abstract:The solution to the global illumination problem using radiosity method is usually represented by an illumination meshes, which are frequently very finely tessellated in order to capture shadow boundaries and other significant illumination features. So the geometry complexity of a complex scene with global illumination effect is beyond the capability of the current computer graphics workstation. In this paper, an automatic method is presented for simplifying the meshes produced as the solution to global illumination problem using radiosity method. Based on the character of the illumination meshes produced by radiosity and the characteristic of human eyes, it simplifies first by merging faces with maximum relative radiosity difference below the threshold that users define. And then the vertices on the perimeters of the merged face are deleted to further simplify the original meshes model. The model simplification samples based on these methods are given and the results show that the algorithm only significantly reduced the complexity of original meshes model, but also performed well to capture the coherent shadow discontinuity feature of illumination meshes.

Abstract:Circular arc recognition is a difficult problem that is not entirely solved in engineering drawing recognition and understanding research field. In this paper, some concepts of global recognition method and patch structure are introduced, and a circular arc recognition algorithm is provided. The algorithm matches several patches with two patterns to decide the seeds, and then by tracing the other patches, it converts these patches into circular arcs. Examples are given, which show that the algorithm has effectively solved a key problem of recognizing drawings are given.

Abstract:Real-time problem solving is an interesting topic in planning in the recent years. Besides discussing the differences between real-time scheduling and off-line scheduling, a real-time scheduling framework is proposed and some pivotal technologies are discussed in this paper. This framework can deal with uncertainty in real-time environment and output approximate solution in given time. Based on this framework, an intelligent assembly robot system is built, and through some experiments this framework is proved to do well in real-time environment. After all, the conclusion is given out, and the policy of real-time planning problem solving algorithm simply and the possible developments in the future are discussed in this paper.

Abstract:A 2D/3D transformation method used for computer aided garment design is presented in this paper. The method is based on spring-mass model. 2D to 3D and 3D to 2D transformations for cloth patterns can be implemented within the same model. In 2D to 3D transformation, 2D cloth patterns are located in their initial positions near the mannequin. Under the applying of sewing force, the cloth patterns are deformed and sewn together on the mannequin automatically. In 3D to 2D transformation, 3D cloth patterns are mapped on a given plane initially. Under the applying of elastic deformable forces, the initial mapped 2D cloth patterns will be deformed and the final shapes of the 2D cloth patterns can be obtained. In 2D/3D transformation for cloth patterns, collision detection is also considered.

Abstract:A new ambiguity representation scheme SPR(structure preference relation) is proposed in this paper, which consists of useful quantitative distribution information for ambiguous structures. Two automatic acquisition algorithms, (1) acquired from treebank, (2) acquired from raw texts, are introduced, and some experimental results which prove the availability of the algorithms are also given. At last, some SPR applications in linguistics and natural language processing are introduced and some future research directions are proposed in this paper.

Abstract:In past decades, there are many vision algorithms. In practice, the environment in which robot stayed is filled with stochastic noise such as shadow, puddle, and fallen leaves. Those factors damage the robustness of the past vision navigation algorithm. A new method to eliminate shadow during mobile robot navigation is presented in this paper. The presented method gives a detailed description on how to use fuzzy network to recognize and eliminate the shadow in low-resolution image during robot navigation, and optimize the structure of fuzzy neural network by genetic algorithm. Also, the experiment results obtained on THMRIII Mobile robot test-bed are given in this paper.

Abstract:Intention preservation of operation is a new proposed concept in the field of CSCW (computer-supported cooperative work), and the key feature of consistency control. A new called document marking scheme for intention preservation is proposed in this paper. By properly marking the sharing document, the document marking scheme can hide the effect of all concurrent operations of one operation. Therefore, operation can be performed at any cooperative side under the document environment just like it produced. Associating operations in a real-time cooperative editing system, the idea and the high-level control algorithm of the new method are presented in detail.

Abstract:A piecewise linear approximation based on vector slope is presented in this paper. Given a set of planar data points, generally, these points have sequence.The vector slope definition is introduced at first in this paper. The slope of every points in set G is computed. The points cluster in a group, where vector slope of these points are very near. Fitting every group to a line and linking these lines, a fitting curve can be attained. The vector slope defination has the message of size and direction, basic interval is (-4～4). The varing of vector slope in basic interval with angle(-180°～180°) is in one-to-one correspondence and the relation curve has good linearity. A piecewise linear approximation based on conventional slope has some problems that the slope value is infinite in some cases and the relation curve with angle has bad linearity. All these very effect the quality of fitting curve and confine the application range. This algorithm overcome these problems, so the authors can obtain a high quality fitting curve and the algorithm can be used in every graph. The time complexity is linear.

Abstract:A solution to the problem of self-delegation using the identification-authentication-signature scheme based on the graph isomorphism problem is proposed in this paper. The major difference from the traditional solutions is that it is based on the graph isomorphism rather than computing numeric theory problem, though they all leak out secret information little by little. The knowledge complexity of problems, the including knowledge complexity, the practical knowledge complexity, and the computing knowledge complexity are also defined. In the authors' opinion, these definitions should be used as the upper bound of knowledge complexity of protocols.

Abstract:The state space, search heuristics, and move generator in searching solutions to a given problem are characterized by first order language, which implies that the logical properties of a search algorithm are determined by its state space, that is, the logic describing the searching process has compactness and the class of initial states has finite close property.

Abstract:There are two issues involved in designing the architectures of engineering database management systems. The first is which kind of client/server structure is to be employed to make a proper distribution of functions between client and server. And the second is which kind of concurrency control algorithm is to be used to guarantee the consistency of the caching data at clients. Three client/server architectures(i.e. Object-server, Page-server, File-server) are dicussed, the differences among them are designated, the advantages and disadvantages of each are pointed out in this paper. The various concurrency control algorithms for cache consistency are also studied. Finally, the architecture of OSCAR, an engineering database management system, is introduced.

Abstract:Based on the distributed parallel environment, for one of the nonuniform domain numerical simulation problems of reservoir, the authors give a load-balance model of parallel computing and a zonal parallel algorithm of load-balance using domain decomposition method, so some well and effective solutions which balancly map the nonuniform domain numerical simaulation of reservoir to parallel environment are found. In the study of block oil reservoir numerical simulation parallel software, the practical results show that the zonal parallel algorithm can improve the performance in speedup.

Abstract:A new and operatable model of uncertain reasoning is provided which is based on the supporting degree of uncertainty introduced in this paper. The basic concepts are precisely defined, the supporting degree of uncertainty of a proposition is introduced, some basic properties are discussed. All of these are done by means of the classic logic, and hence have a solid foundation. The paper concludes with a comprehensive comparison of the presented method with other traditional methods.

Abstract:In this paper, the correspondence among initial(terminal) semantics of liberal glued theories and factor theories are constructed in Institutions, the glued morphism of liberal theory morphisms and its initial(terminal) semantics are given, and the important conclusion is shown that Sign: Th^l→Sign conditionally reflects colimits.

Abstract:In this paper, some errors related to substitution and set operations in the proof procedures of lifting lemma and the completeness theorem of deletion strategy, which are in the literatures on resolution-based automated reasoning, are pointed out, analyzed, and corrected.

Abstract:This paper presents in detail a statistical method and implementation of mouth-shape's shape recognition and gray level based on perfect image features of mouth shapes at the level of vowels recognition. The results of the recognition experiments approximately accord with the reasoning evaluations. The recognition rate is over 80% for five vowels' mouth-shapes. It proposes a beneficial associate approach for language's voice wave recognition.

Abstract:Being different from the general method, a formal language and grammar, stochastic liner grammar and its representation are used to describe the topology logic of the computer network by analyzing the grammar of three elemental statuses. It can be seen that combining them may describe statuses of each node in communication and shared memory of the computer network. In this paper, it is proved that the grammar can establish only route between the start node and the terminal node in some conditions. Under conditions above if may avoid collision. The use and the limit of the grammar are presented at the end of the paper.

Abstract:In this paper, some characteristics of GA(genetic algorithm) deceptive problems are discussed, the performance of the mutation operators is analyzed theoretically, and a new method for solving GA deceptive problems is proposed. The proposed method can change the direction and the possibility of the mutation operators in the process of the genetic searching, making mutation operators adjustable. In this way, GAs can eliminate effectively their deceptive conditions, keep the diversity of population, and thereby converge conveniently on global solutions.

Abstract:As the development of high-performance computing, the requirement for debugging is not only limited in “correctness debugging”, but also for “performance debugging”, which means to achieve the best performance through program tuning. The correctness debugging and the performance debugging are usually supported by the separate tools, which couldn't sufficiently support high-performance computing. A visualization tool is presented in this paper that supports both “correctness debugging” and “performance debugging” for a high performance SIMD chip. This tool incorporates the functionality of debugging, the behavior monitoring and the performance analyzing. It greatly improves the development cycle of high-performance computing programming.