基于局部线性嵌入(LLE)非线性降维的多流形学习

为了研究多人脸多表情数据集的多流形学习问题,提出了一种基于局部线性嵌入(LLE)算法的多流形学习方法.对于分布在不同流形上的高维数据,该方法在降维的同时首先对数据集进行非监督的聚类,然后分析每一类数据的低维流形的本质维数以及流形空间的构成,聚类及流形空间的确定是通过对LLE降维的结果进行分析而完成的,计算复杂度小.在Cohn-Kanade人脸表情数据库上的表情识别实验表明,该方法在多人脸多表情流形的学习中优于基本的LLE算法,表情的识别率提高了20%～40%.     

一种基于降维思想的K均值聚类方法

维数灾难是数据挖掘过程中的重要问题.为解决K均值聚类过程中的维数灾难问题,本文以欧式距离作为距离的计算方式,采用主成分(PCA)方法对数据源进行降维,实验获得在不同数据规模、特征下的K均值方法的聚类时间.设置对照组对时间、差异性、迭代次数三个方面进行比较.通过实验总结出,数据源的大小与维数共同影响降维聚类的时间效益:数据数量越大,降维聚类的时间收益越大,数据维数越大,降维聚类的时间收益越小;数据源的线性程度影响降维聚类与非降维聚类结果的差异大小:数据线性程度越高,两次聚类结果差异性越小.反之,差异性越大;K均值算法收敛速度很快,两次聚类都能在Sqrt(Row)次数内完成程序的收敛.     

基于局部线性嵌入的多流形学习故障诊断方法

故障样本具有复杂多样性,而不同故障类型存在于不同维数的多流形子空间中,将样本统一降维到同一维数的单流形上则不能进行高效的特征提取.提出了一种基于局部线性嵌入(Local Linear Embedding,LLE)的多流形学习(Multi-LLE)故障诊断方法,将单流形故障诊断方法扩展到多流形,首先利用Multi-LLE分别提取各故障数据集在其本征维数流形上的特征,再通过各特征向量的聚类中心与故障新样本在不同维数下的嵌入向量的距离比较,将距离最近者归为一类实现分类识别.利用转子实验故障数据对算法进行了验证,并将Multi-LLE方法与LLE和海赛局部线性嵌入(HLLE)方法进行了比较,结果表明该方法能够有效的实现故障诊断.     

采用时间序列突变点检测的滚动轴承性能退化评价方法

以滚动轴承为研究对象,根据性能退化曲线的现实意义定义了对性能退化特征提取具有指导意义的评价方法,该方法由初始退化点、初始敏感性、失效突变性和趋势一致性4个指标构成,并根据性能退化曲线的物理特性设计了性能退化特征评价的定量化指标;利用时间序列线性化突变点检测的方法给出了评价指标的计算过程,为性能退化特征的选取提供了更为直观的依据。使用国际通用的Swiss数据集进行验证,实验结果表明该评价方法可以全面评价各个性能退化特征对性能退化过程的表征效果。为了更好地保持原始高维数据的空间位置关系,提出了基于邻域参数自适应选取的局部线性嵌入(LLE)算法,通过自适应局部权值向量来保存高维空间数据的局部线性结构,将多个局部线性进行叠加来不断地逼近全局的非线性,有效提高直接使用高维数据反映原始状态性能的可靠性和稳定性。使用滚动轴承加速寿命试验数据,对比邻域参数自适应LLE算法和常规LLE算法所提取的性能退化特征,验证了邻域参数自适应LLE算法可以保留更多原始高维数据的信息。     

基于粗糙集理论的模糊C-means高维数据聚类算法

模糊C-means算法是一种重要的聚类分析算法,但是在数据维数较高的情况下,该算法计算量急剧上升从而导致其效率较低.针对这一问题,提出了一种基于粗糙集理论的模糊C-means高维数据聚类算法,该算法在传统模糊C-means算法的基础上引入了粗糙集属性约简的理念,通过对数据集属性的约简,提取出对分类影响较大的属性集而摒弃与分类无关的属性,进而在聚类过程中只计算属性约简结果集中的属性,从而减少聚类过程的工作量、提高聚类效率.理论分析和实验结果表明,该算法在处理高维数据时较高效.     

两种基于谱方法的流形学习算法研究

流形学习方法是一种新型的非线性降维方法,它可以有效地对具有内在流形形式的非线性高维数据进行维数约简.目前,流形学习已被成功应用于聚类、可视化等数据挖掘领域,表现出卓越的性能.首先讨论了流形学习的研究现状,然后介绍了这一领域中影响最大的2种算法:局部线性嵌入算法和等距特征映射算法.     

基于粗糙集和聚类的采空区煤自燃火灾预报

采用标志气体分析法对煤自燃火灾预报时存在特征维数较高、特征之间存在冗余及人为划分温度段的不合理性等问题,文中提出基于粗糙集和聚类的采空区煤自燃火灾预报方法。即使用粗糙集对原始样本去除冗余和特征维数约简,再用聚类方法对约简后的特征进行聚类得到各温度段的特征中心,并使用模式识别的方法,确定出煤自燃标志气体特征其与温度段特征中心的相似性,从而实现采空区遗煤自燃状态的识别和早期预报。     

一种局部线性嵌入的空间听觉重建方法

空间听觉重建中,头相关传输函数(head-related transfer function,HRTF)庞大的数据量是影响虚拟声源合成效率的主要因素之一.为了减少HRTF的数据存储,提出一种局部线性嵌入(locally linear embedding,LLE)空间听觉重建方法.通过LLE对高维HRTF数据进行降维,在低维数据空间提取与方位感知相关的特征,然后利用聚类算法进行分类,得到特征HRTF,而其余非特征HRTF则可以利用特征HRTF通过改进插值算法进行重构.与现有的主成分分析法(principal component analysis,PCA)相比,利用LLE降维后的数据保留了更多的感知信息,利用HRTF数据间的内在关系,对插值后的数据进行修正,可减少重建误差.仿真结果表明,该方法能够有效地减少HRTF的存储数据量,有利于提高虚拟声源的合成效率.     

基于符号表示的时间序列分类综述

一种有效的时间序列符号表示方法不仅可以实现数据高效降维,且对噪声具有鲁棒性,对于提高分类算法的性能和效率具有重要意义。本文从基于趋势特征、基于聚类或进化计算、基于文本以及基于频率域的角度,对近年来基于符号表示的时间序列分类方法的研究进行比较归类,为研究者了解最新的符号时间序列分类方法研究动态和发展趋势提供参考。     

一种新的粗糙集与支持向量分类机算法

用支持向量机的机器学习是依据结构风险最小化原则,序列最小优化(SMO)是较特殊的分解算法。对高维大样本对象,支持向量机训练算法面临耗时增大与维数灾问题,利用粗糙集(RS)对不确定数据处理能力,提出一种新的粗糙集与支持向量分类机算法RS-SMO,可以对数据集做属性约简,生成类边界集作为SMO的训练子集,比原始训练集的维数与规模大小都有一定程度的减少,可构造出具有较好时空性能的算法。用两个实用数据对象做仿真,实验结果表明算法RS-SMO比SMO的性能有大的提高,实现了结构风险最小化。     

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

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.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.