The present paper discusses the space of representation of the fundamental group of U(l)- bundle over a torus into SU(2),and computes the Chern-Simons invariants of flat SU(2)- connectionson a U(1)- bundle over a torus.

Network Connection and Registering Table Supervision Based on Windows NT s Main Engine Intruding Checkout System;

The appropriate network connection scheme is adopted to ensure the network unblocked; the VoIP audio system is built up to provide audio service within the water resources sector; the video conference system is constructed for flood control and drought relief long-distance meeting; and moreover the network safety facil.

It is included the mode VxWorks enlightening which equipped the network,the network connection between TARGET SERVER of host and WDB of target,the configuration of components,the creation of environment of many tasks and the use of running process analysis tool.

The study of the interconnection network s faulty diameter;

Research on Efficient Collective Communication Algorithms of Interconnection Networks for Multicomputers;

Cubelike recursive networks are novel sorts of interconnection networks that have some attractive topological properties and good parameters.

Network interconnection function was realized with TCP/IP protocol and database middle control-ware by appending Winsock control.

This paper presents the basic requirement for subnet interconnection and several interconnection equipments that are presently adopted,and gives more description about implementation of network interconnection of different interconnection equipment under different environments.

Application of direct interconnection network in Terabit router;

Research on the Guarantees of QoS in Direct Interconnection Networks;

Direct interconnection network is one of major classes of interconnection networks It has been widely used in many areas, such as graph theory, algorithm design and analysis, computer architecture, parallel and distributed computing, computer networks.

The super restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of interconnection networks.

By means of the theory of isomorphic graph, the proposed algorithm is extended to some other faulty interconnection networks such as Fibonacci cubes, enhanced Fibonacci cubes and meshes.

This paper presents the matrix representation forms for logical name structures of interconnection networks, and obtains four sets of logical name matrices of modified manipulators topologically equivalent with flip networks by using the Graph Anlysis Method, which provides theoretical basis for improving the interconnection functions and the performance-cost rat.