1) network describing incident matrix
网络关联描述矩阵
1.
In view of the network describing incident matrix that depicts topology connection between distribution feeder section and switches,an improved general matrix algorithm is presented.
分析了目前配电网故障定位算法中存在的问题,针对馈线区域和开关设备拓扑联接关系的网络关联描述矩阵模型,提出了一种配电网故障定位的改进通用矩阵算法,该算法在通用矩阵算法的基础上,对配电网末端故障及多电源复故障问题提出了新的判据,可快速地定位出故障区域,同时能确定出隔离该区域所应断开的电源侧开关,不仅能对配电网单一故障进行定位,而且能对配电网末端故障以及多电源复故障做出快速、准确的诊断。
2.
A network describing incident matrix that depicts topology connection between distribution feeder zones and switches is introduced.
提出了一种反映馈线区域和开关设备拓扑联接关系的网络关联描述矩阵模型,并给出了基于这一模型的馈线故障区域定位的新方法,可直观地定位出故障区域且同时能确定出隔离该区域所应断开的电源侧开关,对分支末梢区域故障也同样适用。
3.
A network describing incident matrix that depicts topology connection between distribution feeder sections and switches is introduced.
提出了一种反映馈线区域和开关设备拓扑联接关系的网络关联描述矩阵模型,并给出了基于这一模型的馈线故障区域定位的新方法,可直观地定位出故障区域,且同时能确定出隔离该区域所应断开的电源侧开关,对分支末梢区域故障也同样适用。
2) Matrix Representation
矩阵描述
1.
Matrix Representation of Viterbi Algorithm and Optimization of Hardware Design;
Viterbi算法矩阵描述及硬件设计优化
3) Petri net matrix
Petri网关联矩阵
4) connection matrix
联络矩阵
1.
To solve the problem that the order of a connection matrix is greatly increased because a large number of repeated nodes and links are resulted in when a network with voting systems is changed into a network graph, a reduced-order method was proposed.
为了解决含有表决子系统的网络系统在转化为网络图时增加大量重复弧和重复节点,使网络的联络矩阵变为一个高阶稀疏矩阵的问题,提出了一种降阶方法。
5) incidence matrix
关联矩阵
1.
Distribution network flow calculation basedon incidence matrix squaring;
基于关联矩阵自乘的配电网潮流计算
2.
A method to establish OOPN incidence matrix for net performance analysis;
基于性能分析的一种OOPN关联矩阵建立方法
3.
Consumable gas of compressor stations was not taken into consideration when branched gas pipeline networks flow equations were described with the incidence matrix method in the past,which would result in unavoidable deviation.
过去使用的关联矩阵方法在描述枝状天然气管网流动方程时,没有考虑压气站的自耗气,这在一些需要准确描述这部分气量的模型中会产生不可避免的偏差。
6) incident matrix
关联矩阵
1.
Then, the reengineering algo- rithm of incident matrix was employed to describe all the activities.
进一步用关联矩阵的重组算法对各种关系加以描述。
2.
On this basis,it discusses,by using determinant,the calculation method of the number of tree graph vertices of the known connecting graph according to the nature of the basic incident matrix.
文章从生成树之间的距离出发,定义了连通图的树图概念并证明了若干个简单性质,然后根据基本关联矩阵的性质,讨论了用行列式计算给定连通图的树图的顶点数。
3.
Furthermore, an incident matrix_based reengineering algorithm is proposed and used to describe the activity patterns determined.
进一步提出基于关联矩阵的重组算法并用于对确定的各种关系加以描述。
补充资料：关联矩阵(见网络图论)
关联矩阵(见网络图论)
incidence matrix
g日onJ旧n iLJ之he门关联矩阵(ineidenee matrix)论。见网络图
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条