高阶边值问题周期解的存在性

用变分方法研究高阶边值问题(-1)n+1u(2n+2)+∑n/k=1 (-1)kcku(2k)-a(x)u +f(x,u)=0,0相似文献   

一类退缩的拟线性椭圆方程正解的多重性

讨论一类退缩的拟线性椭圆方程在有界域ΩRN上的Dirichlet问题:(P){－(△)·(g(│(△)u│α)│(△)u│α-2(△)u)=λ(x)um+uq,u≥0,u(≠)0,inΩ,u│зn+0,至少有两个正解的存在性,其中2＜2α＜N,0＜m＜1,2α＜q＜q*-1,q*＝2αN/N-2α.     

一类非线性分数阶微分方程边值问题的正解存在性

通过锥不动点定理,给出非线性分数阶微分方程边值问题Da0+u(t)+ f(t,u(t))=0,0＜t＜1 u(0)=u(1)=u’(0)=0 的正解存在性,其中2＜a≤3为实数,f:[0,1]× [0,+∞)→[0,+∞)是连续的,Da0+是一个标准的Rieman-Liouvile微分.     

β+1＜p＜α+2＜p+p(β+1)/n时解的全局存在性

证明了当max(β+1,p)＜α+2＜p+p(β+1)/n时,且当初值属于某一类稳定集时,问题d/(at)(|u|β-1u)-Div(|▽u|p-2▽u)=▽·B(u)+|u|au;x∈Ω,t∈(0,T]u(x,t)=0; x∈(a)Ω,t∈(0,T]u(x,0)=u0(x); x∈Ω的全局解存在.     

三阶奇异周期边值问题的正解

用锥拉伸与锥压缩不动点定理讨论三阶微分方程周期边值问题u+ρ3u=f(t,u), 0＜t＜2π;u(i)(0)=u(i)(2π),i=0,1,2.正解的存在性,其中ρ∈0,(1)/(3)为常数,f在t=0,t=2π和u=0处有奇异性.     

大扰动下非凸广义BBM-Burgers方程解的渐近性态(下)

研究广义BBM-Burgers方程ut+f(u)x=uxx+uxxt的一般初边值问题,其边界条件为u(0,t)=u_(t)→u_(t→∞),初始值u(x,0)=u0(x)→u+(x→∞),u0(0)=u_(0),u±是给定的常数且满足u_＜0＜u+,|u+-u_|为充分小的正数.在流函数f为非凸及初始值为大扰动条件下,利用L2加权能量方法证明相应初边值问题解的整体存在性及渐近收敛于弱稳定波和弱稀疏波的线性叠加.     

一类非线性分数阶微分方程解的存在唯一性

利用混合单调算子理论给出非线性分数阶微分方程边值问题{Dα0+u(t)=f(t,u(t)),0＜t＜1{u(0)=u(1)=u'(0)=u"(0)=0正解的存在唯一性,其中3＜α≤4是一个实数,并且Dα0+是一个标准的黎曼-刘维尔微分.     

带一般边界和大初始扰动条件的广义BBM-Burgers方程解的渐近性态

研究广义BBM-Burgers方程ut+f(u)x=uxx+uxxtt的一般初边值问题,其边界满足u(0,t)=u_(t)→u_(t→∞),u_(t)-u_≤0;初始值满足u(x,0)=u0(x)→u+(x→∞),u_(0)=u0(0)且u_＜0＜u+.在流函数f满足f″(u) ＞0,f′(0)=f(0)=0以及初边值为大扰动的条件下,用L2-能量方法证明其解的整体存在性及渐近收敛于强稳定波和强稀疏波的叠加.     

一类含二阶导数项非线性Schr(o)dinger方程的爆破性质

研究了一类含二阶导数项非线性Schr(o)dinger方程 iut+δ△u+[β△|u|2+a|u|p-1]u=0, t＞0,x∈RN, (*)其中δ和β是实参数.在a＞0,1 ≤ P＜N+2/N-2:={N+2/N-2,N≥3 ∞ ,N=1,2,时,讨论了该方程初值问题解的爆破性质.     

一类带非线性对数项的拟线性椭圆方程解的存在性

研究了球内带非线性对数项的拟线性椭圆方程-div(I▽ uIp-2 ▽ u)=logu+h(x)uq带纽曼边值问题解的存在性,推广了De Queiroz 的相关结论,De Queiroz研究的是p=2时解的存在性.利用双摄动理论,首先对参数0＜s＜1考虑一组逼近问题-div(I▽ uIp-2 ▽ u)=log(u2+εu+ε\u+ε)+h(x)up解的存在性.由于不能直接利用Poincare不等式去求解上述逼近问题,所以对于每个O＜r＜R,定义另外一个区域ArR:=BR\Br,考虑在ArR上逼近问题解的存在性,当,r→0+时可以得到逼近问题解的存在性.最后令ε→0,求出逼近问题解的极限,得到所研究问题存在一个径向的正解Uε C1(BR\{O})n C(BR).     

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.