Abstract:This paper presents an inflected language oriented context-sensitive morphological analysis approach. In this approach, not only the appearances of words but also their syntactic and semantic attributes are distinguished. Further more, the context in which a word appears is also considered. Thus a more reliable result will be attained. To relax the burden of syntactical analysis, inflection relations between connected words are used to remove unreasonable results.

Abstract:This paper discusses some fundamental concepts of the software requirements definition, outlines the design rationale for a graphical object oriented requirements definition language NDORL which is a semi formal language that employs the object oriented method to support requirements definitions, and also introduces its main constructs in detail. The language is concise, very intuitive, and powerfully expressive. It is, moreover, easy to be transformed to a formal functional specification language automatically.

Abstract:A graph based algorithm for generating the delaunay triangulation of a point set within an arbitrary 2D domain (denoted as DTAD for short) is presented in this paper. The basic idea is to calculate the CMST(constrained minimum spanning tree) of the given points within an arbitrary 2D domain. The CMST is then augmented to triangle mesh. Finally the DTAD is obtained by local optimal transformation. The actual application of the algorithm in the automatic finite element mesh generation is also shown in the paper.

Abstract:Interprocedural analysis is one of the critical issues for parallelizing compilers. Traditionally, inline and interprocedural information propagation are the two methods to solve the problem. Recently, a new technique called cloning shows its advantage. Cloning creates specialized copies of procedure body to allow distinct call site inherits an environment context that allows for better code optimization. Previous research focused on constant propagation. This paper presents a method that can propagate the information of symbolic linear equations. The capability of cloning is enhanced by the new method. The authors implemented their scheme in AFT, a parallelizing compiler that they developed. The test result illustrates the effectiveness of this method.

Abstract:Due to limitations of RDBs(relational database), deficiencies of OODBs(object oriented database) and requirements of new applications, a new trend in database area is becoming more and more obvious that relational paradigm and OO paradigm are to be unified in the database context, and RDB and OODB are to be integrated transparently. This paper first discusses three approaches for integration of RDB and OODB, and then introduces the design of a multimedia database system TH CIMHYPER in which the authors adopt the unification approach.

Abstract:The necessities of VLSI design by formal method lead to consider the feasibility of specifying hardware behavior using temporal logic language XYZ/E which is the basis of the CASE tool system XYZ. A microprocessor based fault tolerant computer system is described behaviorally, simulated by executing the description on XYZ system, and the intended properties have been formally verified by using the XYZ/VERI. The comparison between XYZ/E and VHDL(VHSIC hardware description language) has been made. The results have shown that XYZ/E is promising for the research of formal method for hardware design.

Abstract:Philip Wadler introduced the constructing course of a simple lexical parser when he studied how to structure pure functional programs by a monadic approach. This paper studies the approach further. A pure functional parser which can process complicated layout analyses, lexical analyses and syntax analyses is given according to the monadic approach.

Abstract:Computer supported cooperative design is an important field in CAD. This paper discusses version control of EDBMS for cooperative design. Its feature and implement method are also analyzed.

Abstract:Annotated logic is one of the paraconsistent logics.The entailments in annotated logic are  and |≈. Both of them are paraconsistent, and can treat any set of formulae, either consistent or not, in a uniform way.  is monotonic, it has a resolution based sound and complete proof procedure, but some rational inferences of the classical logic, such as modus ponens, are no longer valid under it.|≈ is nonmonotonic. The classical inferences hold true under it when there is no contradiction. But no satisfactory proof theory for |≈ has been given. This paper will propose sound and complete decision Tableaux for  and |≈ respectively.