基于鲁棒主元分析的故障诊断方法

针对工业过程的建模数据中含有离群点的情况,提出了一种基于鲁棒主元分析(PCA)的故障诊断方法.该方法使用广义极大似然估计(M估计)代替最小二乘估计,将传统的主元分析问题转化为一个加权的重构误差优化问题,然后通过改进的非线性迭代部分最小二乘(NIPALS)算法来求得问题的最优解,在此基础上建立主元模型并构造监控统计量检测过程故障.在连续搅拌反应器(CSTR)仿真系统上的应用结果表明,鲁棒PCA方法能够消除离群点对主元模型的影响,比PCA方法分析过程数据更为准确,能更有效地诊断过程故障.     

基于鲁棒PCA的火电厂湿法烟气脱硫系统的故障诊断

针对火电厂湿法烟气脱硫(WFGD)过程建模数据中存在离群点的情况,提出一种基于复合统计量CRS的鲁棒主元分析(PCA)的故障诊断方法.该方法利用含有离群点的样本数据建立PCA模型,求取PCA模型的复合统计量CRS的控制限,剔除样本数据中复合统计量值超过控制限的样本点,使用剩下的样本点重新建立PCA模型.经华能福州电厂的...     

鲁棒递推偏最小二乘法

针对时变模型建模或大数据量情况下建模过程中的野点检测问题,提出了鲁棒递推偏最小二乘法(RRPLS).通过将递推偏最小二乘法(RPLS)与鲁棒主分量回归算法(RPPSV)相结合,实现分块野点检测算法,有效地解决了一般野点检测算法的计算量大的问题.仿真说明鲁棒递推偏最小二乘法不但能检测出数据中的野点还能大量减少建模时间,最后给出了在交流异步电力测功机系统的应用实例.     

基于偏鲁棒M-回归的间歇过程离群点检测

以多元统计分析技术为核心的间歇过程建模、在线监测逐渐成为过程工业的关注焦点,然而过程数据中存在的大量离群点将直接影响上述方法的可靠性,为此提出了一种基于偏鲁棒M-回归的间歇过程离群点检测方法.首先基于极大相关熵估计建立鲁棒预测模型;然后利用偏鲁棒M-回归算法计算模型的回归系数;最后采用Hampel识别器分析最终的权值,从而实现离群点的检测.将所提方法应用于某间歇反应过程,实验结果验证了方法的有效性.     

基于MSPM的故障诊断技术研究现状与展望

首先,阐述基于主元分析(PCA)模型、偏最小二乘法(PLS)模型和独立分量分析(ICA)模型的统计过程监控方法的基本思想及应用情况,并综述各种方法的研究现状及发展趋势.其次,介绍将传统统计过程监控技术与故障预测技术相结合,并实现基于多元统计过程监控(MSPM)的故障预测的方法及其研究成果.最后,分别就多元故障预测技术中出现的非高斯、非线性、多模态、概率分布、间歇过程的故障预测和应用验证等6个难点问题进行讨论.     

基于鲁棒主元分析的SAR图像目标分割

合成孔径雷达(SAR)图像的目标分割,是SAR图像自动目标识别的关键预处理步骤。与一般SAR图像目标区域分割方法不同,鲁棒主元分析融合了主元分析(PCA)与压缩感知(CS)理论中稀疏矩阵的先进思路,利用多帧具有相似性的SAR图像,构建一个观测矩阵D,通过求解一个凸优化问题,重建出一个低秩矩阵A和一个稀疏矩阵E。将矩阵A和E的列向量矩阵化,即可完成SAR图像目标与背景的分离。实验结果表明,鲁棒主元分析算法避免了复杂的SAR图像背景建模,针对同一目标的多帧SAR图像,所提方法对SAR图像目标和背景的分割问题具有可行性和有效性;与经典的最优阈值分割算法相比,误分率明显降低。     

改进的主元分析法在连铸结晶器过程监测中的应用

将改进的主元分析(PCA)方法应用于连铸结晶器的过程监测.基于板坯连铸结晶器摩擦力实测数据进行仿真分析,结果表明,改进的PCA避免了Q统计量的保守性,从而能够更有效地识别过程故障与工况改变引起的T2统计量的变化.与传统的PCA方法相比,改进PCA具有更强的故障检测能力.     

一种鲁棒的约束总体最小二乘无源定位算法

摘要：
为解决异常误差导致的机载单站无源定位不准确问题,提出了一种鲁棒的约束总体最小二乘(RCTLS)定位算法.首先建立定位模型,构建了加权的约束总体最小二乘(WCTLS)定位准则,并给出了牛顿迭代解.然后,利用广义M估计原理构建了WCTLS准则的鲁棒极值函数,将鲁棒CTLS问题转化为对等价权函数的设计问题,并根据丹麦法构建了等价权函数.理论分析表明,RCTLS算法能够有效识别异常误差,并降低异常测量数据的权值以减小其对定位结果的影响.仿真结果显示,存在异常误差时, RCTLS算法能够获得理想的定位估值,具有较强的鲁棒性.
     

KPCA-KPLS方法在pH中和过程建模中的应用

针对化工过程中的具有严重非线性、不确定性、时变性的复杂pH中和过程系统建模问题,提出一种基于核主元分析(KPCA)与核偏最小二乘(KPLS)相结合的建模方法.在高维特征空间内,该方法通过KPCA有效地提取输入数据的非线性主元,利用KPLS方法将输入变量投影在潜在变量上,再用输入与输出变量之间的协方差信息提取潜在特征建立pH中和过程模型.为验证其有效性,将KPCA-KPLS方法应用到弱酸强碱中和过程、强酸强碱中和过程实例中,并与核偏最小二乘、核主元分析_支持向量机(KPCA-SVM)、核极限学习机(KELM)、极限学习机(ELM)、最小二乘支持向量机(LSSVM)、SVM等方法进行比较.实验结果表明:KPCA-KPLS方法具有很高的动态建模精度.     

基于故障重构的PCA模型主元数确定方法的研究

基于故障传感器测量数据的重构知识,研究了确定PCA模型主元数的方法,即求取最优主元个数.该方法利用传感器数据本身所具有的高度相关性,通过定义未重构误差方差,并使其在故障重构过程中达到最小,从而更加合理地计算出主元个数,并且大大减少了以往方法中人为因素的影响.通过在化工过程中的仿真分析,所得结果与累计方差贡献率方法所得结果相比较,具有一致性.     

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.