Abstract:In this paper,the authors start with the introduction of generalized FD path and external closure.With the application of them,they show that the number of closures are reduced when calculating the nonredundant cover of a given functional dependency set.Then a new 3NF synthesis algorithm is presented.In this algorithm,the calculation of nonredundant cover in 3NF synthesis is reduced from two passes to one.So the total number of closures that to be calculated are significantly reduced.

Abstract:Recently,local search method has been successfully applied to solve large scale SAT problem,but it will fail to find solution when an original SAT problem instance is unsatisfiable.MSRA(multi-stage search rearrangement algorithm)is just proposed to overcome the incompleteness of local search method.Properly speaking,MSRA is based on the'separate and conquer"strategy and is the integration of several algorithms While solving the SAT problem,MSRA is more efficient than a single method,such as local search and backtracking method.Since the satisfiability of a SAT problem instance can be estimated by the strength of constrained conditions,the authors could find a more efficient strategy to solve the instance.

Abstract:Recently,local search method has been successfully applied to solve large scale SAT problem,but it will fail to find solution when an original SAT problem instance is unsatisfiable.MSRA(multi-stage search rearrangement algorithm)is just proposed to overcome the incompleteness of local search method.Properly speaking,MSRA is based on the'separate and conquer"strategy and is the integration of several algorithms While solving the SAT problem,MSRA is more efficient than a single method,such as local search and backtracking method.Since the satisfiability of a SAT problem instance can be estimated by the strength of constrained conditions,the authors could find a more efficient strategy to solve the instance.

Abstract:In this paper,an individual,interactive,and intelligent computer aid instruc-non system with multimedia presentation was first proposed.After that,it introduces the way of learn-teaching,control architecture,and designs of components of this system in detail.

Abstract:In this paper,a simple expression E,i.e.,a term or an atom,is viewed as a set,the"so-called"generated set of E,of the Herbrand universe U.or Herbrand base BLof the language L.The authors give a criteria to determine whether an expression coversanother one,and present the notion of decomposition expressions and the decomposition algorithm on which a necessary and sufficient condition for the covering relation between one and several other expressions is based.Then,they show how to partition a union of the sets generated by the simple expressions according to the partition formula in the set theory.Finally,they generalize generis these above results into the conjunctions through defining a transformation which converts a conjunction into a simple expression.This paper provides the theoretic foundation of the procedural semantics of authors'annotated logic program.

Abstract:In this paper,a simple expression E,i.e.,a term or an atom,is viewed as a set,the"so-called"generated set of E,of the Herbrand universe U.or Herbrand base BLof the language L.The authors give a criteria to determine whether an expression coversanother one,and present the notion of decomposition expressions and the decomposition algorithm on which a necessary and sufficient condition for the covering relation between one and several other expressions is based.Then,they show how to partition a union of the sets generated by the simple expressions according to the partition formula in the set theory.Finally,they generalize generis these above results into the conjunctions through defining a transformation which converts a conjunction into a simple expression.This paper provides the theoretic foundation of the procedural semantics of authors'annotated logic program.

Abstract:Load indices which accurately reflect the current load status at a computerSystem are crucial to a good dynamic load balancing system.However,few load indicesQueue length(CPU queue length only exactly)are currently used in implemented dynamic Load balancing systems extensively.In this paper,it's drawback is indicated and a new Load index ,resource utilization,is suggested.Either resource utilizations or response Times of jobs in a dynamic load balancing system using resource utilizations as load indices Are better than the ones in a system using CPU queue length as load index.

Abstract:This paper gives a denotational semantics of an object-oriented distributed real-time language Mini CSP-R.At different layers,the semantics of statement,object and program are given concisely.By introducing real-time state,the real-time property of the language is described briefly in the frame of the denotational semantics.

Abstract:in this paper,a method using bintree structure to express the packing space for rectangular packing is proposed. Through the sequential decomposition of the packing space,the optimal packing scheme of varioussized rectangular packing can be obtained by every time putting the optimal packing element that satisfy specular conditions toward cur rentpacking space and locating it at the up-left corner of the current packing space.Different optimal packing schemes that satisfy different demands can be obtained by adjusting the value of the ordering factors KA and KB.In addition,the packing schemes obtained satisfy the guillotine cutting demands in glass industry.The experimental results indicate that the algorithm is flexible and effective.