连通

By using a perfect data structure, automatic generation of triangle mesh on multi-connected plane domain becomes as simple as simply connected plane domain first time without virtual line and other technical.

本文采用合理的数据组织结构，首次在不添加辅助线和不增加编程难度的前提下，使多连通域的剖分和单连通域的剖分有机地结合到一起，简单自然地解决了多连通域的三角剖分问题。

If k = 2 and the graph G corresponding to the wireless sensor network is (l+ max{1,l-4})-connected, or k≥3 and G is l(k-1 + 1-connected, then we can find k disjoint sets each of which completely covers all the targets and remains connected to one of sinks.

当k=2并且网络所对应的图G是(l+max{1，1-4})连通的，或者当k≥3并且G是l(k-1+1连通时，我们能够肯定找到k个不相交的节点集合，每个集合中的节点能够完全覆(来源：ABC929c92论文网www.abclunwen.com)盖所有的目标，并且与网关节点连通。

We also include the distributions of surface tension,gravitational acceleration,and viscosity to the whole flowing procedure in dynamicfluid equations.

数值例子中，我们不仅捕捉到了分界面在运动过程中的拓扑改变，如从多连通变为单连通，再分裂为多连通等，分界面的扭曲、合并、形成射流等大变形，还在流体力学方程组中添加了反映分界面性质的表面张力、重力、粘性项。

In order to overcome the handicap to extract line-segments from natural hand-printed Chinese characters, the extension is made to other structural features, and the generalized connected background region is defined, and its extraction and recognition algorithm are developed. This recognition algorithm is based on matrix singular decomposition and invariant transformation theory.

针对从自然手写体汉字中难以提取到笔段特征的难题，对汉字的其它结构类特征进行了扩充，提出了汉字的广义背景连通域的概念，并给出了提取广义背景连通域特征的算法以及基于矩阵奇异值分解与不变性变换的广义背景连通域特征的匹配算法。

Similarly, a graph X is said to be hyper-connected if every minimum vertex cut creats two components, one of which is an isolated vertex. In [8], D.Wang and J.

类似地，一个图X称为是超连通的，如果对每一个最小割集C，都有X—C只有两个连通分支，且其中一个连通分支为孤立点。

Chapter 3, we study the stability of approximate solutions of nonlinear equation problems(the continuous function is defined in the linear normed space).We prove that most of approximate solutions of nonlinear equation problems are stable; all accurate solutions are the essential points of the set of approximate solution; the connected component which contains the accurate solution is the essential component of the set of approximate solution; especially the number of essential components is finite.

第三章，研究定义在线性赋范空间上的非线性方程问题近似解及其解集的稳定性，得到线性赋范空间上在Baire分类下大多数非线性方程问题的近似解都是稳定的；精确解是近似解集的本质解；包含精确解的近似解集的连通区是本质连通区；包含精确解的近似解集的连通区为有限个。

Utilizequadratic form and Perron value of bottleneck matrices, we study how the algebraic connectivityof a weighted tree changes under shifting its branches and changing its edge s weights and obtainmore entire information about algebrai.

利用代数连通度的二次型形式和瓶颈矩阵的Perron值，我们研究了当迁移或改变分支和变动一些边的权重时树的代数连通度的变化，得到了比过去更多的关于赋权树的代数连通度的结论。

Connectedness and δ—connected component are denned. Some properties and equivalent conditions about δ—connected axe given. It is respectively discussed that δ—connected L—topological spaces are abroader than connected L—topological spaces.

定义了L-拓扑空间的δ-连通性和δ-连通分支的概念，讨论了它们的一些性质，给出δ-连通的一些等价刻画，证明了δ-连通L-拓扑空间是比连通L-拓扑空间更广泛的一类空间。

In the project, we found a method for designing a family of 4-optimal double loop networks, established some sharp upper bounds of forwarding indices, distance domination nember, the edge-connectivity and the sharp upper bounds of wide-diameter and fault-tolerant diameter of Cartesian product graphs, the lower bounds of restricted edge-connectivity of digraphs and a sufficient and necessary condition for the restricted edge-connectivity of a graph to be equal to the restricted connectivity of its line graphs; raveled pancyclicity and panconnectivity and obtained the exact values of the mentioned parameters for some well-known networks.

本项目给出最优双环网络的设计方法，找到4紧优双环网络无限族，建立了路由转发指数紧的界，确定了笛卡尔乘积图的边连通度的表达式，宽直径和容错直径紧的上界，给出有向图限制边连通度的下界和无向图的限制边连通度等于它的线图限制点连通度的充要条件，对一些著名的网络确定了上述参数的精确值，讨论了宽直径和容错直径之间的关系，解决了超立方体某些变型网络的泛圈性和泛连通性，得到距离控制数的紧的上界。

After basic theory and definings of Voronoi diagram and also parameterized bisectors have been analyzed,two main algorithms of simple-connected at present have been compared;adjust the algorithm of initialization and data construct so as to obtain the algorithm could used in practice; extand the idea of wavefront-propagation algorithm to computing multi-connected voronoi diagram.

通过对Voronoi图的基本理论、定义和参数化平分线公式的分析，以及对两种主要单连通域Voronoi图算法的比较，作者改进了初始化算法和数据结构，得到便于工程应用的单连通域Voronoi算法，并将波阵面传播的思想扩展应用到多连通域的Voronoi图计算，形成新的多连通域问题算法。

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 而在你们心思的灵里得以更新