Abstract:Automatically parallelizing compiler (APC) is one of the approaches in parallel programming. This paper reviews the development and describes the importance of APC . The techniques for parallelizing compiler are discussed. The paper also concludes with a look at the future .

Abstract:A lazy pattern matching implementation method based on extended graph rewriting model is proposed, including a lazy pattern matching compiling algorithm, a sometime-matching argument eliminating and pattern flattening algorithm. The first algorithm has solved the problem of efficient implementing lazy pattern matching which remained unsolved in [6]. The later algorithm is simpler and more efficient than that proposed in [7].

Abstract:In this paper, a theory named LI, which based on a fragment of linear logic, is put forward. In LI, effective results can be achieved when faced with inconsistent or non-monotonic information.

Abstract:The paper presents the formal description of the gobang and explores a strategy for solving the corresponding game problem,proposing a goal-oriented optimal α-βsearch strategy with the good unification of both the velocity and the precision.

Abstract:In this paper we present a database design tool set (DBTOOLS) which consists of three tools: Extended E-R model design tool(EERD) ,E-R model to relational model transformation tool (ERTR), and DFD,DD to relational model transformation tool (DDTR). DBTOOLS works in a combined mode of automatic transformation and human interference, and supports conceptual structure design and logical structure design of relational databases. In the design of DBTOOLS,we emphasize its support to semantic information description and utilization,and incrematal development of database application systems.

Abstract:This paper studies Petri net models for the Horn clause form of propositional logic. Since finding the T-invariants of Petri net models of logical inference is the key step, the paper investigates the algorithms for computing such invariants. These are based on the idea of resolution, and exploit the presence of one-literal, pure -literal and splitting clauses to lead to faster computation.

Abstract:In this paper , we ll introduce a kind of O(F)-LOOP operator , which will lead to a hierarchy of any recursive functions:O(F)=O(F)_n. We've proved that this hierarchy, corresponds to the speed-up theorem , i. e. given any r(x)∈O(F)_i, there is a language having O(F)_i+1 complexity which can be speeded up by r(x), and also there is a r(x) in O(F)_i, so that any language having O(F)_i complexity cannot be speeded up by r(x) . Through this, we can grasp the soul of Speed-up theorem in a more higher level.

Abstract:A computer Aided Design System has been made for solid modelling and pattern decorating of potteries and porcelains. The system structure,the work mode the producing of decorative pattern, the solid modelling of rotative and free surface objects, the calculating of illumination model are discussed in this paper. The principle of colour design and the method of data compressing were being put forward.

Abstract:Owing to the characteristic of temporal logic,some rules of classical logic can't be used directly when doing temporal natural deduction. Though the N system shows us a solution of this problem in which all rules or deductions are divided into two types-verticality and horizontality, the two-dimensional mode also gives rise to some difficulties in deduction. This paper presents an N_L system (a loose natural deduction system of temporal logic) that provides us with a unified view of all rules and-deductions.In fact,we can prove as well that N_Lis equivalent to N and that for every Ndeduction or proof there must exist an N_L deduction shorter in length than the former.

Abstract:This paper presents a new method IBLE for learning from examples with the concepts of capacity, maximal plausible decode criterion of information theory. The method doesn t depend on the prior probability of class. In the method,the attributes are strongly associated, the knowledge representation is intelligible. We use IBLE in the interpretation of mass spectra, good result is obtained and the average predictive accuracy for eight classes of compounds is 93. 96%. This result is superior to experts.

Abstract:Given an undirected graph G(V,E), |V|=n,|E|=m. Based on SIMD shared memory model, a new parallel algorithm for computing connected components of graphs is proposed by using fast data transmission principle. As a result, the algorithm requires O(log²n) time and O(n²/logn) processors on SIMD-CREW shared memory model. But on SIMD-CRCW shared memory model, the algorithm only requires O (logn) time and O(n²) processors. To compare our algorithm with known Hirschberg s algorithm, there exists some differences. The major differences are identified as:1)the way to solve this problem is different;2)proposed algorithm is simple and easy to understan;3)proposed algorithm's implementation on some practical networks such as mesh-of-rtee has better time complexity.