Abstract:In this paper, a nonbacktracking algorithm is presented for the rule based attribute-oriented database induction approach. The background knowledge is considered as a limited logic program, and every clause of it is expanded as a complete resolution clause. Then, the concept of exact level for an attribute in the concept hierarchies is defined and specified according to its threshold required by the users. The values of each attribute are inducted as ones in its exact level by only one pass without backtracking.

Abstract:Algorithm framework is an operational approach to algorithm relocation. In this paper, the authors present the definition of algorithm relocation and an algorithm framework based on selection operator and combination operator. The authors discuss how to design selection operator and combination operator. The algorithm for a given problem can be obtained from the algorithm schema, which is obtained from the algorithm framework presented in this paper. The relationship between algorithm framework and algorithm schema and the relationship between algorithm framework and modular algorithm are discussed as well. Algorithm relocation and its operational approach are significant for software automation and machine-learning.

Abstract:In this paper, a new run-time pointer aliasing disambiguation method, called SHRTD (software/hardware run-time disambiguation), which combines hardware and software techniques is presented. During run time, the SHRTD method lets function units execute NOPs to implement the postponement of the incorrect memory load operation and its successive operations. To guarantee the consistency of the execution sequence of all postponed operations, the order of function units which executes NOPs and the number of NOPs must be determined during compiler time. The SHRTD can be used for irreversible code, and it has very limited compensation code space and no serious rerollability problem. The SHRTD method solves pointer aliasing problem efficiently and makes it possible to obtain potential instruction-level parallel speedup.

Abstract:View is an important idea of database and it can also be used effectively in the Web. But the view of Web is not the same as that of database, since the Web is different from the database. In this paper, the authors present an important idea, the area of navigation, which describes the characteristics of Web users' activities. Based on this idea, the definition of Web user's view is given and its implementation and some possible applications are also discussed.

Abstract:In this paper, the authors study the query requirements of multimedia database and propose a structured multimedia object query language (MOQL). The language can support queries based on type, structure, synchronous relations, temporal relations, and contents of multimedia data. Taking the DB2 relational database system as a storage mechanism, they define a set of algebraic operators and some transformation rules, by which the MOQL queries defined by the users can be transformed into a set of algebraic formula and optimized. Finally, the algebraic formula can be transformed into execution plan in DB2SQL and C++ procedures, which can be run on DB2 system.

Abstract:Interactive communication is the main method to realize cooperation in multi-agent systems. In this paper, from the semantic perspective, the authors investigate the interactive communication procedure of multi-agent systems and incorporate the BDI (belief, desire, intention) model, the agent's mental state mode, into the interactive communication procedure. They present a model concerning the interactive strategy, which supports a variety of arranging interaction on basic interactive action to solve the conflicts of desires or intentions among agents. Compared with former other researches, such as negotiation through argumentation method, this strategy model can realize the flexible interactive communication based on different scenarios, and it is more practical.

Abstract:In this paper, the compatibility of the different-structured decomposition-patterns for probabilistic logic is discussed. If the single marginal probability consistence remain between each pair of the different-structured decomposition-patterns, the combination of them will form a multi-pattern decomposition structure. In addition, the inference system based on the given decomposition method keeps its validity and completeness to the original Nilsson's system.

Abstract:In order to improve the throughput, response speed and scalability of Web servers efficiently, many famous Web sites have thrown away single servers and turned into Web server clusters. Request-dispatching is a technology used by these sites, which centrally accepts all the coming requests and “evenly” dispatches them to the servers in the cluster.“Round-robin”, “Least-connections” and “Fastest Connection” algorithms which Commonly used request-dispatching show low efficiencies, because they either do not consider the difference in performance between servers or do not consider the contents of coming HTTP requests. In this paper, the authors give a novel algorithm designed for heterogeneous Web server clusters, called LTI (least time increment), which considers not only the deference in performance between servers, but also the contents of coming HTTP requests and the current load level of each server in the cluster. They also give the reformed edition of LTI algorithm, namely LTI+, which can judge whether the cluster is closed to the critical state and prevent such trend. Theoretical analysis and real system test show that the algorithm achieves better response latency and throughput than “Least connections” and “Fastest Connection” algorithms. So it makes the Web server clusters more parallel and more scaleable.

Abstract:Many researchers have applied the concept of causation to model-based diagnosis. However, their researches are limited to simple causal theory. In this paper, the concept of generalized causal theory that contains more information is proposed. It is pointed out that the diagnostic space of a generalized causal theory is smaller than or equal to that of the corresponding simple causal theory. Furthermore, generalized causal theory is applied to the area of test. It is demonstrated that for closed generalized causal theory, the abductive differential diagnosis is equivalent to the consistency-based differential diagnosis.

