Abstract:This paper presents a software controlled data prefetching scheme to overcome the delay of remote memory accesses in the physically distributed and logically shared memory system. With the information provided by the parallel programs respecting weak order consistency model, prefetch operations can be arranged at synchronization points to get the data before they are used. This scheme can effectively hide the large latency of non uniform memory access architechtrol model through block operations.

Abstract:It's difficult to describe 2 _D objects and more complicated ones with string grammar, for it can't be used to define the complex relations among them. This paper presents the concept of relation graph and its properties. As a new type of grammar, relation graph grammar is able to abstract the attributes of complicated objects conveniently and provide tools to analyze and recognize them. Relation graph grammar can be used in many fields such as pattern recognition, high dimensional text analysis and visual languages. To make the grammar applicable, the recognition and the matching algorithms of it are also introduced respectively.

Abstract:In this paper, the authors state the concept about subject database, then give an abstract, description of enterprise model and present entity affinity, entity set affinity and the formula evaluating the rationality of enterprise subject databases. Some examples to verify the formula are shown. Finally, the purposes of the formula are pointed out.

Abstract:This paper discusses the security design for nationalized COSIX V2.0 operating system. Through the discussion of micro kernel based multi server architecture of COSIX V2.0, the security design scheme of COSIX is formed. Finally, some issues are proposed with regard to security design in such an architecture.

Abstract:This paper presents a simpler approach in which both a program and its properties are specified by formulas in the same logic: the temporal logic. A transition module of a program is defined and the notion of temporal run semantics, which is a temporal formula precisely characterizing the program is presented. Taken temporal logic as specification language, the correctness of a program means that the formula specifying the program implies the formula specifying the property, where implies is ordinary logical implication. Therefore this approach gives a unified framework for specifying and verifying concurrent programs and allows a full utilization of the existing comprehensive proof systems developed for proving temporal properties of systems. A simple example of a buffer system is presented to illustrate this method and show that the approach is very promising.

Abstract:This paper describes GLEAM a graph layout and edit system. The authors present an algorithm for drawing general graphs. It needs fewer time than other algorithms for drawing graphs, and can lay graph nicely out. The system is extendible. User can add some special knowledge into the system easily, and make the system for special application.

Abstract:FAP(file allocation problem) is a very important problem in computer network and distributed system. This paper presented a new method to solve FAP based on genetic algorithms. The method can well solve optimal file allocation problem in engineering. The method can be also applied in other situations besides the FAP, in those situations resources need to be allocated.

Abstract:Secret sharing is an effective technique for key management，and has been widely used in many aspects of data security．The existing(k，n)threshold schemes for the secret sharing are relatively complex and the data expansion they cause is remarkable． In this paper，a label assignment method is suggested for reducing the data expansion of a simple threshold scheme．The effect of the improved scheme is obvious and its security is ensured too．Such scheme can be used in the secret sharing of the data on a large scale such as images．

Abstract:Several popular approaches of simulated evolution have been developed separately．These approaches emphasize different facets of the natural evolutionary processes，respectively．One has recognized that the simulated evolution will benefit from the adequate combination between the approaches．This paper characterizes the primary difference among existing approaches as the difference between genetic link and behavioral link．A new model of simulated evolution，called FEEE(family eugenics based evolution)，is proposed，which combines the genetic link with the behavioral link in light of the idea of family eugenics．In the FEBE model the orthogonal design technique is introduced into offspring’S breeding inside a family SO as to enhance the behavioral improvement of individuals．The FEBE model is applied to solve Goldberg’S deceptive problem that is challenging to most evolutionary algorithms．The exciting experimental results are achieved.

Abstract:Iterators act on a very important role in the abstraction of loop control mechanism and research on reusable software．Its research history is over ten years．However until nOW there iS no precise and unified definition about it yet．which affects one to understand its meaning heavily and hinder its widespread application．Based on analyzing and studying the limitations of fl variety of concepts of iterators in this paper，the authors define iterator as a abstract data type inside a combined data type and obtain a universal iterator pattern，then present the concepts and patterns of separate iterators and integrated iterators．Finally they illustrate its roles and usage by examples．

Abstract:Query optimization traditionally involves two deeply connected levels that are qualified as logical and physical. In the implementation of a concrete system, dividing it in two completely is not a good way. Considering the problem comprehensively is much better , the authors discuss this in the paper based on association algebra, and give query optimization algorithms in object oriented database system which taking into account both logical and physical aspects.