基于支持向量机的啤酒企业能源消耗预测模型

为提高啤酒企业包装车间生产耗电的预测精度, 提出了一种基于支持向量机和粒子群优化算法的预测模型构建方法。该方法将radial basis function函数作为支持向量机的核函数构建预测模型, 使用K-fold交叉验证方法, 利用粒子群算法(PSO: Particle Swarm Optimization)对惩罚参数c和g值寻优。以28天的生产耗水和生产耗电数据作为训练集, 以10天的生产耗水数据作为预测集, 分别构建基于radial basis function函数与polynomial函数的生产耗电支持向量机预测模型对生产耗电数据进行预测。实验结果表明, 以radial basis function函数作为核函数与以polynomial函数作为核函数相比, 该支持向量机预测模型对生产耗电的预测精度提高了51.495%,该方法具有一定的实用性。     

金融时间序列预测中的GA-SVR方法

针对支持向量机方法在金融时间序列预测的过程中,模型参数选取不当的导致预测精度较低等问题,利用遗传算法优化选取支持向量机模型参数,建立了一种基于遗传算法优化支持向量机参数的金融时间序列预测模型。并将该方法应用于我国上证指数时间序列预测中。实验结果表明基于遗传算法优化的支持向量机方法能较好的反映金融时间序列预测规律,并且提高了模型预测精度。     

基于混合核函数的PSO-SVM分类算法

在数据挖掘中,支持向量机是被广泛应用的一种分类算法,其核函数的选择及参数的设定没有有效的标准。本文采用混合核函数构造兼顾学习能力和泛化性能的支持向量机算法,并利用粒子群算法来确定支持向量机的参数。应用基于混合核函数的PSO-SVM算法对一个经典的分类测试数据集进行分类,将该算法与单一核函数支持向量机算法的分类结果进行比较,结果表明所提出的算法的分类性能有明显提升。     

基于变分模态分解和引力搜索算法的径流预测模型研究

针对月径流数据的数据量小、高度非线性和非平稳性特点,提出了一种基于变分模态分解(VMD)、引力搜索(GSA)与支持向量回归机(SVR)的组合预测模型。首先对月径流样本进行Mann-Kendall(M-K)检验,找出突变点划分训练集与测试集;然后用VMD分别对训练集与测试集进行分解;最后对训练集数据进行训练,利用GSA对SVR的三个主要参数进行寻优,并对测试集的预测结果进行评价。将该模型应用于渭河流域咸阳站与临潼站的月径流预测中。结果表明,VMD-GSA-SVR模型相较于其他模型,有着更高的预测精度与泛化能力,更加符合预测的实际情况,在渭河流域具有较好的可行性与适应性。     

GA优化支持向量机用于混沌时间序列预测

介绍了利用支持向量机与重构相空间理论预测混沌时间序列的方法，并以股价时间序列为样本，比较了几种常用核函数的预测能力，实验表明高斯核的预测能力明显好于其它核．使用遗传算法优化了高斯核支持向量机的参数，优化后其预测能力较经验定参方法有明显提高，且好于传统的预测方法．     

用于SVM说话者确认系统的序列核

为了更好的将区分式分类方法应用于说话者确认系统中,该文提出了一种应用于支持向量机(supportvector machine,SVM)说话者确认系统的新型序列核,通过Gauss混合模型训练出每个说话人模型超向量作为支持向量机的输入样本,然后根据Gauss混合模型之间的Kullback-Leibler距离度量构造的SVM序列核函数对超向量进行训练和判决.在美国国家标准与技术研究所(NIST)2004和2006年说话人识别数据库上的实验证明了该核函数能在一定程度上提升整个说话者确认系统的识别精度和鲁棒性.结果表明,本文提出的应用于说话者确认系统中的核函数不仅具有明确的物理意义,而且改善了识别系统的性能.     

优化的混合核函数相关向量机在发酵过程建模中的应用

针对相关向量机中核函数选择问题进行研究,提出一种局部性高斯核函数和全局性sigmoid核函数结合的相关向量机建模方法.采用差分进化算法对混合核函数构成的相关向量机的参数进行优化,提高了模型的预测精度.将参数优化后的混合核函数相关向量机用于青霉素发酵过程的软测量建模,得到比单一核函数所建模型更优的预测精度.     

一种近似于支持向量机的分类模型

针对线性可分与非线性可分问题,讨论了支持向量机分类模型及核函数的选择.为避免支持向量机的核函数及参数选择的不确定性,提出一种近似于支持向量机的分类模型,并通过心脏病预测实例对两种模型进行了比较.     

PSO-SVR在果酒生物活性物质预测中的应用

针对BP神经网络和遗传算法对果酒生物活性物质预测存在速度慢和精度低的缺点,建立了基于支持向量回归机(SVR)的果酒生物活性物质预测模型。鉴于支持向量机模型的精度和泛化能力很大程度取决于不敏感损失系数ε、惩罚系数C和RBF核函数的宽度系数γ三个参数,模型采用粒子群算法对三个参数同时进行优化,实现了果酒生物活性物质的非线性预测。仿真结果表明:基于PSOSVR算法的果酒生物活性物质预测模型性能优于所比较的BP神经网络模型和支持向量回归机模型,能有效提高果酒生物活性物质的预测精度和稳定性。     

不同核函数SVM在居民出行方式预测模型中的应用

采用持向量机方法构建了居民出行方式选择模型,使用网格搜索方法选择支持向量参数,避免参数选择的随机性,分析不同核函数对模型构建的影响。研究表明,采用多项式核函数、RBF核函数构建的支持向量机模型对居民出行方式预测精度较高,所构建的模型可用于居民出行方式预测;在支持向量机核函数选择中,优先选择RBF核函数,其次为多项式核函...     

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.