正交频分复用系统多播资源分配的动态规划算法

针对现有正交频分复用系统采用多播资源分配算法时效率较低的问题,提出了一种多重描述编码的多播资源分配算法.首先将系统的功率划分为等长的基本分配单元,之后使用动态规划算法计算每个子载波上的功率分配和用户分配.该算法可以从全局进行子载波分配和功率分配,从而提高了资源分配的效率,实现了系统总吞吐率的最大化.由于不需要重复计算相同子问题,因此算法能在很短的时间内完成资源的分配计算.仿真结果表明,所提动态规划算法可以有效地利用系统资源,使得系统总吞吐率与最优算法计算结果之差小于2%.     

多播OFDM系统中基于QoS保证的资源分配研究

分析多播OFDM系统中的资源分配问题,最优的功率子载波分配是NP-hard问题,为此提出三种次优分配算法:算法1对单播情况下的分配方案进行扩展,在初始分配后进行子载波调整,复杂度较高;算法2在等功率的假定条件下进行子载波分配,复杂度最低;算法3首先利用算法2进行子载波分配,然后通过注水进行功率分配,以提高系统性能.分析和仿真证明,所提算法是有效的,且其复杂度低,特别是算法2和算法3,非常适合于实际系统实现.     

一种优化的认知无线电网络资源协同分配算法

在目前的认知无线电研究中,多用户OFDMA系统中如何实现子载波和功率的合理分配是研究的重点之一.针对认知无线电资源分配过程中出现的多认知用户资源分配不公平的问题,研究了认知无线电网络中授权用户占用子载带时,认知用户的吞吐量受限制的问题,提出了一种基于underlay频谱共享模式下的OFDMA认知无线电网络功率与子载带协同分配优化算法.该算法利用干扰门限的设置,使用原始感知信息(RSI)和信道状态信息(CSI)进行功率与子载波分配,然后分别进行功率控制和用户选择的计算,找到最优化传输功率与每个子载带最优使用用户,在保证授权用户免受有害干扰的前提下,使授权用户存在时,也可共享频谱传输,确保了系统的稳定性,提高了网络吞吐量.理论分析与仿真结果表明,相比传统的功率与子载波联合分配算法,该算法可以提高系统的平均加权吞吐量.     

OFDM-SDMA系统上行资源分配算法

针对OFDM-SDMA系统的上行链路,以系统吞吐量最大为目标,建立资源分配问题的优化模型,提出一种低复杂度的次优资源分配算法.该算法分为载波分配和功率分配2部分:载波分配算法在功率平均分配的假设下为每个子载波选择用户集合;功率分配算法在载波分配的基础上,考虑相同载波上的干扰对用户进行注水功率分配.仿真结果表明:该算法获得的系统容量与传统OFDMA系统资源分配算法相比有较大幅度的提高;载波分配算法能很好地适应上行链路的特点,其性能优于下行链路载波分配算法;有扰信道注水功率分配亦优于固定功率分配算法.     

高公平性的OFDMA自适应资源分配方案

针对基于速率自适应准则的正交频分多址自适应资源分配中系统容量和用户公平性的不兼容性问题,提出一种高公平性的自适应资源分配方案.该方案通过基于高公平性的子载波分配算法和基于模拟退火的人工蜂群算法的功率分配实现.在子载波分配算法中,通过引入比例因子a,将子载波分为两部分,首先选取a N个子载波分配给速率比例低的用户,以保证用户间的高公平性;然后将剩余子载波分配给信道增益最高的用户,且每个用户最多只能分配一个子载波,以提高系统容量.在功率分配中,利用基于模拟退火的改进人工蜂群算法实现在所有用户之间的功率寻优,以此获得更大的系统容量.仿真结果表明:所提出的方案不仅保证了用户之间的高公平性,而且有效增加了系统容量,证明了该算法的有效性.     

基于对偶分解的 MU-CoMP 联合资源分配算法

