基于粒子群算法的盲源分离算法

简要地介绍了粒子群算法(PSO)及其改进算法和盲源分离算法(BSS),改进的粒子群算法具有并行性、易实现等优点。将改进的粒子群算法与盲源分离算法相结合,提出了基于粒子群算法的盲源分离算法。该算法以混合信号的峰度为目标函数,采用独立分量分析的方法,用改进的粒子群算法代替常规的最陡梯度下降法,对瞬时混合的信号进行盲分离,解决了梯度算法收敛速度慢的问题。实验仿真表明:该算法具有收敛速度快、分离效果好等特点。     

核独立分量分析在盲源信号分离中的应用研究

提出利用核独立分量分析来分离混合语音信号的盲信号处理方法.介绍了基于核空间ICA的原理和基本算法,然后利用核独立分量分析算法和固定点快速分离算法分离了混合语音信号.试验结果表明:利用基于核独立分量分析的方法可以得到较为理想的分离效果.     

基于粒子群算法的盲源信号分离

当源信号个数大于2,联合对角化（JADE）算法在盲源信号分离时效果不理想.提出了一种基于粒子群算法（PSO）的盲源信号分离（BSS）算法.该算法利用PSO算法代替JADE算法中的联合对角化操作,以混合信号的峭度为目标函数,采用独立分量分析的方法,对瞬时混合的信号进行了盲分离,理论分析和仿真结果表明了该算法的可行性和有效性.     

小波分解单通道盲分离干扰抑制方法

在单通道通信系统抗干扰问题中,由于先验信息不足,不能采用常规的盲分离方法抑制干扰?针对此问题,提出一种小波分解结合独立分量分析(independent component analysis,ICA)的单通道盲分离抗干扰方法?该方法利用小波分解,将单路混合信号分解为一系列的小波分量,通过计算各层小波分量的能量,选择最优小波分量作为ICA的输入信号,采用ICA方法实现信号的分离和重构?该方法选择最优小波分量进行盲分离,有效减少分离算法的计算量,同时降低噪声对系统性能的影响?仿真结果表明,所提方法可以有效地分离混合信号,提高单通道通信系统的抗干扰能力和系统处理速度?     

基于小波变换和FASTICA算法的有噪混合图像盲分离

简要介绍了独立分量分析的基本数学模型和算法,在此基础上,探讨了独立分量分析在有噪混合图像分离中的应用,提出了一种将小波阈值法去噪与独立分量分析相结合的多通道含噪盲信号分离算法,该算法在对混合含噪图像进行独立分量分析之前,使用小波阈值去噪去除含噪混合图像中的噪声.实验结果表明,该方法能有效地降低噪声信号的影响,较好地恢复了原始图像,解决了传统的独立分量分析方法无法实现加性噪声的多通道含噪盲信号分离的缺陷.     

基于独立分量分析与二值掩膜的语音分离

针对欠定混合语音信号模型,提出一种基于独立分量分析和二值掩膜相结合的语音分离新算法.首先,由并列放置的两个全指向性麦克风采集混合声音信号,通过一阶差分麦克风阵列技术使得两路混合信号满足瞬时混合模型;然后,应用两输入两输出独立分量分析方法对两路信号进行分离并估计分离信号的二值掩膜,循环迭代进而提取目标语音信号;最后,合并同源语音信号,增强各独立声源.仿真结果表明:该方法不仅适用于瞬时混合模型,对卷积混合模型同样有效;在瞬时混合条件下信噪比增益平均达到12.41dB,在卷积混合条件下信噪比增益平均为5.28dB.试验结果表明:算法在半消音室环境下能准确分离来自不同方位的三个声源,提取的目标语音都具有较高的清晰度与可懂性.     

一种新的盲声源信号分离方法及其应用

从盲声源信号的独立性出发,提出了一种新的盲声源混合信号分离方法.该方法基于信号联合概率的分布统计,利用信号联合概率的方向导数熵最小获得最佳的旋转角度,最终实现盲信号分离.与快速独立分量分析方法及神经网络方法相比,该方法不需要迭代计算.采用新的盲声源信号分离方法对轴承试验台的混合声音信号进行识别,将电机和滚动轴承的声音分离出来,进而可以准确识别机械的故障.     

单通道涡流无损检测信号盲源分离算法

针对脉冲涡流无损检测(pulsed eddy current testing, PECT)系统中获取单一检测信号存在的混叠问题,文章提出一种基于经验模态分解(empirical mode decomposition, EMD)和快速独立分量分析(fast independent component analysis, FastICA)的单通道盲源信号分离算法。该算法首先通过EMD对混合观测信号分解,然后利用奇异值分解(singular value decomposition, SVD)估计源信号数目,根据估计得到的源信号数目将观测信号和对应模态分量构成新的虚拟信号,最后利用FastICA算法分离得到源信号的估计。有限元仿真实验表明该算法能有效分离单通道混合检测信号,并且优于小波分解的单通道盲源分离算法。     

基于遗传算法的盲源分离算法

针对现有盲源分离算法的性能依赖于对比函数选择的现象,提出了一种基于遗传算法的盲源分离算法,该算法直接从信号的样本序列中估计出信号的概率分布,解决了信号间互信息的求解问题.通过遗传算法最小化信号的互信息,实现了对线性混叠信号的分离.对模拟信号的分离结果表明,该算法可以成功地分离混叠信号,同时与快速独立分量分析算法相比,该算法的性能对源信号的概率密度性质没有依赖,因而对亚高斯和超高斯信号的混合信号表现出更加优异的分离能力.     

基于独立分量分析的混合声音信号分离

论文简要介绍了有关独立分量分析（ICA）的基本理论和算法;探讨了独立分量分析在混合声音信号分离中的应用。针对ICA输出结果排序的不定性以及在长时间记录声音信号的过程,ICA混合模型系数存在时变性等问题,提出了一种结合小波变换和独立分量分析的解决方法;试验结果表明,该方法能有效地提高运算效率并获得较好的分离效果。     

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.