时间分数阶扩散方程的高阶Diethelm方法

针对时间分数阶扩散方程,提出了一种新的隐式差分方法,其中空间导数采用中心差分方法离散.对于时间分数阶导数,将Caputo分数阶导数转化为Riemman-Liouville分数阶导数后,写成Hadamard有限部分积分,再用分段二次多项式对该有限积分部分逼近,由此推导出Caputo分数阶导数的3-α阶离散方法,从而得到无条件稳定的和收敛的分数阶扩散方程的隐式差分格式.数值实验验证该隐式差分格式的有效性.     

一类分数阶对流扩散方程差分格式的理论分析

考虑一般的对流扩散方程,将一阶的时间导数用Caputo分数阶导数替换,二阶的空间导数用Riemann-Liouville分数阶导数替换,得到了一个Riemann-Liouville-Caputo分数阶对流扩散方程.给出了这个方程的一种计算有效的隐式差分格式,并证明了该差分格式是无条件稳定、无条件收敛的,其收敛阶为O(l+h).最后给出了数值例子.     

空间分数阶Edwards-Wilkinson方程的显式差分近似

考虑一种空间分数阶Edwards-Wilkinson方程,这个方程是将一般的空间二阶导数用α(1<α≤2)阶导数代替.利用G算法对空间二阶导数进行离散,构建了空间分数阶Edwards-Wilkinson方程的显式有限差分格式,并证明了此差分格式是无条件稳定和收敛的,且具有o(τ)+o(h)收敛阶.     

变系数分数阶反应-扩散方程的数值解法

考虑了变系数分数阶反应一扩散方程,将一阶的时间偏导数和二阶的空间偏导数分别用Caputo分数阶导数和Riemann-Liouville分数阶导数替换,利用L1算法和G算法对方程的变系数分数阶导数进行适当的离散,给出了该方程的一种计算有效的隐式差分格式,并证明了这个差分格式是无条件稳定和无条件收敛的,且具有o（τ＋h）收敛阶．最后用数值例子说明差分格式是有效的．     

Coimbra变时间分数阶扩散-波动方程的新隐式差分法

将一阶的时间偏导数用Coimbra变时间分数阶导数算子进行替换,提出了一种新隐式差分解法.首先,对Coimbra型变时间分数阶导数算子和二阶空间导数进行离散化处理,将Coimbra变时间分数阶扩散-波动方程转化为代数方程组求解;然后,借助于数学归纳法给出了新隐式差分方法的收敛性分析,并证明了新隐式差分方法是无条件收敛的;最后,通过数值例子检验该方法,计算结果表明新隐式差分方法的理论分析是正确的,所构造的离散格式是可行的和有效的.     

时间分数阶扩散方程的隐式差分近似

考虑时间分数阶扩散方程,它是从标准的扩散方程中用分数阶导数α(0α1)代替一阶时间导数而得到,提出了一个计算有效的隐式差分近似,并证明了这个隐式差分近似是无条件稳定和无条件收敛的。最后给出了数值例子。     

Riesz空间分数阶对流护散议程的一种计算有效求解方法

Riesz空间分数阶对流扩散方程是从混沌动力系统导出的.继续Ilic,Liu等的工作,我们提出在有界区域内求解Riesz空间分数阶对流-扩散方程的一种新的计算有效方法.即基于这两个Riesz空间分数阶导数的矩阵表示.这个方法的创新在于这个算子的标准离散得到包含具有相同分数次幂的矩阵的一个常微分方程组,并利用计算有效的分数阶行方法求解.同时借助于分数阶导数的谱表示和拉普拉斯变换,导出这个Riesz空间分数阶对流扩散方程的解析解.最后给出了数值例子来证实数值方法的有效性.     

变系数空间分数阶对流-扩散方程的有限差分解法

考虑了一个变系数空间分数阶对流-扩散方程.这个方程是将一般的对流-扩散方程中的空间二阶导数用β(1<β≤2)阶导数代替.提出了一个隐式差分格式,验证了这个差分格式是无条件稳定的,并证明了它的收敛性,其收敛阶为o(τ+h),最后给出了数值例子.     

非线性变阶空间-时间分数阶对流-扩散方程的全隐式有限差分格式

针对非线性变阶空间-时间分数阶对流-扩散方程的初边值问题,提出一种全隐式有限差分格式.首先,分别对Riemann-Liouville型变时间分数阶导数算子和Riemann-Liouville型变空间分数阶导数算子和广义Riesz分数阶导数算子进行离散化处理;然后,通过离散的能量方法证明全隐式有限差分格式的稳定性和收敛性,并验证其收敛阶为O(τ+h);最后,通过数值算例检验该方法.试验结果表明:全隐式有限差分格式求解非线性变阶空间-时间分数阶对流-扩散方程初边值问题是可行和有效的.     

变分数阶扩散方程的新隐式差分法

针对变分数阶扩散方程,提出新隐式差分法.首先,对二阶空间导数和Riemann-Liouville型变时间分数阶导数算子进行离散化处理,将变分数阶扩散方程转化为代数方程组求解;然后,借助Fourier级数技术给出了新隐式差分法的收敛性分析;最后,通过数值算例检验该方法,计算结果表明了新隐式差分法的可行性和有效性.     

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.