In the third part , we discuss " " adjacent - vertex distinguishing edge colorings " . we obtain the adjacent - vertex distinguishing edge chromatic numbers with the first moment principle 第三部分主要讨论了邻点可区别的边染色这一概念，用第一矩量原理， markov不等式以及几种形式的lov (
A new algorithm is presented for feature line extraction through controlling the angle deviation of element normal . a method is presented to extract rounding feature on shell meshes , according to curvature characteristic of rounding surface 提出了一种在邻点范围内搜索连接特征边的方法,根据单元法矢夹角识别出特征边,连接特征边得到特征线。
And we provide a rule to set the parameter of the algorithm . a new method to solve hammerstein model using tabu search is also introduced . the conception of searching area is defined and the strategy of choosing neighboring points is given 本文提出了一种利用改进型禁忌搜索算法来解决hammerstein模型辨识问题的方法，定义了搜索域空间，给出了邻点确定策略，提出算法流程，并通过大量的仿真实验，得出针对hammerstein模型合适的禁忌列表长度，可能解列表长度，以及合适的被划分邻域的数目。
We construct the algorithm of three - dimensions model surface reconstruction in three stages : first , we use oct - tree to describe scatter data points in space , second find adjacent points and tangent plane and use the triangulation method to realize 3d surface reconstruction in the end , in research on algorithm of three dimensions model surface reconstruction based on scatter data points 在“基于散乱数据三维表面算法的研究”这一章中，首先通过八叉树的数据结构的算法对三维散乱数据进行处理，然后再确定邻点和微切平面，最后用三角网格化的方法完成三维物体表面重构。
In section 4 . 2 we analyze its main idea and algorithm in detail , two relevant theorems included ; section 4 . 3 provides plenty instances so to explain its nonlinear dimension reduction ability , section 4 . 4 propose a combined method that integrates the advantage of various methods . in section 4 . 5 we analyze some significant problems in lle , including the locality of manifold representation , the choice of the neighborhood , the intrinsic dimension estimation and the parametric representation of mapping . in section 4 . 6 we design an algorithm for estimating the intrinsic dimension in the base of locally linear approximation and discuss the choice of its parameters 第四章是本文的重点内容，研究一种全新的非线性降维方法? ?局部线性嵌入方法，对它的思想和算法进行了详细的分析，给出算法两个相关定理的证明；第三节对比主成分分析，通过实例说明局部线性嵌入方法的非线性降维特征；第四节在此基础上提出了旨在结合两者优势的组合降维方法；第五节提出了局部线性嵌入方法中存在的若干关键性问题，包括流形的局部性、邻点的选择、本征维数的估计和降维映射的表示，第六节基于局部线性近似的思想提出了一种本征维数的估计方法，设计了实用算法，结合实例对算法中参数的选取进行了讨论；最后一节提出了一种基于局部线性重构的图形分类和识别方法，将其应用于手写体数字的图像分类识别实验，实验得到的分类准确率达96 . 67 。
Seven years later more than 1000 research papers had been published on dominating sets and related sets in graphs , and the field is steadily growing . in this paper , we discuss the relationship between the total domination number and the least domination number . the total domination number of a graph g is the minimum cardinality of a dominating set of gsuch that every vertex in v has at least one neighbor in d . the least domination number of g is the minimum cardinality of a dominating set of g whose domination number is the minimum 图g的全控制集是满足v中每个点都至少有一个邻点在其中的控制集，而g的全控制数_ t ( g ) = nin { / d / | d是g的全控制集} ；图g的小控制集是满足其控制数在所有g的控制集中达最小的控制集，而g的小控制数_ l ( g ) = min { | x | | x是g的小控制集} 。
In the research of flooding arithmetic , at first , we analyse the flooding efficient , robustness by the 3 - neighbor , 4 - neighbor and 6 - neighbor ’ s wsn . so we extend to the n - neighbor ’ s wsn . we give the formula about area of wsn ’ s deploy , count of wsn ’ s node , max distance of communications and average of neighbor ’ s count , and validate this formula by the simulate program . in the last , we analyse the flooding arithmetic ’ s lose rate , data efficient rate , energy efficient rate , network life , delay time by the simulate program 在洪泛算法研究中,首先针对3 -邻点、 4 -邻点和6 -邻点的无线传感器网络分析了洪泛效率、网络健壮性,然后推广到n -邻点的无线传感器网络中,并给出无线传感器网络部署面积、节点个数、最大传输距离、和平均邻点数之间的经验公式,并用仿真程序进行了验证。
