可达矩阵

本文提出一种同图论中可达矩阵和区域划分思想相结合的模糊聚类方法，以此来确定RBF网络的隐含层节点数。

A way of fuzzy cluster is provided , which is combined with reachability matrix and the idea of region partition in graph theory , in order to find out the number of the hidden layer nodes of RBF neural network .

由邻接矩阵求解可达矩阵的一种改进简便算法

A Improved Simple Algorithm to Compute Reachability Matrix with Adjacency Matrix

基于强连通的FCM分解算法利用了可达矩阵对强连通进行识别实现对FCM分解。

We present a decomposition algorithm of FCM based on strong connectivity , the algorithm decomposes FCM into several basic FCM by cognizing strong connectivity block with accessible matrix .

证明了对于一类特殊的有向图即有向无环图（DAG），应用解释结构建模法无须求解可达矩阵亦可保证建模结构化的实现。

It is proved that there is no need to calculate the reachability matrix for a Directed Acyclic Graph ( DAG ) .

保留信息就是在建立可达矩阵的过程中得到的。

The retaining information is recorded during the process of TEM .

基于布尔矩阵运算的有向图可达矩阵

Reachability matrix of directed graph and calculation based on matrix calculation

基于可达矩阵的软件体系结构演化波及效应分析

Ripple-Effect Analysis of Software Architecture Evolution Based on Reachability Matrix

关于可达矩阵的求法探讨

Discuss the Way of Reachability Matrix

可达矩阵的新求法

New Formula of Reachability Matrix

人口控制系统的结构模型&可达矩阵在人口控制系统中的应用

The Structural Model of Population Control System & An Application of Accessible Matrix to Population Control System

第2个算法利用可达矩阵的知识，将决策问题转化为递阶层次结构；

For the second algorithm , multi-attribute decision making is transformed into hierarchy by using the knowledge of reachable matrix .

本文仅就应用可达矩阵法检验运输管理信息流程组织问题作某些理论性探讨。

In term of theory this paper goes into the problems inspecting the information flow organization of transportation management with reaching matrix .

给出了基于变化起源跟踪矩阵、变化对象跟踪矩阵、变化构件跟踪矩阵、以及可达矩阵的功能变化传播记录方法；

Record method about propagation of function-requirement change is addressed based on trace-matrix of change-source , of change-object and of change component .

在活动识别阶段，通过邻接矩阵、可达矩阵和强连通矩阵，对耦合活动进行识别。

In activities identification phase , coupled activities was identified by Boolean operation of adjacent matrix , accessible matrix and strong connected matrix .

文中用可达矩阵分析了有向图的强连通性，并给出了一种判别有向图为强连通图的新方法。

This article analysises the strongly connexity of accessible matrices , it also gives a new approach to identify strongly connected graph from digraph .

引入了可达矩阵的概念，利用可达矩阵计算出了公交线网的平均换乘次数，并给出了算法。

Moreover , introduce the idea of reachability matrix , by which , figure out the average transfer times and come out the arithmetic .

围绕并行活动的定耦与解耦问题，将整个流程规划分为活动识别和活动规划两大阶段。在活动识别阶段，通过邻接矩阵、可达矩阵和强连通矩阵，对耦合活动进行了识别。

Focused on coupling and decoupling thesis , the whole process of workflow planning is divided into two phrases & activity identification and activity planning .

本文提出了从可达矩阵求系统结构模型的两种简单方法：图上作业法和矩阵作业法。

In this paper , we present two methods to obtain the structure model of a system , that is , graphic and matric way respectively .

引入邻接矩阵和可达矩阵描述了两两站点的直接相连关系和经过一定长度通路的可达程度。

The paper also introduces the adjacency matrix and the reachability matrix expressing the connectivity between two sites and reachability after " a certain path " .

主要内容包括：可达矩阵法基本原理与应用判别，计算准备以及应用实例等。

The maior focus of this paper are . basic principles , distinguishing in application , preparing for calculation and an example of the reaching matrix method .

对决策问题及其从属关系采用有向图表示，利用图论中可达矩阵的知识，设计了一种算法，探讨了复杂决策问题递阶层次结构及各准则判断矩阵的自动生成问题。

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 .

为了完整地建立系统结构模型，又借助其它建模方法&传递扩大法建立系统可达矩阵。

To set up a complete structure model , the exited method named transferring expanding method ( TEM ) is used to set up a reachable matrix first .

这个方法旨在解决从可达矩阵开始建立邻接矩阵过程中存在的回路矩阵问题。

The information retaining method ( IRM ) is to find the adjacent matrix of return circuit during the course of transform from reachable matrix to adjacent matrix .

建立功能要素集合与子系统要素集合之间的关联矩阵、关联强度矩阵及其可达矩阵，从而确定系统的结构。

The relationship matrix , relationship intensity matrix and its reachable matrix between the function set and the sub-system set are set up , therefore the system structure is established .

在故障树生成中，根据控制系统流程图和有向图确定系统的邻接矩阵，利用邻接矩阵描述系统各子要素之间的直接关系，并求得的系统可达矩阵。

This adjacency matrix describes the direct relationships among each item of elements in the process control system . Also , it can be used to work out the reachable matrix .

文章通过对影响人口系统各因素的因果关系分析，列出可达矩阵并划分等级，最后构造出人口系统结构模型。

With the analysis of the causalty of the factors influencing the population controlsystem , and the delimitation of the grade of accessible matrix , the structural model is then established .

对系统可达矩阵运用系统分析方法，进行子要素级别分析、强连接关系识别、基本子要素的确定一系列的运算，确定系统故障树结构模型，得到系统故障树顶部结构。

System analysis is applied to the reachable matrix . As a result , the fault tree frame model of the process control system is obtained , and the top structure in sequence .

可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法，该方法计算简便。

Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph , it provides the calculating method of reachable matrix with the property of the Boolean matrix operation , the calculation method is easy and simple .

运用计算机技术，利用图的邻接矩阵和可达矩阵，方便快捷地找出业务流程中的不合理部分，由决策者综合考虑各方面因素，确定业务流程中需要合并、删除或增添的活动，进行重组。

The adjective matrices and reachable matrices of chart are used with computer technology to find out unreasonable sectors in business process quickly and conveniently . Then human decision-maker takes all kinds of factors into consideration and selects activities which need to merge , delete or redound in business process .

可达性矩阵的C语言程序实现

C Language Programming for the Connectivity Matrix