A new method for recognizing Chinese characters is proposed. It is based on the so-called feature points of Chinese characters. The feature points we use include those on the stroke of a character, i.e., end points, turning points, fork points and cross points, and the key points on the background of character. This method differs from the previous ones for it combines the feature points on stroke with those on back- ground and it uses feature points to recognize Chinese characters directly. A Chinese chara…

In Peking University Computer Research Institute (PUCRI) a method of inputting Chinese sentences based on words has been developed. To reduce the troubles in choosing one word out of the others characterized by the same feature, grammatical parsing technique is applied to the method and good results have been achieved. This article describes the outline of the method, the principle of applying grammatical formulas and the branch-cutting algorithm used to speed up the grammatical parsing.

A method, called Two-Dimensional Extended Attribute Grammars (2-DEAGs). for the recognition of hand-printed Chinese characters is presented. This method uses directly two dimensional information, and pro- vides a scheme for dealing with various kinds of specific cases in a uniform way. In this method, components are drawn in guided and redundant way and reductions are made level by level just in accordance with the com- ponent combination relations of Chinese characters. The method provides also polysemous ...

In this paper, a method to construct a surface with point interpolation and normal interpolation is presented. An algorithm to construct the discrete interpolation is also presented, which has the time com- plexity O (Nlog N), where N in the number of scattered points.

Parallel graph reduction is a promising model for new generation computer because of its amenability to both programming and parallel computing. In this paper, an initial design for a parallel graph reduction model, PGR model, is presented, which employs eager evaluation strategy to exploit conservative parallelism and provides with primitives and associated tags of nodes to synchronize concurrent tasks .Moreover, a direct operational description of graph reduction in terms of high level instructions (primi…

This paper exposes the concurrent characteristic in the communication between processors in a transputer based system, and proposes an approximate formula for assessing the granularity of distributing the parallel processes among processors. The really measured results for a pipeline sorting program running on the T-rack confirm these deduced results.

This paper introduces a heterogeneous distributed database system called LSZ system, where LSZ is an abbreviation of Li Shizhen, an ancient Chinese medical scientist. LSZ system adopts cluster as distributed database node (or site). Each cluster consists of one or several microcomputers and one server. The paper describes its basic architecture and the prototype implementation, which includes query processing and optimization, transaction manager and data language translation. The system provides a uniform …

Fuzzy set systems can be used to solve the problem with uncertain knowledge, and default logic can be used to solve the problem with incomplete knowledge, in some sense. In this paper,based on interval-valued fuzzy sets we introduce a method of inference which combines approximate reasoning and default logic,and give the procedure of transforming monotonic reasoning into default reasoning.

In this paper, we present a detection technique of and-parallelism in logic programs. The detection consists of three phases: analysis of entry modes, derivation of exit modes and determination of execution graph expressions. Compared with other techniques, our approach, with the compile-time program-level data-dependence analysis of logic programs, can efficiently exploit and-parallelism in logic programs. Two precompilers, based on our technique and DeGroot s approach respectively, have been implemented …

This paper proposes a metalanguage TrapML for transformational programming, which is designed based on the analysis of its design principles, structures and functions. It has the facilities to describe the syntax of object languages, the set of transformation rules and strategies. The behaviour of transformation systems can be conveniently expressed. Both accurate and vague strategies can be written in TrapML. Metaprogram is of higher reliability.