基于集员滤波器的故障诊断

针对具有未知但有界故障的时变系统,提出一种集员滤波的故障诊断方法,保证系统的状态、故障信号的值100%包含在上下界内.假设过程噪声、测量噪声和故障信号的值有界,采用S-过程方法和线性矩阵不等式(LMI)方法设计集员滤波器,最后运用递归优化算法对集员滤波器进行优化.所提方法不仅可以对故障大小进行估计,还能够检测出故障信号类型.数值仿真证明了该方法的可行性和有效性.     

具有状态约束的基因调控网络的集员滤波器研究

针对基因调控网络中切实存在状态约束现象,在考虑一类含时滞、参数不确定、噪声干扰的离散基因调控网络模型基础上设计一种集员滤波器,实现基因调控网络状态的估计.通过假设测量噪声是未知但有界的,采用LMI方法设计集员滤波器,获得滤波器的增益矩阵,运用递归优化算法对集员滤波器进行优化.最后,通过数值仿真证明了所提算法的有效性,实现了基因调控网络中的mRNA和蛋白质浓度的准确估计.     

线性系统在非线性等式约束下的集员卡尔曼滤波

为了解决运行系统要求的100%估计包含真实最小域的需要和计算机的实时计算问题,使用集员卡尔曼滤波算法解决非线性状态约束.采用最小迹椭球算法对状态向量的椭球域进行更新,同时分别在预测和滤波的2个阶段用投影的方法把没有约束的状态估计投影到有约束的状态估计表面来处理约束问题.最后将所设计的集员卡尔曼滤波器应用到汽车追踪实例中.实验结果表明:采用所提算法的系统只是在初始值有比较大的误差,在后续的跟踪过程中都能在最大最小界之内跟踪上真实值.所提算法相比于传统的卡尔曼算法,其误差能迅速减小.实例仿真结果证明了所提方法的可行性和有效性.     

具有状态约束的集员卡尔曼滤波器设计

针对状态约束问题,提出具有状态约束的集员卡尔曼滤波算法.采用最小迹椭球算法对状态向量的椭球域进行更新,同时分别在预测和滤波的两个阶段用投影的方法把没有约束的状态估计投影到有约束的状态估计表面处理约束问题.将所设计的集员卡尔曼滤波器应用到三维追踪实例中,实例仿真结果证明了所提方法的可行性和有效性.     

滑模观测器实现不确定系统的鲁棒故障重构

讨论了利用滑模观测器实现不确定系统的在线故障重构问题.首先应用奇异值分解,对系统进行规范化处理,设计了鲁棒滑模观测器的LMI算法,并通过非线性介入使设计观测器对系统不确定性具有鲁棒性及跟踪系统状态的收敛性;然后根据滑模观测器设计方法,利用等价输出误差介入、H∞约束优化原理以及加入输出滤波器方法,提出了执行器故障和传感器...     

具有线性不等式约束非线性规划问题的降维算法

对线性约束的一般非线性规划问题进行了研究,在算法中提到的起作用集策略,与常见的起作用集算法相比较;在迭代过程中求解等式约束子问题时采用了降维算法,而对于不等式约束子问题采用了起作用集算法.通过数值试验,说明了算法的有效性.算法对于求解非线性约束非线性规划问题提出了一种新思路,将非线性约束线性化,解决一般此类问题.     

考虑状态约束的容积卡尔曼滤波估计算法

针对传统非线性滤波未考虑状态约束的局限,提出一种考虑状态约束的容积卡尔曼滤波算法。将状态约束转化为增益约束,结合最小方差估计给出最小约束代价函数;同时,采用相径容积规则近似计算系统状态的后验均值和协方差,给出等式状态约束下的容积卡尔曼滤波递推公式。最后,对路径约束条件下的导航定位系统进行仿真,结果表明算法定位精度优于常规容积卡尔曼滤波算法,较好地解决了非线性系统存在等式状态约束时、常规容积卡尔曼滤波算法不满足约束条件且估计精度差的问题,验证了算法的有效性。     

随机学习萤火虫算法优化的模糊软子空间聚类算法

传统软子空间聚类算法在利用局部搜索策略解决等式约束的连续非线性的变量加权问题时,易陷入局部最优导致聚类效果不佳.针对该问题,该文提出了一种随机学习萤火虫算法优化的模糊软子空间聚类算法.该算法利用具有全局搜索能力的萤火虫算法对新算法的目标函数进行优化,同时,为弥补萤火虫算法易提前收敛和寻优精度较低的缺陷,对萤火虫种群进化方式和全局最优粒子的学习方式进行了改进.新算法将权值矩阵拟化成萤火虫种群,使变量加权的等式约束变为界约束,通过萤火虫位置的更新搜索最优权重并发掘子空间中隐藏的簇类.在人工数据集、UCI标准数据集和癌症基因表达数据集上的实验结果表明:该算法具有较好的聚类效果.     

基于谱分解技术的两通道因果稳定IIR滤波器组的设计(英文)

提出一种新的两通道因果稳定IIR滤波器组的设计方法.首先基于所定义的一种余弦滚降IIR滤波器,两通道滤波器组所要求的平坦条件完全被满足;其次该方法是依赖于分析滤波器的功率谱特性,而不是该滤波器的幅度频率特性来设计滤波器组.IIR滤波器的设计问题可转化成一个准凸问题,采用凸优化算法来求解;然后对所得优化解进行谱分解,得到目标滤波器组.该滤波器组具有合理的完全重构误差,并且其多相因子的分母相同,简化了完全重构条件.采用该滤波器组作为约束非线性优化法的有效初值,进一步优化得到完全重构2通道IIR滤波器组.     

求解含等式约束优化问题的遗传算法

针对遗传算法较难处理含等式约束的优化问题,在设计变量独立性分析的基础上对等式约束采用了降维处理方法,不仅使等式约束在优化时始终严格满足,而且经降维处理后优化问题仅包含不等式约束;然后,借鉴多目标优化思想,提出了从个体违反约束程度和违反次数2方面同时对种群进行排序,使算法对个体的排序和选择更符合实际.实例验证了该算法的有效性和可行性.     

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.