连通性

Then a general expression describing the relation between effective stress coefficient tensor and equivalent connectivity tensor of pore is proposed; and the expression can be applied to isotropic media and also to anisotropic media.

分析了有效应力系数的物理机理及其主要影响因素，在此基础上，提出了等效孔隙连通率的概念，以此表征岩土类孔隙介质的结构和孔隙之间的连通性，建立了有效应力系数张量演化的普适性理论模型。

Based on the topological dimension reduction method presented by B. Zhang et al for the problem of motion planning in the environment consisting of precisely known polygonal or polyhedral obstacles, we further discuss the problem of motion planning for a multi—joint robotic arm.

对由完全精确已知的多边形或多面体组成的障碍环境中的运动规划问题，在张钹等提出的拓扑降维法的基础上，本论文进一步探讨了应用拓扑法的多关节机械手的运动规划问题，其中重点解决了状态空间中连通块的划分问题和连通块之间连通性的判别问题。

After the simulation system based on these algorithm for motion planning is set up, the correctness of partition principles is confirmed by many typical simulation experiments, so does the feasibility of motion planning for multi-joint robot based on topological dimension reduction method.

经过状态空间的划分，得到许多连通块，根据连通块之间的连通性的判别条件，构建特征网，最后根据搜索算法在特征网上搜索连通路径，进而从特征网上的连通路径求出机器人运动的几何路径。

In fact, on one hand, it is often found that two graphs with the same number of verticesand the same connectivity(edge-connectivity) may result in entirely different forms after a minimum disconnecting set of vertices is removed, one may be totally disconnected while the other may consist of a few very stable components, and thus be much easier to reconstruct.On the other hand, we often face this question: how easily can we disrupt a system at the least cost, on the contrary, when we set up a system, especially a communication system, we try our best to make it as stable as possible that it can be reconstructed easily if it do get disrupted .

对于两个具有相同点数，具有相同点连通度的图，从图中分别去掉使图不连通的点集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。

In chapter 4, we studythe cyclic edge connectedness of regular half vertex transitive graphs, we showthat a connected k(≥4)-regular half vertex transitive graph X with girthg≥6 isλ_c-optimal, and we also obtain a su?cient and necessary conditionfor a connected k(≥4)-regular half vertex transitive graph X with girth 4 tobeλ_c-optimal.

第四章，我们研究了正则半点传递图的圈边连通性问题，主要结果是证明了一个围长为g≥6的k(≥4)-正则连通半点传递图X是λ_c-最优的，并且得到了一个围长为g = 4的k(≥4)-正则连通半点传递图X是λ_c-最优的充分必要条件。

Chapter 3, presents a technique for solving the connectivity problem of undirected double loop network G .

第三部分主要研究无向双环网G的直径以及连通性问题。

After survey, we study the wide-diameters of undirected de Bruijn graphs in Chapter 3, and

在一般性的纵览之后，就进入第三章；虽然无向迪布恩图的连通性早就知道了，但是宽直径却一直不得而知，在这一章中，我们探讨宽直径，从而保证对任意两点都有足够多条的不同路径，而这些路径都不会太长。

This article is to study the small-world network synchronization, and was found to have uniform distribution of network connectivity easier to synchronize!

详细说明：这篇文章是研究小世界网络同步的，发现具有连通性均匀分布的网络更容易实现同步！

Chan of the overall variation method of image restoration, Due to the limitations of their own algorithm to solve visual connectivity problems.

采用T.Chan的总体变分方法实现图像修复，由于算法本身的局限性，无法解决视觉连通性的问题。

Using T. Chan of the overall variation method of image restoration, Due to the limitations of their own algorithm to sol...

采用T.Chan的总体变分方法实现图像修复，由于算法本身的局限性，无法解决视觉连通性的问题。

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.

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