A new graph algorithm for fault simulation in digital systems is presented.
本文提出一种数字系统故障模拟的新算法——图形算法。
Combined with the practical situiation in distribution network, it's suitable to select graph algorithm as the theoretical algorithm base.
结合配电网络实际，选用图算法作为研究馈线自动化系统的算法理论依据被证明是比较适宜的处理方案。
This paper proposed a new contour reconstruction method combining multi-scale strategy, and the core component of new method is edge distance graph algorithm.
设计了一种将轮廓线三维建模与多尺度二维图像处理技术相结合的新方法。该方法的核心是边缘距离图算法。
It has profited from the domestic and foreign research results, in this foundation, it discussed automatic production of attack path, as well as attack graph algorithm comparison.
同时，在借鉴国内外研究成果的基础上，探讨了攻击路径的自动生成算法以及对攻击图相关的算法之间的优缺点进行了比较。
The method effectively reduces the expenditure of the attack graph algorithm, and is free from reducing the timeliness of the discovering process while improving the network attack accuracy.
本发明有效地降低了攻击图算法的开销，在提高发现网络攻击准确度的同时，不会降低发现过程的时效性。
This study is based on smart planning and plan recognition theory, research tools are planning graph algorithm, using a database programming model to achieve the user plan recognition algorithm.
本文的研究基础是智能规划和规划识别理论，研究工具是规划图算法，采用有库规划模型实现用户规划识别算法。
This is done by using a topological sort algorithm on the graph.
这通过图表中的拓扑排序算法实现。
The algorithm first makes a top-down coarse location using the projection analysis of the edge density graph and then makes a bottom-up precise location based on the vertical edge linkage intensity.
该算法首先通过对边缘密度图进行投影分析进行自顶向下的粗定位，然后在此基础上利用垂直边缘的连接强度进行自底向上的精确定位。
This paper introduces a kind of graph anti-aliasing algorithm and its implement by hardware.
本文研究的主要内容是图形的反走样算法及其硬件模型研究。
Utilizing the shortest path algorithm in Graph Theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part.
运用图论中的最短路径搜索算法从装配模型中自动搜索出功能约束尺寸链，确定零件的功能尺寸。
In the last, the paper designs and analyses the Graph Theory algorithm and drives a conclusion that the problem of the arranging of curriculum schedule is NP - hard problem.
在文章的最后我们对课表超图的图论算法进行设计与分析，并得出该问题是一个NP难问题。
It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.
当所给风向图是欧拉图时，由这一近似算法求得的投递员路线是最优的投递员路线。
With flexible mechanism of class management, the algorithm is successfully applied to the editing software to realize the transformation from graph language to text language.
结合灵活的类管理机制，将该算法应用于编辑软件，成功地解决了图形语言向文本语言的转化。
Some theories of operations research, such as Graph Theory, double sweep algorithm, and Queuing Theory, and their applications in the configuration design of RMS are addressed.
论述了图与网络理论、双向扫视算法、排队论等运筹理论，以及它们在可重构制造系统的组态设计中的应用。
Proposed and implemented several methods to improve the SD-RT algorithm with the graph traverse algorithm.
基于图的遍历算法，提出和实现了对于SD-RT算法的几种改进方法。
It first introduces its architecture, knowledge representation model and reasoning schema, and then the concept of Rule model Graph (RMG) and an algorithm for reasoning using RMG.
首先介绍系统总体结构，给出知识表示模型和推理机制，并且引入RMG的概念，进一步提出运用RMG完成推理过程的算法。
Some design problems were discussed and solved such as Scene Graph, Shape Modeling, iterative algorithm on coordinate transform and collision response etc.
探讨解决了一些设计上的问题，诸如构造场景图与几何建模、坐标变换迭代算法、碰撞响应处理等。
The graph cut algorithm is one of high effective optimal methods in the stereo images matching.
图割算法是图像立体匹配算法中一种高效的最优化计算方法。
Compute shortest paths with matrix multiplication and the Floyd-Warshall algorithm for the following graph.
计算最短路径与矩阵乘法和弗洛伊德·沃肖尔算法对以下图。
A heuristic algorithm of creating graph of user sessions identification was presented.
给出了生成此会话识别图的一种启发式算法。
A sequential equivalence checking algorithm based on state transfer graph is presented.
提出一种基于状态转换图的时序电路等价验证算法。
An algorithm based on graph theory for non-rigid shape matching is presented.
提出了一种基于图理论的非刚体形状匹配算法。
The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.
算法的输入是一个有向图，产生一个图的强连通分量顶点划分。
This paper presents a total variation(TV) image denoising algorithm based on graph cut.
本文提出一种基于图割的全变差（TV）图像去噪算法。
Based on logical topology similar to wavelength graph, the algorithm constructs the multicast tree.
提出的算法基于一种类似于波长图的逻辑拓扑来构造组播树。
Based on logical topology similar to wavelength graph, the algorithm constructs the multicast tree.
提出的算法基于一种类似于波长图的逻辑拓扑来构造组播树。
应用推荐