子图

Feature of principal lines spatial distribution: detect the principal lines through edge detecting technology, and then divide the image of palmprint into blocks with same dimension, compute the mean and variance as feature; Feature of palmprint direction: divide the image into sub-images; compute the max angle of projection and coordinate of each sub-image, which stand for the direction and location of the line on the palm; Feature of moment invariants: compute the moment invariants of each sub-image and the whole image as feature.

掌纹主线空间分布特征：利用边缘检测技术检测出掌纹的主线，将图像分割成相同大小互不重叠的子图，提取每一个子图的均值和方差作为特征；掌纹线方向特征：将图像分成不重叠的子图，利用Radon变换求出每一个子图的最大投影角度和坐标，也就是子图内掌纹线的方向和位置，构造特征向量；掌纹不变矩特征：提取图像整体和分割后的子图的不变矩作为特征。

In this chapter, we give out the definitionsof Cartesian product, composition, union and join for two L-graphs, which aregeneralization of the corresponding operations in graph, and the necessary conditionsthat a partial L-subgraph of these operations can be obtained by the same operationfor some partial L-subgraph of the given two L-graphs are investigated.

本章定义了两个L-图的笛卡尔积运算、合成运算、并运算和联运算(它们是图中相应运算的推广)，并研究了这些运算的部分L-子图可以由这两个L-图的部分L-子图通过相应的运算生成所需要的条件。

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]上的分布情况。

Graph theory and topology was researched to establish graphic interpreter, boolean multiplication ⊙ of a matrix is inferred and defined, and simple sub-graphs are disconnected from complex graph by the multiplication ⊙; parameterization of graph is realized through a sequence of sub-graph entities linked by constraints.

研究了图形翻译器的图论和拓扑学理论基础，推出并定义了矩阵布尔乘运算〓，使用矩阵运算〓将复杂的图形拆分成一系列简单子图；以约束关联的子图实体序列实现图形的参数化。

Firstly, we give out the definitions of L-graph and partial L-subgraph, and we ob-tain some properties of partial L-subgraphs. Secondly, continuous mapping is intro-duced respectively between L-graphs and between L-cotowers, and the relationshipbetween the category L-FG of L-graphs and the category FG_L~C of L-cotowers isstudied. At last, we study the finite topological property of the category L-FG, andgive out the concrete constructions of finite product and finite coproduct.

本章首先给出了L-图和部分L-子图的概念，得到了部分L-子图的若干性质；其次，给出了L-余塔的概念，在L-图之间和L-余塔之间分别引入连续映射，研究了L-图范畴L-FG和L-余塔范畴FG_L~G之间的联系；最后，研究了L-图范畴L-FG的有限拓扑性质，给出了L-图范畴L-FG的有限积和有限余积的具体构造。

In this approach ,the sketch is designed with simple elements such as points , segments, circles or Child-Graphs which is combination of above simple elements ;geometric elements is designed in sequence can implement the function of unwell defined(less-constrain) parametric design.2Dand 3D constrains is treated consistently.

不同于常见的用底层图元进行设计的二维全约束求解方法，提出并实现了一种基于子图的序列化草图设计方法。使设计者既可用通常的点、线、圆弧等的基本图元，又可用高层的子图设计，可加快设计过程；序列化设计求解方法可实现变量化设计；基于标识的约束模型，使该方法可统一二、三维约束求解。

Then, by taking the local features provided by users as portions of the AAG, and the whole CAD model as the whole AAG, the problem of local feature matching is transformed into that of subgraph isomorphism. Subgraph isomorphism is a NP-complete problem.

在局部匹配过程中，用户输入的局部结构被表示成"子图"，待匹配的整体CAD模型被表示成"大图"；则在整体CAD模型中，检索局部结构的问题就被转换成在"大图"中寻找同构"子图"的问题。

The expression of assembly structure based product structure labeled graph is proposed.The module partition method based on frequent subgraph mining is presented,and Apriori algorithm is applied to build the mapping between frequent subgrahs and product family modules.The structural correlation method of product family is presented,which includes the predefinition of the assembly structure of product family,the definition of the configuration relationships among producy family modules and the definition of the parameter correlations among producy family modules.

以成熟产品设计实例为分析对象，利用产品结构标号图描述其装配结构；提出基于频繁子图挖掘的产品族模块划分方法，建立频繁子图到产品族模块的映射关系；研究了产品族结构关联方法，包括产品族装配结构预定义、产品族配置关系定义和产品族参数关系定义。

The tree T=is a bichromatic tree subgraph in a maximal plannar graph G, in which the subgraph induced by V_t is a tree and T is a component of some bichromatic subgraph Gij of some 4-coloring of G.

极大平面图G=中的一个二色树子图T=，其Vt在G中导出子图为树，并且图G存在至少一个四着色C，使T是该四着色一个二色子图的一个连通支。

According to the topology of real network 's not always being close in , an improved disjointing algorithm for calculating the reliability of networks is put forward .

本文针对现实的网络图的非封闭性特点，对计算网络可靠性的不交化算法进行了改进，其主要思想就是根据网络图的最小路集把网络图分解成若干子图，求出这些子图各自的最小路集并对它们进行不交化运算求出所有子图的可靠性，进而求出整个网络图的可靠性。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。