基于复杂网络抗毁性与ADMPDE算法的网络拓扑结构优化

复杂网络抗毁性研究的重要内容之一,就是优化网络拓扑结构。在分析常用复杂网络抗毁性测度不足基础上,提出了以自然连通度为复杂网络抗毁性测度,建立了其拓扑结构优化模型;综合运用ADMPDE算法收敛好、寻优速度快等优点,通过适当改进用于求解复杂网络拓扑结构优化模型。通过仿真分析,验证了复杂网络拓扑优化模型及其求解算法的科学性与可行性,得出了拓扑优化过程网络结构变化一般性规律,并分析了网络拓扑结构优化前后,在不同攻击策略下复杂网络抗毁攻击能力。     

抗毁网络的物理结构设计

为设计网状的抗毁网络物理结构.将网络抗毁特性设定为网络的拓扑具有各节点对的二重回路,研究了能找到有二重回路的网状拓扑的实验性设计方法,并举例分析了其结果.     

基于遗传算法的定向天线网络拓扑控制

针对定向天线网络拓扑中拓扑结构的设计的问题,综合考虑了网络中节点的最大度、最大通信距离、连通度等因素,着重考虑构建一个k连通的通信网络拓扑,这个特性很好地保证了网络的抗毁性与可靠性。基于此建立了最优k-连通的网络拓扑模型,提出一个节点间的新的连接方式作为一个固定的模版,以此来确保网络的连通性。在此基础上利用遗传算法来对连接方式进行优化,给出了一种有效的编码方式,并且采用有序交叉作为交叉运算,避免了每次交叉后的个体网络连通性检查,降低了交叉运算的时间复杂度,同时保护了染色体中较好的模式被遗传到子代个体。找出了节点间更好的拓扑连接形式,通过仿真实验得到了很好的结果。     

通信网络抗毁性的评价方法

基于多抗毁性度量值的评估技术,以作战运用的视角,对通信网络的抗毁性进行评价.首先,从通信网络抗毁性的定义出发,构建了通信网络拓扑结构的抗毁性评价模型.在所建模型中,选取了用户较为关心的网络抗毁性量度,方差的引入弥补了以往的量度不能体现个体差异的不足.其次,采取的点打击策略没有按度的大小进行打击,而是取路径中出现次数最多的点进行打击,这更符合实际情况.最后利用模型对实例进行了分析,结果表明模型不仅能够评价通信网络拓扑结构的抗毁性,而且还能指出网络结构需要优化的地方.     

一种三维无线传感网络拓扑控制算法的研究

当前关于三维拓扑控制的研究主要侧重在保证网络的连通性,并没有很好的考虑到邻居节点度和能耗最低路径两者之间的权衡关系.针对该问题提出了一种可调节的无线传感器网络拓扑控制算法,通过调整因子r(0＜r＜1)动态调整网络拓扑结构,使网络具有良好邻居节点度的同时保留了部分能耗最低路径.仿真实验数据表明该算法构造的网络拓扑图具有良好的可调节性和稀疏性,同时算法在优化网络生命周期和节点功率方面都具有较明显的效果.     

基于BA无标度网络的WSNs拓扑优化模型

由于无线传感器能量受限,最大化网络生命周期成为优化网络拓扑首要考虑的问题。基于BA无标度理论,提出了一种WSNs拓扑优化模型(WTOM)。在网络中引入超级节点,结合粒子群算法合理地划分整个网络;在节点间建立多因素为导向的虚拟力场,利用虚拟力调整超级节点的部署位置,实现网络能量的均衡消耗,通过对关键节点的保护,提高网络的抗毁鲁棒性。经理论分析和实验证明,该网络不仅继承了BA无标度网络的特征还具有小世界特性;同时该动态拓扑延长了网络的生命周期,提高了网络面向数据收集的节能性。     

复杂网络抗毁性研究进展

随着复杂网络研究的兴起,复杂网络抗毁性研究的重大理论意义和应用价值日益突显出来,成为极其重要而且富有挑战性的前沿科研课题.本文总结综述了国防科技大学信息系统与管理学院在复杂网络抗毁性领域取得的研究进展,具体包括:研究了不完全信息条件下复杂网络拓扑结构抗毁性;提出了复杂网络拓扑结构抗毁性的谱测度方法;分析了3种结构属性对复杂网络拓扑结构抗毁性的影响;提出了基于禁忌搜索的复杂网络拓扑结构抗毁性仿真优化方法.     

移动智能体网络的优化功率控制及同步

从网络拓扑结构连通性与网络整体同步行为的内在关联出发,提出一种移动智能体网络的功率控制策略.首先确定满足网络拓扑结构连通的最小感知半径;其次以提高整个移动智能体网络的拓扑结构抗毁性为优化目标提出一种代价函数,在最大功率限制下的最大感知半径及保证连通的最小感知半径的范围内采用粒子群优化算法(PSO)予以优化,寻求同时满足网络连通性与抗毁性需求的个体感知半径;随后基于该控制策略,以个体感知邻域内运动方向偏差最大的2个邻居个体运动方向的中值作为个体下一时刻的运动方向,研究了移动智能体网络的快速同步问题.仿真结果表明:通过调节个体感知半径,移动智能体网络的功率控制和抗毁性能得到了提高.     

不同信息条件下加权复杂网络抗毁性仿真研究

针对加权复杂网络的抗毁性分析问题,选取网络效率和网络鲁棒性作为抗毁性的度量指标,对加权网络在不同信息条件下抗毁性的变化进行数值仿真模拟.最后,对成本和性能约束下加权网络的抗毁性进行定量分析,给出不同信息条件下加权网络抗毁性的优化策略.结果表明:在基于局部拓扑信息的攻击策略下,权重系数越大,网络的抗毁性越强;在基于全局拓扑信息的攻击策略下,网络的抗毁性要优于基于局部信息的攻击策略,且权重系数为0.5的网络在攻击初始阶段抗毁性最强;另外,若能在攻击早期加大对节点的防护力度,则会大大降低对网络性能的影响.     

多自适应波束天线节点的最优组网拓扑控制

自适应波束天线由于其发射接收具有强指向性的特点,其网络拓扑控制问题、方法与全向天线存在较大不同。针对节点安装有多个空间均匀分布的自适应波束天线进行组网通信时的拓扑优化控制问题,建立了自适应波束天线和网络节点通信的数学模型;对拓扑优化控制的问题进行了分析,其问题本质是对节点安装的多部天线进行最优化链路分配。以网络通信质量的量化计算作为目标函数,提出了一种基于0-1规划的拓扑控制优化模型,并对网络连通性进行了分析,给出了两节点连通以及整个网络连通的充要判决条件。最后给出了2种不同节点数情况下的仿真计算结果,并通过穷举法验证了模型计算结果的正确性。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.