基于变化分组时隙窗口的新型流水印技术

为了解决当前网络数据包在嵌入水印时需要对数据包的内容进行修改以及分组方式单一性的问题,通过理论分析和计算,提出一种基于变化分组时隙窗口的新型流水印技术.给出了交替变化的时隙窗口划分的具体操作步骤及调制数据包发送延迟平均值的规则,同时采用码分复用技术对水印信息进行扩展后再传输,增强其纠错能力.为验证新技术的性能,模拟了不同网络环境,分别进行多次测试,同时用两种相似率计算方法计算检测率值的大小.试验结果表明,抖动时间均值超过6 ms时,新型水印技术检测率高于原始分组技术28%;另外若在抖动均值范围小于10 ms时,新型水印技术检测的误码率均值低于0.49,而原始水印误码率高于0.5.比较可知,新技术能明显提高检测率,性能良好.     

一种基于自同步技术的音频水印算法

提出一种基于自同步技术的音频水印算法,该算法在小波变换域的低频系数中选取具有重要特征系数作为同步信号.通过修改同步信号相邻的若干系数实现水印的嵌入.水印检测不需要参考原始音频信号,是一种盲检测水印算法.实验结果表明了该算法的鲁棒性和不可感知性.     

抗污染攻击的流内安全网络纠错编码

传统的网络路由并不能达到多播网络中"最大流-最小割"定义的Shannon容量限,而网络编码很好地解决了上述问题,在增大吞吐量的同时还可以均衡网络负载,提高带宽利用率.但是当网络中存在恶意攻击时会引入错误数据包,在线性网络编码操作下会带来数据包的"错误扩散",不仅影响网络性能,还会造成资源的严重浪费.因此如何在优化网络传输性能的同时提高通信网络的安全性成为目前亟待解决的问题.本文采用基于同态校验的线性网络纠错编码机制进行差错控制,拟解决多播网络中的污染攻击问题,对安全性能以及传输性能进行了分析.仿真结果表明基于同态校验的网络纠错编码能够在不破坏数据包编码规则的前提下及时地进行错误的检测和纠正,得到较好的差错控制性能,能够对抗网络中恶意节点引起的污染攻击问题.      

一种在噪声环境中传输图像的有效算法

对小波变换后的视频图像进行压缩和纠错编码相结合的处理,可大大减少传输的带宽,同时能抵御噪声的干扰 但如果译码时间过长,就不适合用于实时图像的传输 本文提出了基于Fano译码的图像压缩与纠错编码,它通过判断路径度量和门限选择搜索正确译码方向,根据数据受噪声干扰的程度来调整运算量,与基于Viterbi的压缩、纠错混合编码相比,能较大节省译码的时间     

一种盲检测的小波域数字水印算法

提出一种基于离散小波变换的盲检测数字水印算法.该算法在嵌入时,采用同一水印多重嵌入的思路,不但实现了盲提取,同时还提供提取水印时所需要的纠错信息,提高检测的正确率.通过实验证明,该算法具有较理想的安全性、鲁棒性,且由于该算法在提取水印时不需要原始信息,因此将水印技术应用于产品的网络发布和传播时具有一定的优势.     

零拷贝技术在网络流量控制系统中的应用

分析数据包的传输过程,分析数据拷贝操作的CPU消耗和时间代价,并研究当前的零拷贝技术PF_RING,设计出一种改进的基于操作系统的零拷贝实现方法,该方法利用Linux的内存共享和DMA技术实现数据包传输过程中内存的零拷贝,同时解决了同步问题,优化了Linux的内存管理,该方法能消除数据包传输过程中内存拷贝对CPU的消耗,缩短数据包行走路径,并进行了测试,结果表明应用零拷贝后系统效率提升明显.     

一种基于像素差值的无损数字水印技术研究

无损数字水印技术能够鉴别数字媒体的真实性和完整性的同时,还能实现数字媒体和水印的完好分离,可得无失真的原始数字媒体。采用对像素对进行分类和差值运算的方法来嵌入水印、提取水印和恢复原始载体,并在水印的嵌入过程中运用了纠错编码技术。算法易于实现且结构对称,鲁棒性强,能明显提高含印图像质量。     

利用亮度分量的彩色图像信息隐藏算法

提出了一种利用亮度分量的彩色图像信息隐藏算法.本算法实现了隐藏信息的盲检测,并在512×512的RGB彩色图像中嵌入多达2048字节的数据.算法有效地利用了数字通信理论中的前向纠错编码技术和数据扰乱技术,使水印抵抗各类攻击的性能得到了有效地提高.实验证明该算法能较好地平衡隐形水印的不可见性和稳健性之间的矛盾,所隐藏的数字水印在StirMark的攻击下,具有较好的抵抗能力.     

一种多重水印零嵌入算法

根据零水印概念,提出一种基于小波和混沌的多重水印零嵌入算法.该算法利用小波零树结构构造匹配矩阵,然后用其加载已由混沌空域置乱的多重二值图像水印.算法实现了多重水印的零嵌入,从根本上保证了水印的不可见性,并能够进行分级盲检测.实验表明,该方法鲁棒性较强,安全性良好,具有可靠性和可行性.     

基于DCT变换的数字图像盲水印算法

提出一种基于DCT变换的数字图像盲水印算法,通过调整DCT域选定中频的大小关系嵌入水印,易于实现。仿真试验证明本算法能够抵御剪切、噪音和JPEG压缩失真,具有良好的不可见性和鲁棒性。     

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.