多小区多用户MISO系统中自适应有限反馈方案

依据有限的用户信道状态信息(CSI)下的小区间干扰消除,提出一种简单的协作单小区传输方案.研究使用不同的有限反馈方案所造成的和速率损失,对提出的反馈比特的分配算法给出具体的闭合表达式,该算法能够使量化误差最小.仿真结果表明:与等比特分配算法相比,提出的自适应比特分配算法能获得更优的系能增益.     

多用户MIMO-OFDM自适应子载波组分配的优化算法

针对于多用户多输入多输出-正交频分复用(MIMO-OFDM)下行传输,提出一种基于用户信道特征反馈自适应调整多用户子载波分配的优化算法.该算法提出的简化技术将信道相关带宽信息和动态子带分配算法联合起来,将连续子载波分配的最小单元由单个子载波变为子载波组,从而能在不明显影响系统性能的基础上有效改善传统子载波自适应算法中运算量较大的问题.仿真结果表明:该算法运算量获得较大的简化,但在性能上接近于传统动态子载波分配的效果,是一种有效的多用户动态自适应子载波分配算法.     

时变OFDM稀疏信道估计中最优导频选择

针对时变OFDM系统中基于压缩感知的频率选择性衰落信道估计,为了提高其估计精度,结合最优导频选择方式,给出一种自适应求最优导频方法。通过闭环反馈信道稀疏度变化的方式,实时的求取最优导频进行信道估计,并与周期性求最优导频方法进行对比分析。仿真结果表明,自适应方法具有更低的信道估计均方误差,与随机方式相比,性能增益平均提高了11 dB,比周期性方法,平均提高了4 dB,且自适应方法误差曲线更平滑。     

多用户MIMO-OFDM系统中基于非理想反馈的自适应子载波分配

考虑基于VBLAST架构的多用户MIMO-OFDM系统中的资源分配问题,提出了一种基于非理想反馈的自适应子载波分配算法.该分配算法综合考虑了反馈信道信息和反馈质量,为表征反馈质量,引入了置信系数和等价方差的定义,推导了实际中反馈时延和反馈误差同时存在时置信系数和等价方差的通用闭式表达.仿真结果表明,所提出的分配算法在各种非理想反馈情况下,均可改善系统性能.     

基于自适应网格编码QAM的渐进图像编码传输方案

为了在无线信道下鲁棒和高效地传输静态渐进图像,基于高效率编码调制系统提出了一种新型编码传输框架。使用支持多种编码传输模式的自适应网格编码正交振幅调制作为脆弱嵌入式压缩渐进码流的编码保护方案,在给定的功率和延迟约束条件下,基于启发式并行搜索算法对待传信源压缩分组的传输功率和编码调制模式进行联合优化,使得图像传输的端对端期望失真最小。经过对不同测试图像在不同功率和延迟约束条件下的仿真,该传输优化方案相对于以往基于不等重功率分配算法的传输优化方案取得了明显性能增益,在Gauss白噪声信道和准静态衰落信道中,接收端重建图像的峰值信噪比分别平均提高了1.33和2.70dB。     

分布式多天线下行链路的空分复用性能分析

针对多天线下行链路的远近效应问题，研究了分布式多天线系统的空分复用性能，结果表明分布式多天线系统可以有效地降低远近效应的影响．在此基础上，提出了一种分布式多天线系统中的自适应传输方案．该方案根据用户与各天线端口的相对位置灵活地改变传输策略，在用户距离天线端口较远时，利用空分复用联合发送抑制用户间干扰，而在用户靠近天线端口时，采用选择式发送，以降低反馈负荷和复杂度．仿真实验结果表明，与空分复用联合发送相比，通过设置合适的自适应切换门限，所提出的方案仅以系统容量损失7％为代价，能在40％的信道实现中有效降低反馈负荷和处理复杂度．     

Ka频段ATC-OFDM传输体制的性能分析

分析了Ka频段移动信道特性,建立了Ka频段自适应Turbo编码-OFDM传输体制(ATC-OFDM),并提出了3种自适应方案和相应算法。通过新传输体制中的自适应功率、自适应调制和自适应功率调制同固定分配功率和调制方案的TC-OFDM传输体制相比,在不同的天气环境下,其系统误码性能有着明显的改善。系统的吞吐量在信噪比大于8dB时,相比于BPSK调制,可提高2bps/Hz,验证了该传输体制的可行性和有效性。     

非规则QC-LDPC码联合自适应均衡技术在浅海水声信道研究

浅海水声信道具有长时延、多途强、起伏快等特点,为提高数据传输可靠性,采用纠错能力强、编译码复杂度低的非规则准循环低密度奇偶校验(QC-LDPC)码作为信道纠错码方案,并联合自适应判决反馈均衡器(DFE)作为接收机结构以消除码间干扰(ISI).综合考虑非规则QC-LDPC码编译码参数选择、自适应均衡器中的最小均方差(LMS)、可变步长LMS(SVSLMS)和递归最小二乘(RLS)等3种算法的性能与复杂度权衡问题,结合福建泉港浅海域实测水声信道特性,研究了该接收机的性能.仿真结果表明:非规则QC-LDPC码的性能优于随机构造的规则LDPC码;联合自适应均衡的非规则QC-LDPC码可显著提高浅海水声通信系统性能,在较高信噪比(SNR)下,选用RLS算法时,误码率(BER)可降为0(15dB),选用低复杂度的SVSLMS算法BER可达到10-4(18dB).     

协作多小区MISO干扰消除自适应比特分配算法

针对两小区MISO有限反馈系统中的小区间干扰消除问题,分析了部分信道状态信息下最大化信漏噪比和迫零波束形成在不同比特分配算法下的系统性能.通过使用两个独立的随机矢量量化(RVQ)码本分别量化期望信道和干扰信道,计算单用户下由量化误差导致的速率损失,再把速率损失限定在一定的范围内,进而对比特在期望基站和干扰基站之间的分配提出了一种新的自适应分配算法.仿真的结果表明与等比特分配算法相比该算法能够获得更优的系统性能.     

编码MIMO信道中削弱误差传播的软判决均衡

为降低信道均衡算法的复杂度,提出了一种适于LDPC(Low-Density Parity-Check)编码M IMO(Mu lti-InputMu lti-Output)信道的基于迭代式概率数据辅助(PDA:Probab ilistic Data Assoc iation)的次优软输出判决反馈均衡算法。滑动窗PDA检测器输出外信息作为软输入软输出LDPC信道解码器的先验信息,实现信道均衡与信道解码的联合信息更新,克服传统判决反馈均衡器误差传播的缺陷。仿真表明,该均衡算法性能要比V-BLAST迫零检测算法提高1~2 dB,当Eb/No为3 dB时,误比特率达到10-5,且算法复杂度仅为O(N3),可获得较为满意的码间干扰消除效果。     

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.     

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.     

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).     

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.