基于Kohonen网络-粗集-模糊神经网络获取模糊规则的集成方法

基于单一知识发现方法的不足提出了一种基于Kohonen网络、Rough Sets和FNN获取模糊规则的集成方法.首先用Kohonen网络进行数据量化,然后运用粗集理论产生初始规则,并根据所得的规则建立模糊神经网络模型,从而生成较少的精炼规则.最后通过实例仿真分析,验证了该方法的有效性和实用性,同时为获取模糊规则提供了新的思路.     

基于模糊神经网络的车牌图像识别方法

提出了一种基于模糊神经网络的方法对汽车车牌字符进行识别.该方法首先基于Rough Sets.思想获取初始规则和训练集,基于图像识别目标确定网络结构,通过神经网络的学习算法对网络进行优化.然后根据图像识别的模糊特性,利用模糊神经网络对汽车车牌进行精确的识别.实验结果证明该算法比常规识别算法识别率更高.     

模糊神经网络控制器参数的混沌优化

为了优化模糊神经网络的参数,将混沌变量引入到模糊神经网络参数寻优方式中,根据系统的性能指标,采用混沌变量进行粗搜索寻优模糊神经网络参数,然后在粗寻优基础上引入基于模拟退火策略的混沌细搜索,最后搜索出的模糊神经网络参数是全局最优的.仿真结果表明:该控制方案有效地实现对非线性对象的最优控制,为工业过程非线性复杂系统的控制提供了一种有效的控制方案.     

基于阴阳调和的模糊神经网络

针对传统的基于最小均方差或最大后验概率的学习算法不能得到最优解的实际情况,提出将贝叶斯阴阳(Bayesian Yin-Yang, BYY)学习算法引入模糊小脑模型关联控制器(Cerebellar Model Articulation Controller, CMAC)来确定最优模糊集的方法,并利用真值限定(Truth Value Restriction, TVR)推理策略推导出规则权值的真值.BYY受著名的中国古代阴阳哲学理论启发,认为宇宙中的任何事物都是阴和阳对立的统一体,当阴阳取得调和时,则达到完美.模糊规则集通过BYY系统地优化,使其具有更高的泛化能力;与原始的CMAC相比,它有效地减少了存储需求,并提供直觉模糊逻辑推理,具有清晰的语意规则.产品需求预测实验结果表明:BYY结合TVR应用于模糊神经网络,改进了CMAC模型,预测方法优于其他代表性的神经网络模型,所求模糊集与训练数据达到阴阳调和,得到最优解.     

基于Rough集理论的模糊神经网络构造方法

提出了在模糊神经网络中使用Rough集理论进行网络结构设计的方法。由于Rough集理论有强大的数值分析能力,而模糊神经网络具有准确的逼近收敛能力和较高的精度,所以通过两者的结合,可以得到一种可理解性好、计算简单、收敛速度快的神经网络模型。这种网络构造方法的主要过程为：首先,利用Rough集理论对给定数据集进行规则获取;然后,根据这些规则构造模糊神经网络各层的神经元个数及相关参数初始值;最后,用BP算法迭代求出网络的各种参数,完成网络的设计。给出了一个二维非线性函数拟合的实例,进一步验证了方法的正确性。     

模糊前向神经网络在瓦斯涌出量预测中的应用

为解决多输入单输出数据集的建模预测问题,提出一种基于Mamdani型模糊系统和前向神经网络的模糊神经网络,实现了瓦斯涌出量的建模预测.首先由采样数据生成模糊规则,明确了前向神经网络的网络结构.在Mamdani型模糊系统中提取出了隐含层神经元激励函数,并据此确定了模糊前向神经网络的表达式.然后对BP学习算法进行了改进,得到了权值直接确定的矩阵式.最后在瓦斯涌出量预测中,利用主成分分析法选取了较为重要的3个因素.仿真实验表明模糊前向神经网络具有较高的建模和预测精度.     

用于热力系统建模的基于粗糙集的模糊神经网络

模糊神经网络应用于热力系统建模,虽能取得较好的效果,但当模糊规则较多时,网络学习速度较慢。针对这个问题,对传统的模糊神经网络进行了改进。利用Kohonen自组织网络对数据信息进行聚类。然后利用粗糙集规则约减的方法,获取模糊神经网络最小规则,以提高模糊神经网络的学习速度。经过锅炉汽压回路模型的仿真实验结果表明:粗糙模糊神经网络学习速度较传统模糊神经网络有较大提高,同时网络误差有所降低。     

双枝模糊粗集

为进一步揭示模糊集、双枝模糊集与粗糙集的关系,在双枝模糊集及粗糙集的基础上,给出了上枝模糊粗集,下枝模糊粗集及双枝模糊粗集的概念;利用双枝模糊集及粗集的性质,讨论了下枝模糊粗集,上枝模糊粗集和双枝模糊粗集的性质.由讨论可知,双枝模糊集与粗集具有紧密的联系,由二者融合构成的双枝模糊粗集与模糊粗集具有类似的性质,双枝模糊粗集是模糊粗集的推广,而模糊粗集是双枝模糊粗集的特殊情况.     

双枝模糊粗集的分解

在双枝模糊集和粗集的基础上,提出了双枝模糊粗集的截集的概念;利用双枝模糊粗集的截集,讨论了下枝模糊粗集、上枝模糊粗集及双枝模糊粗集的结构,给出了双枝模糊粗集的分解定理.     

基于S-粗集理论的交通控制系统研究

利用粗集理论的知识推理,通过对交警指挥交通的实际经验所得决策表的约简,归纳出一系列交通控制规则,提出了一种基于S-粗集理论的交通控制模糊建模方法,实现了城市交通的粗模糊控制．     

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.