点图

Dominating set is an important concept in graph theory, which is defined as an a vertexsubset such that every other vertex not in it must be adjacent to some vertex in this subset.

控制集是图论中的重要概念，它定义为图中的一个点集，使得图中其它任何一点都与该点集中的某点相邻。

In this dissertation, we shall study the incidence coloring ofθ- graph, then we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs and determine the adjacent vertex distinguishing incidence chromatic number of some graphs.

本文研究了θ-图的关联着色，定义了图的邻点可区别关联着色及邻点可区别关联色数并确定了几类图的邻点可区别关联色数。

A new concept on the continuously distributed directional image/field and the method to compute it in the fingerprint images are proposed,which exhibits not only good continuity,well gradualness,and excellent robustness to the noises,but very high precision,as well.

本文提出了指纹连续分布方向图的概念及其算法，连续分布方向图具有很好的连续性、渐变性、抗噪性和较高的精确度；对经典的PoincaréIndex计算公式和指纹奇异点检测算法进行了改进，改进后的PoincaréIndex不仅能精确表示向量场的旋转角度，而且还能精确表示向量场的旋转方向，能够在像素级水平精确定位指纹奇异点(core点和delta点)。

This method bases on distance transformation in Euclidean metric with the computational complexity of O(2+kn,and is the same with non-Euclidean metric space.

基于欧氏空间中离散点集的2阶V图距离变换原理，论述了栅格形式下离散点集和一般点集图形的2阶V图生成的方法，确定了它的时间复杂性为O(2+kn，适用于欧氏及非欧度量空间的自然图形2阶V图构造。

Based on the traits of dyadic wavelet decomposition of signal and that of the distribution of wavelet image coefficients, PLVQ and ZR are conjoined by making use of D\-4 lattice. Firstly, Pyramidal lattice vector quantization is adopted to quantize wavelet image coefficients. Nonzero lattice vectors and zero lattice vectors are formed. Secondly, nonzero lattice vectors are dealt with by adopting complex entropy coding. Finally, in order to fix on the position of nonzero lattice vector effectively, that is, to deal with zero lattice vectors effectively, the concept of significant map is introduced into. The significant map is scanned two times from down to up and from up to down.

根据信号的二进小波分解特点和小波图象系数的分布特点，利用D\-4格将PLVQ和零树结合起来，提出了一种基于零树和金字塔格型矢量量化的小波图象编码方法，该方法首先采用金字塔格型矢量方法来量化小波图象系数，以得到非零格点和零格点；然后采用复合熵编码来处理非零格点；最后为了有效确定非零格点的位置，也就是为了有效地处理零格点，又引进了重要图的概念。

Based on long term study, we put forward new algorithm of recognizing fingerprint directional diagram: the iterative algorithm based on model, which revises the singular points (central point and triangulation point) and fingerprint directional diagram through local and global iteration. Hence, the algorithm can recognize the directional diagram and singular point more accurately and can extract detail features more accurately.

经过长期的研究，我们提出全新的判别指纹方向图算法：基于模型的迭代算法，通过局部和全局反复迭代修正图像的奇异点和指纹方向图，更能准确地判断指纹方向图、奇异点，从而更能准确地提取细节特征点。

In fact, on one hand, it is often found that two graphs with the same number of verticesand the same connectivity(edge-connectivity) may result in entirely different forms after a minimum disconnecting set of vertices is removed, one may be totally disconnected while the other may consist of a few very stable components, and thus be much easier to reconstruct.On the other hand, we often face this question: how easily can we disrupt a system at the least cost, on the contrary, when we set up a system, especially a communication system, we try our best to make it as stable as possible that it can be reconstructed easily if it do get disrupted .

对于两个具有相同点数，具有相同点连通度的图，从图中分别去掉使图不连通的点集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。

In chapter 4, we studythe cyclic edge connectedness of regular half vertex transitive graphs, we showthat a connected k(≥4)-regular half vertex transitive graph X with girthg≥6 isλ_c-optimal, and we also obtain a su?cient and necessary conditionfor a connected k(≥4)-regular half vertex transitive graph X with girth 4 tobeλ_c-optimal.

第四章，我们研究了正则半点传递图的圈边连通性问题，主要结果是证明了一个围长为g≥6的k(≥4)-正则连通半点传递图X是λ_c-最优的，并且得到了一个围长为g = 4的k(≥4)-正则连通半点传递图X是λ_c-最优的充分必要条件。

Compared with methods appeared in literatures, our algorithm, with high accuracy, sensitivity and correctness, complete adaptively the correct distinction between interferential fringes and backgrounds. In chapter four, methods for the computer operatable description of line and region features are discussed, which contains: Computation curve's curvature in quantity, Fringes' separation distance , Contour's smoothness of region, Similarity of varied curves.

在第三章中，本文研究的是以线条为直接目标的图象分割方法——条纹抽取，在研究分析了许多条纹抽取方法以后，针对激光全息焊点缺陷检测这一课题中的复杂数字光学图象LHII条纹抽取进行了多方面的研究，主要有：分别从点对应、邻域特性对应推导并提出了几个信息分离算法；结合光学图象形成方面的知识，提出了变周期余弦分割二值化方法；结合当前条纹走向、毗邻条纹走向及可靠条纹点约束条纹跟踪，在许多方面，改进并发展了常规的条纹跟踪算法，实现了无人-机交互的全自动条纹跟踪抽取。

In the special case when G = AutX, we call a G—vertex-transtive graph, G—edge-transtive graph, G—semisymmetric graph X is vertex-transtive edge-transtive semisymmetric graph respectively In this paper we investigate the autmorphism graph AutX of the cubic semisymmetric graph of order 12p ,when p is primes.

特别地，若G=AutX这时的G-点传递图、G-边传递图、G-半对称图称为点传递图边传递图半对称图。

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.

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