一类半正椭圆方程径向正解的存在性

首先,用变分法理论讨论带有Dirichlet边界条件的半正椭圆方程■径向正解的存在性问题,结果表明:当λ充分小时,方程不存在非负解;当λ充分大时,方程存在径向正解.其次,证明该方程每个解处的线性化算子均有非负的第一特征值.其中Ω■R~N(N≥2)是一个球或环,参数λ0,f∈C([0,∞),R)且f(0)0(半正),k:[a,b]→[0,∞)且■不恒为0.此外,当Ω为球时,k为线性映射;当Ω为环时,k为单调增函数.     

一类临界半线性双调和方程的多解存在性

给出了一类带非负扰动的临界半线性双调和方程的多解存在性。首先将方程化成一个椭圆方程组,然后根据椭圆方程组的正解的存在性获得了方程的第一个正解。最后,在不同的参数值和不同的维数条件下,用山路引理和一个改进的Pohozaev恒等式得到了方程的第二个正解的存在性和非存在性。参10。     

一类半正椭圆方程径向正解的存在性

首先, 用变分法理论讨论带有Dirichlet边界条件的半正椭圆方程径向正解的存在性问题, 结果表明: 当λ充分小时, 方程不存在非负解; 当λ充分大时, 方程存在径向正解. 其次, 证明该方程每个解处的线性化算子均有非负的第一特征值. 其中Ω是一个球或环, 参数λ>0, f∈C(［0,∞),R)且f(0)<0(半正), k: ［a,b］→［0,∞)且k(|x|)不恒为0. 此外, 当Ω为球时, k为线性映射; 当Ω为环时, k为单调增函数.     

一类半线性椭圆型方程组正解的存在性

利用上下解方法研究了一类半线性椭圆型方程组正解的存在性问题,在一定条件下得到了方程组解的存在性,且当参数λ,θ充分大时方程组的解总是存在的.     

一类一阶周期边值问题多个正解的存在性

本文研究了一阶周期边值问题■多个正解的存在性,其中λ>0是一个参数,a∈C（R,[0,∞）)是一个T-周期函数且∫^T₀a（t）dt>0,f∈C（[0,∞）,（0,∞）)且单调递增.在■的条件下,本文证明存在一个λ^*>0,使当0<λ<λ^*时问题不存在正解;当λ=λ^*时问题至少存在一个正解;当λ>λ^*时问题至少存在两个正解.主要结果的证明基于上下解方法和Leray-Schauder度.     

临界非齐次多重调和方程的多解存在性

讨论了带非负扰动的临界非齐次多重调和方程多解存在性和非存在性 .因为多重调和方程没有极值原理 ,所以首先利用泛函弱半连续性和适当变换辅助函数的方法建立起多重调和方程的上下解定理 由这个上下定理得到方程的第一个非负解 ,并讨论了第一个解的一些性质 再用山路引理和推广的Pohozave恒等式讨论了方程第二个解的存在性和非存在性 参 1 0 .     

四阶奇异边值问题的多重正解

利用算子方程的一些抽象结果来讨论四阶奇异边值问题.在非线性项f满足一定条件时,得到λ*∈(0, ∞),使得当λ∈(0,λ*)时,问题至少有两个正解;当λ=λ*时,至少有一个正解;λ>λ*时,没有正解.     

非线性Dirichlet边值问题的两正解存在性

基于Leray-Schauder度理论和上下解方法讨论非线性边值问题y″+f(y)=0,y(0)=0,y(1)=b＞0的正解存在性,其中f是局部Lipschitz连续函数f(0)≥0,并且可以是变号函数.主要结论是如果f在＋∞满足一个超线性增长条件,并且存在满足条件β(1)＞0的非负上解β,则存在正数B使得此边值问题当b＜B时,至少存在两个正解;当b=B时,至少存在一个正解;当b＞B时,不存在正解.     

一类四阶两点边值问题多个正解的存在性

研究了一类含参数λ的四阶常微分方程两点边值的多解问题。利用锥上的不动点指数理论,获得了该问题当0≤λ<π4时存在多个正解的几个充分条件,当λ≥π4时该问题无正解。从而所得结果推广了现有文献的结论。     

关于分数阶q-差分方程正解的存在性

本文研究了一类分数阶q-差分方程边值问题正解的存在性,在前人研究成果的基础上,基于薛定谔方程探究了一类高阶分数阶带有扰动项的问题.首先,运用迭代方法研究了 A=0时特殊解的存在性.然后,利用格林函数的性质,以及锥拉伸和锥压缩不动点定理,研究了当λ＞0时参数的变化对边值问题解的影响,并讨论了正解的存在性以及正解的存在区间...     

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.