A general review of Chinese character processing systems developed in China is presented. Three main categories of existing entry schemes, i.e. character entry, encoding and component keying-in, are described. After examing the diversified encoding schemes based on phonetics, shape and phonetics-shape, it is pointed out that computer-aided component keying-in scheme is more ergonomical and promising in the near future. Section of Main Features gives an overall picture of the Chinese editor, character font, software for bilingual processing, display and printer for Chinese characters. Then the standardization of the character font, code for information exchange, machine code as well as Chinese character terminal are discussed. Finally, an overview of the applications of Chinese character processing systems in the enterprises, offices, facilities for public service and Chinese medical diagnosis are given.

This paper gives two varieties of the public key cryptosystem in [1] which can also be used to implement digital signatures.

Asynchronous operations in dataflow computers bring about some problems. In this paper, synchronous operations for dataflow computations and their model are proposed, and the outline of the implementation, SDS, of the model and its functional programming language, SDSFP, are described. The architecture of the first version of SDS (SDS-1) is discussed in detail.

This paper discusses the inherent parallelism limits on several applications for vector computers, the parallel capabilities of several architectures and two ways (traditional instruction control flow and data control flow) by which the capabilities can be used. Then a scheme for a pipelined vector processor of multi-processing units is presented. The basic system structure and its function on highly sparse vector processing are described. A vector cache system and a distributed main memory are also considered, which are intended to sustain extremely high access rates for the processor. A microprocessor based vector processor is constructed, which can simulate the high performance version of the processor.

In this paper we have proposed a method of computing Boolean difference by means of transition operators. This method considerably simplifies the computational complexity. Particularly, when the method is used in the test generation of digital circuits, the Boolean difference can be calculated iteratively from the outputs of gates to their inputs level by level, no matter whether there are reconvergent fanout lines or not. When there are m different paths from a given fault line to the primary output of the circuit, using traditional Boolean difference methods, the result formula will contain 2m?1 product terms, whereas using the method presented in this paper, the result formula will contain onlym product terms. On the other hand, the m product terms are connected by “OR” operators, therefore it is very convenient to generate partial test patterns. We also introduce a method in which partial test patterns along a given path can be generated. The method discussed in this paper have been used in the test generation of the PCBs of several computers and the results were quite satisfactory.

In this paper complexity of the 0/1 multi-knapsack problem is discussed. First we prove that the corresponding decision problem is NP-complete in the strong sense. For any fixed numberk of knapsacks, the problem is only NP-complete in the ordinary sense, but not NP-complete in the strong sense. Then, we prove that the 0/1 multi-knapsack optimization problem is NP-equivalent by using Turing reduction.

A structural operational semantics for Edison. 1—an Edison-like language—is given. The static and dynamic (operational) semantics for various declarations and statements contained in this type of languages have been carefully studied by using a structural operational approach. The method used here can be generalised to cover more complicated concurrent programming languages.

The paper is divided into two parts. In the first part, an abstract syntax of Edison. 1 is introduced and the static semantics of it is studied. In the second part, an operational (dynamic) semantics of Edison. 1 is given.

We study fairness with respect to markings in Petri nets, which means no infinite execution sequence such that in the sequence some marking occurs only finitely often but it is an element of the forward set of a marking M which occurs infinitely often. First we show the transition strong fairness implies the marking fairness although the transition fairness and the marking fairness are quite different matters. And we find some relationship between the marking fairness and the frozen tokens. Then we prove that it can be controlled locally to make marking fairness.

A new clustering algorithm ISOETRP has been developed. Several new objectives have. been intro-duced to make ISOETRP particularly suitable to hierarchical pattern classification. These objectives are: a)minimizing overlap-between pattern class groups, b) maximizing entropy reduction, and c) keeping bal-ance between these groups. The overall objective to be optimized is

GAIN = Entropy Reduction/(Overlap + 1).

Balance is controlled by maximizing the GAIN. An interactive version of ISOETRP has also been developed by means of an overlap table. It has been shown that ISOETRP gives much better results than other existing algorithms in optimizing the above objectives. ISOETRP has played an important role in designing many large -tree classifiers, where the tree performance was improved by optimizing GAIN value.