判断一类双系统同时精确可观测的充分条件

利用反自伴算子生成系统是精确可观测的Hautus条件,得到判断如下双系统同时精确可观测的充分条件.Z·1(t)=A1z1(t),z1(0)=z1,y1(t)=C1z1(t)Z·2(t)=A2z2(t),z2(0)=z2,y2(t)=C2z2(t)     

多自由度振动系统的同相振动性

采用反射函数法研究了多自由度振动系统x′=p(t)x, 当p(t)=diag(A(t),B(t))时,给出其等价系统y′=A(t)y, z′=B(t)z同相振动的充分必要条件,其中A(t)=(aij(t))2×2, B(t)=(bij(t))2×2, y=(y1,y2)T, z=(z1,z2)T, p(t+2ω)=p(t), ω>0, t∈R, x∈R4, p(t)为连续可微的矩阵函数.     

Banach空间非柱形域上微分系统解的存在性

考虑在Banach空间非柱形域Ω上,微分系统 (IVP;τ,z0) z′=x′ y′=f1(t,x,y) f2(t,x,y)=f(t,z), (t,z)∈Ω, z(τ)=x(τ) y(τ)=z0=x0 y0 解的局部存在性,其中f1,f2分别满足紧性条件与耗散性条件,得到的结果推广并完善了已有的相关结果。     

一类完全三阶常微分方程边值问题的正解

用锥上的不动点指数理论与导数估计技巧,研究完全三阶边值问题{-u′′′(t)=f(t,u(t),u′(t),u″(t)),t∈[0,1],u(0)=u′(0)=u″(1)=0正解的存在性,其中f:[0,1]×R_+~3→R_+连续.在f(t,x,y,z)满足|(x,y,z)|充分小或充分大时的一些不等式条件下,得到该方程正解的存在性结果,这些不等式条件允许f(t,x,y,z)关于x,y,z超线性或次线性增长.     

完全三阶边值问题解的存在性

本文讨论了如下完全三阶两点边值问题{-u(t)=f(t,u(t),u′(t),u″(t)),t∈[0,1],u(0)=u′(0)=u″(1)=0解的存在性,其中f:[0,1]×R3→R为连续函数.当f(t,x,y,z)满足关于x,y,z超线性增长的不等式条件及f(t,x,y,z)关于z满足Nagumo型增长条件时,本文应用Leray-Schauder不动点定理获得了该问题解的存在性.     

临界情况下一类拟线性方程组的初值问题

本文将讨论下列方程组 εdx/dz=A(y,x)z εf(y,x),dy/dx=z, (1) 具有无穷大初值 y(0,ε)=y0,z(0,ε)=z-1/ε, (2) 其中z=(z1,z2)T,y=(y1,y2)T,f=(f1,f2)T都是二维向量,记号T表示向量的转置,ε是小参数,A(y,x)是行列式为零的二阶矩阵.在文献[1]讨论过数量情况下具有无穷大初值的二阶方程.由于在向量情况下,临界情况比较复杂,本文仅讨论一类特殊的矩阵A:     

一类积分微分方程Robin边值问题的奇异摄动

本文研究奇摄动积分微分方程的Robin边值问题 εy″=f(t,Ty,y,y′,ε), α(ε)y(0)—b(ε)y′(0)=A(ε),c(ε)y(1)+d(ε)y′(1)=B(ε),其中T是定义在C[0,1]上的一个积分算子。文中用微分不等式方法证明了解的存在性,构造出解的渐近展式并给出了余项的一致有效估计.最后把所得结果用于研究奇摄动四阶边值问题. εx~((4))=f(t,x,x″,x,ε), x(0)=φ(ε),x(1)=φ(ε), α(ε)x″(0)—b(ε)x(0)= A(ε),c(ε)x″(1)+d(ε)x(1)=B(ε).     

二阶微分方程组边值问题2个正解的存在性

讨论了二阶微分方程组x″(t)+λa(t)f(x(t),y(t))=0,y″(t)+λb(t)g(x(t),y(t))=0,0≤t≤1,x(0)=y(0)=x′(1)=y′(1)=0,其中f,g连续,并赋予f,g一定的增长条件,证明了方程组至少存在2个正解。     

一类完全三阶两点边值问题解的存在性与唯一性

讨论如下完全三阶两点边值问题{-u(t)=f(t,u(t),u′(t),u″(t)),{t∈[0,1],u(0)=u′(0)=u′(1)=0解的存在性与唯一性.其中f(t,x,y,z):[0,1]×R3→R为连续函数.在f(t,x,y,z)关于z满足Nagumo型增长条件下,应用上下解方法与截断技巧,获得了该问题解的存在性和唯一性结果.     

关于丢番图方程Ax4+Bx2y2+Cy4=z2的解

证明了丢番图方程4x4-6x2y2 3y4=z2,(x,y)=1的全部正整数解为(x,y,z)=(x0／2,ab,(3a4 b4)／4), (Xn,2yn,2zn),认为仅有正整数解(x,y,z)=(1,1,1)是不妥的,它漏掉了(xn,2yn,2zn)及(x0／2,ab,(3a4 b4)／ 4);丢番图方程x4-6x2y2 12y4=z2,(x,y)=1的全部正整数解为(x,y,z)=(x0,ab,(3a4 b4)／2),(xn,yn, zn),认为仅有正整数解(xn,yn,zn),则漏掉了(x0,ab,(3a4 b4)／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.