基于车载自组织网络的数据和能量协同路由算法

针对车载自组织网络中路边单元具有较高碳足迹和部署成本的问题, 提出一种车载自组织网络中数据与能量协同的路由算法, 通过路边单元间的能量合作及路边单元与下行车辆能量传输的方法, 实现网络生命周期最大化. 其中路边单元节点可从自然界和车辆中收集能量, 并通过能量协作将路边单元节点获得的部分能量传输给邻居路边单元节点. 通过分析数据速率、 传输功率和能量传输, 解决了能量和数据路由中最大网络生命周期的问题, 确定了能量和数据路由联合优化策略的必要条件, 并基于分布式Lagrange-Newton迭 代算法更新数据流、 能量流和功率控制, 使算法能更快地收敛到最优操作点. 实验结果表明, 在车载自组织网络中的能量合作框架可有效改善网络生命周期.     

基于车载自组织网络的数据和能量协同路由算法

针对车载自组织网络中路边单元具有较高碳足迹和部署成本的问题, 提出一种车载自组织网络中数据与能量协同的路由算法, 通过路边单元间的能量合作及路边单元与下行车辆能量传输的方法, 实现网络生命周期最大化. 其中路边单元节点可从自然界和车辆中收集能量, 并通过能量协作将路边单元节点获得的部分能量传输给邻居路边单元节点. 通过分析数据速率、 传输功率和能量传输, 解决了能量和数据路由中最大网络生命周期的问题, 确定了能量和数据路由联合优化策略的必要条件, 并基于分布式Lagrange-Newton迭 代算法更新数据流、 能量流和功率控制, 使算法能更快地收敛到最优操作点. 实验结果表明, 在车载自组织网络中的能量合作框架可有效改善网络生命周期.     

一种改进的喷泉多选择序列峰均比降低算法

针对非连续正交频分复用(NC_OFDM)系统具有边带功率(Sidelobe power)大及峰均比(PAPR)高等问题,提出一种基于喷泉编码(Fountain code)的改进算法,同时考虑认知无线电环境下NC_OFDM系统旁瓣干扰及峰均联合优化.采用喷泉多选择序列算法,通过喷泉编码及序列映射的思想,降低边带功率及系统PAPR.仿真表明,喷泉编码改进算法能有效减少NC_OFDM系统中感知用户对于授权用户(licensed user)的干扰,通过喷泉编码设定目标PAPR将NC_OFDM系统PAPR控制在合理范围内,从而有效解决NC_OFDM信号放大失真问题,提升系统整体误比特率性能.     

协作中继和网络编码在车载网络中的应用

对于出行者来说,通过路边热点来进行文件共享和内容分发以及车辆间相互通信的车载网已经成为蜂窝网络重要的互补网络.车载网络独有的特点给这些网络的内容分发和连接性等带来了挑战.提出结合协作中继和符号级网络编码来提高车载网络的连接性和信息传输的效率和鲁棒性.通过仿真评估了所提出机制的性能,证明了该机制可以提高网络的误码率和吞吐量.     

最小中断概率的无线协作多播网络资源分配

研究了基于正交频分多址(OFDMA)无线协作多播系统的资源分配问题,该系统的资源分配中只有用户的平均信道状态信息可用.由于瞬时深衰落的影响,不可能保证每一个多播数据的成功传输,因此为了达到有效可靠的传输,利用协作分集带来的潜在增益,提出了协作的联合子载波和功率分配算法来最小化多播传输的中断概率.由于联合分配问题有很高的计算复杂度,因此提出了次优化的分配算法.在子载波分配阶段提出了比例协作子载波分配算法(CP)来实现吞吐量和公平性的折中.在功率分配阶段采用迭代功率分配算法(IP)来有效地利用有限的功率.仿真结果表明所提出的协作算法的性能明显优于传统的非协作算法.     

基于喷泉码的强抗干扰跳频传输设计及性能

针对跳频系统在一半跳频频点失效时系统瘫痪而无法通信,而喷泉码具有无码率、低复杂度、易于硬件实现等优势,考虑将喷泉编码用于强抗干扰跳频通信系统中. 本文在对喷泉码编码原理及算法进行深入分析基础上,研究了基于喷泉编码的连续和随机频点部分频带干扰情况下的高效传输和译码性能. Matlab仿真表明,采用高码率LDPC预编码能有效降低译码开销. 此外,还给出了一些重要结论以及译码参数计算公式,对实际跳频系统具有重要的指导意义.      

一种基于喷泉码和并行路径的深空通信无反馈协议

针对深空通信延时非常大的特点,提出了一种基于喷泉编码和并行路径的无反馈数据传输协议,该协议能够避免发送端和接收端之间反复的握手过程,缩短数据传输时间.同时通过在发送端和接收端之间部署多个中继,建立并行传输路径保证数据能够连续传输,克服单一路径易受链路中断影响的缺点,达到充分利用链路资源的效果.仿真结果表明,只要采用编码开销比链路丢包率稍微大一点的喷泉码就能保证数据在接收端以极高的概率准确恢复;增加并行传输路径的数目可以提高传输容量,减小传输所用时间.     

双向四节点中继协作传输策略性能分析

讨论和研究了高频谱效率的双向四节点无线网络中继协作策略.其系统模型为线型放置的4个节点要通过中间2个节点的中继协作来实现2组数据的交换.基于该系统模型,给出了只采用叠加编码技术的双向中继传输策略(SC-relaying)和联合网络编码与叠加编码的双向中继协作传输策略 (JNSC-relaying),并对它们可获得的速率范围和吞吐量性能做了分析和讨论.数值分析结果表明,在可获得的速率范围性能方面,JNSC-relaying策略并没有明显的优势;然而在吞吐量性能方面,JNSC-relaying策略可获得明显的性能改进.     

衰落信道下的无线传感器网络虚拟MIMO传输优化设计

针对基于虚拟多进多出技术的无线传感器网络系统,分析了在信道衰落下的平均误码率,并提出了使用各协作节点最优传输功率的新方案,推导出基于Nt×1虚拟多进多出系统的最优传输功率表达式.理论分析和仿真表明：与等功率传输相比,传输功率优化方案可获得更低的误码率.同时,对协作节点数与传输效能的折中设计进行了探讨.仿真结果表明：低功率传输时,应适当降低协作节点数,以降低有效传输能耗.     

基于协作多点的干扰协调技术

协作多点干扰协调技术是第四代移动通信中的关键技术,文中对此进行了全面回顾.内容主要分为3个方面:基站联合传输/顸编码、基站协作调度和基站联合检测/解码.基站协作传输主要表现在基站协作设计合适的预编码向量/矩阵,降低/避免用户间的干扰;基站协作调度表现在通过按照某种准则选择用户子集与基站通信,在系统吞吐量和通信公平性之间做出折中;基站联合检测/解码是通过基站间的协作对多个用户的信号进行译码.     

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.