在MU-CoMP-JT(multi-users coordinated multiple-points joint transmission)资源分配算法中,大多数将功率分配与子载波分配分为独立的2个部分进行独立求解,这样势必会降低系统性能,而实际上子载波分配和功率分配是密切相关的.为了有效地提升系统吞吐量,采用了迫零预编码技术,研究了一种在多个小区和多个子信道之间联合优化用户调度与功率分配的资源分配算法,该算法以最大化用户权重速率为目标,基于对偶分解理论,将原优化问题分解为多个独立优化的子问题.仿真结果表明,该算法与最优的穷尽分配算法相比性能有所降低,但有效地降低了复杂度,同时也能获得较好的性能.     

基于OFDM的认知无线电系统联合资源分配

为充分利用现有无线电频谱资源, 研究了基于正交频分复用的认知无线电系统, 以填充和下垫联合方式进行分配资源的问题, 提出了新的子载波分配算法和最优功率分配算法。该算法在保证总功率和每个子载波所受干扰在一定阈值内的前提下, 采用最优功率分配算法最大化次用户传输速率。同时, 为降低算法的复杂度, 将置零子载波功率算法应用到资源分配中。最后, 基于Worst-case 方法, 对次用户和主用户间的信道不确定性进行鲁棒性分析。仿真结果表明, 在相同条件下, 该资源分配最优算法和次优算法都优于单独的填充式或下垫式资源分配算法。     

稀疏码多址接入系统中基于分层编码的多播资源分配算法

稀疏码多址接入(sparse code multiple access,SCMA)技术被认为是一种能有效提高频谱效率的技术。将稀疏码多址接入技术应用于无线多播通信中可以扩展多播系统的容量。对多播系统的容量进行了推导,采用分层编码技术应用在SCMA系统的多播传输中,使得系统容量不再受限于多播系统中最差用户的信道质量,采用资源分配算法来最大化多播系统容量。为了减少最优化问题的计算复杂度,又提出了快速次优化算法(fast suboptimal algorithm, FSA),该算法分为码本分配和功率分配2个阶段。仿真结果显示,提出的快速次优化算法在SCMA系统中的多播系统功效要优于正交频分多址接入(orthogonal frequency division multiple access, OFDMA)系统中的多播系统功效。并且,在SCMA系统和OFDMA系统中,提出算法的系统功效都要远优于传统多播(conventional multicast, CM)策略的系统功效。     

OFDMA系统中满足不同时延要求的跨层资源分配算法

针对OFDMA系统下行链路资源分配和调度问题,提出了一种跨层子载波和功率联合分配算法。其优化目标是在保证每个时延敏感用户的平均时延要求的条件下,最大化时延不敏感用户的长期平均吞吐量。该算法首先根据时延敏感用户的时延要求、队列状态和信道状态进行子载波和功率联合分配,即每分配给一个子载波后就立即用最优的功率分配算法在该用户内部进行一次子载波功率分配,以满足其平均时延和比特溢出率(QoS);然后将剩余系统资源根据对平均速率提高贡献最大原则对时延不敏感用户进行子载波和功率联合分配。仿真结果显示,该算法不仅保证所有时延敏感用户的QoS和用户间平均时延的公平性,还在系统的平均吞吐量和满足用户的不同时延要求之间达到一个很好的平衡。     

OFDMA中继网络中联合队列和信道信息的资源分配策略

针对基于正交频分多址接入(OFDMA)的多中继、多用户的中继网络,研究了联合队列和信道信息的资源分配问题,目标是最大化下行系统吞吐量,同时保证用户队列的稳定.首先将子载波配对、载波对分配和功率分配问题建模为一个联合优化问题,之后通过对变量进行连续性放松,采用拉格朗日对偶方法进行求解,并利用Karush-Kuhn-Tucker(KKT)条件及匈牙利方法获得优化问题的近似最优解.性能分析与仿真结果表明,与仅利用信道信息的算法相比,所提的联合队列和信道信息的资源分配算法能够有效地提高系统吞吐量并降低用户数据包平均等待时延.     

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.