通过对GPS直接观测量的关联矩阵进行分析，提出了一种生成GPS最小双差集的有效算法，并编制了相应的程序通过算例进行验证。
On the analysis of observed connection matrix, this paper proposes an efficient algorithm of generating the minimum sets of GPS double differences together with a demonstrating example.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
本文基于矩阵变换算法提出了一种在计算机上生成多种复杂纹理的新方法。
In this paper, the authors present a new method of generating textures based on matrix transformation.
提出哈尔矩阵的迭代生成算法，并给出相应MATLAB函数。
Haar matrixs iterative algorithm is indicated, and the MATLAB function is given.
反演过程涉及到三个关键环节，即系数矩阵的生成、TEC的解算以及重建算法的实现。
The whole process of inversion includes three key steps, namely, build of projection matrix, calculation of TEC and realization of reconstruction algorithms.
该算法能基于双语语料，通过机器学习来自动进行语义聚类，生成词间相似度矩阵。
Based on bilingual corpora, the algorithm can produce words-similarity-matrix through machine learning.
采用自适应NAAC算法生成的测试矩阵能够确保无征兆误判，同时还能将大的测试矩阵压缩成小规模的测试矩阵。
The self-adaptive NAAC detection optimal algorithm can assure us of generating test matrix with no symptom aliasing and no symptom confounding.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
并对这些矩阵的生成算法进行了研究和探讨。
These expanding topological characteristics matrixes include more information and could be generated by computer.
另外考虑本体的关系影响，对不同类型关系引入不同权重生成本体描述矩阵，引入图理论算法生成本体匹配图（MGO）。
And next point is that different relations are assigned different weights, and then the matching graph of ontologys (MGO) is generated by using graph theory.
该算法通过引入邻接矩阵并借助自定义的堆栈数据结构来完成控制流路径子集的生成。
The control flow paths in the subset are based on the strategy that the loop statements in the program execute less than twice.
根据最小生成树(MST)算法获得图像序列的连通分量，得到图像对之间的变换矩阵并将图像映射到拼接平面。
The minimum spanning tree (MST) was used to obtain the best connected-component of the image set to recover the transformation between images and project the images into the Mosaic frame.
根据最小生成树(MST)算法获得图像序列的连通分量，得到图像对之间的变换矩阵并将图像映射到拼接平面。
The minimum spanning tree (MST) was used to obtain the best connected-component of the image set to recover the transformation between images and project the images into the Mosaic frame.
应用推荐