连通

It is proved that strictly efficient point set of the objective space is connected when objective function is cone convex－like,and that if objective function is cone convex set－valued mapping,then strictly efficient solution set is also connected.

证明了当目标函数为锥类凸的集值映射时，其目标空间里的严有效点集是连通的；若目标函数为锥凸的集值映射时，其严有效解集也是连通的。

The Graphical Representations of Connected Cubic Arc-Transitive Coset Graphs of Minimum Degree on Projective Special Linear Group PSL2,p

特殊射影群PSL(2，p)的最小级连通3度弧传递陪集图表示论文标题：特殊射影群PSL(2，p)的最小级连通3度弧传递陪集图表示

At many occasions they arise quite natu-rally.For example,they appear in the Iwasawa decomposition of the isometry group ofa non-compact Riemannian symmetric space.Also,every connected homogeneous Rie-mannian manifold of non-positive sectional curvature can be represented as a connectedsolvable Lie group with a left-invariant Riemannian metric.

它们出现在非紧致黎曼对称空间的等距群的Iwasawa分解中；任一非正截面曲率的连通齐性和黎曼流形可以表为带有左不变黎曼度量的连通可解李群等，带有左不变黎曼度量的幂零及可解李群的微分几何，调和分析和谱几何是重要的研究课题。

And then all directed cutsets from the set of those directed segs were selected by analyzing connectivity of another subgraph.

算法首先利用边收缩图的概念，递归生成有向装配连接图的具有一个连通子图的一部分有向断集，接着通过判断另一个子图是否连通，从这些有向断集的集合中筛选出全部的有向割集。

And then all directed cutsets from the set of those directed segs were selected by analyzing connectivity of another subgraph. Theoretical analysis and experimental analysis of the algorithm showed that the improved algorithm was feasible and efficient.

算法首先利用边收缩图的概念，递归生成有向装配连接图的具有一个连通子图的一部分有向断集，接着通过判断另一个子图是否连通，从这些有向断集的集合中筛选出全部的有向割集。

The surface generated by a straight line,the generator,passing through a fixed point,the vertex ,and moving along a fixed curve,the directrix.

如果一个连通图的一个顶点能被分割，从而使这图成为一个不连通图，则这个顶点称为断点。

Although finding the Minimum Connected Dominating Set in an arbitrary graph is a NP-hard problem, many approximation algorithms have been proposed to construct a serviceable CDS.

由于求解最小连通支配集是一个NP难问题，许多近似算法被提出用于构建可用的最小连通支配集。

Although finding the Minimum Connected Dominating Set in an arbitrary graph is a NP-bard problem, many approximation algorithms have been proposed to construct a serviceable CDS.

由于求解最小连通支配集是一个NP难问题，许多近似算法被提出用于构建可用的最小连通支配集。

In wireless ad-hoc networks, routing based on connected dominating set is a promised approach, where the searching space for route is reduced to nodes in the dominating set.

在ad-hoc网络中，基于最小连通支配集(minimum connected dominating Set-MCDS)的路由方法是一种有效的分层路由方法，它将路由搜索主要集中在连通支配集内。

The algorithm runs on the sink node and the connected dominating set educed from the algorithm forms the virtual backbone of the network. Because the algorithm gets the global information and the information is general, the size of the connected dominating set got from the centralized heuristic algorithm is smaller than that of distributed heuristic algorithm.

本文算法在中心控制或管理节点上运行，求得的连通支配集构成无线传感器网络的虚拟骨干网，并且由于算法采用网络的全局信息，获得的信息量较为全面，所以求得的连通支配集的规模相对于分布式算法更小。

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