一些双线性型方程的Baecklund变换及其相关问题

本文中我们考虑了五阶KdV方程．变形KdV方程和Ito方程以及相关的一些问题。我们给出了五阶KdV方程和二次变形的五阶KdV方程的Baecklund变换(简称BT)及非线性叠加公式。利用Hirota的直接方法，我们求得了变形的五阶KdV方程的N-孤立子解。对于Ito方程，我们给出了其多参数的BT并导出了该方程的无穷多个守恒律。我们还考虑了五阶KdV方程及变形方程和Ito方程的BT与Scale变换之间的关系。此外，我们得到了五阶KdV方程的一个周期波解。     

6阶KdV方程的精确解

借助于6阶KdV方程的分解式,运用最近提出的(G’/G)-展开法获得了6阶KdV方程的行波解,分别以含两个任意参数的双曲函数、三角函数及有理函数表示,并运用变换方程方法得到了该6阶KdV方程的多孤子解。结合解的图形对所获得的2-孤子解做了细致的分析,讨论了两个孤波的相互作用。     

广义KdV方程和Ito型耦合KdV方程的数值研究

采用隐式紧差分Padé方法解完全非线性KdV方程和Ito型耦合KdV方程.特别地,应用这种方法研究了compacton和Ito型耦合KdV方程的解特性.数值结果证明了这种方法的效果.     

一个(2+1)维KdV方程的自-BT和多重孤立波解

通过引进新的位势函数，导出了一个(2 1)维KdV方程，并利用齐次平稀原则导出了该方程的自-Baecklund变换(BT)，借助BT获得了(2 1)维KdV方程的多重孤立波解。     

一类空时分数阶混合(1+1)维KdV方程的精确解

本文考虑一类具有修正Riemann-Liouville分数阶导数的空时分数阶混合(1+1)维KdV方程.利用分数阶复变换,本文将非线性分数阶偏微分方程转化为非线性常微分方程,然后应用首次积分法和Maple软件得到了该方程的精确解.     

一个变形KdV方程和混合KdV方程的Bcklund变换

本文获得了一个关于变形Korteweg-de Vries(简称Kdy)方程和混合KdV方程的B?cklund变换,这一变换包含了变形KdV方程的一个解映射到另一个解的自B?cklund变换.与现有的Clairin法、Chen法和Hirota法不同,本文是通过已知变换来导出方程的自B?cklund变换.     

构造变系数非线性发展方程精确解的一种方法

给出一种辅助方程的解,并通过一种函数变换,借助符号计算系统Mathematica构造了两类变系数KdV方程、广义变系数KdV方程和带有强迫项的KdV方程的新的类孤子解和三角函数波解.     

一般变系数KdV方程的自-BT和变速孤立波解

设方程的系数满足线性相关条件 ,用齐次平衡原则导出了一般变系数KdV方程的自—Backlund变换(BT)。利用BT获得了变系数KdV方程的变速孤立波解 ,方程的系数不改变孤立波的波形 ,但是直接改变孤立波的传播速度 ,对于孤立波的振幅影响是增大或减小常数倍 ,该常数正是方程的变系数之间的一比例常数。     

试探函数法与广义变系数五阶KdV方程的类孤子解

为了得到广义变系数五阶KdV方程的新解,本文利用试探函数法和符号计算系统Mathematica,研究了它的求解问题,并得到了广义变系数五阶KdV方程的由双曲函数与三角函数组成的类孤子新精确解.     

变系数KdV方程新型的Darboux变换

基于Painlevé展开,给出了变系数KdV方程的新型Darboux变换,反复应用该变换可以得到变系数KdV方程的许多精确类孤子解.     

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.