A new approach named DRM(distance reachable matrix)was proposed by introducing the value of distance in the reachable matrix so as to show directly the shortest distance at intervals of activities and find out the unreasonable activity loops quickly in business process.

Study on the improved topological index of distance matrix and its application;

The element of matrix in the distance matrix S*_~ij is defined and the topological index W* based on the distance matrix is defined as well.

According to the adjacency matrix and distance matrix of the two units, the sequential formulas to calculate Wiener topological indices or molecular topological indices have been given.

Based on the minimum matrix distance criterion, the method equals to aggregating individual pairwise judgment matrices to find a matrix, the sum of whose distances to the individual matrices is minimized, and then the latter reduces to a goal programming model.

Based on the knowledge of reachable matrix in graph theory, a new arithmetic is designed, with which hiberarchy and opinion matrix can be automatically formed.

A Improved Simple Algorithm to Compute Reachability Matrix with Adjacency Matrix;

The reachability matrix ofdirected graph is computed by Warshall algorithm for computing transitive closure of relationshipin set theory.

An ontology graph model,which creates ontology adjacency matrix and ontology reachability matrix,is described.

In this article, the theory of accessible matrix is firstly applied to the analysis of the structure of population control system.

This paper puts forward a new method of accessible matrix calculation,which also simples the process and improves the speed of calculating enormously,it converts the theory to the application software.