化学信号小波变换的本质分析

根据墨西哥帽小波的特点,提出两种新的函数,对化学信号进行n次小波变换,得到了信号的近似2n阶导数.由数值微分法和小波变换法对模拟信号计算的结果发现对于含噪信号,小波变换法有效滤除了噪声,所得结果的信噪比明显高于前一种方法;同时还可分离重叠峰,提高谱图分辨率.该方法函数形式简单,易于编程,为处理化学信号提供了新的途径.     

基于新阈值函数的二进小波变换信号去噪研究

由于二进小波变换的小波基函数存在着一定的冗余,基于二进小波变换的去噪效果要好于离散小波变换的信号去噪·噪声阈值的准确估计和阈值函数的选择对去噪精度有着显著的影响·在分析高斯噪声的二进小波变换特性基础上,提出了一种改进的二进小波变换去噪方法·采用一种新的阈值函数,克服了Donoho软阈值方法中估计小波系数与分解小波系数存在恒定偏差的缺陷·仿真结果表明,改进的二进小波去噪方法不仅可以有效地抑制信号奇异点处的pseudo-Gibbs现象,而且消噪精度高于传统的软硬阈值方法·     

一种基于小波的白噪声消除方法

介绍了小波变换的基本理论，研究了信号和白噪声在小波变换下的不同特性，在此基础上提出了一种新的基于小波变换的白噪声消除方法．仿真结果证明，这种方法具有很好的去噪声效果．     

基于样条小波变换的语音基音检测

作者在分析小波变换时频局部化特性的基础上，选取样条小波函数对语音信号进行处理，给出了基于小波变换极大模的基音周期检测方法和实验结果。     

连续样条小波变换解析高噪声重叠分析信号

采用连续样条小波变换方法对化学中高噪声重叠信号中峰位置和峰数目的提取进行了分析,讨论了信噪比、重叠程度、信号相邻峰高比对重叠信号解析的影响．结果表明：对于信噪比低至1的高噪声信号,采用连续样条小波变换处理能够得到重叠信号的峰位置和峰数目;连续样条小波变换对于高噪声重叠信号具有较好的解析能力,为低含量多组分物质的复合信号的定性定量分析提供了基础;该方法与离散小波变换法相比,数据点无须为2^n(n为整数),并且不需要对信号进行多次分解,因此简单快速。     

小波变换在心电图R波检测中的应用

介绍了一种新颖的信号处理方法－小波变换．利用三阶样条小波分析了信号的奇异点与其小波变换的关系，并通过ＥＣＧ信号的小波变换，分析了小波变换的抗干扰能力．最后提出了一种以小波变换为基础的ＱＲＳ波检测方法     

小波变换数字算法及其在高压输电线保护中的应用

从电力系统继电保护应用的角度，结合香农采样定理，深入探讨了连续信号和离散信号的小波变换的关系，给出了离散信号的积分小波变换和离散小波变换的数字计算方法。从理论上研究了信号小波变换的误差与尺度函数和小波函数的关系。结果表明：小波变换的误差来源一是信号在尺度空间的投影与抽样空间的投影转换，二是小波以及尺度函数的选择。小波的时频定位特性越好，即时间频率窗的面积越小，计算误差越小。阐述了小波分析在电力系统高压输电线路的行波保护以及单端暂态量保护中的应用。     

连续小波变换与几种具体信号的傅立叶变换的比较

列出门函数、单边指数函数和阶跃函数这三种具体信号的连续小波变换与傅里叶变换的表达式,并通过表达式对连续小波变换与傅里叶变换进行比较．结果表明：傅里叶变换是线性变换,具有统一性和相似性,但不具有局部化性质,不能作局部分析;小波变换也是线性变换,同样具有统一性和相似性,并且是稳定的,还具有时一频同时局部性和自适应性．由此说明了小波变换在分析和处理信号时比傅里叶变换更加灵活、更加全面和深入．     

小波神经网络在模拟电路故障诊断中的应用研究

对模拟电路提出了一种基于小波与神经网络辅助式结合的故障诊断方法．该方法用小波变换作为模拟电路故障信号的预处理器，大大减少神经网络的输入数目，简化神经网络结构和减少它的训练时间，提高辨识故障能力．在介绍该故障诊断方法的基本原理后。给出了小波函数及故障特征选择的方法．     

瞬态信号波至点检测函数的研究

讨论了连续复小波变换在瞬态信号波至点检测中的运用,提出了一种新的信号波至点检测函数.这种检测函数运用了能量归一化的方法,它不仅能够保证信号波至点的有效检测,而且还拓宽了小波变换中用于信号检测的尺度范围.仿真实验证明,这种检测函数是有效的.     

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.