Abstract:The assignment of transaction identifiers is one of the important factors influencing the per-formance of nested transactions. In this paper, the requirements which the transaction process poses on the transaction identifiers under the nested transaction model are analysed. Based on this, a series of efficient and practical assignment strategies are proposed, and the bit-based transaction identifier strategy is implemented in the object-oriented database system——KDOODB (KeDa object oriented database). At last, the performance evaluation results are given.

Abstract:In this paper, the authors present a kind of generalized least general generalization, called MGG (multiple minimum general generalization), under generalized θ-subsumption. MGG does effectively reduce the generalization of inductive hypotheses to extent, such that the problem of over-generalization is satisfactorily overcome. For computing MGG efficiently, the relation between normal generalization and MGG is studied and an algorithm CMGG (clustering-based multiple minimum general generalization) based on concept clustering is proposed, which can effectively figure out MGG and reflect accurately the internal relation of the set of learning examples.

Abstract:In this paper, the authors present a new principle for designing a sort of multi-layer weight-sum-and -threshold neural networks. The design process consists of two steps. First, each class of the given training samples is covered by using neighbor coverings as less as possible. Then a neural network is specifically designed by an approach called alternative covering algorithm. The simulation results of two representative hard classification problems are shown. One is so called “two spirals separation” problem, the other is “the learning problem of infinitetraining samples”. These simulation results are given to illustrate the effectiveness of the new method.

Abstract:GenVoca is a domain-independent model of hierarchical software system design and construction that is based on large-scale reuse. This model is a blueprint for implementing software component technologies in many domains. In this paper, the authors discuss the main features of GenVoca model and present a reusable graphical editor (GE) software architecture based on this model. They explain the realms and their components of the architecture, examine the relations between these components, and show how combining these components into some graphical editors is achieved.

Abstract:Mining association rules is a major aspect of data mining research. In this paper, on the basis of analyzing the basic properties of the problem of mining association rules and multidimensional scaling, the authors propose a new multidimensional scaling based algorithm for fast mining association rules, which projects each data item on multidimensional space according to the association scaling between data items, and then reduces the dimensions of the space. Finally, the algorithm generates association rul...

Abstract:In this paper, the authors analyze the methods to generate and test frequent itemsets in existing algorithms in KDD research, and put forward a new efficient algorithm for discovering association rules based on vertical data layout. This algorithm has no need of Hash data structure and makes only two databases scans. As a result, the algorithm not only facilitates the implementation, but also improves the efficiency.

Abstract:The shell operation of solid is an effective method to construct a solid with shape of thin shell. In this paper, the authors describe the mathematical definition of shell operation on regular solid with boundary representation, and present an algorithm for shell operation. The algorithm implements the solid's 3D operation by 2D merging operation of loops in surface's parametric region. So the complexity of problem is reduced.

Abstract:In this paper, the authors discuss the first-order disunification and the algorithm for computing the complete set of disunifiers. There are many methods for solving unification problem, the method by using translation rules has been thoroughly studied. Many translation rules are also given out in the study of disunification problem. By using translation rules, people usually get some solved forms for the problem. In this paper, the authors are concerted with the method for giving out the complete set of disunifiers based on solved forms. The method becomes more convenient and direct by using functions G_θand Z.

Abstract:The problem of computing the euclidean shortest path between two points in the three dimensional space bounded by a collection of convex disjoint polyhedral obstacles is known to be NP-hard and in exponential time for arbitrarily many obstacles. It can be solved in O(n²) time for single convex polyhedron obstacle (here n is the total number of vertices of polyhedron). In this paper, the author mainly researchs the shortest problem of the case of two convex polyhedral obstacles, and presents an algorithm that solves this problem in O(n²) time, and improves improving significantly previous best result On³logn) for this special case. On the other hand, the author also presents a better result O(∑12^i-1n²_i) for the problem of shortest path amidst a fixed number of convex polyhedral obstacles.

Abstract:Although BDI approach is currently a subject of much ongoing research, less relative works about modeling communication have been involved. The aim of this paper is to extend classical BDI logic for representing and reasoning about speech act interactions between multi agents. A many-sorted, quantified, first-order, multi-modal logic with branching time structure is presented, including standard BDI modal and temporal operators like belief, goal, intention, etc. In addition, some operators and constructs are introduced for characterizing agents' “know-how” or having plans about how to achieve their intentions and for interpreting the pragmatic meanings of inter-agent communication. While discussing the syntax and semantics of the logic, some kinds of illocutionary speech acts are logically classified and interpreted.