基于时间序列分析的改进型MPEG视频序列流量模型

提出了一种新的基于时间序列分析的改进型MPEG视频流量模型,利用消除趋势项、滑动平均过程等方式建模,并根据实际流量的分布,将预测流量进行概率分布转换.大量的仿真实验等方面说明,在预测误差、尾部概率分布、自相关函数和自相似性及GOP、视频帧两个时间尺度上,该模型同时兼顾了长时相关性和短时相关性,并保持了与实际流量相一致的自相似性.     

投影寻踪自回归模型在长江径流量预测中的应用

为准确预测长江径流量,引入投影寻踪自回归模型,用自相关分析技术确定预测因子,构造了新的投影指标函数,并用基于实数编码的加速遗传算法优化投影指标函数,建立了投影寻踪自回归流量预测模型.将该模型应用于长江径流量的预测,结果表明用该模型预测长江流量时序是可行和有效的.     

基于小波变换和AAR模型的WMN流量预测方法

在WiMAX Mesh网络中,为了实现对带宽的动态分配和有效利用,需要实时对业务流量进行实时准确预测.WiMAx Mesh 网络调度器将根据该预测值进行带宽分配.经分析,现有包括ARMA在内的流量预测方法并不能直接应用于WiMAX Mesh网络流量的预测中.在对WiMAX Mesh网络流量特性的分析基础上,提出了一种基于小波变换和线性自回归模型相结合的WiMAX Mesh网络流量预测方法.该方法首先对流量信号进行降噪,并将该处理结果用于AAR模型预测.利用Auckland大学的流量数据进行仿真,预测精度比自适应ARMA方法提高约2% .方法的预测精度较高,运算量较小,更适合于对WiMAX Mesh网络进行预测.     

基于组合模型的网络流量预测

为了更好地对网络流量进行分析和管理,提出一种基于小波变换、自回归滑动平均模型(ARMA)和极限学习机(ELM)的组合预测模型W-ARMA-ELM.原始数据通过小波分解产生近似序列和细节序列,通过对分解序列的自相关性和偏自相关分析,平稳序列使用ARMA预测,而非平稳序列使用ELM预测.使用兰州大学教育网、网通流量数据和英国学术主干网流量数据三组不同的网络流量数据来检验组合模型W-ARMAELM的预测性能.实验结果表明提出的组合方法要比单一的ARMA和ELM预测效果要好.同时指出使用自相关和偏自相关分析相结合的方法对分解后的子序列进行平稳性判定有助于选择合适的组合模型从而提高预测精度.     

基于自优化的多属性高斯核函数相关向量机方法

在相关向量机的预测模型中,核函数的选择和核参数的取值对模型预测性能影响很大.针对这一问题,文中采用多属性高斯核函数建立相关向量机预测模型,提出了一种自优化的核参数学习方法进行参数优化,并将该模型用于二维标准函数预测和污水处理系统出水水质预测,与不同核函数下的相关向量机模型以及不同参数优化方法下获得的预测模型进行了对比实验.结果表明,基于自优化的多属性高斯核相关向量机模型对低维数据的参数敏感度较低,对高维数据有良好的输出精度和稀疏性,在污水出水水质预测中获得比较满意的结果.     

模型识别的自动化程序研究——以汇率数据为例

介绍了最小信息准则法、扩展样本自相关函数法和最小典型相关法等3种时间序列模型识别的自动化程序.利用人民币对美元、英镑和加元的每日汇率中间价数据建模,从模型的拟合优度和预测精度等方面评估了3种自动化程序在实证研究中的效果.研究表明,扩展样本自相关函数法的预测效果相对较好,但是3种自动化程序没有明显的优劣分化.因此,建议将自动化程序和传统的Box-Jenkins方法结合起来以达到精确选择模型的目的.     

基于小波变换与组合模型的网络流量预测算法

针对网络流量在以不同时间尺度分析时呈现不同特性给流量精确预测带来的困难,提出一种基于快速小波变换和季节差分自回归滑动平均组合模型的多分辨分析预测算法.采用小波方法对网络历史流量进行分解以分析不同时间尺度下的流量相关结构,根据不同时间尺度下的流量时间序列的周期性和自相似性,分别选择合适的模型建模用于预测.使用小波方法对各序列的预测值进行重构,得到原始流量的预测结果.仿真结果表明,所提预测方法比同类预测方法具有更高的精度.     

短期电力负荷预测模型的比较研究

为了解决提高电力负荷预测精确度这一问题,越来越多的人工智能方法应用于能量功率预测.为此利用湖南省2014年至2017年的电力负荷数据,比较自回归(AR)模型、BP神经网络(BPNN)和指数平滑(ES)模型在预测日度电力负荷和月度电力负荷上的性能,并运用统计学知识来分析三种模型之间的差异.最终根据实验结果得出两个结论:AR模型对日度数据预测的结果优于其他两个模型以及ES模型对月度数据预测的结果优于其他两个模型.     

自相似网络流量的处理和分析

为了解决自相似模型难以进行自相似网络流量趋势预测的问题,提出时间序列分析中短时相关模型(自适应自回归模型)的方法用于流量数据的估计;同时为了提高预测精度,提出改进的最小平方格型(modified least square lattice, MLSL)算法,使模型参数不断递推修正,收敛到最佳值.仿真试验结果验证了短时相关模型在网络流量预测应用中的可行性,实现了自相似网络流量的短期预测,该算法比最小平方(least square, LS)算法均方误差减少20%, 具有收敛快、预测精度高的优点,而该算法的计算量减少一半.     

基于QoE感知的无线视频传输节能技术研究

针对未来无线网络中用户体验(quality of experience,QoE)感知的节能技术这一范畴,对视频业务QoE感知技术和降低网络能耗方面进行了研究,在此基础上构建了能耗目标函数和相应的约束条件,理论上分别推导出视频帧的丢帧率模型和视频帧的传输能耗模型.保障视频业务的QoE约束条件下,求出一系列符合条件的传输参数,使用迭代优化算法求出最优传输参数并计算了相应的最低消耗.对所提方法的性能进行了仿真,主要分析了视频业务质量、视频帧的重传数量以及视频帧的大小对传输能耗的影响.仿真结果表明,针对视频业务质量要求高、视频数据量大这一特点,所提出的方法能够有效降低未来无线网络的传输能耗并保障了视频业务的质量.     

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.