查询词典 directed graph

After the circuit is abstracted as a directed graph, circuits matching problem is solved by subgraph isomorphism algorithm.

将电路抽象成有向图的数学模型后，采用了子图同构算法实现电路匹配。

In the paper,the simulation model of mineral processing is given,the automatic solving method of sequential modular approach for simulation calculation is described,the system partition method based on reachability matrix method is introduced,and then,according to process topological structure,the ring break method based on breadth-first searching of directed graph is proposed.

首先给出选矿流程模拟模型；接着阐述了序贯模块法用于选矿流程模拟计算的自动解算方法，给出了基于可及矩阵法的系统分块方法，根据选矿流程拓扑结构特点，提出了基于有向图广度优先搜索的环路切割方法；说明了基于序贯模块法的流程模拟软件设计思路。

Through further analysis of the hierarchical directed graph of risk system, we divide it into source risk, process risk and final risk, make clear the transitive relation among risk factors and determinate the key controllable risk of generation enterprise.

针对风险系统的递阶有向图作进一步分析，划分出发点企业的源头风险、过程风险及最终风险，明确风险元素之间的传递关系，从中确定发电企业的关键性可控风险。

Secondly, a more general linear controller isdesigned. The method based on frequency domain theory is suitable to both cases of undirected and directed graph.

在第二种方法中，所设计的控制器为一般的线性控制器，结论同时适用于有向和无向图两种情形。

By using of signed directed graph deep knowledge model and inverse direction inference technique, the problem of on-line misoperation autodiagnosis during computer simulation training can be solved effectively.

采用符号定向图(SDG，Signed Directed Graph)深层知识模型配合反向推理方法，可以有效解决仿真训练过程中误操作实时在线自诊断问题。

By means of directed graph, it is originally pursued that combining the study of cognitive psychology and AI problem solving together with the study of neurophysiology. After that, we put forward a concept of finitely related clusters in human thinking process.

分析了认知心理学信息加工理论的局限性，通过有向图抽象方法，将认知心理学和神经生理学联系在一起进行研究，结合人工智能问题求解中遇到的问题加以引伸，提出了一种人类思维过程的有限关联团块观点。

To enhance security in Ad-Hoc networks,it is important to evaluate the trustworthiness of other nodes without centralized authorities.In this work,authors focus on the evaluation of trust evidence in Ad Hoc networks.First,the authors introduce the metrics of the trust,the evaluation process is modeled as a path problem on a directed graph,where nodes represent entities,and edges represent trust relations.Using the theory of semirings,a trust evaluation model based on semiring（TD-SEMIRING） is developed,then two nodes can establish an indirect trust relation without previous direct interaction and introduce the application of this model in route election.At last,the feasibility of this model is analyzed.

讨论了对可信事件的评估：首先介绍了可信的相关概念和相关的特性；接着评估过程被建模成一个在有向图寻找最短路径的问题，在该有向图中结点表示实体或者用户，边表示可信关系，通过使用半环理论，建立了一个基于半环的可信性评估模型TD-SEMIRING，在两个以前没有进行相互操作的实体之间建立间接的可信关系，介绍了这个模型在路由选择当中的应用；最后，通过仿真实验，验证、分析了该模型的有效性。

The spectral graph theory is one of the main branches in algebraic graph theory, it is mainly concerned with the adjacency spectrum and the Laplacian spectrum.

图的谱理论是代数图论中的一个重要课题，主要涉及图的邻接谱与图的Laplacian谱的研究。

The study of graph spectra is an important direction of research in algebraic graph theory, and its main object of study is the adjacency spectrum and the Laplacian spectrum.

对图谱的研究是代数图论中的一个重要研究方向，其主要研究对象是图的邻接谱与图的Laplacian谱。

In the third chapter, we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs: For graph G, let Q_u={|u"∈N}U{|u∈N},σ: I→C is a k- incidence coloring of graph G, C_u denotes the set of colors assigned to Q_u.

在第三章中我们将定义图的邻点可区别关联着色及邻点可区别关联色数：对图G，设Q_u={|u"∈N}∪{|u∈N}，σ：I→C为图G的k-关联着色，C_u表示着在Q_u上的色集。

They have quite a lot of work to do.

他们有许多工作要做。

Let us give you a more elaborate example of this process.

让我们给你这个过程的更多的详细例子。