分层结构故障诊断中适合电路容错性的模糊聚类模型匹配算法

分层结构方法是目前在复杂系统故障诊断中常用的方法．但由于电路系统中元器件的容错性问题,如直接采用一般的聚类方法,效果并不理想．因此,在构造加性模糊聚类模型的基础上,提出了一种适合电路容错特性的模糊聚类模型匹配算法．将各故障在特征空间中的容错区间作为集合,用Ｈａｕｓｄｏｒｆ距离测定集合间的相似程度来决定类别．用一个实用电路作为例子,采用本算法对故障集进行了聚类分析,并与模糊Ｃ－划分法进行了对比分析．结果表明,该算法是有效的     

基于模糊聚类方法的T-S模糊系统建模

提出了用一个聚类验证准则设计模糊C均值聚类算法，这个聚类验证准则是用来确定模糊C均值算法中合适的聚类数．针对T—S模糊模型，由模糊c均值聚类算法确定其逻辑前件参数，进而采用最小二乘算法确定模糊推理规则的后件参数．最后，应用本文建模方法对一个非线性实例进行仿真计算，并与其它方法进行了比较，结果表明本文方法是有效的．     

高斯模糊核聚类的模拟电路在线故障诊断算法

为提高模拟电路故障在线诊断的运算速度与可靠性,采用高斯模糊核聚类算法对模拟电路故障进行非监督学习。该故障诊断算法的关键是利用已知故障数据类中心点确定故障类。利用模糊核聚类的高效识别树型结构减少训练样本规模、处理模糊类中的野值点,以提高分类器的训练速度和精确度。根据每一类故障数据得到的故障参数均值,设其为故障判断阈值,并赋予类标。在三种不同故障条件下,对Sallen-Key低通滤波器电路进行故障诊断的仿真实验。结果表明：与RBF监督学习方法相比,β-MKFCM方法能够高效地辩识已知故障与未知故障。该研究为电路在线故障诊断提供了参考依据。     

复杂系统故障诊断中的模糊聚类方法

为了提高复杂系统故障的诊断能力,采用模糊Ｃ－均值聚类算法对原始采样数据进行聚类,并通过模糊传递闭包法和绝对值指数法得到模糊Ｃ－均值法的初始迭代矩阵．用划分系数、划分熵和分离系数来评价聚类的结果是否最佳．采用模糊聚类方法可避免研究复杂系统的内部特性,比仅依据其外部输出的数据进行故障诊断方法简便．通过某飞行器测试系统的应用,表明采用模糊聚类方法后,提高了判别故障的准确率．     

基于蚁群聚类算法的文本模糊聚类方法

针对模糊C-均值本文提出将基于蚁群算法的模糊聚类算法应用于文本聚类中,聚类采用二级结构,蚁群算法(ACA)作为一级结构,模糊C-均值聚类FCM用于二级结构。将此算法对文本集合进行聚类实验,并用分离系数、分离熵来判断模糊划分的效果,实验结果表明,与FCM相比,该算法具有较好的聚类效果。     

基于在线模糊聚类的故障检测和容错控制

提出了一种新的基于T-S模糊模型在线辨识的非线性系统的故障诊断与容错控制策略.在闭环控制中,根据在线产生的数据对T-S模糊模型进行辨识,当故障引起系统动态的结构性变化时,在线模糊聚类算法能够辨识出系统的重大改变并产生新的模糊规则描述系统新的动态,同时基于T-S模型的控制律也会做出相应的调整.分析了T-S模糊模型结构和参...     

一种基于集合划分的鲁棒性自适应模糊聚类分割算法

模糊C均值算法(FCM)是图像分割最常用的算法之一,这种方法需要提前确定初始聚类中心和聚类数.为此,提出了一种新的自适应模糊聚类算法(AFCM),AFCM算法中构造的观察矩阵、判断矩阵和集合划分可以自动确定合适的聚类数.为了得到更好的图像分割效果,采用核距离作为相似性度量,提出了一种鲁棒性自适应模糊C均值算法(RAFCM).实验结果表明,与FCM算法相比,AFCM和RAFCM算法不仅能自动地确定聚类数目,还可以得到更好的图像分割质量.     

动态模糊聚类方法及其在故障诊断中的应用

动态模糊聚类方法及其在故障诊断中的应用宓为建，石来德根据故障诊断分类的特点，用变分原理导出了动态聚类的最优解的存在条件，讨论了相应的算法及其收敛性，并在柴油机供油系统故障诊断中实现了故障分类的动态表示，证明了其在故障分类识别中的有效性．动态模糊聚类方...     

基于设计模式的多维集合及其在模糊聚类中的应用

为了解决模糊聚类中聚类结果的存储和表示,作者在研究了Composite设计模式后,设计和实现了多维集合类．并在简单介绍作者所设计的模糊聚类类后,详细分析了多维集合在直接聚类法中的应用方法．     

一种柴油机燃油系统故障诊断的新方法

提出一种基于小波变换和模糊C-均值聚类分析的柴油机燃油系统故障诊断方法.对测得的柴油机高压油管压力波形进行小波变换,提取了反映故障状态的5个特征参数.给出了模糊C-均值聚类算法的原理及一般步骤,指出用划分系数、划分熵和分离系数可以评价模糊聚类的有效性.利用模糊C-均值聚类算法建立标准故障特征模式,通过待识样本与标准模式的贴近度计算和比较,可以完成故障模式的模式识别.该方法应用于柴油机燃油系统的典型故障诊断中,测试表明采用小波分析和模糊C-均值聚类分析后,提高了判别故障的准确性.     

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.