查询词典 graph method

To resolve the algorithm of the chromatic number of a graph,a special method is adopt to remember the coloring process of graph,and the method does different jobs for four given cases during the coloring process.The adjacent strong edge chromatic number of join graph of star and path is obtained.

为了解决图的邻强边染色问题中一个图的色数算法问题，通过特别的方法来记图的染色过程，同时分4种情况讨论了星和路联图的邻强边染色问题，指出在染色过程中给定的4种情况的染色方法各不相同，并通过对图的着色得到了星和路联图的邻强边色数。

Applying the De Caen"s inequality of sum of the squares of the degree and Cauchy"s inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph. Applying the Laplace matrix theorem of trees, we obtain an upper bound of the second smallest Laplace eigenvalues of a unicycle. Extremal graph whose second smallest Laplace eigenvalues reach the obtained upper bound is determined. We also obtain an upper bound of the second largest Laplace eigenvalues in terms of vertex number of the largest connected branch of unicycle graph, and obtain a theoretical method to calculate the second largest Laplace eigenvalues of unicycle graph. We obtain an upper bound of any Laplace eigenvalues in terms of vertex number of a unicycle graph. We also obtain the distribution of Laplace eigenvalues in the inter [0,n] in terms of the matching number.

本文得到了以下几个方面的结果： 1、利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；利用树的Laplace理论给出了单圈图次小Laplace特征值的一个上界，并刻画了达到该上界的极图；利用子图的连通分支的顶点个数给出了单圈图次大Laplace特征值的一个上界，并给出了单圈图次大Laplace特征值一个理论上的一个求法；利用单圈图的阶数给出了其一般Laplace特征值的一个上界；利用单圈图的匹配数给出其Laplace矩阵谱在区间[0，n]上的分布情况。

The paper provides a method,which can automatically search next path of outline based on clockwise tread and search next path of closed graph based on counter－clockwise tread.The method improves the ancient method and increases graph making efficiency and intelligentize of CAD system.

该文提出基于顺时针行走方向搜索外轮廓下一条路径和基于逆时针行走方向搜索封闭图形下一条路径的原理和算法，改进了以往算法的不足，对提高CAD系统的图形生成效率以及系统的智能化程度等方面有着重要的意义。

ABSTRACT To improve the parametric design method which is based on points, lines and circles, this dissertation presents the theory and methodology of parametric design which is based on relating-graph. The expression, organization, cyclic problem, covariation and extension method of relating-graph are studied.

针对当前二维参数化方法中存在的考虑线素较为简单、循环约束问题较难解决等一系列问题，本文系统地研究了基于高层次图素的关联图形的表达、关联图形的组织、关联图形循环约束问题的解决、关联图形的联动以及关联图形的拓广等方法。

It solves the problem that the unitary contour presentation can not correctly extract face contour in a face image which suffers from scale, rotation etc. The definition of the internal and external energy function is provided. At the same time, the global matching algorithm and local matching algorithm is given. The experiment shows that this presentation and the accompanying matching algorithm can be used to extract the face contour very well. So the image segmentation can be implemented by using it.②By analyzing the recognition principle of PCA method, we can conclude that the face images coming from different surrounding consist of different face image space. This is the essential reason that makes the generality of PCA method worse. Also, we give a measurement means to measure the distance from different face image space, so we can analyze face image space more conveniently.③We also construct various scale models and rotation pose models to detect the scale and rotating angle of face image to be recognized. The experiment results show that the detecting precision is very high. So it is good for face image feature extraction and face image representation.④Similarly, we construct local feature models of face image and utilize them to detect the local feature of face image. At the same time, we put forward a novel face image local feature detection algorithm, locating step by step. The experiment results show that this method can accurately detect the location of local face feature in a image.⑤A novel face image presentation model, dual attribute graph , is put forward. Firstly, it utilizes attribute graph to present the face image, then exact the local principal component coefficient and Gabor transform coefficient of thc pixels which corresponds to the nodes of the graph as the attribute of the nodes. This representation fully makes use of the statistical characteristic of the local face feature and utilizes Gabor transform to present the topographical structure of face image. So DAG has more general property.⑥Based on the DAG presentation, we give a DAG matching function and matching algorithm. During the design of the function and algorithm, the noise factor, e. g., lighting, scale and rotation pose are considered and tried to be eliminated. So the algorithm can give more general property.⑦A general face image recognition system is implemented. The experiment show the system can get better recognition performance under the noise surrounding of lighting, scale and rotation pose.

