Abstract:Symbolic transition graphs with assignment is a general semantical model for value-passing processes. Strong bisimulation equivalences between such graphs can be reduced to the greatest solutions to simple predicate equation systems. The aim of this paper is to generalise this result to weak bisimulation equivalences. For this purpose, the notion of nesting predicate equation systems is introduced, and algorithms are presented to reduce weak bisimulation equivalences to the greatest solutions to nesting predicate equation systems of the form E₂μE₁.

Abstract:The authors review current research situation of engineering CAD, including engineering con-straints and geometry constraints, and analyze the denotation and characteristics of engineering design. Somerules and peculiarities of constraints in engineering design are analyzed. Engineering constraints representationmodel named as “Multilateral Elements Constraints Graph”, and the method based on the model constructs theone-way dependence relations between constraints variable are analyzed. In this way, some problems of constraints consistency and search space are solved well.To bridge the gap between the constraints solver and special engineering domain,an improving algorithm based on priority list is developed.Many heuristic rules and engineering experiences could be added to the list for the efficiency.These algorithms have been used in the CAD system of plant steed structure design.

Abstract:Being a kind of restricted intelligent objects, agent is a natural way to research the inheritance feature of software agent and integrate inheritance mechanisms into AOP (agent-oriented programming). Based on BDI model of agents, the semantics of inheritance and cloning behavior of agents are addressed in this paper. The semantics of inheritance are discussed from two aspects: single inheritance and multiple inheritance. For cloning behavior, the authors identify and formally classify the dynamic cloning mechanisms of agent instances into four types: function split, logic split, preference split and retrogress split. The principle of each cloning mechanism is presented and the examples are provided based on the electrical commerce systems.

Abstract:A new method is presented in this paper, which is about incremental maintenance of multi-materialized views based on parallel pipeline process. In this process, the authors classify all the materialized views first by using choosing methods, then by classified topological sorting, so that no nested definitions of relations exist among these views. Finally, in order to maintain the incremental multi-materialized views, they process in parallel all the views by utilizing pipeline model of semaphore process mechanism.

Abstract:Presending is an active service which extends caching mechanism from temporal locality to spatial locality. Two modes of extracting user behavior patterns are proposed to predict future requests from clients for efficient presending. URL-based mode exploits the Markov-chain features of request series, and can be used for hierarchical presending. Session-based mode captures more semantics, and the authors' work emphasizes the clustering algorithm, feasible document weight definition, and attribute-vector-distance computation representing order of accesses. Their performance is evaluated using appropriate metrics such as request hit rate, session hit rate, presending efficiency and presending cost. Numerous experiments are carried out to compare the two modes. These methods are used for web presending, while they are helpful to web server design and ISP (internet service provider) service planning.

Abstract:As the Internet/Intranet/WWW technologies become more and more mature and web-based applications become richer and richer, the application developers are provided with an ideal computing environment to construct WfMSs (workflow management systems). Web-based WfMSs can help business goals to be achieved effectively by means of integrating various distributed resources in an easy to access environment. A web-based general purpose workflow management system named Wowww! is described in this paper, detailing its architecture, the workflow model and the algorithms used for workflow instance execution, the self-learning algorithm for automatic process definition generation, and the strategies to support synchronous cooperation.

Abstract:In the distributed memory multiprocessor (DMM) systems, communication overhead, involved among tasks run on different processors, is still large which even offsets the advantages brought by multiprocessor parallelism. In order to execute a parallel application efficiently, it is necessary to choose an appropriate scheduling technology to allocate processors to tasks. In this paper, formal description of general scheduling system including task model, processor model and schedule problem is presented. Three most important problems, concerning schedule in incompletely interconnected homogeneous systems, are studied, which are: (1) How to choose scheduling tasks in sequence, (2) How to choose a route, (3) How to allocate processors to tasks. In addition, the problem on how to choose a route is studied according to store-and-forward and wormhole routing respectively. In the end, a static scheduling algorithm for incompletely interconnected homogeneous systems is constructed according to the solutions to the above three problems.

Abstract:With the development of human-computer interactive technology, the interface between computers and users is more and more natural, the management of user interface is becoming more and more complex. Now, the available models of next generation user interface are almost conceptual. The formal specification and property verification to them are necessary. Based on the results of the research on natural interactive user interface, the authors give out a general model of interactive user interface. In order to guarantee the correction of the design of system, it needs to specify and verify it rigidly. The formal description and verification by use of LOTOS (language of temporal ordering specification) and ACTL (action based temporal logic) are given out in this paper. These allow people to study, evaluate and define the dynamic behavior of current user interfaces.

Abstract:Debugging the distributed applications is very difficult. One of the reasons why this problem is made is that the distributed applications are inherently more complex than sequential ones. To solve this problem, the method of abstracting events is proposed, which lets the users grasp the various aspects of behaviors of a distributed application. Abstract event timestamp is used to decide the “happened before” relation among abstract events, which plays a very important role in abstracting and debugging the distributed applications. In this paper, a new complete algorithm of timestamping abstract event is proposed, which needs less storage and costs less time than others. Proofs of the correctness of the algorithms are also given in this paper.

