一种基于DCT变换的文档图像半脆弱数字水印算法

提出了一种用于文档图像内容认证的半脆弱数字水印嵌入算法,可用于文档图像内容的篡改定位,该算法利用文档图像的纹理频域特性生成水印,并将水印嵌入到图像中,嵌入算法采用了分快的DCT变换,对文档图像进行认证时,不需要原始载体图像,也不需要额外存储水印信息.给出实验数据说明算法的有效性,实验表明,本文算法具有较好的透明性,对JPEG有损压缩具有较好的鲁棒性;对剪切、替换等恶意篡改表现出脆弱性.     

基于JPEG2000的半脆弱数字水印技术

提出了一种抵抗JPEG2000图像压缩标准的半脆弱水印,适合数字图像产品的内容篡改认证和完整性证明.该算法先对图像进行预量化与预截断抵抗JPEG20000的压缩攻击,根据原始图像像素的邻域特性形成水印,再使用量化嵌入算法,嵌入水印.提取时不需要原始图像甚至不需要原始水印的对比.实验效果表明,该算法对抵抗JPEG2000压缩有鲁棒性,对恶意攻击有脆弱性,篡改定位准确.     

一种多功能数字水印算法的研究与实现

提出了一种图像多功能数字水印算法.在图像中同时嵌入一个鲁棒水印和一个脆弱水印,前者用于版权保护,后者用于篡改提示.结果表明,鲁棒水印对各种攻击具有一定的稳健性,而脆弱水印具有一定的易损性,从而实现了版权保护和篡改提示,而且有效实现了原始水印的盲检测.     

基于整数小波零嵌入的多类数字水印算法

;基于整数小波变换和SPIHT搜索小波零树理论,提出一种整数小波零嵌入的多类数字水印算法:将用于版权保护的鲁棒水印进行零嵌入,再将用于数据完整性认证的脆弱水印分别嵌入到小波域不同方向的细节子代中.通过对含水印图像的攻击实验表明,该算法兼具鲁棒性和脆弱敏感性,且篡改定位较精确,水印检测时不需要原始图像的参与,是一种有效的数字图像水印方案.     

一种彩色图像内容认证混沌脆弱水印算法

提出了一种结合彩色图像分量内容和混沌系统的脆弱数字水印算法.将原始图像R分量和B分量的像素值经混沌序列调制后映射成另一个混沌系统的初值,经多次迭代生成4灰度级的水印图像;然后把它嵌入原始图像G分量的最低2比特平面.利用混沌对初值极端敏感性的特点,能够精确地定位对加入水印图像的篡改,并且水印提取不需要原始图像.实验结果表明了所提出水印方案对篡改证明的有效性、敏感性以及良好的篡改定位能力.     

一种基于分块DCT变换的三维网格模型

 半脆弱水印可区分恶意攻击和正常数据处理,具有更广泛的适用性,但目前已提出的算法大多只能容忍少数类型的网格正常处理。文中提出了一种基于内容认证的半脆弱水印算法,网格分割后水印隐藏在各分块的DCT变换域系数中,网格被非法篡改时,通过匹配提取出的水印序列与原始水印序列可定位出篡改位置。实验结果表明,算法嵌入的半脆弱水印可容忍多种类型的网格正常数据处理,如网格RST相似变换和低强度的顶点坐标值量化处理,同时对恶意攻击表现敏感,可较准确的定位出篡改位置,并能以直观的可视化形式做出标记。     

一种能进行篡改定位的音频双水印算法

提出一种音频双水印算法,解决双水印中认证水印的抗攻击鲁棒性差以及脆弱水印定位不准确的问题。鲁棒水印采用基于RBF神经网络的音频零水印方案作为版权认证水印,因为该水印方案不改变原始音频数据,所以具有良好的透明性;脆弱水印采用一种新的双极性量化方法嵌入,提高了脆弱水印的敏感性。实验结果表明,该方案认证水印具有很强的抗攻击鲁棒性,脆弱水印具有很强的敏感性,且能够对恶意篡改进行精确定位。     

基于混沌映射的脆弱水印技术

提出了一种基于混沌映射的自适应脆弱水印算法,选取图像小波变换的低频信息作为图像特征并利用混沌映射对初值的敏感性产生两种水印,将其嵌入到随机选择的图像点的LSB（Least Significant Bit）,有效地抵抗了伪认证攻击。水印的产生和嵌入都基于宿主图像本身,因此认证时无需原始图像和水印的参与,实现了盲检测功能。实验结果表明,该脆弱水印算法对图像篡改有很强的敏感性,并具有良好地篡改定位能力。     

可信JPEG XR图像采集研究与实现

文章在原始图像中加入定位信息和时间信息并编码为JPEG XR图像,采用半脆弱水印技术实现图像的鲁棒性认证和内容认证,构造可信的JPEG XR图像采集系统。由CMOS采集原始图像,借助GPS全球定位系统获取定位信息和时间信息添加在该图像合适位置,被编码为JPEG XR频率模式码流结构,提取码流中的DC系数和LP系数构造基于图像内容的二值特征信息作为水印,置乱后嵌入到JPEG XR解码后的图像对应像素的Y分量的最低有效位中,然后再对含有水印的图像进行JPEG XR编码实现水印嵌入;通过比较基于图像的二值信息和嵌入在图像的二值水印信息进行篡改定位;在S3C2410A上移植定制并优化的JPEGXR编解码算法和半脆弱水印算法并进行测试。     

一种基于分块DCT变换的三维网格模型半脆弱水印算法

半脆弱水印可区分恶意攻击和正常数据处理,具有更广泛的适用性,但目前已提出的算法大多只能容忍少数类型的网格正常处理。文中提出了一种基于内容认证的半脆弱水印算法,网格分割后水印隐藏在各分块的DCT变换域系数中,网格被非法篡改时,通过匹配提取出的水印序列与原始水印序列可定位出篡改位置。实验结果表明,算法嵌入的半脆弱水印可容忍多种类型的网格正常数据处理,如网格RST相似变换和低强度的顶点坐标值量化处理,同时对恶意攻击表现敏感,可较准确的定位出篡改位置,并能以直观的可视化形式做出标记。     

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.