THE RELATIONSHIP BETWEEN THE INVASION OF PARAPHARYNGEAL SPACES AND THE INVOLVEMENT OF CERVICAL NODES AND POSTERIOR GROUP CRANIAL NERVES IN NASOPHARYNGEAL CARCINOMA

Two hundred cates of nasopharyngeal carcinoma (NPC) admitted to this department from Feb. 1985 to May. 1988 were analysed according to the CT scanning and clinical findings of the primary lesions prior to radiotherapy. The results showed that involvement of parapharyngeal space was very common in NPC, about 80% (160/200 cases) ; particularly unilateral or bilateral retro-styloid spaces, about 69.5% (139/200 cases). It was proposed that patients with NPC had a high Incidence of ipsilateral cervical node metastasis. Contralateral cervical node metastasis was rare. The development of cervical node metastasto in NPC has two modes: one Is direct Infiltration of the retro-stylold space by the lesion; the other Is along the nasopharyngeal lymphatic rete. The data also showed that patients with NPC who presented symptoms of Ⅸ- Ⅲ cranial nerve paralyses always had ipsilateral or bilateral retro- styloid space Infiltrations.

Node Grouping in System-Level Fault Diagnosis

With the popularization of network applications and multiprocessor systems, dependability of systems has drawn considerable attention. This paper presents a new technique of node grouping for system-level fault diagnosis to simplify the complexity of large system di-agnosis. The technique transforms a complicated system to a group network, where each group may consist of many nodes that are either fault-free or faulty. It is proven that the transformation leads to a unique group network to ease system diagnosis. Then it studies systematically one-step t-faults diagnosis problem based on node grouping by means of the concept of hide-pendent point sets and gives a simple sufficient and necessary condition. The paper presents a diagnosis procedure for t-diagnosable systems. Furthermore, an efficient probabilistic diagnosis algorithm for practical applications is proposed based on the belief that most of the nodes in a system are fault-free. The result of software simulation shows that the probabilistic diagnosis provides high probability of correct diagnosis and low diagnosis cost, and is suitable for systems of any kind of topology.

A practical interconnection network RP(k) and its routing algorithms

Based on Petersen graph, a new interconnection network, the RP(k) network, is devel-oped and the properties of the RP(k) network are investigated. The diameter of the RP(k) network is [ k/2] + 2 and its degree is 5. We prove that the diameter of the RP(k) network is much smaller than that of the 2-D Torus network when the number of nodes in interconnection networks is less than or equal to 300. In order to analyze the communication performance in a group of nodes, we propose the concepts of the optimal node groups and the diameter of the optimal node groups. We also show that the diameter of the optimal node groups in the RP(k) network is less than that in the 2-D Torus net-work. Especially when the number of nodes in an optimal node group is between 6 and 100, the diam-eter of the optimal node groups in the RP(k) network is half of that in the 2-D Torus network. Further-more based on the RP(k) network we design a set of routing algorithms which are point-to-point rout-ing, permutation routing, one-to-all routing and all-to-all routing. Their communication efficiencies are [ k/2] +2, k + 5, [k/2] + 2, and k + 5 respectively. The RP(k) network and the routing algorithms can provide efficient communication means for parallel and distributed computer system.