基于MaxplusⅡ的短时傅里叶变换分析及仿真实现研究

通过短时傅里叶变换算法原理分析,运用Max+plus II设计了现场可编程逻辑器件实现高速短时傅里叶变换,该结构充分利用蝶形单元运算特点,在满足时间分辨率及频率分辨率的基础上降低了运算复杂度,并在高速率运行时钟下节省了硬件资源.最后,进行了仿真研究分析,达到了信号语谱设计要求.     

基于FDCT的图像消噪算法

由于曲波(Curvelet)变换可以很好的逼近含线奇异的高维函数,近年来日益受到研究人员的普遍关注.传统的数字曲波变换是非正交的、冗余度较高,而本文采用的快速曲波变换(Fast Discrete Curvelet Trans form,FDCT)对物体边缘信息具有最优稀疏表示.通过实验表明,基于FDCT的图像消噪算法可以很好的保持图像边缘,使消噪后的图像获得较好的视觉效果,同时峰值信噪比(PSNR)也得到很大提高.     

对数快速傅氏变换

本文讨论了对数数字系统中的快速傅里叶变换,分析了对数数字系统中快速傅里叶变换的执行速度及运算误差。理论分析与实验结果均表明对数系统中快速傅里叶变换的速度与精度都优于定点数和浮点数系统,文中还给出了计算机模拟实验的结果。     

基于分数傅里叶变换的认知无线电抗干扰系统

认知无线电之间的冲突或者授权用户的干扰会降低认知无线电系统的性能,为此,文中提出了采用分数傅里叶变换的认知无线电抗干扰系统,将在分数傅里叶变换域具有能量集中性的Chirp信号作为认知无线电的基带信号,接收端通过分数傅里叶变换域滤波和相关运算恢复出原始数据.仿真表明:文中的系统能够提取出有用信号的能量,当干扰为余弦信号时,要比未采用分数傅里叶变换的系统具有更低的误码率,而且还能够有效地抑制多径干扰和其他的多认知用户的干扰.     

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

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

高速数字接收机中位同步与滤波联合实现方法

针对高速数字接收机中的位同步问题,提出了一种位同步与滤波联合实现结构.该结构利用一次快速傅里叶变换(FFT)运算将信号变换至频域,从中提取定时信息并实现定时恢复,同时完成滤波处理,极大地降低了系统的运算量,节约了硬件资源,并且能够先于载波同步稳定工作.理论分析与仿真结果表明,该结构算法复杂度低,比常用时域方法减少了约60%的运算量,能够在中等信噪比条件下(15 dB以上)准确实现位同步,适用于高速调制解调系统.     

基于扩展傅里叶变换的图像压缩

介绍了傅里叶变换的原理,分析了傅里叶变换在声音和视频压缩方面的应用,并且指出傅里叶变换在数字图像处理中的重要地位和作用.     

浅谈积分变换在电路分析中的应用

通过非周期函数傅里叶变换式的三角函数形式与周期函数的傅里叶级数对比,指出两者都是无穷多项正弦谐波的叠加:周期函数的傅里叶级数是可数无穷多项的叠加,非周期函数傅里叶变换是不可数无穷多项的叠加,得到了傅里叶变换的电学背景及非周期电路的分析方法.综述了傅里叶变换、拉普拉斯变换在电路分析中的应用.     

利用整数变换的高效图像可逆信息隐藏方法

针对Alattar算法运算复杂度过高的问题,提出一种基于整数变换的高效图像可逆信息隐藏方法.该方法在数据嵌入和提取过程中,只需要对各宿主向量进行一次整数变换,且所有向量通过整数变换后即可直接判定该向量是否可用于嵌入机密数据,降低了数据嵌入和提取过程中的运算复杂度.实验结果表明:该方法具有较大的数据嵌入容量,较好的隐蔽性和较低运算复杂度,在正确提取嵌入数据后可无失真恢复原图像.     

基于一维傅里叶变换的改进形状上下文特征

提出了一种新的特征描述子,将无方向选择的形状上下文特征看做一系列一维信号的集合,对这些信号做一维傅里叶变换,理论上证明了利用这种简单的算法可以生成平移、缩放、旋转不变的特征.新特征的提取运算简单,时间复杂度低.形状点集匹配的实验结果验证了这种新特征的有效性.     

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.