查询词典 graph

Phase correlation and then reaches image mosaic by graph cut and poisson image fusion.graph cut is used to find a globally optimized seam-line for deghosting while poisson image fusion is used to realize smooth mosaic without exposure difference.a new weight calculation method based on the statistics of guadient direction histogram is presented here in order to robustly realize graph cut.an edge transition poisson image fusion method is also proposed to reach exposure difference removal

该方法在相位校正的基础上将图切割和泊松融合相结合实现拼接，图切割用于搜索全局最优的缝合线以去除鬼影，泊松融合用于曝光差异的处理。本文给出新的基于梯度方向直方图统计的权值计算方法，实现稳定的图切割。另外，本文还设计出重叠过渡的泊松融合方法，较好地完成图像合成。

Finally this paper consideres an applicable case-the symbolic transition graph,then the generalized symbolic observation graph SOG and symbolic congruence graph SCG can be finite,so authors' algorithm is feasible for weak bisimulation and observation congruence.

此时由符号双迁移关系生成的符号观察图和迟符号同余图必为有穷图，因而我们的弱互模拟等价算法是可行的。

it was a routine way for graph- drawing based on coordinate data in application software to program and graph processing,because from coordinate data to graph it is uniqueness.in hydrologic analysis,we calculated related data according to figure parameters,as using rainstorm isoline to reckon average rainfall in the river basin.through examples and analysis,the paper proposed methods for curve numerical translation and area calculation by vb.

在应用程序编制和图形处理的软件系统中由坐标数据可以绘出图形是常规的途径，但有曲线图形，要生成坐标数据，至今还没有通用的方法，因为由坐标生成图形是唯一的，而反过来由图形转换为数据是非唯一的。在水文分析计算时，有时需要根据图形参数进行有关数据的计算，如用暴雨等值线图计算流域平均雨给出量的时候。通过分析和计算实例提出了利用vb实现可满足使用要求的曲线数值转换和封闭图形的面积计算方法。

According to the three-dimensional finite element analysis, the graph of axis force on steel, the graph of Z displacement on steel and the graph of whole transmogrification on girder are drawn.

通过模型分析计算得出的结果，得到钢筋轴力的分布图，相应的钢筋Z向位移曲线和梁的整体变形图，钢筋应力及混凝土平均应力曲线图，最后根据分析结果推导出钢筋应力与荷载的关系公式。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

In this paper, a lot of research works of algorithms of mining CAD has been done. Many important mine specialty graph operation algorithms have been put forward. The main results are as follows: polygons cut out algorithm, two close polygons mutual, merge and subtract algorithm, polygon vector fill, any vector polygons area calculating and sequence polygons or multifold which has the direction and region area calculating, curve smoothing, graph element search for any region, graph element attrib collect in any region, parallel polygon or vector intersection-point push out or pull in, ore reserves and grade calculating for any type polygon, mine spatial data searching and boundary line tracking and automatic link algorithm etc.

论文在矿山图形算法研究方面做了大量的工作，提出了许多有价值的矿山专业图形运算算法，主要算法有：多边形裁剪算法、闭多边形的加、减、并算法、多边形的矢量填充算法、任意有向多边形、有向多连域、有向多边形序列面积算法、多种曲线光滑算法、任意区域的图元搜索算法、任意区域图元属性提取算法、多边形平行外推/内缩算法、任意多边形储量品位计算、矿山空间数据搜索算法、界线的自动追踪和连接等。

We apply the results in Chapter 2 to the equitable list coloring of graphs and prove that a graph G is equitably △-choosable if G is a plane graph without i-cycles, 3 ≤ i ≤ 5, or a plane graph without 4-cycles(or 5-cycles) and 6-cycles.

从而得出不含3-圈，4-圈和5-圈的平面图和不含4-圈(或5-圈)和6-圈的平面图GΔ(G≥6均有一个Δ-均匀列表染色。

In a graph-theoretic version for a graph G,it is to find a set F of added edges such that the graph G+F is chordal and |F| is minimized.Here the minimum value |F| is called the finll-in number of G,denoted as f.

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G+F是弦图。

The fill-in minimization problem comes from the elimination process of sparse matrix computation. In a graph-theoretic version for a graph G, it is to find a set F of added edges such that the graph G+F is chordal and |F| is minimized.

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G+F是弦图。

If G is a {2K_1+K_2, C_4}-free graph, we show thatifα＞3 then G is a split graph, and ifα=3 then for any independentset S of cardinality 3, G-S is a chordal graph or G-S?

如果图G不含与4-圈和2K_1+K_2同构的导出子图，我们证明了如果α＞3，那么G是一个split图；如果α=3，那么对于G的任一个有三个元素的独立集S，G-S是一个弦图或者G-S？

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。