带有色乘性噪声随机系统的逆向最优反卷积算法

通过建立状态和乘性色噪声的逆向Markov模型，推导出了带有色乘性噪声随机系统的逆向最优状态滤波器。基于该滤波器给出了节省存储空间的逆向固定区间最优反卷积算法。仿真实例证明了该反卷积算法的有效性。     

两传感器自校正信息融合白噪声Wiener反卷积滤波器

应用现代时间序列分析方法,基于自回归滑动平均(ARMA)新息模型,对于带未知模型参数和噪声方差的两传感器反卷积系统,提出了自校正信息融合白噪声Wiener反卷积滤波器。它具有渐近最优性。一个Bernoulli-Gaussian白噪声反卷积的仿真例子说明了其有效性。     

最小输出熵盲反卷积方法中概率密度估计

针对多通道卷积混叠模型 ,给出了两种基于最小熵盲反卷积算法中概率估计的方法—基于Edgeworth展开非参数逼近方法和基于核函数的参数逼近法 ,概率估计方法和反卷积滤波器参数逼近的训练公式一起构成最小熵盲反卷积方法 .文中给出了计算机仿真实例     

自校正信息融合Wiener反卷积滤波器

对于含有未知模型参数和噪声统计的多传感器信号反卷积系统，应用现代时间序列分析方法，基于自回归滑动平均（ARMA）新息模型参数的在线辨识，可在线估计噪声方差，进而提出了自校正信息融合Wiener反卷积滤波器。证明了它的渐近最优性，即若ARMA新息模型参数估计是一致的，则它收敛于当噪声方差已知时的最优融合Wiener反卷积滤波器。同单传感器情形相比，它可提高滤波精度。一个带三传感器的反卷积系统的仿真例子说明了其有效性。     

ANC系统的FU-LMS算法及其性能分析

由于声反馈通道向ＡＮＣ系统引入了新的极点,导致系统有失稳的可能性,为了补偿反馈通道的反馈增益,引入具有零极点的ＩＩＲ滤波器结构和ＦＵ－ＬＭＳ算法。通过理论 计算机仿真,讨论了ＦＵ－ＬＭＳ算法各参数对系统性能的影响。结果表明,采用ＩＩＲ滤波器结构的ＡＮＣ系统,对声学反馈现明确定具有明显的抑制作用。．     

一种新的尖峰信号盲反卷积方法

介绍一种新的盲反卷积方法，以解决尖峰信号的盲卷积问题，该方法不需知道信号和噪声的先验知识。基于尖峰信号高斯混合模型，给出一个自适应反卷积滤波器和一个自适应零记忆非线性估计器，以实现信号的恢复。将进化计算和梯度算法相结合，对反卷积滤波器和零记忆非线性估计器进行参数寻优，从而获得良好的信号恢复效果。最后给出计算机仿真结果。     

用于信号盲提取的最大三阶相关峭度反卷积算法

传统的低阶自适应滤波器难以抑制或消除激光位移信号的高阶统计噪声,且在微位移测量条件下,基于最大熵或自然梯度的盲源分离方法的收敛速度和信噪比会急剧降低.为此,文中利用混合信号的峭度变化特性,提出了最大三阶相关峭度反卷积算法,设计了反卷积逆滤波器,分析了最大三阶相关峭度反卷积算法的收敛性和稳定条件,并构建了实验平台进行盲提取实验.结果表明,最大三阶相关峭度反卷积算法可有效地盲提取激光位移信号和多重反射信号,较FastICA算法具有更快的收敛速度和更高的信噪比.     

一类H_∞线性连续时变反卷积滤波器

在反卷积框架下研究未知输入的估计问题,提出一类线性连续时变H∞反卷积滤波器.反卷积滤波器的结构等效于输出观测器和一个线性映射,该线性映射反映了未知输入与输出估计误差之间的内在联系.基于有界实引理给出了反卷积滤波器的时域设计方法和滤波器存在的充分条件.滤波器的设计参数可通过求解一个Riccati方程来构造.文中还给出了反卷积滤波的稳态解,并通过数值算例证明了所提出方法的有效性.     

一种自适应线谱对滤波器的新算法及在线性预测中的应用

本文从自适应格型滤波器导出自适应线谱对（ＬＳＰ）滤波器，使用最小均方（ＬＭＳ）型自适应算法逐级更新计算线谱对系数。实验表明。该算法与其它算法比较，具有更高的收敛率和较低的失调。用该算法计算得到的ＬＳＰ系数进行语音线性预测合成，获得比使用ＰＡＲＣＯＲ系数更好的效果。     

基于VHDL语言的fir滤波器软件设计

本文以一个具体指标参数的fir滤波器为例,详细介绍了基于VHDL语言设计fir滤波器的软件设计流程,从最初的方案确定、并利用matlab对滤波器参数的计算、VHDL代码的编写并最终通过matlab的conv函数可以验证FIR滤波器卷积的结果。     

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.