连通数

These issues are mostly difficult to solve according to the general study of mathematical models, but the Monte-carlo method is very convenient for calculating Multiple Integral of low dimension in regular domain of integration or complex range or even non-connected region.

这类问题绝大多数按数学的研究处理模式出发，都是难以解决的，而蒙特卡罗方法对计算高维空间中维数不很高且积分区域是规则的积分、以及复杂区间甚至不连通的区域上的积分都却是很方便的。

To avoid a large volume of unnecessary network traffic, the broadcast algorithm based on connected dominating set can decrease the redundant messages by reducing the forwarding nodes.

为了避免由洪泛搜索方法引起的大量网络流量问题，基于连通支配集的广播算法BCDS通过减少转发节点来减少查询消息数。

With the experimental data, operation time of contour extraction of binary image represented by rectangle NAM is 0.31 to 0.86 times of that of image represented by matrix, operation time of Euler number computing of binary rectangle NAM image is 0.11 to 0.63 times of that of the pattern algorithm, operation time of connected component labeling of binary image represented by rectangle NAM is 0.08 to 0.37 times of that of image represented by matrix, 0.05 to 0.12 times of that of image represented by quadtree.

实验数据表明，采用矩形NAM表示的二值图像轮廓提取算法的执行时间是矩阵表示的0.31至0.86；矩形NAM表示的欧拉数计算执行时间是模板算法的0.11至0.63；矩形NAM表示的连通区域标记算法执行时间是矩阵表示的0.08至0.37，四元树表示的0.05至0.12。

Factors with prescribed properties such as factors including or excluding some given edge, maximum or minimum factors, factor covering and connected factors; 3. Factorizations of graphs; 4. k-extendable graph and its generalizations. Fractional graph theory is a relatively younger research branch.

例如，因子与图的最小度，韧度，联结数：邻域并等参数之间的关系；2·研究图的有限制条件的因子，例如，有约束条件的因子，图的连通因子，图的最大最小因子；3·图的因子分解；4·k-可扩图及其推广等。

One is theexplicit formula for strict-connected acyclic hypergraphs:〓where a=r-d,m=/a;the other is the recurrence formula for linearacyclic hypergraphs:〓where the numbers of r-1 and r in the multinomial coefficient are j and krespectively,〓 and 〓.

一个是关于严格-维连通无圈超图的显式公式：〓其中a=r-d，m=/a；另一个是线形无圈超图的递推公式：1=〓其中r-1与r在多重组合数中的重数分别是j与k，〓且f(0，r)=1。

In this article, a algorithm CCN is put forward to study the crossing number. It is a very important development in graph planarity issue after planarity-determinant algorithm and embedding algorithm.

本文首次给出了较好的计算图的交叉数算法CCN，这是继图平面性判定算法，二连通图的平面嵌入算法之后在图的平面性问题上的一个最重要的进展。

By this equality,we prove that the amplitude of a compact DG module M over a cohomologically bounded DG algebra A is just the sum of the amplitude of A and the projective dimension of M.

对于一个同调有界的连通DG代数上的紧的DG模，我们由此等式可得其振幅与DO代数的振幅的差恰是它的投射维数。

The four sets of stator bars including those retired from three large generators and the standby bar subjected to Dynamic Mechanical Analysis, Scanning Electron Microscopic and optical microscope observation. It was revealed from DMA that the peak value tan d m of mechanical loss thermogram tan d ~ T shift toward a higher temperature and a lower amplitude, indicating that the amount of movement monomers diminished greatly in the insulation aging process, the tan d 195, increased very slightly with the service time of insulation, showing the degrading of bonding properties at interface, and the presence of more defects in insulation. The observation of SEM and optical microscope showed that more and more voids appears in insulation, and delamination was formed due to development of voids in aging process.

对不同运行年数的线棒进行了 DMA 、 SEM 、光学显微镜等微观分析试验，动态力学分析发现(参见 Hao et al， CEIDP， 2002：404)，力学损耗温度谱 tan d ~ T 的峰值 tan d m 随老化时间向高温、低值方向移动，表明促成环氧发生玻璃化转变的活性侧基或发生局部运动的活性链段减少，分子链的刚性增强；195℃的力学损耗 tan d 195随老化时间有缓慢增大的趋势，表明有更多的能量耗散在界面处，界面的粘合性变差，甚至由于界面粘结不良出现微观缺陷； SEM 和光学显微分析发现(参见 Hao et al-2， IEEE DEI， 2003)，老化后的绝缘气隙增多，随着老化时间气隙不断扩展或相互连通，绝缘逐渐分层。

The theory of graphs and relations between the spectra and fixed variate (e.g. chromatic number, degree sequence, diameter and connectivity) of graphs by means of the well-developed theory and technique of algebra, topological structure properties of graph, combination and matrix theories so as to establish firm essential relation between the algebraic properties and topological properties of graphs and networks.

图谱理论的研究主要是利用成熟的代数理论和技巧，并结合图的拓扑结构性质和组合数学的理论、矩阵理论来研究图谱及其与图的结构性质、图的其它不变量(如色数，度序列，直径，连通度等)之间的关系，将图与网络的代数性质与图的拓扑性质紧密地联系在—起。

So our definition is a kind of DG generalization of the global dimension of connected graded algebras.

因此我们的定义是连通分次代数整体维数的一种推广形式。

For a big chunk of credit-card losses; the number of filings (and thus charge-off rates) would be rising again, whether

年美国个人破产法的一个改动使得破产登记急速下降，而后引起了信用卡大规模的亏损。

Eph. 4:23 And that you be renewed in the spirit of your mind

弗四23 而在你们心思的灵里得以更新