AN codes are effective for the error correction in the arithmetic operations using the symmetric r-ary number representation (SrR). This paper discusses the existence of perfect AN codes in SrR and shows that such codes exist for r3, 5, 7, 11 but do not for r9. Furthermore, it is shown that there exist near perfect AN codes in SrR similar to Neumann-Rao AN codes in the conventional r-ary number representation.

The Manchester Dataflow Machine (MDFM) works with tasks of size equal to one single instruction. This fine granularity aims at exploring all parallelism at the instruction level. However, this project decision increases the instruction communication cost, which ends up to jam the interconnection network and reduces the system performance. One way to skirt this problem is to adopt variable size tasks instead of working with such small task size. In this paper, in order to study whether or not the usage of such variable size tasks in the MDFM architecture contributes to the improvement of the performance, some simulations by toy programs take place. In the simulation, variable size tasks are realized by packing the sequential instruction stretches into one task. To manage this packing, the Sequential Block (SB) technique is developed. The simulation of those packed and unpacked programs give an outline of advantages and disadvantages of working with variable size tasks, and how the SB technique should be implemented in the system.

It is not so easy even for the ordinary Chinese to spell the correct Pinyin. Therefore the Pinyin-based Chinese character (Kanji) input system including the Chinese word processor is not easy to use. This paper propose a FEP (Front End Processor) to the Pinyin-based input system which allows the user's slight mistakes due to his ignorance of the spelling or dialect. This FEP uses the similarity of the structure of Kanji to confirm the correct Pinyin.