基于FFT预估计的宽带信号DOA估计

将离散傅立叶变换（DFT）运用到宽带阵列信号处理中，对等距线阵接收的信号进行波达方向（DOA）估计，解决了基于聚焦的宽带信号DOA估计中预估速度较慢的问题。该方法能快速预估出DOA，与采用传统的波束形成法预估相比，计算速度大大提高。用该方法预估后再对波达方向作高精度估计，仍具有对信号的超分辨特性。计算机仿真结果表明此方法可以运用到宽带信号处理中，计算量与传统的波束形成法相比大大减少。     

给予窄带信号DOA估计的宽带相干信号DOA估计方法研究

提出了一种用窄带信号的波达方向（DOA）估计方法与宽带聚焦的方法相结合来估计宽带相干信号的DOA的方法.先利用相干信号子空间法将带宽内各个频率点的信号子空间聚焦到参考频点下的同一信号子空间，然后利用窄带信号的波达方向估计方法对DOA进行估计.用了一种新的无需谱峰搜索并且不要对噪声方差进行估计的窄带SSESPRIT算法进行宽带波达方向的估计，为了比较又用了经典的需要进行谱峰搜索的窄带MUSIC算法进行宽带信号的一维及二维波达方向的估计，仿真实验结果验证了方法的有效性.     

未知信源数条件下基于合成空间谱的弱信号DOA估计方法

针对强弱信号并存时信源数和弱信号波达方向难以准确估计的问题,提出了一种基于合成空间谱的弱信号DOA估计方法.该方法将阵列的特征波束通道输出进行加权叠加,并用其对噪声子空间逼近法的空间谱函数进行方位加权,得到合成空间谱对弱信号DOA进行估计.本方法无需信源数目已知的先验信息.相比于已有的基于特征波束形成的弱信号DOA估计法,本方法在多个弱信号来波方向较接近时具有更好的估计性能,仿真结果证实了本方法的有效性和优势.     

基于窄带信号DOA估计的宽带相干信号DOA估计方法研究

提出了一种用窄带信号的波达方向(DOA)估计方法与宽带聚焦的方法相结合来估计宽带相干信号的DOA的方法.先利用相干信号子空间法将带宽内各个频率点的信号子空间聚焦到参考频点下的同一信号子空间,然后利用窄带信号的波达方向估计方法对DOA进行估计.用了一种新的无需谱峰搜索并且不要对噪声方差进行估计的窄带SSESPRIT算法进行宽带波达方向的估计,为了比较又用了经典的需要进行谱峰搜索的窄带MUSIC算法进行宽带信号的一维及二维波达方向的估计,仿真实验结果验证了方法的有效性.     

基于改进聚焦矩阵算法宽带信号测向研究

针对CSM算法预估信号,存在DOA估计误差的问题进行研究,提出运用解相干空间平滑技术对宽带信号进行矩阵重构,进而构造酉聚焦矩阵,将各频率点下阵列流变换到同一频率点上,进行DOA估计.仿真结果表明,经过前后向平滑处理,改进聚焦变换矩阵的方法,不需要对来波信号方位角预估,就能高精度、稳健的估计来波方向,且计算量少.     

非规则部分校准阵列下的宽带LFM信号二维DOA估计

提出了一种宽带线性调频（LFM）信号的二维波达方向（DOA）估计新方法.该方法在空域和时域同时对信号进行采样,并利用观测样本的分数阶Fourier域峰值构造出新的时频空DOA矩阵,进而通过特征值分解的方法实现多个LFM信号的DOA估计.该方法充分地挖掘了观测信号所包含的时频信息,降低了对阵列结构和阵元一致性的约束,使其适用于阵元几何分布不规则且大部分阵元未经校准的阵列.此外,该方法无需谱峰搜索和二维参数配对,计算简单且估计精度较高.仿真结果显示,在DOA估计的均方根误差（RMSE）相同时,与传统方法相比,该方法可获得6～8 dB的信噪比增益.     

阵列信号处理中多重信号分类算法的仿真研究

波达方向（DOA）估计是阵列信号处理研究的重要内容之一,多重信号分类（MUSIC）算法是一种经典有效的DOA方法。概述了阵列信号处理研究的主要内容,详细介绍了多重信号分类算法的原理,并用MATLAB进行仿真实现该算法,研究了MUSIC算法的性能。     

结合快速傅里叶变换和线性调频变换的快速波达方向估计

针对阵列信号处理中传统多重信号分类(MUSIC)算法估计信号波达方向(DOA)时运算量庞大,导致其在实时性需求较高的场合应用受限的问题,提出一种结合快速傅里叶变换和线性调频变换的快速DOA估计算法。该算法以降低MUSIC算法谱峰搜索的运算复杂度为目的,首先利用分片搜索的思想并结合快速傅里叶变换对估计的信号子空间矢量进行波束形成,近似估计信号DOA,获取其对应波束指向及该波束指向对应的空域角度范围,避免了对全空域角度范围的谱峰搜索;然后,针对已确定的空域角度范围,结合线性调频变换算法实现信号DOA的精确估计,通过将MUSIC算法中对估计的噪声子空间矢量的加权处理转化为可以快速实现的序列的圆周卷积,降低精确估计信号DOA时谱峰搜索的运算复杂度。理论分析和仿真实验表明:相比于经典的MUSIC算法,所提算法能够在保证信号DOA估计精度的前提下将MUSIC算法谱峰搜索的运算复杂度降至原复杂度的10%以下;对于阵列孔径较大和DOA估计精度要求较高的场景,所提算法的计算效率优势更为明显。     

采用 RWT的信号波达方向估计方法

针对宽带多线性调频信号波达方向（DOA）估计精度低的问题,提出了一种基于Radon-Wigner变换（RWT）和多重信号分解（MusIc）的信号DOA估计方法．该方法首先利用RWT在多目标环境下能够有效抑制交叉项干扰和噪声,具有很好的时频汇聚性特点,通过峰值搜索提取信号的初始频率和调频斜率;然后将信号阵列的时变方向矩阵...     

基于盲源分离算法的阵列信号波达方向-频率估计

盲信号处理已成为近年信号处理和神经网络热点领域,主要用于语言信号处理,应用于雷达信号处理并不多见.确定空间辐射源的波达方向(DOA)和频率是雷达阵列信号处理的基本问题之一,近20年来许多学者提出了性能各异的算法,其中有代表性的是多信号分类法和旋转不变技术的参数估计法.近年来,越来越多文献将盲源分离算法应用到阵列信号处理中,开辟了一条DOA估计的新道路.本文首先给出了一种用来盲分离复数信号的盲源分离算法,结合该算法,提出了可同时估计波达方向、频率的波达方向-频率盲估计算法.盲源分离算法是基于负熵的快速定点算法,不需要给出复数信号的概率密度函数,具有收敛速度快,鲁棒性强等特点.本文证明了波达方向-频率盲估计算法的收敛性.仿真研究表明新的波达角估计算法的特点:1)估计算法是有效并且鲁棒的;2)估计算法能从含噪声的阵列接收信号中同时估计出辐射源波达方向和频率;3)估计算法能将雷达杂波和目标回波分离.     

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).     

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.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.