本文在上述研究的基础上，取得了如下主要研究成果：①构造了一个通用的人脸轮廓模型表示，解决了由于人脸图象尺度、旋转等因素而使得仅用单一轮廓表示无法正确提取人脸轮廓的问题，并给出了模型内、外能函数的定义，同时给出了模型的全局与局部匹配算法，实验表明，使用这种表示形式以及匹配算法，能够较好地提取人脸图象的轮廓，可实际用于人脸图象的分割；②深入分析了PCA方法的识别机制，得出不同成象条件下的人脸图象构成不同的人脸图象空间的结论，同时指出这也是造成PCA方法通用性较差的本质原因，并给出了不同人脸空间距离的一种度量方法，使用该度量方法能够直观地对人脸图象空间进行分析；③构造了各种尺度模板、旋转姿势模板以用于探测待识人脸图象的尺度、旋转角度，实验结果表明，探测精确度很高，从而有利于人脸图象特征提取，以及图象的有效表示；④构造了人脸图象的各局部特征模板，用于人脸图象局部特征的探测；同时提出了一种新的人脸图象局部特征探测法---逐步求精定位法，实验结果表明，使用这种方法能够精确地得到人脸图象各局部特征的位置；⑤提出了一种新的人脸图象表示法---双属性图表示法；利用属性图来表示人脸图象，并提取图节点对应图象位置的局部主成分特征系数以及Gabor变换系数作为图节点的属性，这种表示方法充分利用了人脸图象的局部特征的统计特性，并且使用Gabor变换来反映人脸图象的拓扑结构，从而使得双属性图表示法具有较强的通用性；⑥在双属性图表示的基础上，给出双属性图匹配函数及匹配算法，在函数及算法设计过程中，考虑并解决了光照、尺度、旋转姿势变化等因素对人脸图象识别的影响，使得匹配算法具有较强的通用性；⑦设计并实现了一个通用的人脸图象识别系统，实验结果表明，该系统在图象光照、尺度、旋转姿势情况下，得到了较好的识别效果。

By using the algebraic method, we obtain a new formula for the expected hitting time of random walks on strong-connected and aperiodic digrahs (irreducible and aperiodic Markov chain). From this formula, we obtain the explicit expressions for the expected hitting times of random walks on directed de Bruijn graph, directed Kautz graph and some graphs constructed from strong regular graph, etc.

利用代数方法给出了强连通非周期有向图上随机游动（即不可约非周期马尔可夫链）平均首达时间一个新的表达式，并利用这个表达式得到了有向de Bruijn图，有向Kautz图以及和强正则图相关的几类图上随机游动任意两点之间的平均首达时间。

By using the graph-theoretic method, the completion problems for a partial inverse Mmatrix with any order are discussed when its corresponding graph of the partial inverse M-matrix is a 2-chordal graph .

本文采用图论的方法对任意阶部分逆M矩阵，当其对应的图为2-弦图时，研究了其逆M矩阵的完备问题。

The classical cutting stock algorithm——column generation technology , and wrap up rectangle technology for abnormity are analyzed ; The development of AutoCAD with ObjectARX is studied and the generating method of cutting outline drawing and layout drawing were found out on the basis of analyses of the graph database structure of AutoCAD and the basic operation of it ; The process planning technology of plate material cutting orienting numerical control is studied a process planning method directly based on layout drawing is established ; The emulation technology in AutoCAD is studied and a kind of dynamic emulation method is put forward , which is realized by incrementally modifying graph entity ; The postposition of NC program of the integrated cutting system constructed on software plug-in is proposed , which can effectively solve the problem that it is difficult for a numerical control programming system to be common , which is caused by the difference of instruction format and control parameter between different type of numerical control machine .

分析了经典的矩形件优化排样算法——列生成法和针对异形件的矩形包络算法；研究了基于ObjectARX 的AutoCAD 开发技术，结合对AutoCAD 图形数据库结构及其基本操作的分析，给出了下料轮廓图和排样图的生成方法；研究了板材数控下料加工的工艺处理技术，建立了一种直接基于排样图进行的图形交互工艺规划方法；研究了在AutoCAD环境中的板材下料数控仿真技术，给出一种通过增量修改图形实体对象实现的动态仿真方法；提出以软插件技术构建集成下料系统的数控编程后置处理部分，能够有效解决因数控下料机床指令格式及控制参数不统一导致的自动编程软件系统不易实现通用性的问题。

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

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

The concept"attachable graph"and the enumeration method of pates and circuits on the graph are proposed. With the graph, the gear arrangement problem can be solved. The new method and procedure of GLM type synthesis are presented. With general type synthesis method, Attachable Linkage Kinematic Chain could be generated.

用一般平面连杆运动链类型综合的方法可生成ALKC，然后通过在ALKC上配置齿轮模块得到NGLKC，再在NGLKC上用一定方法设置焊点生成WGLKC，进而选取机架和原动件，即可完成GLM的类型综合。

With Death guitarist Schuldiner adopting vocal duties, the band made a major impact on the scene.

随着死亡的吉他手Schuldiner接受主唱的职务，乐队在现实中树立了重要的影响。

But he could still end up breakfasting on Swiss-government issue muesli because all six are accused of nicking around 45 million pounds they should have paid to FIFA.

不过他最后仍有可能沦为瑞士政府&议事餐桌&上的一道早餐，因为这所有六个人都被指控把本应支付给国际足联的大约4500万英镑骗了个精光。