查询词典 fuzzy graph

The recognition method of circuit drawing plotted by AutoCAD is proposed It uses the topological graph to describe the electrical symbol s drawing and adopts the isomorphic graph algorithm to recognize the electrical symbols, meanwhile,the circuit wires are also recognized It can recognize the circuit drawing automatically with high accurac

提出自动识别使用AutoCAD绘制电气原理图的方法该方法利用拓扑图表示电气符号，采用图的同构算法识别电气符号，并在识别出电气符号的基础上识别电路线该方法能够以较高的准确率自动识别电气原理

Graph isomorphism ; NP problem ; P problem ; NPC problem ; Graph isomorphism complete

图同构； NP问题； P问题； NPC问题；图同构完备

Since the graph isomorphism problem is neither known to be NP-complete nor to be tractable, researchers have sought to gain insight into the problem by defining a new class GI, the set of problems with a polynomial-time Turing reduction to the graph isomorphism problem.

由于图同构的问题既不是已知的NP完全问题，也不是听话的，研究人员设法深入了解这个问题，确定了一类新基的一系列问题，多项式时间图灵减少的图同构问题。

Graph's isomorphism is one of the basic problems and NP problems in graph theory.

图的同构是图论学科中的基本问题之1，属于图论中多个NP—完全问题之1。

A new method for understanding the construction of dual links has been developed on the basis of medial graph in graph theory and tangle in knot theory.

基于图论中反转中间图的方法和纽结理论中的缠绕理论，我们提出了构建对偶链环的新方法。

It just makes it that much easier for your audience to read and understand points on a graph if they're labeled within the graph and not to the side, like it generally is.

对你的听众而言，如果你能够将在图表中标出某一点资料的标签放在表内，而不是平时常用的在表格旁边列出，那么可以更便于他们阅览。

Figure 1 is a composite graph that illustrates the "mound" of conditioner on the lane going from channel to channel. As you can see, this graph does not show a wall. The heavy application of "oil" in the middle of the lane can make a bowling ball "bounce" as though it has hit a wall when delivered from the middle of the lane toward a part of the lane outside the 10 board.

图一是球道上每块板所上的油量厚度总合，图上看不出上头有道墙，中间部份的厚重油量会使球从中央往外侧的10块板处送去时，在球沟附近会好像有一道墙把球围起来，使它不会落入球沟里。

Let G be a simple graph. A line of graph G is allowed if it lies in some perfect matching of G.

设G为一个简单图。G的一条边为容许边，如果它属于G的某个完善匹配。

The paper summerizes several general pratical new techniques, such as the analyzers of program profiles, maximum potential parallelism, array privatizability, loop parallelism; the visualizers of the statement data dependence graph, procedural callgraph, loop iteration space graph and interactive tools of array privatization and unimodular transformation; the automatic techniques of array privatization combined data dependence and coverage, the computation of parallelizing unimodular transforming matrix for mult-nested loops, enhanced unimodular transformation with array reduction recognition, non-loop level parallelism revealing technique, dynamic dataflow analysis and optimization of cross-loop local cache reuses, etc.

本文从而概括了若干具有一般性的实用新技术，如：程序计算量分析、最大潜在并行性分析、数组私有化分析、循环并行性分析等动态程序分析技术；语句数据相关图、过程调用图、循环迭代空间相关图、交互数组私有化、交互幺模变换等可视化语义交互分析变换技术等等；总结了若干自动并行化新技术，如：结合相关和覆盖的数组私有化方法、对多层嵌套循环计算幺模并行化变换矩阵的循环幺模变换方法、结合数组规约识别增强幺模变换的技术、发掘非循环级并行性的技术、动态数据流分析技术、优化利用循环间Cache数据局部性的技术等等。

The minimal vertex-covering problem of graph is a NP-complete problem of graph theory.

图的最小顶点覆盖问题是图论中的一个NP完全问题。

The second is to cut a mere 100 calories from your diet , which is the equivalent of a tablespoon of butter.

第二个就是从你的饮食中减少一百卡路里，只是相当于一大汤匙的黄油。

This is where the Rorschach test comes in.

现在，罗氏测试就出现了。