Abstract:Knowledge base revision is to add new knowledge into the knowledge base, and to delete old knowledge if it is necessary for preserving consistency. The recently proposed knowledge base revision methods are all intractable in general case. By restricting the structure of the knowledge base, a polynomial revision algorithm is given in this paper when the corresponding constraint graph of the knowledge base is a tree. In the constraint tree, the authors use a bottom-up process to get the revision knowledge base.

Abstract:The authors use an immune evolutionary programming to design multilayer feed-forward networks in this paper. The immune evolutionary programming retains the ability of stochastic global searching of traditional evolutionary programming, and draws into the interaction mechanism based on density and the diversity maintaining mechanism which exists in living beings' immune procedure. The immune evolutionary programming has better global convergence and very strong self-adaptive ability with enviornment. The experimental results prove the high efficiency of the immune evolutionary programming in designing neural networks.

Abstract:In this paper, the authors analyze in theory how to increase the speed-up ratio of parallel test generation algorithm based on fault partitioning. The approach of backward fault partitioning of output fan-in cones (BFPOC) which combines the relevant fault recognition and shortest path sensitization, is presented. And BFPOC is compared via experiment with the approach of toward fault partitioning of input fan-out cones (TFPIC) proposed by Banejee and the general one, equal distance partitioning of fault sequence (EDPFS). The experimental results show that in large-scale parallel processing environment, BFPOC can reach higher speed-up ratio, obvious super to the other two approaches.

Abstract:As the networks becoming more complex and heterogeneous, there has been a growing demand for the network management tools. In this paper, the authors propose a model for web-based network intelligent management. It adopts a temporal data model as the underlying information model, and a rule based network intelligent control and management strategy as an automatic and adaptive management method to the networks. Moreover, the functions provided by this model as well as the hierarchical architecture of its related software supporting them and a prototype are presented in this paper.

Abstract:As one of the most fundmental, critical and challengable problems in PDC (parallel distributed computing), task scheduling has great influence on the execution efficiency of PDC. The existing heuristic task schedulings based on static task priorities always use it as processor selection policy to make the current task have earliest start execution time. On the basis of analysis of the mechanism in priority-based heuristic task scheduling, the authors illustrate the drawbacks of the processor selection policy mentioned above, and propose a new processor selection policy, i.e, to make the successor of the current task have the earliest start time, and give the corresponding restraint.

Abstract:Using the splitting property of tringular Bézier patch, the problems of iterating and initial intersection point calculating can be solved. By the procedures of near surface point iterating and border points traversing, the whole intersection curve traversing many patches can be traced from one initial intersection point. Inserting intersection points as measure points into surface, retriangulating grids, splitting triangular grids and measure points along intersection curve, the original surface can be trimmed into two composite triangular Bézier surfaces. The experimental results show that this method is simple, robust and applicable for surface modeling.

Abstract:In this paper, the authors discuss two important issues in rough set research which are attribute reduction and value reduction. A new attribute reduction approach which can reach the best attribute reduction is presented based on discernibility matrix and logic computation. And a multivariate decision tree can be got with this method. Some improvements for a widely used value reduction method are also achieved in this paper. The complexity of acquired rule knowledge can be reduced effectively in this way.

Abstract:In this paper, an automatic syllable detection method namely merging-based syllable detection automaton (MBSDA) is studied and implemented. The MBSDA uses a variety of features including the frame energy, the zero crossing rate and the fundamental frequency to merge similar consecutive frames (one or several frames) into one merged similar segment (MSS). The frames in the same MSS are treated as frames of the same state of a phonetic. These MSSs are passed into a syllable detection automaton (SDA) to give the syllable detection results. In addition, the MBSDA gives the range of syllable number (RNS) of each definite detection segment.

Abstract:The analysis of unknown forms is a challenging and important problem in document processing. Current methods can only tolerate small breaks in form lines. In this paper, a strategy is proposed for analyzing unknown structure and filled forms based on extracted lines. Individual edges are validated using knowledge of features of the extracted lines and their local proximity. In a process of scanning the horizontal and vertical lines, candidate edges are validated and rectangles are generated if their surrounding edges and their combination are all valid. To preserve the constraints and make full use of global information, the process is recursively applied. The rectangle extraction can tolerate large breaks in form lines, ignore irrelevant segments and deal with complex configurations such as embedded rectangles. After rectangle extraction, other form components are extracted by searching the remaining segments. Experiments on a collection of forms with handwritten fields and documents with tables show that the proposed approach works well even on poor quality images.

Abstract:The rule learning algorithm on continuous attributes space is studied in this paper. First, thepurpose and the importance of studying rule learning algorithm on continuous attributes space are briefly introduced, and then some basic concepts in the theory of rule learning are extended to the continuous attributes space. On this basis, the authors study the problem to divide continuous attributes space, and prove that the problem of min dividing continuous attributes space is a NP hard problem. The concepts of information entropy and infinite normed apply to the problem of dividing continuous attribute space and a new algorithm of dividing continuous attribute space based on the function of information entropy are presented. At last, a rule learning algorithm on continuous attributes space is presented and the data results of the experiments are given.