Z-Z小片恢复技术超收敛性的研究

本文介绍了近年来发展起来的新的有限元的后处理技术-Z-Z小片恢复技术，并探讨了运用Z—Z小片恢复技术对两点边值问题的有限元解的一阶导数进行后处理所产生的超收敛性和后验误差估计．着重在高斯点利用最小二乘拟合技术对于k=1时的一次元和k=2时的二次元的后处理公式进行了推导，得出了后处理公式．并举例验证后处理公式对于两点边值问题-p（u＇（x））＇＋qu（x）=f（x），u（a）=u＇（b）=0，x∈[a，b]的正确性。     

有限元后处理技术的研究

有限元法是一个用来解决场问题的近似方法,对有限元的解进行后处理可产生更高阶的逼近,并可得到后验误差估计。对于k=1时的一次元的后处理公式进行推导,从而得出了后处理公式,并在两点边值问题:{-(pu′)′ qu=f u(a)=u′(b)=0 x∈[a,b]中进行了应用,从而验证了后处理公式的正确性。     

有限元后处理技术的研究

有限元法是一个用来解决场问题的近似方法，对有限元的解进行后处理可产生更高阶的逼近，并可得到后验误差估计。对于k=1时的一次元的后处理公式进行推导，从而得出了后处理公式，并在两点边值问题：{-（pu′）′＋qu=f u（a）=u′（b）=0 x∈[a,b]中进行了应用，从而验证了后处理公式的正确性。     

两点边值问题的双向迭加法

考虑二阶线性常微分方程的两点边值问题: Lu=f(x),a≤x≤b (1) (I){ a_1u′(a)+a_2u(a)=α,b_1u′(b)+b_2u(b)=β (2) (a_1~2+a_2~2≠0,b_1~2+b_2~2≠0)不失一般性,算子L可看作 Lu=u″(x)-q(x)u(x) (3) 众所周知,方程(1)的通解具有如下迭加结构: u(x)=c_1u_1(x)+c_2u_2(x)+u_f(x) (4)其中u_1,u_2为对应(1)的齐次方程     

二阶脉冲微分方程三点边值问题

研究了一类具有边值条件u(0)=0,u(1)-αu(η)=b形如u″+a(t)f(u)=0,-Δu′(tk)=Ik(u(tk))(k=1,2,…,m)的二阶脉冲微分方程三点边值问题解的存在性。在合适的假设条件下,利用Schauder不动点定理讨论了该脉冲微分方程解的存在性,并在此基础上通过相关引理给出了方程至少存在一个正解和无解的充分条件,即存在ε*0,使得当0bε*时,所考虑的脉冲微分方程边值问题至少存在一个正解;另外,当bε*时,边值问题无解。     

一类半线性三阶两点边值问题的解和正解

利用Schauder不动点定理,对半线性三阶两点边值问题-u″′(t)=f(t,u(t),u′(t),u″(t)),t∈[0,1],u(0)=a,u(1)=b,u″(0)=c建立了一些解和正解的存在性定理.     

关于超线性Sturm-Liouville问题正解的唯一性

讨论超线性微分方程 u″ +f(x ,u) =0和u″ +f(x ,u ,u′) =0带边界条件u(a) =u′(b) =0或u′(a) =u(b) =0 时正解的唯一性问题 .给出了相应的正解唯一的充分条件     

Banach空间中一类四阶两点边值问题的正解的存在性(英文)

利用Darbo不动点定理,研究了Banach空间中一类四阶两点边值问题x(4)(t)=f(t,u(t),u″(t)),t∈I,x(0)=x′(1)=x″(0)=x(1)=θ,正解的存在性.并给出了例子用来阐明该文的结果.     

三阶三点边值问题的两个正解的存在性

考虑三阶三点边值问题 u?(t) a(t)f(t,u(t))=0t∈(0,1) u(0)=au( η ),u′(1)=βu′( η ),u″(0)= {0 当非线性项f满足一定的增长条件时,利用Avery-Henderson不动点定理得到了上述边值问题至少有2个正解的 存在性结果.     

一类非线性m点边值问题正解的存在性与多解性

考察了非线性方程m点边值问题u″(t) a(t)u′(t) b(t)u(t) f(t,u)=0,0≤t≤1,u(0)=0,u(1)=∑m-2i=1αiu(ξi),的正解的存在性与多解性.设a∈C[0,1],b∈C([0,1],(-∞,0));设1(t)为线性方程边值问题u″(t) a(t)u′(t) b(t)u(t)=0,0≤t≤1,u(0)=0,u(1)=1,的唯一正解.其中ξi∈(0,1),αi∈(0, ∞)为满足∑m-2i=1αi1(ξi)<1的常数,i∈{1,2,…,m-2}.通过考察f在有界集上的性质,运用Krasnosel'skii锥拉伸与锥压缩型不动点定理及格林函数的性质,获得了其正解的存在性与多解性,推广和改进了已有的相关结果.     

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.