连通度

In this method, first, the gray-scale image of the molten pool is obtained according to the fractal-based discrete Brown random field theory. Next, the connected domain is detected based on the binary morphology theory and is then used to remove the noise and obtain the target image. Moreover, the successive edges of the image are obtained by means of the Open-Close operation on the basis of the mathematical morphology theory.

该方法利用分形理论中的离散分数布朗随机场理论得到按分形维分布的熔池灰度图像，然后利用二值形态学中的连通域检测去除噪声并得到目标图像，进而利用形态学中的开运算和闭运算得到图像的强连通边界。

The Graphical Representations of Connected Cubic Arc-Transitive Coset Graphs of Minimum Degree on Projective Special Linear Group PSL2,p

特殊射影群PSL(2，p)的最小级连通3度弧传递陪集图表示论文标题：特殊射影群PSL(2，p)的最小级连通3度弧传递陪集图表示

A restricted edge-cut F of G is an edge cut such that G — F has no isolated vertex.

限制边连通度是计算机互连网络可靠性的一个重要度量。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

First, this method calculates the iteration step size with the average value of connectivity ,then it optimizes the local cost functions.

该算法首先根据网络的平均连通度确定迭代步长，然后对每个未知节点的局部代价函数进行优化求解。

We study the recursive structure of the twisted-cube connected network sufficiently, and prove that the twisted-cube connected network is an n regular graph with connectivity n: point out that the twisted-cube connected network is a cube-free network, which is an essential distinction with the hypercube and other variations of the hypercube; prove that the diameter of n dimensional twisted-cube connected network is [ (n+1)/2] , which is almost the half of hypercube's.

首先对其结构的递归性进行充分地研究，证明它是连通度为n的n正则图；指出扭立方体连接网络无立方体子图，这是扭立方体连接网络与超立方体及其其它变种的本质差别；证明了n维扭立方体连接网络的直径为[（n+1）/2]，它几乎是超立方体直径的一半；最后，给出超立方体及其变种的等价定义，并对它们的结构递归性、网络参数和拓扑性质等作了简单的分析、综合和比较。

The formatted method of rectangle NAM image representation reconstructed the ubiety of sub-pattern instance with five queues. It made connectivity operation between sub-pattern instances easier.

在对连通关系进行分类的基础上研究了子模式实例连通关系判断、连通关系搜索和连通关系遍历等基础操作，给出了各算法的时间复杂度分析。

Effective porosity is the porosity available to free fluids, excluding unconnected porosity and space occupied by bound water and disseminated shale.

有效孔隙度是指适用自由流体的空隙度，它不包括不连通的空隙度和周围水以及浸染泥岩占有的空隙度。

Using this algorithm, arbitrary two vertexes in a given undirected graph can achieve a required vertex-connected degree.

利用该算法可最优地将给定无向图中任意2点达到所要求的点连通度。

On the basis of above studies, the thesis forecasts rural highway total scale using land quotiety method, the synthesizing-quotiety method, the population density of economic method and connectedness method. Through the forecasted mileages open to traffic, it gains county and village network scale of Henan province, and then forecasts the total scale of county and village highway network and the grade frame of every town or city in Henan province.

在上述研究的基础上，本论文采用国土系数法、综合系数法、人口经济密度法、连通度法对河南省公路网总规模进行了预测，并通过对河南省公路网通车里程的预测，得到河南省县乡道和村道的公路网规模，进而预测了河南省各市的县乡道和村道的规模，同时对河南省县乡道和村道公路网的等级结构进行了预测。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。