多用户全双工无线携能系统中的波束赋形研究

针对多用户全双工蜂窝通信系统,提出了一种基于功耗最小及能量收获最大双目标准则的联合优化方案。该方案采用迫零消除上行链路中多用户干扰,在下行链路,为了实现信息和能量的有效传递,全双工基站分别采用信息波束赋形及能量波束赋形为用户提供通信服务,在保证用户的服务质量及功率约束的同时,实现了功率效率和频谱效率的同步改善。由于功率问题为非凸问题,通过半定松弛将其转化为凸优化问题。仿真结果表明,所提方案相比传统方案能够节约大量的功率,此外全双工基站通过能量波束赋形向下行用户传递能量,有效提高了系统的功率效率。     

WPCN中下行链路能力扩展模型与最大化用户最小速率方法

针对无线供电通信网络的下行阶段缺乏信息传输功能等问题,提出一种基于无线携能通信技术的具有下行链路信息传输能力的网络模型。该模型将一个传输单位分为上、下行两个阶段,在上行阶段,用户发送射频信号进行信息传输,各小区基站完成信息解码任务;在下行阶段,基站通过波束成形技术和多载波技术向用户发送射频信号,各用户通过时分切换或功率分流方式完成信息解码与能量捕获。基于该模型,提出一种最大化最小速率的方法,通过最大化最小用户上行信息传输速率求解各小区内各用户的最优上行发送功率,通过最大化最小用户下行信息传输速率求解各个小区内的基站的最优下行波束成形矢量,实现网络中各用户相对公平的性能最优。仿真结果表明,本文方法提高了用户的最小传输速率。     

带有下行SWIPT的强干扰WPCN中用户最小速率最大化研究

现有的无线供电通信网络(Wireless powered communication networks,WPCN)只考虑在下行链路中进行能量传输,没有考虑信息传输的需求。实际上,在很多应用场景中需要考虑利用下行链路传输信息。如何制定发送策略来权衡各用户上行传输速率的公平性与最大化是WPCN中的研究热点。本文提出一种新的在强干扰蜂窝小区中进行能量与信息传输的设计方案,将下行无线信息与能量的同时传输(Simultaneous wireless information and power transfer,SWIPT)与无线供电通信网络相结合,实现基站与用户之间的下行能量传输与上下行双向信息传输。该方案通过上行功率分配、下行时间分配与波束成形以实现上下行最小传输速率的最大化,从而实现各用户上下行信息传输的性能与公平性的平衡。仿真结果表明,与传统的传输方式相比,本方案显著提高用户的最小传输速率。     

基于干扰效率的星地认知网络功率分配算法

针对Underlay模式基于能量效率的功率控制算法未能准确反映次用户与主用户之间干扰性能导致系统容量下降的问题,综合考虑次用户能量有限及卫星链路和地面链路的差异性,定义干扰效率为认知卫星用户总的传输速率与地面基站接收到的干扰的比值,建立了基于干扰效率的星地认知网络上行链路功率分配模型,在此基础上提出一种基于干扰效率的功率分配算法.通过引入干扰门限约束及信干噪比约束条件,利用非线性分式规划理论和拉格朗日对偶法求解出最优功率.仿真结果表明:该算法能在较好满足次用户通信质量的前提下,有效减少对主用户的干扰,提升系统的干扰效率.     

认知蜂窝异构网络中能效优化的资源分配算法

在认知蜂窝异构网络中,针对大规模部署认知家庭基站带来的能量消耗问题,研究了两层异构网络上行链路的资源分配算法.提出了一种基于双循环迭代的资源联合分配算法,在实时用户服务质量(quality of service,QoS)需求约束和跨层干扰约束下最大化认知系统能量效率,将分数形式的能效函数等价转换为减数形式,使优化问题近似确定为凸优化形式,并通过迭代方法求解.仿真结果表明:该算法能够快速收敛到最优能效,并保证了实时用户的QoS需求,有效提高了系统能量效率.     

分布式天线小区协作通信系统下行链路频谱效率的研究

针对多小区分布式天线系统中下行链路的干扰问题,提出将基站协作通信和分布式天线技术相结合,通过最大化最小的用户频谱效率,保证用户频谱效率的公平性.同时提出一种用户天线选择关闭算法,改进了传统的基站协作迫零波束成形技术在用户数接近最大值时频谱效率急剧下降的缺陷.仿真结果表明,采用分布式基站天线和用户天线选择技术的小区协作通信,可以获得更高的用户频谱效率.     

移动通信中不同类型的天线在不同场景下的应用

基站的天线是手机用户用无线与基站设备连接的信息出(下行、发射)入(上行、接收)口,是载有各种信息的电磁波能量转换器。基站发射时,调制后的射频电流能量经基站天线转换为电磁波能量,并以一定的强度向预定区域(手机用户)辐射出去;手机用户信息经调制后的电磁波能量,由基站天线接收,有效地转换为射频电流能量,传输至主设备。基站天线是电磁波传输的第一道空中闸口,天线选择的正确与否,严重影响到移动通信的质量。本文阐述了不同类型的天线在不同场景下的应用。     

TD-SCDMA直放站上行链路自动关断技术研究

TD—SCDMA直放站是一种由上行链路和下行链路构成的双向放大设备。直放站在正常工作时不可避免会有噪声输出，上行输出的噪声电平送到基站，会抬高基站接收机的噪声电平，降低接收灵敏度。在微功率直放站设备中使用上行链路自动关断技术，能实现当无线直放站覆盖区域内无用户使用时，直放站自动关断上行链路，不会对基站噪声电平产生不利影响。这一方案克服了现有直放站在开通状态会一直不断影响基站电平的缺点，具有较好的应用价值。     

基于射频能量收集的异构网络资源分配策略

针对异构网络中微微基站出现过多用户的情况,研究最大化上行总吞吐量的资源分配问题。通过部署一个具有能量收集功能的中继节点,将微微基站部分用户转移到相邻的空闲微微基站。中继节点具有能量收集功能,可以从专用射频源和环境射频源收集能量。将资源分配问题建模为最优化问题,以最大化微微基站用户的上行总吞吐量为目标,同时满足用户最小数据速率、中继节点能量消耗和发射功率的约束条件。通过引入增广拉格朗日乘子法,获得最优解。仿真结果表明,与传统的将部分微微基站用户转移到宏基站的方法相比,提出的方法具有较大的吞吐量提升。此外,与同样采用中继节点进行辅助通信的等功率方法相比,提出的方法在吞吐量方面有一定程度的增加。     

基于旋转直积码本的3D有限反馈SDMA方案

为平衡反馈开销和系统性能,在频分双工(FDD)系统下,针对三维多输入多输出(3D MIMO)系统的多用户预编码问题,提出一种应用于3D MIMO系统的基于统计信道信息的空分多址(SDMA)方法.首先,基于三维信道的空间相关性,提出3D MIMO中基于旋转直积的用户分簇码本设计,码本中每个分簇基的列向量相互正交,可作为发送方向用于下行预编码;其次,用户根据下行信道估计所得到的发端相关矩阵选取所在的分簇基及发送方向,并以长周期将其索引反馈至基站;最后,基站调度用户实现下行多用户传输.仿真结果表明:在信道相关性较高的情况下,该方法可以显著提升系统的吞吐量,且只须长时间向基站反馈信息,上行反馈开销极小.     

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.