- 更多网络例句与不连通性相关的网络例句 [注：此内容来源于网络，仅供参考]
-
This paper lists two basic modes of connection breaking in evolving process of self-organizing network, analyses the key factor and proposes a simple and convenient links replacement algorithm based on local connected domain optimization, which can assure the connectedness in evolving processes of network.
本文列举自组织网络不连通的两种主要模式，分析了破坏连通性的主要原因，提出了一种简便可行的基于局部连通域优化的连接置换算法，可以有效保证网络演化过程中的连通性。
-
Much attention is focused on the connectivity in early network for there is no competition for the resources.
早期的网络更注重的是连通性，不存在资源竞争的问题。
-
In chapter 4 , with S-KKM mapping , a new Ky Fan\'s minimax inequality is proved , the locally convex H-space with uniform structure is introduced , s-HKKM mapping is defined as the generalization of KKM mapping, with the H-convexity of Hausdorff locally convex H-space , a new fixed point theorem for the compact andclosed mapping belonging to the class s-HKKM is established ;with local intersection property of muti-function ,K-H-quasi-convexity of mapping , connectedness of set and condensing correspondences, some new vector quasi-variational inequalities are established , respectively .
第四章利用S-KKM映射，建立了新的Ky Fan极小极大不等式；定义了带有一致结构的局部凸H-空间，利用Hausdorff局部凸H-空间的H-凸性，对于属于s-HKKM中紧的闭映射建立了新的不动点定理，利用对应的局部交性质、映射的K-拟-凸性、集合的连通性以及φ-condensing对应分别建立了相应的拟向量变分不等式。
-
But when their informationset is not complete,it is hard for decision-makers to determine,that is to say,the preference relation is not complete.
实际上，在一般决策问题中，决策人对备择方案的优劣判断主要依赖于决策人的信息集，而当决策人的信息集不完备时，决策人就可能难以对一些备择方案的优劣做出判断，这时完全性或连通性就不满足。
-
A non-binary social choice is actually a group decision-making problemwith the preference relation need not satisfying the connectivity axiom.
非二元性选择问题实际上就是偏好关系不一定满足连通性公理的群决策问题。
-
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 .
对于两个具有相同点数，具有相同点连通度的图，从图中分别去掉使图不连通的点集后，所得图的结构可能完全不同，这是因为点连通度、边连通度和局部点、边连通度等连通性参数仅反映了系统被破坏的难易程度，而对系统遭受破坏的程度并没有明确的反映。
-
After survey, we study the wide-diameters of undirected de Bruijn graphs in Chapter 3, and
在一般性的纵览之后，就进入第三章；虽然无向迪布恩图的连通性早就知道了，但是宽直径却一直不得而知，在这一章中，我们探讨宽直径，从而保证对任意两点都有足够多条的不同路径，而这些路径都不会太长。
-
The traditional skeletonization algorithms based on distance transform can not guarantee the connectivity property, so saddle points should be added to solve the connectivity problem.
传统的基于距离变换的骨架算法不能保证骨架的连通性，需要引入鞍点解决连通问题。
-
The connectivity property is not guaranteed by the traditional skeletonization algorithm based on the distance transform, saddle points should be added to solve the connectivity problem.
传统的基于距离变换的骨架算法不能保证骨架的连通性，需要引入鞍点解决连通问题。
-
Based on the measure of sand geometry in M Block and comparison of results calculated with Spherical, Exponential and Gaussian Model, it is concluded that different variogram models get very different variogram range in major and minor direction.
在详细解剖M油田的砂体几何形态的基础上，对比分析球模型、指数模型和高斯模型的计算结果，3种模型计算的变差函数长变程误差15％，短变程误差25％，方向也不一样；同时运用不同模型计算的砂体体积亦有较明显的差别：砂体越发育，砂体连通性越强，不同模型计算的砂体体积相差越小；砂体越不发育，砂体连通性越差，不同模型计算的砂体体积相差越大。
- 更多网络解释与不连通性相关的网络解释 [注：此内容来源于网络，仅供参考]
-
unconnected graph：不连通图
无条件收敛级数 unconditionally convergent series | 不连通图 unconnected graph | 不连通性 unconnectedness
-
unconnected space：不连通空间
unconnected graph 不连通图 | unconnected space 不连通空间 | unconnectedness 不连通性
-
unconnectedness：不连通性
不连通图 unconnected graph | 不连通性 unconnectedness | 不相关随机变量 uncorrelated random variables
-
uncorrelated random variables：不相关随机变量
不连通性 unconnectedness | 不相关随机变量 uncorrelated random variables | 不可数序数 uncountable ordinal