李雅普诺夫第二方法在二阶线性偏微分方程中的应用

本文将常微分方程稳定性理论中的Lyapunov第二方法应用到偏微分方程中去,着重讨论了二阶线性偏微分方程混合问题解的唯一性与稳定性;得到了三个唯一性与稳定性的定理;并通过实例说明定理的应用, 由于Lyapunov泛函比传统方法中的“能量函数”广泛得多,因而用选取适当的泛函V证明混合问题解的唯一性与稳定性要比文[1][2]中的证明简单而且广泛.     

一类具有扩散的传染病模型的渐进稳定性

讨论了具有空间扩散的传染病系统在齐次Neumann边界条件下解的整体性态.通过线性化方法给出了局部渐近稳定条件,通过构造 Lyapunov函数给出了全局稳定性的证明.     

一类具有潜伏期的水源性疾病模型的稳定性

研究一类具有潜伏期的水源性疾病模型的稳定性,利用再生矩阵方法计算出基本再生数R0,并进一步通过构造Lyapunov函数证明无病平衡点和地方病平衡点的全局稳定性.     

调度策略中的稳定性证明

在实际应用中，讨论调度策略的稳定性至关重要。以往研究在给出时清空最大缓冲器调度策略稳定性的证明时，证明复杂、繁琐。笔利用动态系统的Lyapunov理论，给出了调度系统中的Lyapunov函数，证明清空最大缓冲器调度策略稳定性。     

一类三阶非线性系统的全局渐近稳定性

李雅普诺夫第二方法是研究非线性系统稳定性的基本方法之一,而Lyapunov函数的构造是解决问题的关键.本文运用"类比法"对非线性系统x g(x)x f(x,x)x h(x)=0,构造了较好的Lyapunov函数,得到其平凡解全局渐近稳定的条件,并且证明中脱离了对Lyapunov函数无穷大性质的约束,推广了旧有的结果.     

带跳时滞随机微分方程E-M方法指数稳定性

研究带跳时滞随机微分方程Euler-Maruyama方法的指数稳定性.在全局Lipschitz条件及解析解和数值解在均方有界的条件下,证明SDDEJs的指数稳定性的充要条件是Euler-Maruyama方法下构造的数值解是指数稳定性的.避免寻找Lyapunov函数的困难,将指数稳定性的等价关系推广到带跳情形.     

T-S模糊广义系统稳定性分析及控制器设计

针对T-S模糊离散广义系统稳定性判别条件严格,不具备更好适用性等问题,提出一种优化判据的新方法.该方法利用模糊Lyapunov函数分析了T-S模糊离散广义系统的稳定性问题,经过推导得出了更具一般性的稳定充分条件,并对得到的结论予以严格的数学证明;基于并行分布补偿(PDC)设计了模糊控制器,在原有T-S模糊模型的基础上,引入了Lyapunov函数,然后根据稳定性判别表达式不同的处理方式,提出了更宽松的T-S模糊离散广义系统稳定性判别条件,并对推论进行了证明.对T-S模糊离散广义系统的稳定性问题的优化,使得模糊离散广义系统具有更好的通用性,更贴近实际及更稳定的控制作用.     

Matlab在判断平面自治系统零解稳定性中的应用

旨在研究一类难以找到合适的Lyapunov函数的自治系统的零解稳定性问题.从零解稳定性的几何特征出发,基于零解稳定性理论,通过Matlab编程,结合平面自治系统的具体实例,在相平面上绘制出相应系统在原点附近的线素场,观察其走向,以此来分析零解的稳定性.然后,再利用Lyapunov第二方法,从理论上对得到的结论加以证明.本文从定性的角度探究自治系统零解的稳定性问题,不仅揭示了零解稳定性的本质特征,而且提供了更为便捷、直观的方法来判断微分方程零解的稳定性.     

飞机全电刹车系统滑移率约束反演滑模控制

针对滑移率控制中要求保持刹车工作点的稳定性问题,提出基于障碍Lyapunov函数的反演滑模控制方法并应用于飞机全电刹车系统.考虑机电作动器的非线性特性,建立系统的状态空间模型并简化为严格反馈形式,将刹车系统的控制稳定性问题等效描述为含输出约束的系统镇定问题.根据反演控制思想,采用障碍Lyapunov函数方法获得刹车压力控制律,实现对滑移率的边界约束,并设计无抖振非奇异快速终端滑模控制器应用于机电作动机构,实现对参考刹车压力的快速跟踪.通过Lyapunov方法证明闭环系统稳定性,HIL实验结果表明控制策略的有效性.     

具有超级感染和Logistic增长的两菌株传染病模型

研究一类具有Logistic增长和超级感染的两菌株传染病模型.首先,证明模型解的非负性和有界性;其次,讨论平衡点的存在性和局部稳定性;最后,运用Lyapunov函数方法与LaSalle不变集原理得出其全局稳定性,并通过数值模拟验证了理论结果.     

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.     

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.     

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).     

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.