查询词典 connection graph

However, the traditional way cannot satisfy the practice requirement with slowly efficiency, difficult to design graph, data and graph discretely and so on.

但是传统的研究方法效率较慢，制图困难，数据与图形分离等，不能满足实际需求。

The model was preprocessed to assure the regulation of facets, create the dual graph of it, and then adapt Reeb Graph to extract the skeleton which contains enough information of the model, such as gesture and topological features, to be able to be used as descriptor of 3D model retrieval.

通过对模型进行一定的预处理保证面片的规则，定义面片间距离计算方法，创建模型的对偶图，识别连通分量，在连通分量上应用Reeb图的计算思想抽取原模型的骨架。试验表明，该算法具有较好的计算效果和效率，最终的骨架保存了模型的拓扑连通性以及姿态，可用于基于内容的三维模型检索时的特征描述符。

According to the Marr's visual theory, a novel face image presentation model, dual attribute graph , is put forward in the thesis. Each node of the graph has two attributes, local principal component coefficient and Gabor coefficient. So the presentation of face image can be converted from gray level to more high level.

根据Marr的视觉表示理论，本文提出了新的人脸图象表示形式---双属性图表示，属性图中每个节点有两个属性特征，局部主成分系数特征以及Gabor系数特征；从而将人脸图象的灰度级表示，转化为更高一级表示。

Kinematic and kinetic analysis problems are discussed using topological graph and signal current graph. Research on the generality of EGTs is completed elementally and the occurrence condition of circulated power in EGTs is derived.

8运用拓扑图和信号流图探讨运动学和动力学分析的问题，初步完成对周转轮系的共性方面的研究工作，讨论了周转轮系的循环功率产生条件。

Knauer in 1990 first defined the endomorphism spectrum and the endomorphism type of a graph to study the algebraic structure which is put on a graph by this various endomorphisms.

德国数学家Knauer于1990年在文献[1]中首次提出了自同态谱和自同态型的概念，目的是通过图的各种不同的自同态来研究图的代数结构。

This paper shows that if graph G is 2-connected, we may just use Euler"s formula and the graph"s structural

本文指出，对于2-连通图，只用欧拉公式和图的结构性质就能证明这些以及其它的一些结果。

Ava Universal Network/Graph Framework - JUNG provides a common and extendible language for the modeling, analysis, and visualization of data that can be represented as a graph or network.

UNG 提供了一个公共的可扩展的语言来建模、分析和可视化数据，数据可以通过图形或网络来提供。

In the framework of graph embedding, it shows that the proposed algorithms have correspondingly extensional type of graph embedding and applicability.

在图嵌入框架下，对本文提出的算法进行了分析和比较，表明了提出的算法具有相应的图嵌入扩展方式和适用性。

This paper introduces basic concepts, representation methods and practiCal applications of computer internal division graph and external divistion graph, and presents a linear mapping method of representing internal divisio.

计算机内插图形和外插图形是计算机图形学中由图形生成图形的两种基本方法，用该方法可以生成许多有趣的图形、图案，在计算机动画模拟图案设计中有着广泛的应用。

In section four, by researching the properties of Kneser graphs, we construct the homomorphism φ between the Kneser graph and the outerplane graph. So the fractional chromatic number and chromatic number are obtained.

在第四部分中通过对Kneser图的一些性质的考察，在Kneser图与外平面图之间建立同态关系，从而得到了外平面图的分数色数与顶点色数。

Must have Coordination and negotiation skill, flexible ideas, and be punctilious person.

必须具备较好的协调与谈判能力，头脑灵活，工作认真仔细

Result: 18 patients are all with simple eye.The pigment mole lies in nasal and temple sides of the ball conjunctiva,in which 2 lie in lacrimal caruncle and semilunar plica.

结果：18例患者均为单眼，色素痣大多数位于内外侧睑裂部球结膜面，2例位于泪阜及半月皱襞，经激光治疗后，10例色素痣消失，有5例行再次激光后消失，2例行第三次激光后消失，1例第四次激光后消失。