神经元中的随机共振及含燥周期方波脉冲信号的最优检测

理论研究表明，神经元用于含噪周期方波脉冲信号传输时存在随机共振现象，信号的占空比和神经元的阈值对随机共振的影响有一定的规律．同时，可获得大于1的信噪比增益，这是线性系统不能实现的，因而可将神经元的应用推广到非线性信号处理领域．在此基础上，对应用神经元实现含噪周期方波脉冲信号检测的最优条件和最优特性进行了分析．最后，通过仿其实验验证了理论分析的正确性．     

含相关色噪声和周期方波信号的双稳系统的随机共振

本文研究了含相关色噪声和周期方波信号的双稳态系统的随机共振（Stochastic Resonance, SR）. 在绝热极限条件下，本文利用统一色噪声逼近（Unified Colored-Noise Approximation, UCNA）法将原系统转化为相关高斯白噪声及周期方波信号驱动的新双稳系统，给出其Fokker-Planck方程，然后基于双态理论推导了系统的信噪比（Signal-to-Noise Ratio, SNR）的表达式．本文分析了势参数、噪声参数及信号参数对系统信噪比的影响，发现对所有参数随机共振均出现．本研究可望为实际应用提供一些理论基础．     

基于随机共振大参数微弱周期信号检测

研究了非线性双稳系统的动力学机理,根据非线性系统产生随机共振的同步条件,提出了不满足绝热近似理论的大参数微弱信号实现随机共振的方法。通过对系统参数的适当调整,实现了大频率信号和大强度噪声淹没的微弱周期信号的检测。理论分析和仿真实验表明,该方法有效地实现了大参数微弱信号随机共振,使得利用随机共振法检测大参数微弱周期信号不再局限于尺度变换法。     

小波分析在动态测试信号降噪中的应用

论述了小波分析在动态测试信号降噪中的应用.主要分析如何引入小波变换理论并通过它去除动态测试信号中的白噪声.随后阐述小波分析去除噪声的工程实现方法及其相对FFT除噪方法的优势.对一例加入白噪声的力脉冲信号进行了计算机仿真实验,结果表明,用小波变换处理含噪信号,具有明显效果.     

采用遗传算法的自适应随机共振系统弱信号检测方法研究

针对传统自适应随机共振系统只能实现单参数优化的缺点,提出了一种基于遗传算法的多参数同步优化自适应随机共振算法.该算法选用由双稳系统输出的信噪比作为遗传算法的适应度函数,能够实现随机共振系统中多个参数的自适应选取,从而最优地检测出原始信号中的微弱周期成分.同时,将该优化算法和移频变尺度随机共振相结合,可以实现大参数条件下的随机共振.仿真数据和滚动轴承外环故障数据的分析表明,该算法收敛速度快,简单易行,在采样点数较少的条件下能从强噪声背景中检测出微弱的高频周期成分,因此具有良好的工程应用前景.     

信号逼近在复杂信号去噪中的应用

对具有不同类型时频结构的复杂信号,为了最优化非线性信号逼近,可根据信号自适应地选择基。分析了通过极小化凹花费函数,从基字典中挑选“最佳”基的原理,采用快速最佳基的树搜索算法,在小波包基和局部余弦基这一类基中寻找被处理信号的最优基,实现了含噪语音录音信号的去噪。结果表明,最优经验局部余弦基对此类复杂信号的去噪效果远比固定小波基阈值去噪效果好。     

噪声诱导下单热敏神经元信号检测

利用热敏神经元动作电位发放图、ISI分叉图、功率谱密度(PSD)等,系统地研究了单热敏神经元在噪声诱导下的随机共振现象.通过对比分析发现分岔周期数为1或者2的情况下,存在一最优输入信号频率fopt,使得神经元输出信噪比(rSNR)最高.不同噪声强度D下,热敏神经元对输人信号检测能力各异,低噪声强度下检测能力较好.     

深孔加工过程油压监测信号消噪技术研究

针对深孔加工过程油压监测信号含有大量脉冲干扰和随机非平稳噪声的特点,提出了一种基于小波包的防脉冲干扰滑动平均滤波方法,该方法首先对油压信号进行小波包消噪,再对小波包处理后的结果进行防脉冲滑动平均处理.实验结果表明,利用小波包技术和防脉冲干扰滑动平均算法相结合的滤波方法,对油压监测信号具有很好的滤波效果,从消噪油压信号中提取的变化率特征可有效实现对深孔加工过程中堵屑故障的监测.     

一种非线性双稳系统的微弱信号捕获装置设计

基于信号检测技术中随机共振的原理,采用数值模拟手段,建立脉冲多普勒信号检测的随机共振系统;对信号进行频率压缩,使之变为满足发生随机共振条件的低频信号,实现随机共振;给出信号检测的随机共振软件程序、硬件电路,实现强噪声环境下对较大频率微弱信号的捕获。     

频移变尺度自适应随机共振在大信号检测中的应用

针对随机共振检测大信号的局限性和判断随机共振发生时刻的盲目性,提出了将基于频域信噪比的自适应算法引入频移变尺度随机共振中,自动调节双稳态系统结构参数和采样频率,自动获取随机共振状态,实现大参数信号检测.数值仿真实验结果表明,频移变尺度自适应随机共振可以从强噪声背景中提取较高频率的周期信号;能自适应地寻找到随机共振发生时刻,获得了较高的输出信噪比,在信号检测领域具有更好的应用前景.     

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.