有限Mbius变换群下的Haseman边值问题

对于复平面上具Lyapunov边界闭曲线保持有限Mbius群下不变且在边界曲线上带有位移函数的Haseman边值问题,给出了问题的可解性理论和解的简单表示形式.     

低渗透压裂井非对称区域三线性渗流模型

建立了低渗透压裂井非对称区域三线性渗流模型,与传统的理想对称区域模型相比,新模型考虑了更为复杂 的模型条件--考虑启动压力梯度和各种非对称边界组合的影响。利用拉普拉斯变换对模型进行了求解,得到了井 底压力在拉普拉斯空间的表达式,再利用数值反演,获得了试井分析样版曲线。新模型试井样版曲线与传统模型明显 不同：考虑启动压力梯度的压力及压力导数曲线后期呈上升趋势,启动压力梯度越大,曲线上升时间越早、上升位置 越高;非对称区域边界条数以及边界与压裂裂缝的相对位置（垂直或平行）对试井曲线有显著的影响,边界条数越多, 上翘幅度越大;相同情况下（边界类型和无因次边界距离相同）不同位置（垂直或平行）的边界反映在曲线上存在明显 差异。     

有限M(o)bius变换群下的Haseman边值问题

对于复平面上具Lyapunov边界闭曲线保持有限M(o)bius群下不变且在边界曲线上带有位移函数的Haseman边值问题,给出了问题的可解性理论和解的简单表示形式.     

基于多阶段向量场的活动轮廓模型

传统的基于向量场的活动轮廓模型不能准确地提取复杂形状边界,尤其当初始轮廓曲线在目标边界外部、提取复杂的凹形边界时,常遇到"平衡点"问题.为此,文中提出了基于多阶段向量场的活动轮廓模型.首先在离散化的轮廓曲线上取一些样本点,并按其法线方向将它们映射到目标特征点;然后由传统向量场和映射产生的向量场得到一个加权平均的向量场,将轮廓曲线在该向量场中演化,若轮廓曲线未完全收敛到边界,则在未收敛的轮廓曲线上取新样本点,按前面方法计算出新的向量场.经过在多阶段向量场中的演化,轮廓曲线最终收敛到目标边界.实验结果表明,相比于传统方法,文中方法更有效.     

融合C-V和GVF的测地线活动轮廓模型

对于有凹陷边界或弱边界的待分割目标,采用传统的测地线活动轮廓(GAC)模型无法进行准确的图像分割.为了解决这一问题,提出了一种融合C-V模型、GVF模型和GAC模型的图像分割算法.在该算法中,GAC模型的单位内法向量与GVF模型的梯度矢量流共同作用,促使轮廓曲线向目标的边界方向运动;而GAC模型单位内法向量与C-V模型的区域信息的力场共同作用,不仅促使轮廓曲线向目标的边界方向运动,而且使轮廓曲线稳定在目标的边界上.仿真实验证明了上述方法的有效性,同时还证明了该方法对轮廓曲线的初始位置具有较好的适应性.     

分形曲线和曲面上的第二型积分

将经典意义下在可求长曲线上的第二型曲线积分和分片光滑曲面上的第二型曲面积分推广到较一般的曲线和曲面上，给出了存在定理且减弱了格林公式，奥高公式和斯托克斯公式中关于边界的条件。     

NURBS构造N边域曲面方法

应用 NURBS,讨论了根据给定的(N-1)条边界曲线及其跨界导矢构造 N 边域曲面的方法,由参数域Ω中任一点 V 到边 E的距离 d 构造曲面的混合函数,再由 B 样条曲线的边界曲线和其跨界导矢可得插值于其上的映射 P,这样由混合函数和给定条件的映射可生成一张整体几乎处处 G~1连续并且几乎处处 C~1值于给定的(n-1)条边界曲线及其跨界导矢的 N 边域 NURBS 曲面。     

基于固定边界的直纹面构造近似可展曲面

对边界固定直纹面提出用重新参数化边界曲线的方法来提高直纹面的可展程度。首先对一类边界曲线为二次的直纹面，证明了用一次有理函数重新参数化边界曲线可以使直纹面真正可展，然后对其他的边界曲线分别为二次和三次的直纹面，给出了衡量其可展程度的目标函数，并用牛顿迭代法求出使目标函数极小的一次有理函数，用求得的一次有理函数来重新参数化边界曲线使直纹面实现近似可展。最后通过改进方法，对一些特殊情况引入了分段的一次有理函数来重新参数化边界曲线，使得直纹面的可展程度有了进一步提高。     

Riemann曲面类O_(AD_0)和O_(MD_0)

一、引言 一个Riemann曲面上的子区域Ω的边界如果由可数条分散的解析曲线(即1维实解析子流形)组成,则称Ω为一个好子域,这里“分散”的意思就是R上任何一点都有一个邻域至多跟其中一条曲线相交。一个非相对致密的有緻密边界的好子域叫做一个     

基于相伴方法的平面域曲线边界中轴线计算

从生成中轴线的几何学原理出发,应用微分几何学中的活动标架和相伴曲线方法,将两条边界曲线与其中轴线建立起法向等距映射关系,形成两对相伴曲线,进而建立起平面域曲线边界中轴变换的几何学模型.研究了边界曲线与其中轴线的位置对应关系、尺度变换关系及微分不变量之间的内在联系,在此基础上,利用已知的边界曲线和初始值,提出一种计算中轴线的跟踪算法.算法直接使用准确的自由曲线描述边界,克服了多边形逼近算法的拓扑结果奇异性;同时不需要迭代,计算效率高,可以实现中轴线的精确快速计算.     

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.