连通数

词组短语

Betti number

与连通数相关的网络例句 [注：此内容来源于网络，仅供参考]

In the last, we give a new upper bound of the algebraic connectivity about the dominate number.

最后给出了图的代数连通度关于独立数的一个新的上界。

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

We give a purely algebraic method to add uniton numbers for harmonic maps from a simply connected domain into the unitary group.

对于从单连通区域到酉群的调和映射，我们给出了一个增加酉子数的纯代数方法。

A simple connected graph is called bicyclic if it has n vertices and n + 1 edges.

双圈图是指边数等于顶点数加1的简单连通图。

On the other hand, Let M~n be an z-dimensional complete noncompactoriented submanifold with finite total curvature in an-dimensional simplyconnected space form F~ of constant curvature c. In this thesis, we provethat if M satisfies one of the following: n≥3, c=0 and integral from n=M H~n＜∞;n≥5, c=-1 and H＜1-2/n~(1/2); n≥3, c=1 and H is bounded, where Hdenotes the mean curvature of M. then the dimension of the space of L~2 harmonic1-forms on M is finite.

本文还证明：若具常曲率c的完备单连通空间型F~中具有有限全曲率的n维完备非紧可定向子流形M满足下面条件之一：n≥3，c=0且integral from n=M H~n＜∞；n≥5，c=-1且H＜1-2/n~(1/2；n≥3，c=1且H有界的，则M上L~2调和1-形式空间的维数是有限的，这里H为M的平均曲率。

The complexity of connectivity search at the worst situation is O, N is the side length of image. The complexity of connectivity ergod is O, N_q is the number of sub-pattern instances.With the connectivity operation of sub-pattern instance, contour extraction, Euler number computing and connected component labeling of binary rectangle NAM image are researched.

以子模式实例的连通关系处理算法为基础，分别研究了基于矩形NAM图像的二值图像轮廓提取、欧拉数计算、连通区域标记等图像运算，给出了具体的算法和分析，并将其与流行的基于其它图像表示的同类相关运算进行了比较。

Based on investigating the short and intermittent structural plane, surrounding rockmass of the huge underground powerhouse in Three Gorge has been divided into five statistical similar areas according to its characteristic of rockmass structure by applying structure plane network simulation. Distributed characteristic of structural plane has been studied and based on it mechanics macrocharacteristic has been studied:(1) It is the first time that based on the result of structural plane network simulation rockmass quality of every structure area has been studied with applying blurred information optimum seeking technique and be compared with and RQD method. The result indicated that it has better effect to evaluate rock quality with blurred information optimum seeking technique.(2) It is the first time that the interrelated relationship of the result of in-suit rockmass deformation test and fractal characteristic of structure on test point has been applied to determine rockmass deformation parameter. The question of evaluating deformation parameters of engineering rockmass has been solved.(3) Anisotropy strength parameters have been determined by applying shear zones simulating method. The result indicated that there are different strength parameters in every structural area, after comparing the result of Fast Lagranian Analysis in continua number simulation method with that of method of weighted mean according to continuity. The result indicated that when a suitable reduction coefficient is been considered rockmass strength parameters can be simply and fast determined with method of weighted mean according to continuity where there is not enough test result.(4) Damage characteristic has been studied based on analysis fractal characteristic of structural plane network by applying fractal-damage coupling method. It is the first time that the concept of damage degree has been set up to evaluate rockmass quality according to the biggest principal damage.

通过对短小、断续性结构面统计特征的研究，将地下厂房区划分为五个岩体结构统计均质区，应用结构面网络模拟技术研究了各个岩体结构均质区结构面的发育分布特征，并以此为基础对岩体宏观力学特性进行了深入研究：(1)首次通过在结构面网络模拟计算结果的基础上，应用模糊信息优化技术研究了厂房区各个岩体结构分区的岩体质量并与岩体基本质量指标研究法、岩体质量指标RQD值研究法作了对比，结果表明以结构面网络模拟结果为基础，应用模糊信息优化技术进行岩体质量评价能够取得很好的效果，解决了工程岩体质量的定量评价问题；(2)首次通过对已有的现场大型岩体变形试验结果的分析及相应试验点岩体结构分形特征的研究，建立了结构面分布的分形维数和岩体变形指标间的相关关系，并首次应用这种相关关系根据结构面网络模拟及分形维数计算结果确定了缺少试验结果的地下厂房各工程部位的岩体变形指标而且应用于围岩稳定性计算，解决了工程岩体宏观变形参数的评价问题；(3)应用在结构面模拟网络图上模拟岩体剪切破坏带的方法，得出了岩体在不同方向上的强度参数，结果表明岩体的强度特性与结构面的发育方向和程度有着明显的关系，各个岩体结构均质区具有不同的强度参数；同时还通过应用拉格朗日差分法对岩体强度指标的数值分析并与按连通率加权平均计算法对比表明，按连通率加权平均计算法在考虑合理的折减系数情况下，可以简单快速地对缺少现场大型试验结果的具体工程部位实现岩体强度指标的估计，通过以上研究解决了工程岩体抗剪强度参数的评价问题；(4)通过结构面网络分形维数的研究，应用分形损伤耦合分析方法，研究了厂房区岩体的损伤特征，并首次引入"损伤度"的概念，建立了应用最大主损伤评价岩体质量的指标体系。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

Let G be an undirected, simple and connected graph.

最小限制边割所含的边数称为G的限制边连通度(有向图的限制边连通度可类似给出)。

The global dimension of a connected graded algebra equals to the global dimension of it viewed as a DG algebra with zero differential.

任意一个连通分次代数，如果将它视为微分为0的连通DG代数，其左整体维数与其作为连通分次代数的整体维数是一致的。

与连通数相关的网络解释 [注：此内容来源于网络，仅供参考]

betti number：连通数

Betterton-Kroll process 贝特顿-克洛耳法 | Betti number 连通数 | betti reaction 贝蒂反应

multiply connected region：[数]多连通区域

dobsonfly 蛇蜻蜓(翅色灰白,其幼虫常用做钓饵) | multiply connected region [数]多连通区域 | crystal packaging 晶体封装

traverse：遍历

想想:我们需要存储所有的输入对记录,有新的对以后,遍历(traverse)它们并判断. 下面是我最初的思路: 1、 保存整数对到数组ipair[m][n](矩阵和图总是有很多的联系),1为连通,0为不同. 2、 接受新的输入对p-q,检查其对应位置ipair[p][q]是否为1,

betti number：连通数

Betterton-Kroll process ==> 贝特顿-克洛耳法 | Betti number ==> 连通数 | betti reaction ==> 贝蒂反应

betti reaction：贝蒂反应

Betti number ==> 连通数 | betti reaction ==> 贝蒂反应 | Betti reciprocal theorem ==> 贝蒂互易定理

dobsonfly：蛇蜻蜓(翅色灰白,其幼虫常用做钓饵)

hypnotise <主英> hypnotize | dobsonfly 蛇蜻蜓(翅色灰白,其幼虫常用做钓饵) | multiply connected region [数]多连通区域