The minimal path is illustrated for each matrix.
两个矩阵的最短路径如图所示。
This paper gives some properties of companion matrix of polynomial over finite field with its application for evaluating period of linear shift register sequence and minimal length of cyclic code.
本文给出了有限域上多项式的友矩阵的某些性质，及其在计算线性移位寄存器序列的周期和循环码的最小长度的应用。
Matrix arithmetic of network maximal flux and minimal separate set not only solves these problems, but also solves some other problems by the computer such as minimal fee, distribution and transport.
网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
By the convergence of the method, we can fast construct a COSTBC matrix with the maximal rates and the minimal decoding delays that we all know now recur to the computer.
利用该方法良好的收敛性，可以借助于电子计算机快速的构造目前已知的具有最大码率和最小解码时延的多天线复正交空时分组编码矩阵。
Finally, we present an efficient algorithm for computing the minimal polynomial of a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree.
最后，我们给出了一种计算多项式矩阵最小多项式或特征多项式的有效算法，它从低次项到高次项逐项确定最小多项式的系数多项式。
The stability of ship deck grillage is analyzed by means of transport matrix technique and minimal weight of the structure is obtained with multilevel optimization method.
本文运用迁移矩阵法进行甲板板架稳定性分析，并用分级优化方法作结构最小重量设计。
When the minimal eigenvalue of connection weights matrix is greater than the reciprocal of derivation of its neuron activation function, the network will be convergent in parallel update mode.
当网络连接权值矩阵的最小特征值大于激活函数导数的倒数时，网络并行收敛。
In addition, for the minimal rank solution set, the expression of the optimal approximation solution to a given matrix is derived.
另外，给出了中心对称最小秩解集合中与给定矩阵的最佳逼近解。
The minimal realization method is given by the approach to realize multi-port network of transfer matrix.
文中运用传递矩阵多端口网络实现的方法，提供了这种系统的最小实现方法。
A polynomial algorithm about minimal marking of structural live Petri nets is presented, it is based on incidence matrix and the constructive of transitions sequence.
从网的关联矩阵以及所定义变迁发生序列的结构，求解结构活网的极小标识，得到了一个多项式时间算法。
This paper gives a new method of finding the minimal sub-tree and gives the method of finding the matrix of minimal path weight.
本文给出了求最小部分树的一种新方法，同时给出最短路权的矩阵求法。
It is proved in this paper that the minimal characterizing number of a matrix is equal to the spectral radius of the corresponding non-negative matrix.
本文对一个矩阵的最小示性数进行了研究，并证明了一个矩阵的最小示性数等于其对应的非负矩阵的谱半径。
A matrix algorithm of minimal energy-consuming path and a matrix algorithm of maximal node-energy path for multiple points to one point communication in WSN are given.
给出了在WSN中多点对一点通信的最小能耗路径和节点能量最大路径的矩阵算法。
By the solid example, reasons that measuring errors, because of minimal variation of cross-coupling matrix, are cleared, and methods for calculating the upper limit of error margin are described.
通过具体的计算实例，阐明了因耦合矩阵的摄动，引起测量误差上限的计算方法。
Minimal path matrix are defined. Based on the special vector operations defined in this paper, reliability of the systems can be expressed exactly by those of subsystems, and the algorithm is given.
定义了最小路径矩阵的几种运算，利用所定义的运算，将多源点多汇点网络系统转化为等价的单源点单汇点网络系统，并给出了由子系统可靠度精确表示网络系统可靠度的解析表达式。
This paper presents a minimal cut set method based on the adjacent terminal matrix, which can be used to evaluate the reliability of main electric connection schemes for the railway station-oriented.
在邻接矩阵和邻接表的基础之上，提出了一种新的有向图存储结构-扩展邻接矩阵，并研究了建立该矩阵的算法。
On the principle of path-algebra and introducing in lengthening matrix, passing array, open-closed flag and non-circuit minimal path matrix, etc.
应用路径代数原理，通过引入途经数组等，给出一种TSP的新解法。
On the principle of path-algebra and introducing in lengthening matrix, passing array, open-closed flag and non-circuit minimal path matrix, etc.
应用路径代数原理，通过引入途经数组等，给出一种TSP的新解法。
应用推荐