Chinese characters are basically composed of few radicals, and it is essential to recognize the radicals inside a character before recognizing the whole character. A partial matching algorithm that is based on a modified relaxation method is proposed to do radical recognition on a scanned input character. Experiments are carried out with 204 constrained handwritten characters, each containing two to five radicals, for matching 16 radical templates. The total recognition rate is 63.3%. But the rate of identifying at least one radical in a character is 97%.>

This paper presents a detailed analysis of a sampling approach used in the partitioning of a data file for the parallel balanced tree sort in a local area network or a multiprocessor environment. The average overall time complexity for sorting N data on a k processor system is derived. The performance of the parallel sorting rests upon how evenly the file can be partitioned into k ordered subfiles. A data partition scheme by sampling is proposed and analyzed. Formulas for computing the optimal sampling size are obtained. The results also show the computational improvement of the sorting as a function of k and the sampling overhead. The performance of the sampling method is studied and found to be approaching the absolute optimal in some cases.