基于整数小波变换和差值扩展的可逆数据隐藏

针对传统差值扩展嵌入算法存在过分修改像素值、须嵌入溢出定位图等缺点,提出了一种基于整数CDF(2,2)双正交小波变换和差值扩展的彩色图像可逆数据隐藏算法.该算法用较小的差值扩展量扩展1个色彩分量的像素值,扩展方向由溢出像素的数量决定,采用调整像素值的方法避免像素溢出,并用少量的调整信息代替定位图,从而提高嵌入容量.提取端根据临界像素值的顺序定位调整的像素,用调整信息恢复调整像素的值,提取信息的同时可无损地恢复原始图像.实验结果表明:算法的整体性能优于预测误差差值扩展和传统差值扩展算法.     

基于多进制嵌入的彩色图像可逆数据隐藏算法

针对Tian差值扩展算法存在过分修改像素值、嵌入容量不高等缺点,提出了一种基于多进制嵌入的彩色图像可逆数据隐藏算法.它利用十字预测法获取较高的直方图峰值,将版权信息变换成二进制和三进制信息,然后分两次嵌入到多个峰值中;同时在嵌入之前有针对性地对所有可能溢出的像素进行调整,并将这部分信息作为辅助信息优先存放,替代了定位图.嵌入的顺序与分形生长图形计算的结果一致,提高了保密性.实验结果表明:该算法在保证图像质量的同时,嵌入的容量有一定的提高.     

基于差值扩展和随机块选择的可逆数据隐藏算法

针对传统数据隐藏算法容易被SPAM检测到的问题,提出一种基于差值扩展和随机块选择的可逆数据嵌入算法.该算法首先对目标图像进行分块处理,然后随机地选择目标块,并根据目标块的类型和方向选择相应类型的差值扩展方法嵌入数据,最后利用块位置图记录溢出情况,以保证图像质量.实验表明,该算法不仅能够提高嵌入数据的容量,并能有效降低嵌入数据后对图像质量的影响.     

基于差值二次可扩展性的彩色图像可擦除水印

提出了一种基于差值二次可扩展性的彩色图像可擦除水印算法.利用色彩分量之间的相关性减小差值,将较小的差值扩展量分散到2个色彩分量中,从而减小像素值的修改量,提高含印图像的质量.采用修改像素值LSB的方法嵌入水印,并利用差值的二次可扩展性定位不可扩展差值,采用调整临界像素值的方法避免像素溢出,在另一色彩分量中嵌入少量的辅助信息代替定位图,确保水印的嵌入率达到最大值.实验结果表明,该算法嵌入的水印不可见性好,在擦除水印后能够无损地恢复原始图像.     

一种邻域像素差预测的可逆水印算法

针对现有高容量水印嵌入算法中载体图像失真问题,提出一种邻域差值预测的可逆水印算法,该算法通过计算相邻像素差值的绝对值来决定是否嵌入水印.为确保较高的图像质量,设置理想阈值,嵌入过程中如果绝对差值高于预设的阈值,则像素保持不变.结果表明,与同类算法相比,该算法具有较好的图像质量和高嵌入容量.     

一种邻域像素差预测的可逆水印算法

针对现有高容量水印嵌入算法中载体图像失真问题,提出一种邻域差值预测的可逆水印算法,该算法通过计算相邻像素差值的绝对值来决定是否嵌入水印.为确保较高的图像质量,设置理想阈值,嵌入过程中如果绝对差值高于预设的阈值,则像素保持不变.结果表明,与同类算法相比,该算法具有较好的图像质量和高嵌入容量.     

基于预测差值的医学图像可逆信息隐藏

针对目前医学图像需要对图像中特殊区域进行划分以及在应用于医学图像时效果不稳定、嵌入容量小等问题,结合医学图像的特点,提出一种基于预测差值的可逆信息隐藏算法。首先采用中值边缘预测算法计算预测差值,再根据预测差值的分类进行信息嵌入和像素平移;在形成载密图像的过程中,为防止像素值溢出,对原始图像进行多次预嵌入来标记所有可能发生溢出的像素点位置,且标记过的像素点不再修改。实验结果表明,本文算法能在保证图像质量的同时获得较高的嵌入量。     

采用相邻像素预测的可逆信息隐藏算法

为了提高图像信息隐藏算法的信息嵌入容量和载密图像的保真度,提出一种采用相邻像素预测的可逆信息隐藏算法.构建局部线性预测模型,以待预测像素的3个相邻像素为目标像素,通过目标像素的相邻像素建立线性方程组,求解预测模型参数.应用预测模型进行预测,计算预测误差,绘制预测误差直方图,通过直方图平移实现可逆信息隐藏.实验结果表明:文中算法可通过较少的预测像素进行预测,比其他算法具有更高的预测精度和更大的信息嵌入容量.     

一种基于位平面的差值扩展可逆水印算法

为了提高算法的嵌入容量和降低失真率等问题,文章提出一种基于图像位平面图分解理论的差值扩展算法,该算法只针对图像较低层的位平面图进行信息嵌入,不改变图像的其他较高位平面的像素值,通过这样的操作,在减小图像失真的同时,提高了总的信息隐藏量.     

基于二次预测误差和像素排序的可逆图像水印

为了提高可逆图像水印算法的性能,提出一种二次预测误差与像素排序相结合的可逆图像水印算法;该算法首先对像素进行二次误差预测;并利用相邻像素的误差值来确定其余像素的预测误差;然后采用局部复杂度对像素进行排序,以使具有较小误差值的像素被优先处理并进行数据嵌入;最后通过平移差值直方图生成零点间隙,利用冗余的零点间隙嵌入水印信息。实验结果表明,利用二次预测误差与像素排序技术,可以有效地提高像素的预测精度并降低图像失真;在相同的嵌入容量下,该算法嵌入水印后图像的PSNR比相关算法提高了1 dB左右,具有更好的不可感知性。     

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…     

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.     

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

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

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.