基于证据理论的协同频谱感知算法

针对认知无线电系统中的有效检测授权用户需求,研究了中心节点未知先验信息时的协同频谱感知问题。为了在中心节点未知先验信息的条件下实现对授权用户的有效检测,基于证据理论,对认知用户的本地感知结果提取证据,在中心节点进行融合并判决,提出了一种新的协同频谱感知算法。仿真表明,该算法能够在中心节点未知先验信息情况下,获得很好的频谱感知性能,在先验信息和感知性能之间取得了很好的折中。     

分簇认知网络中能量有效的协作频谱感知算法

针对认知网络中用户节点能量受限问题,提出了一种基于分簇网络的能量有效协作频谱感知算法。该频谱感知算法通过对用户节点分簇,缩短感知结果的传输距离。根据对授权用户信号的本地感知和簇内融合的判决结果,设计两次报告审查规则,减少传输感知结果的认知用户数量。以最小化协作频谱感知能耗为目标,建立多变量非线性优化问题模型,并通过逐一变量优化方法求得次优解。仿真结果表明,在保证检测性能的前提下,该算法能明显降低协作频谱感知的能量消耗和传输时延。     

分簇认知网络中能量有效的协作频谱感知算法研究

针对认知网络中用户节点能量受限问题,提出了一种基于分簇网络的能量有效协作频谱感知算法。该频谱感知算法通过对用户节点分簇,缩短感知结果的传输距离。根据对授权用户信号的本地感知和簇内融合的判决结果,设计两次报告审查规则,减少传输感知结果的认知用户数量。以最小化协作频谱感知能耗为目标,建立多变量非线性优化问题模型,并通过逐一变量优化方法求得次优解。仿真结果表明,在保证检测性能的前提下,该算法能明显降低协作频谱感知的能量消耗和传输时延。     

基于频谱感知信息的认知无线电网络功率密度约束问题

通过机会式地共享已分配的授权频谱,认知无线电技术可以极大地提高频谱的利用率,解决目前频谱资源日益匮乏的难题。当认知无线电网络与传统的通信网络共存时,首先要保证不会对传统的通信系统产生有害的干扰。为此,就需要考虑认知无线电网络中节点的配置密度,使得其对传统用户（主用户）的干扰低于干扰温度的容限。针对此问题考虑了多个认知用户组网时的最大可达到的功率密度问题,在认知用户与主用户间的距离参数未知条件下,将此距离用认知用户检测到的本地信噪比等价表示,获得了认知用户在不同检测概率条件下的可允许的最大功率密度约束条件,并给出了仿真结果。     

一种基于多个循环频率的联合循环谱感知方法

认知无线电是提高频谱利用效率的一种有效途径,快速可靠地检测到主用户和频谱空穴是认知无线电实现的关键和前提.循环平稳检测是认知无线电中进行频谱空穴检测的可靠方法,可以在低信噪比时有效检测出授权用户是否存在.针对单循环检测不能充分利用信号所包含信息的缺点,提出了将Chair-Varshney数据融合准则的思想应用于循环频谱检测的改进算法,使用多个循环频率处的循环谱进行联合检测.仿真分析表明:改进算法充分利用了各单点循环频率上的循环谱信息,在低信噪比时有更好的检测性能.     

基于迭代支持检测的分布式压缩频谱感知算法

在宽带认知无线电网络中,为了解决频谱感知所面临的诸如高采样速率、信道衰落以及认知无线电用户硬件资源受限等技术挑战,提出一种基于迭代支持检测的分布式压缩频谱感知算法.通过一跳通信的方式,认知无线电用户能够将各自的检测信息扩散到整个网络,并得到全局一致的支持集;同时,认知无线电用户进行本地稀疏信号重构时,利用一致的支持集信息能够保证不同用户的估计结果具有联合稀疏特性,从而得到更为准确的频谱检测结果.仿真结果表明,文中的分布式频谱感知算法能够以低于奈奎斯特准则的采样速率有效地实现频谱检测,并且在不需要融合中心的前提下获得近似最佳的检测性能.     

基于用户集合势估计的认知无线电合作频谱感知

频谱感知技术是认知无线电系统的基本功能,是实现已授权频段的次级动态接入和共享的前提。提出基于用户集合势估计的合作频谱感知方案,旨在通过GEEF（gerschgorin exponentially embedded families）,SPEEF（sam-pled power exponentially embedded families）等算法估计出用户的集合势,即适合参与合作频谱感知的最优用户个数,再从全部合作用户中筛选出相应的频谱观测数据生成全局检测统计量,通过与判决门限进行对比,最终对授权用户状态做出判决。理论分析与实验结果表明,提出的方案能够有效地提高频谱感知的性能。     

宽带认知无线电网络分布式协作压缩频谱感知算法

针对宽带认知无线电网络中压缩频谱感知算法在低信噪比环境下频谱检测性能下降的问题,提出了一种基于高斯过程的分布式压缩频谱感知(PBCS)算法.首先应用层次化的正态分布概率模型来表示压缩频谱的重构,然后各个认知无线电用户交换模型参数并结合本地的压缩采样数据进行压缩频谱感知.有别于其他直接融合频谱感知结果或检测数据的协作式算法,PBCS算法通过模型参数融合来进行协作,能有效减小信噪比低的协作用户的影响,从而提高算法的抗噪性.仿真结果表明,PBCS算法可以在-5dB的信噪比条件下达到检测概率大于0.9、误检概率为0.1的频谱检测性能.     

基于信噪比加权的协作频谱感知技术

在认知无线电系统中,通过认知用户的彼此协作,可以显著提高频谱感知的性能.在实际工作环境中,由于认知用户之间的差异,其信噪比会不同,每个认知用户的局部判决在融合中心对全局判决的影响也不同,因此本文提出一种基于信噪比加权的感知技术,给不同信噪比的用户能量分配不同的权重,采用间接的动态改变不同信噪比用户的判决门限的方法.仿真结果表明,在一定环境下,该算法能提高协作感知性能.     

基于极大似然比频谱检测的认知无线电子载波分配算法

在认知无线电多载波调制系统中,子载波分配是实现主用户与认知用户频谱共享的前提.研究了认知OFDM中基于极大似然比检测(MLD)的子载波分配算法,认知用户采用MLD模型对主用户频谱使用情况进行分布式检测,利用频谱检测信息动态分配子载波,通过认知基站对认知用户子载波频谱感知信息进行融合判决.推导了MLD模型的判决区域上下界阈值、检测概率与虚警概率,并与能量检测进行性能比较.仿真结果表明,相对于能量检测,MLD判决阈值与子载波平均接收信噪比(SNR)有关,检测性能自适应信道变化.MLD用于CR多载波调制中的子载波分配,可明显提高认知OFDM子载波频谱感知性能,从而达到高效利用频谱资源,实现"绿色通信".     

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.