计算机仿真结果表明，利用该模型算法可以发现拓扑图中关键节点，同时度量值均方差可以准确评估给定连通网络拓扑图的抗毁性能。
The simulation on PC shows that the algorithm can find the critical nodes in topology, and the mean square deviation can evaluate accurately the survivability for a given connected topology.
通过定义节点编码图概念，提出一种不需要拓扑排序的求解关键路径的新算法。
A new algorithm for finding the critical paths is proposed by using coding graph and without topological sort.
介绍了系统开发的关键技术：模型简化、节点划分、平面图形截面特性的计算、强度计算的算法及分析结果的输出形式。
The key techniques such as model simplification, node division, section feature calculation, strength calculation method and result output format are introduced.
提出了一种基于轮廓匹配来预测二维关节点的算法，有效地解决了遮挡和跟踪错误积累这一关键问题。
Propose a method based on shape matching to solve the occlusion and error accumulation which are two difficult problems in the human body tracking.
该算法首先搜索得到与所有查询关键字相关的中心节点，再通过中心节点搜索连接成子图。
This algorithm firstly searches for the central node of the query keywords, and then searches for the keyword nodes through this central node to construct the subgraph.
该算法首先搜索得到与查询关键字匹配的关键字节点，再由这些关键字节点的中心节点将它们连接成子图。
This algorithm firstly searches for the matching keyword nodes of the query keywords, and then Bridges these keyword nodes through the central node of them to construct the subgraph.
解决该指标全代数化计算的关键问题是寻找能够算出网络各节点之间全部路由的代数化路由算法。
The key technique to achieve complete algebraic calculation of this index is finding out an algebraic algorithm which can calculate all routes among network nodes.
同时，基于轮廓匹配来预测二维关节点的算法有效地解决了遮挡和跟踪错误积累这一关键问通。
A method based on shape matching was also promoted to solve the occlusion and error accumulation problem.
同时，基于轮廓匹配来预测二维关节点的算法有效地解决了遮挡和跟踪错误积累这一关键问通。
A method based on shape matching was also promoted to solve the occlusion and error accumulation problem.
应用推荐