认知无线网络频谱协作感知能耗与吞吐量的凸优化研究

针对认知无线电(cognitive radio,CR)双门限频谱协作感知能量效率与吞吐量优化的问题,提出了利用凸优化理论使能量效率与网络吞吐量达到最优平衡.在能耗一定条件下推导吞吐量关于虚警率与检测率等参数的目标方程;然后,对虚警率和检测率作合理约束,利用凸优化理论对吞吐量方程分析,推导出最优化目标函数的服从条件在一定范围内,关于感知时间与较大门限值满足联合凸或分别凸,吞吐量目标函数的变形在一定范围内,关于感知时间与较大门限值满足联合凸或分别凸;最后,利用凸优化工具获得感知时间与感知门限的最优值.理论分析和仿真结果表明,在能耗一定条件下,对于较为广泛的信噪比区间,该优化方案均可明显提高网络吞吐量及双门限认知无线电频谱协作感知的能量效率.     

基于正交试验设计的粒子群优化算法

针对粒子群优化(particle swarmopti mization,PSO)算法在进化初期收敛速度快但容易陷入局部最优、在进化后期收敛速度变慢且精度低的缺陷,为了提高粒子群算法的收敛速度和全局寻优能力,提出了基于正交试验设计的粒子群优化(orthogonal-experi mental-design-based PSO)算法.在基本粒子群算法的基础上,算法OE-PSO对当前搜索到的解进行局部寻优,利用正交试验设计对搜索空间的分布均匀性在可行解的领域选择有代表性的解进行测试.算法OE-PSO用搜索到的更好的解在下一次迭代中引导粒子进行搜索,从而获得更快的收敛速度和更精确的解,同时避免局部最优.实验结果表明,算法OE-PSO不但具有较快的收敛速度,而且能够有效提高解的精确性,增强算法的鲁棒性.     

基于数值分析理论的低复杂度MED算法

经典的最大特征值检测（MED）算法在检测相关信号时具有优异的性能.然而,随着信号维度的不断增大,MED算法面临着严重的感知判决量和判决门限计算的效率和实现问题,从而极大地限制了该算法在现代认知通信系统中的进一步应用.为此,提出了一种基于数值分析理论框架的低复杂度MED频谱感知算法.所提算法利用Rayleigh商加速幂法迭代地计算感知判决量,与经典的幂法相比,在检测高维信号时具有更快的收敛速度;此外,不同于经典的查表法,新算法基于三次样条插值法快速、准确地确定任意给定目标虚警概率所对应的感知判决门限.所提MED算法在保持原有算法检测性能的同时,有效提升了计算效率,降低了算法实现复杂度;其对于高维条件下的频谱感知问题尤其具有吸引力.最后,仿真结果证明了所提算法的有效性.     

基于改进粒子群优化的快速协作式频谱感知算法

为了改进算法的计算效率和感知性能,提出了一种新的线性协作式频谱感知算法.在新算法中,通过动态地改变粒子群优化（PSO）方法在每次迭代过程中的迭代系数,以获取最优的权重向量,从而最大化算法的检测概率.采用时变迭代系数后,基于PSO的协作式频谱感知算法在粒子飞行的初期具有很好的全局探索能力,而随着迭代次数的增加,算法具有很好的局部搜索能力.仿真结果表明,新算法相比基于传统PSO的频谱感知算法具有更快的收敛速度,相比传统的基于修正系数和基于传统PSO的协作式感知算法具有更好的性能.不同场景下的仿真结果验证了新算法的有效性.     

基于不完全频谱感知的认知中继网络能量效率研究

针对认知中继网络中基于能量效率的资源分配问题,提出一种基于次用户能量效率最大化的功率分配优化算法,通过建立多重约束条件下的频谱感知和传输联合优化模型,在考虑单位发射速率消耗功率和干扰限制的情况下,利用分数规划将问题中的混合整数非线性规划问题转化为等价的凸优化问题,分析了不同参数对能量效率的影响。仿真结果表明,提出的功率分配优化算法在达到能量效率最优的同时降低了算法复杂度低。     

无人机无线能量传输网络多波束阵列设计与位置部署

针对无人机(unmanned aerial vehicle, UAV)辅助的无线能量传输(wireless power transfer, WPT)系统，构建了一种能量波束设计以及无人机悬停位置部署的联合优化方案，以最大化所有用户接收的总能量。针对优化问题是非凸、难以直接求解的情况，提出一种联合优化多波束设计和无人机三维位置的迭代算法，利用巴特勒矩阵设计高增益、宽覆盖范围的能量多波束，利用穷举算法寻找无人机最优二维位置，通过单调性理论得到无人机的最佳悬停高度。仿真结果表明，所提出的算法能显著提升无线能量传输效率。     

基于混合鲸鱼优化算法的鲁棒多用户检测

针对冲击噪声环境下多用户检测误码率高的问题,提出一种基于混合鲸鱼优化的鲁棒多用户检测算法。该算法首先利用基于非线性控制策略的改进鲸鱼优化算法,加速寻优算法迭代过程的收敛;再利用自适应差分进化算法丰富算法种群个体信息,增强优化算法的全局收敛性;同时将适应度较好的个体信息保存到集合中,以保证下一次迭代寻优方向的可靠性,最终实现对最优解位置的快速解算。仿真结果表明,基于本文算法设计的多用户检测器相比采用遗传算法、差分进化算法,以及鲸鱼优化算法的多用户检测器寻优迭代次数更少,且误码率低。     

基于MDFT滤波器组的两步检测算法

认知无线电(Cognitive Radio, CR)在解决频谱资源匮乏问题和提高频谱资源利用率方面被寄予厚望。频谱感知的循环特征检测算法复杂度较高,而能量检测算法在信噪比比较低的情况下检测性能不理想,针对这种情况,在改进离散傅里叶变换(MDFT)滤波器组结构的多载波调制系统中,提出一种基于MDFT滤波器组调制的两步检测算法。该算法结合了循环特征检测较强的抗噪声干扰特性以及能量检测算法复杂度低的优势。仿真结果表明：所给出的两步检测算法在较低信噪比时相对于MDFT能量检测、OFDM循环特征检测等其他算法,其检测性能有明显改善,同时较MDFT循环特征检测算法可有效降低算法复杂度。     

嵌入不动点迭代法的粒子群算法

针对利用粒子群优化算法寻找最优极值的问题,本文提出了一种对粒子群优化算法的改进方式.在粒子群优化算法中,加入不动点迭代法,即在进行粒子群迭代寻优之后,再利用不动点迭代策略再次进行迭代寻优计算.通过两次迭代寻优计算,让算法更加快速的收敛到最优值,并且能够找到更小的极值,且不易陷入局部极值.让粒子群算法更加稳定,寻优更加优化.     

基于改进离散傅里叶变换滤波器组的两步检测算法

认知无线电(cognitive radio,CR)在解决频谱资源匮乏问题和提高频谱资源利用率方面被寄予厚望。频谱感知的循环特征检测算法复杂度较高,而能量检测算法在信噪比比较低的情况下检测性能不理想;针对这种情况,在改进离散傅里叶变换(MDFT)滤波器组结构的多载波调制系统中,提出一种基于MDFT滤波器组调制的两步检测算法。该算法结合了循环特征检测较强的抗噪声干扰特性,以及能量检测算法复杂度低的优势。仿真结果表明:所给出的两步检测算法在较低信噪比时相对于MDFT能量检测、OFDM循环特征检测等其他算法,其检测性能有明显改善;同时MDFT循环特征检测算法可有效降低算法复杂度。     

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.