一种基于F-HMIPv6协议的QoS上下文转移方案

针对在传统的移动Ipv6切换方案中,每次切换都需要交互大量信令,增加了切换延时的问题,基于快速层次移动IPv6的框架,提出一种新的QoS上下文转移解决方案.它在移动节点执行切换的同时为实时应用提供服务质量保证,并且这种方法可以减少移动节点切换后重新发起信令建立QoS转发处理所带来的延时,减少了移动节点会话的QoS服务中断.理论分析和仿真实验表明,本方案可以显著降低实时业务切换时的延迟抖动,特别是在移动节点进行乒乓(ping-pong)切换时有较好的表现,实现了移动节点的平滑切换.     

一种基于小波变换的自适应播放算法

针对网络传输中延时的非平稳特性,提出了一种基于小波变换的自适应播放算法. 通过小波变换将非平稳的延时序列变为多个平稳的分量,再对各平稳分量采用不同自适应速率的自回归(AR) 模型进行预测,将各个预测分量利用小波重构得到最终的端到端延时. 仿真结果表明,该算法的预测精度比传统的AR算法提高了5～14dB,比新提出的差分自回归 (DIAR) 算法提高了1.5～5.0dB.     

基于滤波电感辨识及延时补偿的并网逆变器模型预测控制

针对三相并网逆变器采用传统模型预测控制时,因模型失配造成输出电流畸变率大、谐波含量高、并网效率低的问题,文章提出了一种基于滤波电感辨识及延时补偿的模型预测控制方案,将在线辨识的滤波电感和延时补偿的电压电流应用到三相并网逆变器模型预测控制系统中,并在MATLAB/Simulink环境下进行了仿真,仿真结果表明:基于滤波电感在线辨识及延时补偿的模型预测控制具有很好的动、静态特性,输出电流正弦度好、谐波含量少,验证了方案的可行性和正确性.     

基于Linux AdHoc网络MIPv6方案的实现

给出基于自组织网的Linux系统上MIPv6协议的执行方案和关键技术的改进方法,并设计出执行MIPv6协议的框架,提出了协议执行程序需采用的关键技术.然后,对移动性的切换延时问题进行分析,降低了系统延时.最后,建立实验场景,对移动切换的性能进行研究.通过对比延时数据,验证了改进后的方案是正确且可行的.     

一种面向交互应用的多视点视频编码方案

视点切换是交互式多视点视频应用需要解决的难题之一,该文为此提出一种交互式多视点视频的编码方案。通过消除预测帧之间的相关性,改善视点切换的性能,以共享关键帧和时-空预测编码方式,在时间和空间上去除多视点视频数据的冗余,提高编码效率。该方案不增加任何辅助数据,即可在任意的P帧上进行快速视点切换,具有极低的视点切换延时,并且兼顾了编码效率和单一视点的解码代价。采用H.264/AVC编码器实现该方案,并得到满意的测试结果。     

多信道无线网状网的多信道多径路由实现

基于优化链路状态路由(OSLR)协议,提出了一种改进的路由算法,能在多信道无线网状网中进行多信道多径路由.仿真实验结果表明,与单径路由方案相比,有效地减少了信道切换次数,从而降低了总体端到端延时.     

一种基于位置标识与身份标识分离协议的移动性快速切换方法

现有的位置标识与身份标识分离协议(Locator/ID Separation Protocol, LISP) 需要在其基础上部署移动IP(Mobile IP, MIP)才能实现移动性.针对此方案切换延时长、丢包率高、部署相对复杂等缺点,提出了一种基于LISP协议的快速切换方法(FM LISP).改进方法吸取了MIP快速切换FMIPv6中链路层触发的机制,并结合LISP协议本身特性,省去了FMIPv6中转交地址分配、冲突地址检测及双向隧道的建立,简化了切换过程.仿真结果表明,FM LISP在切换延时方面较LISP+MIP方案有较大程度的改进,并利用原接入路由器的缓存功能,有效地降低了丢包现象的发生.     

异构网下基于速度的自适应垂直切换算法研究

在异构网络垂直切换中一直存在着乒乓效应、网络利用率低和丢包率严重等问题．以往的算法虽然提出了改进的方法,但是没有考虑移动节点速度不同对切换效率的影响,在此提出了一种自适应主动预测的垂直切换算法．采用代价函数对可接入网络进行评估和选择;根据稳定周期、移动节点运动的速度和所处位置来自动调整切换执行时间,使移动节点能自适应的进行切换抉择．仿真结果表明,该算法可以有效地减少切换延时、分组丢失以及切换次数,能够有效地提高系统的切换性能。     

集成HIP和SIP的多层次移动管理方案

随着越来越多的移动终端接入到互联网,IP网络如何提供有效的移动管理成为了一个重要的问题。该文提出了一种集成主机身份标识协议(host identity protocol,HIP)和会话发起协议(session initiation protocol,SIP)的多层次移动管理方案,该方案在充分利用HIP和SIP各自优势的基础上,集成了系统中的位置管理服务器,从而有效地减少了系统信令损耗;同时,该方案根据不同类型的应用采取不同的移动切换流程,从而缩短了平均切换延时。数值仿真结果表明该方案在信令损耗和终端切换延时方面优于已有的移动管理方案。     

基于小波神经网络的工业以太网延时预测控制

随着网络控制研究的兴起,对工业以太网延时进行补偿成为研究的重点方向.针对网络延时给网络控制系统带来的问题,提出用小波神经网络对工业以太网延时进行预测,根据输入的过去时间延迟序列预测输出下一采样时刻的网络延时值.预测模型的参数通过训练算法实时更新,以保证预测输出的准确性.对实际工业以太网延时数据样本的预测分析表明,该预测模型能够有效预测延时.为进一步说明延时预测效果,将延时预测模型应用于网络控制系统进行延时的预测与补偿,系统仿真结果证明了预测模型预测的准确性及补偿的有效性.     

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.     

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.     

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).     

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.