一类基于Levenberg-Marquardt算法的神经PID控制研究

传统的比例积分控制器具有一定的局限性,尤其是当被控对象会有非线性、不确定性和时变特性,常规的PID控制器往往难以发挥作用,甚至会失稳.利用神经网络进行复杂过程的PID控制可以很好地解决上述问题.Lvenberg-Marquardt(LM)算法是梯度下降法与高斯-牛顿法的结合.就训练次数与精度而言,它明显优于共轭梯度法及变学习率的BP算法,适用于PID控制.得到了在线自适应神经网络PID控制算法,该算法改善了传统BP算法,实现了现有PID控制器控制方法.     

一类基于Levenberg—Marquardt算法的神经PID控制研究

传统的比例积分控制器具有一定的局限性,尤其是当被控对象会有非线性、不确定性和时变特性,常规的PID控制器往往难以发挥作用,甚至会失稳．利用神经网络进行复杂过程的PID控制可以很好地解决上述问题．Levenberg—Marquadt（LM）算法是梯度下降法与高斯一牛顿法的结合,就训练次数与精度而言,它明显优于共轭梯度法及变学习率的BP算法,适用于PID控制．得到了在线自适应神经网络PID控制算法,该算法改善了传统BP算法,实现了现有PID控制器控制方法．     

基于梯度监督学习的理论与应用(Ⅰ)——基本算法

讨论了一类基于梯度的监督训练算法及其用于神经网络的参数优化。文中详细讨论了ＬＭ算法，它是梯度下降法与高斯牛顿法的结合，既有高斯牛顿法的局部收敛性，又有梯度下降法的全局特性。μ很大时，ＬＭ算法近似于梯度下降法；μ为零时，则是高斯牛顿法。由于利用了近似的二阶导数信息，ＬＭ算法比梯度法快得多。就训练次数及准确度而言，ＬＭ算法明显优于共轭梯度法和变学习率的ＢＰ算法。由于主矩阵的正定性，解总是存在的，从这种意义上说，ＬＭ算法优于高斯牛顿法     

发电机励磁与汽门系统的改进神经网络逆控制方法

为提高发电机励磁汽门系统机端电压和转速的控制性能,提出了基于在线学习和扩张状态观测器(ESO)的改进神经网络逆控制方法.首先,将神经网络逆与被控励磁汽门系统组成的复合伪线性系统等效为含有扰动的线性系统.然后,基于自抗扰控制方法,设计了用于在线估计复合伪线性系统状态和扰动的ESO,并在设计的伪控制量中对扰动进行补偿,利用线性系统理论证明了ESO的收敛性和闭环系统的稳定性;同时,在离线训练的基础上设计了基于在线梯度方法的神经网络逆在线学习算法,利用李雅普诺夫稳定性理论证明了神经网络逆在线学习的收敛性.最后,以典型的两区域四机系统为例进行数值仿真,结果表明,与传统的AVR/PSS方法和基于离线训练的神经网络逆控制方法相比,所提方法明显提升了电力系统的暂态性能.     

基于在线学习和ADRC的发电机励磁与汽门系统ANN逆鲁棒控制方法

为提高汽轮发电机组励磁与汽门系统机端电压和功角的控制性能,提出了基于在线学习和自抗扰控制(ADRC)的神经网络逆鲁棒控制方法.首先,将神经网络逆(ANN)与被控励磁汽门系统组成的复合伪线性系统等效为含有扰动的线性系统;然后,基于ADRC,设计了用于在线估计复合伪线性系统状态和扰动的ESO,解决了神经网络逆在线学习时训练样本获取的难题,并在设计的伪控制量中对扰动进行补偿,基于线性系统理论证明了ESO的收敛性并针对励磁子系统和汽门子系统与神经网络逆系统组成的伪线性复合系统分别设计整数阶PID控制器和分数阶PID控制器以实现闭环控制;同时,在离线训练的基础上设计了基于在线梯度方法的神经网络逆在线学习算法,利用李雅普诺夫稳定性理论证明了神经网络逆在线学习的收敛性.最后,以典型的两区域四机系统为例进行数值仿真,与传统的AVR/PSS和基于离线训练的神经网络逆控制方法的比较结果表明所提方法明显提升了电力系统的暂态性能.     

一种具有自适应动量因子的BP算法

为提高神经网络的训练速度,提出一种自适应确定带动量项BP算法中动量因子的方法.在学习率为常数情况下,根据误差函数关于权值向量的梯度变化情况,自适应调节动量因子.数值试验表明,该方法对离线和在线训练均有效,且在收敛速度和算法稳定性上优于常动量因子的BP算法.     

一种基于优化小波神经网络的语音识别

在以往的BP小波神经网络中,最常用的学习算法是BP算法,BP算法实质上就是梯度下降法,是一种局部搜索算法,梯度下降法使得网络极易陷入局部最小值,从而使得网络训练结果不尽人意,搜索成功概率低.取代传统的梯度下降法,利用粒子群算法对小波神经网络中的参数进行优化.然后利用基于粒子群优化(PSO)的小波神经网络进行抗噪声语音识别实验,仿真结果表明,与BP网络相比,PSO算法在迭代次数、函数逼近误差、网络性能方面均优于BP网络,系统的识别率也得到较大的提高.     

一种基于人工神经网络的旋转机械故障监测方法

把神经网络与数字信号处理相结合，提出并实现了一种基于神经网络的旋转机械在线故障监测系统，主要用于识别旋转机械的一些常见故障如转子不平衡振动、转子零部件松动、油膜涡动等等。系统主要由数字信号采集、数字信号预处理和Ｂ－Ｐ神经网络几部分组成。在神经网络中采用批处理加动量项的梯度下降算法学习。仿真结果表明该故障监测系统在故障识别率等各方面性能指标均优于传统的基于知识的工况监测与故障诊断系统。     

基于小波神经网络的自适应控制器设计

针对一类未知非线性系统,设计了一种基于小波神经网络的自适应控制器,并提出了一种适合在线学习的参数混合训练算法。根据离线和在线学习系统的特性,得到小波神经网络控制器的初始参数,使用混合训练算法在线修正控制律,实现了自适应控制。仿真结果验证了该控制方案的有效性。     

基于自构建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.