连通和

Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.

理论分析和实验数据表明，CVT算法的性能在时间复杂性和连通覆盖集大小方面都优于已有的贪婪算法。

Based on considering the energy of nodes, the paper gives three attribute chatacteristics: flow factor、bridging factor 、convergence factor,and two ways to find articulation nodes:using energy model to find and finding key nodes in the connected gragh. At the same time,we use network simulator NS2 to simulate and verify our analysis results.

本文从考虑节点能量的角度出发，给出了关键节点的三个属性特征：流量因子、桥接因子、汇聚因子和两种判断关键节点的方式：利用能量模型判断和在连通图中判定关节点，同时用网络模拟器NS2加以模拟验证。

The math models of the tree structure chart and the net structure chart are formed by describing the different road state abstractly.The tree structure chart model is presented without consideration of U structure and ring structure. This kind of model has a notable feature: there is a line only between the two dot in the chart, which means that there is only one road from one point to another point in expressway ,so the tree structure chart is called "single roads chart".

在不考虑U型路段和环路的情况下，提出了高速公路的树状结构图模型，该模型具有一个显著的特点：图中两点之间有且仅有一条连线，这意味着由高速公路上的一个地点到达另一个地点仅有一条通路，也称这种高速公路树状结构图为"单路径图"；考虑到包含U型路段和环路的高速公路路况，提出了高速公路的网状结构图模型，这种模型可抽象成一个连通图，即图中任意两点之间至少有一条直线相连，这意味着由高速公路上的一个地点到达另一个地点有多条通路，也称这种高速公路网状结构图为"多路径图"。

And connectivity in Tongzhou District of Beijing and 30 bus lines, the Grand Duchy of more than 800 delivery vehicles, but also meets tenants living in the Tongzhou district of actual demand.

和连通的北京通州区和30个公交线路，大公国的800多名运载工具，而且还满足住户居住在通州区的实际需求。

In this thesis, we mainly study the restricted edge connectivity for the de Bruijn digraphs and the super restricted edge connectivity for the de Bruijn undirected graphs.

并介绍了de Bruijn图和限制边连通度方面的基本概念和基本结论。

Ultimately, it can share resource and cooperation in virtual network. In human life, people could use computer or smart data device communication with each other in anytime and anywhere facilely. This is a complicated, heterogeneous and distributed system. This thesis is written under such a background.

Internet技术的不断发展，使得人们对于家庭网络的需求不仅仅表现在家庭设备硬件的连通，而且实现互联网上所有资源的全面联通，包括计算资源、存储资源、通信资源、软件资源、信息资源、知识资源等等，最终实现网络虚拟环境上的资源共享和协同工作，消除信息孤岛和资源孤岛。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

We study the recursive structure of the twisted-cube connected network sufficiently, and prove that the twisted-cube connected network is an n regular graph with connectivity n: point out that the twisted-cube connected network is a cube-free network, which is an essential distinction with the hypercube and other variations of the hypercube; prove that the diameter of n dimensional twisted-cube connected network is [ (n+1)/2] , which is almost the half of hypercube's.

首先对其结构的递归性进行充分地研究，证明它是连通度为n的n正则图；指出扭立方体连接网络无立方体子图，这是扭立方体连接网络与超立方体及其其它变种的本质差别；证明了n维扭立方体连接网络的直径为[（n+1）/2]，它几乎是超立方体直径的一半；最后，给出超立方体及其变种的等价定义，并对它们的结构递归性、网络参数和拓扑性质等作了简单的分析、综合和比较。

The distributary river course reservoir in the Lower Member of Minghuazhen Formation in an oilfield of Bohai Basin was modeled. The modeling units were divided using the integrated geological modeling method based on seismic, log and geological data. The sedimentary microfacies features of the modeling units were described. The geological knowledge base, including quantitative description of microfacies in every unit, probability function of facies, connection probability of sand body, was established. The geological model of reservoir was proposed on the basis of stochastic reservoir modeling by using an objectbased simulation method.

以渤海某油田新近系明化镇组下段缓坡三角洲平原亚相分流河道储层为例，利用以精细地质建模为目的的地震、测井和地质一体化综合研究方法，合理划分模拟单元并定量描述各单元内沉积微相特征；结合相概率函数和砂体连通概率等定量约束条件，建立了半定量—定量储层地质知识库，实现了等时建模、成因控制相建模、确定性条件约束随机建模三者的有效结合；采用基于目标的随机模拟方法建立了储层地质模型。

Lamadian Oilfield static state map plan system includes data pretreatment subsystem and development geology charting subsystem and geological map sheet access subsystem, realizes the function of drawing for the Lamadian Oilfield development well location map and skeleton structure section map and connected section graph and Sedimentary facies chart and tectonic maps, and realizes various types of geological map data storage and query functions.

本文研究的喇嘛甸油田静态图幅绘制系统包括：绘图数据预处理子系统、开发地质制图子系统和地质图幅存取子系统，实现了喇嘛甸油田开发井位图、骨架剖面图、连通剖面图、沉积相带图、断层剖面图和断层实际资料图的绘制功能以及各类地质图件资料的存储及查询功能。

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