移动社交网络中基于用户动态需求的D2D数据分流方法

针对因数据流量的爆炸式增长给蜂窝网络带来的流量负担和网络拥塞等问题,提出一种基于移动社交网络中用户动态需求的D2D数据分流方法。考虑用户在一天中不同时段的兴趣和移动轨迹,构建用于描述用户流量需求的图结构。通过Newman快速算法将移动用户划分为不同的社团,同一社团中的用户具有相似的数据需求并且经常彼此联系。在此情况下,每个社团挑选不同的种子用户进行数据共享。为了最大化蜂窝网络的数据分流,对比五种不同的中心性度量方法选择种子节点,采用对比实验,证明新提出的DDS方案的有效性。实验结果表明,在DDS策略中,PageRank度量方法选择的种子节点分流表现最好。     

基于Internet的高速缓存技术分析

Internet的迅速发展 ,使网上的数据量惊人地增加 ,造成网络带宽严重不足。高速缓存是一种对频繁访问 Web信息的请求在本地实现的技术 ,它能降低 Internet的信息流量、提高用户的访问速率。文章在研究了高速缓存工作原理的基础上 ,综合分析了基于 Internet的缓存技术的 3种实现方案 :基于浏览器的客户机缓存、代理服务器和网络缓存 ,分析了它们各自的工作特点和应用场合 ,并展望了缓存技术的应用前景。     

Peer-to-Peer流量缓存部署建模

为了在网络中更好地部署对等网络(P2P)流量缓存,从而优化网络的性能,提出了一个评价方法量化在不同链路上部署P2P缓存的收益。基于该方法建立了最优化模型:在给定部署开销的约束下最大化收益。分析了问题复杂度,提出了优先选择收益开销比的链路进行部署的启发式算法求解。对实际校园网络的仿真结果表明:在10%的链路上部署P2P流量缓存,能够降低30%的平均链路利用率。该文提出的P2P流量缓存部署模型和算法可以有效地指导P2P缓存的部署,优化网络性能。     

基于数据分类和最小时延的LWA网络流量控制算法

无线异构网络已经成为未来无线通信网络演进的关键路径之一,多种无线网络互相融合亦是大势所趋.长期演进(longterm evolution,LET)与WLAN网络融合系统(LTE-WLAN aggregation,LWA)在改善系统频谱效率与能量效率以及提升网络系统容量与数据传输速率方面发挥着重要的作用.单一性地将LWA系统中分组数据集中协议(packet data convergence protocol,PDCD)数据单元分配给某个网络会增加网络负载和时延,所以LWA网络合理地流量控制方案愈发重要.为了提高系统吞吐量和能量效率,同时降低演进型基站(evolved nodeB,eNB)负载,提出一种基于数据分类和最小时延(data cassification and minimum delay,DCMD)的LWA网络流量控制算法.所提算法通过对传输数据进行分类并选择时延最小的网络传输对时延敏感的数据,而时延较大的网络则传输时延不敏感的数据,以此实现流量控制.仿真结果表明,所提算法能有效地提升系统的吞吐量、边缘地区用户终端(user e-quipment,UE)吞吐量和用户能量效率.     

Peer-to-Peer流量缓存部署建模

为了在网络中更好地部署对等网络(P2P)流量缓存,从而优化网络的性能,提出了一个评价方法量化在不同链路上部署P2P缓存的收益。基于该方法建立了最优化模型:在给定部署开销的约束下最大化收益。分析了问题复杂度,提出了优先选择收益开销比的链路进行部署的启发式算法求解。对实际校园网络的仿真结果表明:在10%的链路上部署P2P流量缓存,能够降低30%的平均链路利用率。该文提出的P2P流量缓存部署模型和算法可以有效的指导P2P缓存的部署,优化网络性能。     

对象存储系统的合作缓存方案

结合对象存储系统的数据访问模式,综合设计客户端和元数据服务的缓存,构造存储系统的合作缓存方案.该方案将客户端和元数据服务器的缓存作为整体进行设计,以达到提高缓存利用率的目的;通过缓存准入策略合理选择数据传送模式,减少数据传送的通信量;同时,合作缓存方案根据数据对象的大小、访问成本和网络负载动态地调整缓存策略,提高存储系统的服务质量.实验显示,合作缓存方案能较好地适应不同的工作负载,有效提高了系统的输入输出性能.     

无线网络多基站低时延协作缓存方案研究

随着社交视频网络服务的日益增长,内容请求的多样性及内容传输的冗余性大大降低了现有蜂窝通信的流量效率.在基站设置合理的文件缓存可以减少核心网中重复传输造成的流量拥塞,从而可有效提升终端视频请求服务的体验质量.本文针对多蜂窝基站协作缓存场景,研究了文件流行度未知时最小化系统总传输时延的模型构造.首先,结合基站缓存容量大小及文件请求的分布,构造了基于最小时延传输的0-1整数规划最优化问题;其次,利用组合多臂赌博机(CMAB)算法完成对未知文件流行度的估计;最后,结合流行度更新迭代过程完成文件的最优化缓存.通过将非线性问题依次转化为多项式问题和线性问题,并结合高效的启发式算法得到次优解,相比于分支定界最优算法有效降低了运算复杂度.仿真结果表明所提算法接近最优解,与传统的缓存方案相比可有效降低传输时延.     

基于代理服务器缓存的Internet分层视频点播

针对目前访问Internet设备的差异性，为了降低网络传输成本，提出了一种基于视频分段的缓存算法来传输经过分层编码的视频流，其中分层视频段缓存优先级的计算来自于视频对象间的优先级、视频对象内的优先级以及用户接收带宽的分布．与缓存整个视频层的方案相比，仿真实验结果也证实了提出的针对分层视频流的缓存方案在给定缓存空间大小的情况下，可以大大降低视频服务器的点击率，而且在不增加实现复杂度的情况下也能满足用户接入带宽的差异性．     

客户机/服务器下的数据缓存技术

为了在客户机，服务器网络环境下的数据库检索系统中，引用数据缓存技术改善数据检索效率，通过对现有的数据缓存系统进行分析、归纳和总结，并参照借鉴存储器缓存技术的一些理论，阐述了数据缓存技术在客户机，服务器网络环境下应用模式，系统的进行了理论归纳，给出缓存一致性问题的解决方法，实现了数据缓存技术的高效使用。     

多小区 MIMO 网络中一种新的 D2D 通信干扰对齐算法

当多小区MIMO（multiple-input multiple-output）网络中引入D2D（device-to-device）技术后形成D2D-MIMO干扰网络,为解决其干扰问题,提出了一种基于天线数奇偶性的发送端数据流分配方案和基于该方案的干扰对齐（interference alignment,IA）算法。该算法通过最小化基站泄露到非目标用户的信号功率来求解蜂窝链路的预编码矩阵,通过最大化蜂窝用户的信干噪比（signal to interference plus noise ratio,SINR）来求取蜂窝链路的干扰抑制矩阵,进而通过线性干扰对齐消除蜂窝内干扰,并推导了系统的最大自由度（degrees of freedom,DOF）。理论分析和仿真表明,相对于现有算法而言,该算法提高了系统的自由度、频谱效率和能量效率,降低了对天线数的要求,增强了系统的灵活性。     

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…     

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.     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

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.