Abstract:In this paper, we propose a parallel table compression algorithm using a WRAM of n^1-ε processors. The time complexity of the algorithm is O(mn^ε+(s²)/(n^1-ε)). Our algorithm achieves linear speedup.

Abstract:FOREST is a new double-layer channel router based on Unconstrained Via Minimization. It partitions the routing procedure into two parts: Topological routing and Physical routing. As a heuristic algorithm, it tries to consider the routing completion rate, area, vias and wire length as a whole. It allows horizontal segments and vertical segments to route on one layer and allows over lapping of segments on different layers. FOREST is useful for general channels, especially for irregular channels. Some examples show that it is efficent,especially in reducing vias.

Abstract:The influence of useless actions on testing serializability of a schedule is discussed in this paper. At first, we define the write-write^ write-read^ read-write and read-read constraints. It is shown that if there is no useless actions in the schedule, the complexity of testing serializability under the constraints is in polinomial time. We extend the problems to the multiversion systems, then some good conclusions polynomial are obtained.

Abstract:An algorithm for constructing a bounded Petri Net according to its reachable marking graph is presented in this paper. A proof of correctness and a valuation of complexity for the algorithm are also given. We show that the algorithm is of polynomial complexity, hence it is a valid algorithm.

Abstract:In fuzzy systems the two very important key questions, the selection of universe and the description of intentions of concepts, have not been solved within fuzzy sets theory. For solving these questions, the author created the concept of factor space. Define factor space as follow: DEFINITION: A factor space is a set family {X(f)}(f∈F) taking a completed Boolean algebra F = F(∨,∧, c,1,0) as index set, and satisfies the following two items:(2.1)X(0)={φ}(2.2)((AT∈F)(t,s∈T,t≠s)=>s∧t=>0)=>X(∨_t∈TFt0=Ⅱ_t∈TX(Ft) F is called the factor set, f?F is called factor, X(f) is called full space

Abstract:This paper describes the design and implementation of CEIP (Computer Embroidery Image Preprocessing) of Computer Embroidery Programming System. CEIP uses scanner to input embroidery design and creates the graphs suitable for embroidery by recognization and processing. Using effective image processing algorithms and techniques, the system makes embroidery improved.

Abstract:In this paper, two new propagational heuristic graph search algorithms PRA and PRA* are presented, based on the concept of propagation. Algorithm PRA* is admissible, and it has an advantage over algorithm RA* on run time. Based on the concept of tie-resolution, the relation theorem between RA s run time and PRA s run time is investigated.

Abstract:The Chinese character store system is described in this paper. Compressed Chinese characters are stored in two-level memory and managed by C-tree?keyed file access routines. LFU policy is used when character-fault. An experiment, in which Chinese character access sequence is accordant with normal distribution is assumed, is made. The preliminary experimental results are presented and discussed.

Abstract:This paper discusses the issues on embedding an object oriented and semantic associated query language-OSDL in C language, and presents a complete C host language interface for OSDL. This C interface, called OSDL-C, suggests a method for embedding semantic data model queries in a procedure language in general.