具有能量收集的认知双向协作中继网络中断概率分析

为了延长认知中继网络的生存时间和降低中断概率,提出了具有多主接收端的专用信号塔(PB,Power-beacon)辅助能量收集认知双向协作中继网络,并研究了采用译码转发模式和机会中继选择策略的衬底式认知网络中断性能。网络中次用户发射功率由收集自PB的能量和主接收端的干扰约束决定。推导了Rayleigh块衰落信道下次网络的精确中断概率,结果表明增大PB发射功率或主网络干扰约束将使中断概率单调下降。此外,还推导了有干扰约束和无干扰约束的次网络渐近中断概率,研究了中断饱和现象,PB位置对中断概率的影响,以及主接收端和中继数量、次网络端到端容量以及能量收集比率与中断概率之间的关系。仿真结果验证了理论推导。     

具有直接链路的能量收集认知协作中继网络中断概率分析

针对能量受限认知中继网络生存期短和中断概率高的问题,提出一种具有多个主接收端、多个次目的节点、次网络直接链路和次网络节点硬件损伤的功率信标(PB)辅助能量收集认知协作中继网络,推导出在瑞利块衰落信道下采用机会中继选择策略和选择合并方式的次网络精确和渐近中断概率,并对理论分析结果进行蒙特卡洛(Monte Carlo)仿真验证。研究结果表明:主接收端干扰约束或者PB发射功率的提升会使中断概率单调下降并趋于饱和;中断概率随着次网络节点硬件损伤水平、主接收端数目和次网络端到端信道容量的增大而增加,并随着中继和次目的节点数目的增多而减小;恰当设定能量收集比率能有效降低中断概率。     

能量采集双向衬底式认知中继网络中断性能分析

针对具有硬件损伤的能量受限网络传输效率低、生存周期短的问题,提出了基于硬件损伤模型和多天线能量信标(PB)辅助能量采集的衬底式双向认知中继网络模型。次网络节点发射功率由采集自多天线PB的射频信号能量和多主接收端的干扰约束共同决定。推导了次网络在瑞利分块衰落信道下中断概率的精确和渐近闭合解。理论分析和蒙特卡洛仿真结果表明:随着PB天线数目和发射功率、主网络干扰约束和能量转换效率的增加,次网络中断概率减小;随着主接收节点数目、次网络节点硬件损伤水平以及PB与次网络间距离的增大,次网络中断概率提高。     

基于机会调度的上行认知中继蜂窝网络中断性能研究

对基于机会调度的上行两跳认知放大中继蜂窝网络的中断性能进行研究,导出了该系统的中断概率封闭表达式和高信噪比下的中断概率近似表达式。该系统中有多个源节点,研究表明,通过选择最优的次用户进行信息传输,系统中断性能可得到改善。仿真验证了理论推导的正确性。     

联合干扰功率限制下的认知中继网络性能分析

频谱共享的Underlay认知中继网络中,为了保证主用户的可靠通信,要求次用户网络中源节点及中继节点的发射功率必须满足主用户接收端干扰功率的限制。基于主用户峰值干扰功率和平均干扰功率的联合限制,分析了中继节点采用选择协作解码转发协议时潜伏式频谱共享认知中继网络的性能。值得一提的是,考虑中继传输中由主用户接收端干扰功率限制引起的第1跳链路信噪比之间的相关性,推导了瑞利衰落环境下次用户中断概率和信道容量准确的闭合表达式。仿真结论显示,次用户中断概率与信道容量的解析曲线与仿真结果一致,系统性能因频谱共享的认知网络中次用户源节点与主用户接收机链路之间的相关性而有所下降,中断概率约有2dB的性能提升。     

全双工中继协作下认知MIMO系统的自干扰收集

针对传统基于能量收集的全双工认知多输入多输出(MIMO)系统忽略自干扰对提高能量利用率的作用问题,建立了基于全双工MIMO的认知中继网络,通过能量收集技术进行自干扰收集.研究了系统能量效率最大化问题,在满足中继发送功率限制等约束条件下,对传输信号协方差和功率划分因子进行联合优化.利用半定松弛算法将系统优化问题转化成凸优化问题,并结合注水功率算法分析得到最优解.仿真结果表明:与传统自干扰消除模式相比,所提方案在保证系统频谱效率的同时,系统能量效率还可提高13.9%;在自干扰收集模式下,与系统容量最大化方案相比,所提方案每传输1 bit信息可降低近0.1 J的功率消耗.     

认知多中继网络中基于最佳功率分配的中断性能

研究了认知多中继网络的功率分配方案,提出了简单的最优功率分配(OPA)方法,并给出最优解.仿真了不同的认知中继位置对认知系统中断性能的影响,并联合考虑频谱感知和认知多中继协作传输两个过程.仿真结果表明,文中提出的最佳功率分配方案的中断性能优于等功率分配(EPA)方案,且存在最佳的感知时间使认知多中继网络的中断性能最优.     

认知解码转发中继网络的安全性能分析

在认知中继安全通信网络中,研究了自适应解码转发中继节点采用机会式传输策略的物理层安全性能。在满足主用户对干扰功率限制的条件下,推导了在瑞利信道下的安全中断概率的闭合表达式,并进一步推导了安全中断概率性能的渐近表达式,从而可以直观地对系统性能进行分析。仿真结果验证了理论分析的正确性,并揭示了在认知中继网络中各系统参数对机会式传输方案的安全性能的影响。结果表明,可以通过增大主用户的最大干扰功率容限和增加次级中继节点个数来提升系统安全性能。     

非完全信道下认知中继网络中断概率及功率分配

基于最大信道增益的中继选择方法,分析了在不完全信道状态信息（CSI,channel state information）和受主用户干扰情况下认知中继网络的中断概率;进一步提出了在主用户干扰约束和保证认知用户服务质量（QoS,quality of service）条件下最大化认知中继网络频谱效率的数学优化模型,利用拉格朗日对偶松弛法获得了该优化问题的解,在保证主用户传输性能不受影响的前提下,提高了认知中继网络的频谱效率。仿真结果表明该文提出的功率分配方案与等功率分配方案相比提高了性能增益。同时表明在非完全信道条件下获得的频谱效率与完全信道条件下的频谱效率近似,但减少了系统信息的反馈量和实现的复杂度,有利于该方案的工程应用。     

大规模 MIMO 蜂窝网与 D2D 混合网络物理层安全性能研究

随着量子计算机等计算设备的飞速发展,传统的加密技术正面临着挑战;由于物理层安全充分利用了无线信道的特性,其被认为是一种有效的解决方案.为此,提出了一种安全的混合网络模型,其中,端到端(device-to-de-vice,D2D)网络覆盖于大规模多入多出(multiple-input multiple-output,MIMO)宏蜂窝之上,被动的恶意窃听者(eavesdropper,Eve)能够窃听所有的无线信道;同时,为了提高能量效率,D2D发射机不仅可以从专用的PB(powerbeacon)收集能量,还可以从附近的射频干扰信号中收集能量.对此混合网络模型,假设所有网络元素的位置都服从独立泊松点过程,利用随机几何,得到了任一D2D发射机采集足够能量的概率;基于此概率,获得了蜂窝网用户和D2D用户的各态历经速率和安全中断概率.结果表明,由于D2D发射机可以从周围的射频干扰信号中采集能量,系统的能量效率得到显著提升,同时将专用PB的信号视作一种人工噪声,有效地提高了网络的安全性能.     

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.