连通度

Here we main concern about the equicontinuity of a Graph( i . e., one ? dimensional connected compact branched manifold).

本文主要研究图（即一维紧致连通的分支流形）上的连续自映射的等度连续性。

This result generalized theconnected sum theorem about Donaldson invariants.

Kametani的简单不变量的环面连通和结果推广到度为1的SO（3）不变量情形。

We establish an asymptotic Lipschitz homotopy invariance theorem for these K-homology groups and K-theory groups. We show that the asymptotic index maps are isomorphisms for the asymptotically scaleable spaces, which include Euclidean cones, simply connected complete Riemannian manifolds with nonpositive curvature.

我们证明了这些K-同调群和K-理论群具有渐近Lipschitz同伦不变性；对于渐近可标度的几何空间（包括欧氏锥、单连通非正曲率完备黎曼流形等），证明了渐近指标映射为同构。

In the layout analysis, we chose a bottom-up algorithm based on nearest neighbor connect-strength and line confidence to segment the image area, table area and text area; In the printed Chinese character recognition module, we calculate the degree of incorporative difference to match the character, also define a refusal class which could orientate the mathematical expression automatically; Put the expression into the formula processing module, then we chose the character segmentation method based on connectivity and the template match method to recognize the character in the mathematical expression and at last we used the structure analysis based on the character to transform the two dimension formula into one dimension Word EQ expression.

在版面分析中，采用基于最近邻连接强度和行列可信度的自底向上的版面分析算法，分割出图像区域、表格区域和文本区域；在汉字识别模块中，采用回溯切分方法切分出字符段，计算合并差异度与特征字典比较，通过引入汉字的拒识类，从而实现了公式的定位；将定位后的数学公式送入公式识别器，在公式识别器中采用基于连通域搜索的字符分割方法和模板匹配方法对字符识别，对于识别出的字符，再采用基于特征字符的结构分析方法，从而将二维的数学公式转化为一维的Word EO域语句。

A configuration is a connected cluster of vertices of a plane graph together with the degrees of the vertices.

一个构形是面图的一连串连通的顶点与这些顶点的度。

A scanline algorithm for area filling with pushing span -ends has good efficiency but also a shortcoming that one class of special connected fields cann′t be filled completely by this algorithm .

针对压入区段端点的区域填充扫描线算法有可能出现的漏填，分析了漏填现象产生的原因，并在不增加算法复杂度的情况下提出相应的改进办法，给出了具体的算法流程，从而实现了对任意4-连通区域的正确而快速的填充，而且该算法的运行效率比递归种子填充算法以及经典的扫描线种子填充算法有明显提高。

By the means of combinatorial matrix, the relation between minimum degree of connected graph and upper bound of spectral radius was carefully depicted.

利用组合矩阵方法，精细地刻画出连通图的最小度与谱半径的上界之间的关系，在一定条件下改进了以前的一个结果。

The Trefoil knot, a main exhibit in the middle of the hall, is 10 meters wide, 12 meters high, with bandwidth of 1.65 meters. It is made from triangular prism band.

三叶纽结整体宽度10米，高12米，带宽1.65米，是由一条三棱柱带经过三次盘绕，将其中一端旋转120度后首尾相接，由此构成三面连通的单侧单边三叶纽结造型。

The results prove that T*1 S-closed space and T2 S-closed space are identical and that the regular S-closed space and normal S-closed space are the same. Therefore, to make T*1 space X become the complete conditions of S-closed space is the X extremely unconnected H-closed space, while S-closed space X can be measured as the complete condition X of S-closed T1 normal (A1) space.

首先讨论了S-闭空间的分离性，证明T*1型的S-闭空间与T2型S-闭空间是相同的，正则的S-闭空间与正规的S-闭空间是相同的，从而得到要使T*1型空间X成为S-闭空间的充要条件是X为极不连通的H-闭空间， S-闭空间X可度量化的充要条件是X为S-闭的T1型正则(A1)空间。

In this thesis we discuss the properties of Wiener Index and degree Distance of connected graphs with order n.

本文主要研究n阶连通简单图的度距离和Wiener指数的性质。

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.

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