基于自适应Smith预估器的炉温控制系统

针对目前工业炉控制系统中存在的大纯滞后现象,提出一种基于自适应Smith预估器的炉温控制系统,具体介绍了控制系统的结构与算法。常规的PID控制,Smith预估控制和自适应smith预估控制在计算机上仿真结果表明自适应Smith预估控制具有超调量更小,调整时间更快,精度更高等特点。     

基于模糊控制的Smith预估器的改进研究

针对于燥系统具有不确定特性、大滞后的特点，提出了一种将模糊PID与模糊Smith预估器相结合的控制策略，实现了PID参数和Smith预估器滤波时间常数的在线整定，获得了比模糊PID控制、模糊Smith预估器控制更好的控制效果。仿真结果也证明了这一点．     

监控AGC系统的智能PID控制策略

为了解决带有纯滞后的监控AGC系统的控制问题,提出了基于RBF神经网络的PID控制器与Smith预估器相结合的智能PID控制系统,并对传统监控AGC、应用Smith预估器的监控AGC及应用智能PID控制的监控AGC系统进行了仿真.结果表明,应用智能PID控制的监控AGC系统收敛速度明显加快,适应能力与鲁棒性比常规PD控制要好.     

基于改进Smith预估器的显微视觉伺服

提出了一种改进Smith预估器的模糊白适应PID显微视觉伺服控制策略.该策略用于改善视觉伺服系统的控制品质.针对视觉迟延问题,建立了视觉伺服系统的分时模型.在对基于位置的动态“look and move”视觉伺服系统特性分析的基础上,建立了基于改进的Smith预估器的模糊自适应PID控制的视觉伺服系统结构.在微操作机器人平台上进行了微小零件的自动定位与抓取实验.实验与仿真结果表明,提出的视觉控制结构的伺服系统具有很好的控制品质,满足微操作应用要求.     

基于时滞补偿的气动系统位置控制仿真

为解决气动系统在控制过程中出现的时滞性、非线性性和外部干扰等问题,提出了一种基于时滞补偿的模糊比例-积分-微分(proportion integration differentiation, PID)控制的策略。首先,分析气动系统的工作原理,建立气动系统的机理模型。其次,针对气动系统存在的时滞特性,在Smith预估器的结构中引入干扰观测器,并使用改进的Smith预估器来补偿系统的纯滞后环节。最后,为提高位置控制精度,设计了具有自整定能力的模糊PID控制器。仿真结果表明,改进的Smith预估器与模糊PID控制相结合的策略能够保证系统的稳定输出,提高系统的抗干扰能力和鲁棒性。     

基于C＋＋Builder的三容液位系统的Smith预估控制

三容器液位控制系统具有典型的滞后特性,用常规的PID难以达到精确的控制效果,提出了基于三容器数学模型的Smith预估补偿控制算法,并用C Builder对其进行实验仿真.仿真结果表明Smith预估补偿控制比常规的PID控制具有调节时间短、超调量小、鲁棒性好等优点.     

基于Smith预估器和自适应模糊PID的温控系统

针对常规温度PID控制系统由于温度惯性大、单向升温和滞后大等特性存在超调量较大、抗干扰性差等问题,提出一种新的电阻炉温度控制系统.该系统采用自适应模糊PID控制算法,在此基础上结合Smith预估补偿器,实现软切换,并采用MATLAB软件进行仿真.仿真结果表明,基于Smith预估补偿器的自适应模糊PID控制相比常规PID控制具有良好的控制性能.     

基于Smith预估器的PCR仪时滞温控系统

为了解决聚合酶链式反应(PCR)仪温度控制中的纯滞后问题,在试验数据的基础上,基于Matlab搭建仿真模型.仿真结果表明,加入Smith预估补偿环节可以较好地解决纯滞后效应带来的积分累积问题.将仿真得到的方法移植到实际的控制中,可获得良好的控制效果.最后提出添加一个比例-积分-微分(PID)控制器的改进算法,用以解决Smith预估控制算法中鲁棒性不强的问题.     

一种改进的自适应Smith预估器

传统的Smith预估器是基于被控对象的精确数学模型而设计的,对于缺乏精确数学模型且参数时变的大时滞系统,常规的Smith预估控制规则就很难获得令人满意的控制效果。文章在一种增益自适应Smith预估补偿器的基础上,利用信号的相关性分析技术中的平均幅度差函数,实时调整预估器的滞后时间;仿真表明,该算法具有较好的性能,加强了Smith预估器抗干扰能力,改善了参数时变的大时滞系统的鲁棒性。     

用于时滞不确定系统的自适应Smith预估器

Smith预估器对模型的依赖性制约了它在实际中的应用 ,文中提出一种改进型Smith预估器 ,能在线地跟踪时滞不确定对象的时滞时间常数的变化引起的系统输出的变化 ,调节模型输出使得闭环系统稳定 ;而且 ,模型中不含有时滞环节 ,控制器只有一个调节参数 ,易于实现 ;对一大惯性、大时滞系统的仿真结果表明 ,改进算法较好地解决了Smith预估器的稳定性对模型时滞时间常数的依赖性问题 ,具有广泛的应用前景     

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.