非线性微分方程解的唯一性

运用Nevanlinna值分布理论,研究亚纯函数的唯一性问题。若f(z)为f 'f=F(z)的有限级亚纯解,其中F(z)为非零整函数且λ(F(z))< 1,当f(z)与有限级亚纯函数g(z)CM分担0、1、∞,则f=g。如果f(z)为f '+A(z)f ⁿ=F(z)的一个有限级亚纯解,其中A(z)为不等于0的多项式,F(z)为非零整函数且λ(F(z))< 1, A(z)≠F(z),若有限级亚纯函数g(z)与f(z)CM分担0、1、∞,则f=g。     

涉及微分多项式和多项式的亚纯函数正规族

k,l∈N,且k≥2,设F为D内亚纯函数族,对f∈F,在D内的零点之级≥k 1,极点之级≥2.h(z)为D内的全纯函数,在D内的零点之级≥2,且h(z)0.设a1(z),a2(z),...,ak-1(z)和b1(z),b2(z),...,bl(z)为D内的全纯函数.置H(f)(z)=f(k)(z) ak-1(z)f(k-1)(z) ... a1(z)f ′(z) b1(z)f(z) ... bl(z)f l(z).若对f∈F,有H(f)(z)≠h(z)(z∈D)成立,则F在D内正规.     

q移位差分方程的亚纯解及任意亚纯函数分担3个值的唯一性

用Nevanlinna理论,研究差分方程a_1(z)f(qz+p)+a_0(z)f(z)=F(z)一个有穷级超越亚纯解f(z)及任一亚纯函数g(z)分担0,1,∞IM时的唯一性问题(其中p,q为常数,满足n∈N~+,q~n≠±1,q≠0,a_1(z),a_0(z),F(z)为非零亚纯函数且级均小于1),得到了f(z)=g(z).     

亚纯函数的正规族和微分多项式的例外函数

主要证明了定理:设F是单位圆盘△上的亚纯函数族,F中的任一函数f的极点是重级的,零点重级至少为m 1,m是正整数,h(z)≠0,a0,a1,…,am-1都是D上的全纯函数.如果对任一f∈F,L(f)(z)=f(m)(z) am-1(z)f(m-1)(z) … a1(z)f′(z) a0(z)f(z)≠h(z),z∈D,则F在D上正规.     

一类二阶线性微分方程解的增长级

考虑一般形式的二阶线性微分方程:A2(z)f″+A1(z)f′+A0(z)f=0解的增长级,其中A2(z),A1(z)和A0(z)均为多项式,其次数分别为,m2,m1和m0.从而得到解的增长级的估计.     

关于亚纯函数正规定则

本文得到了下述关于亚纯函数的几个正规定则. 定理1:设{f(z)}为域D内亚纯函数族,其中每个f(z)的极点之级≥3.ρ(z)为D内全纯函数不恒等于零,若在D内,f(z)≠0,f(z)≠ρ(z).则在D内{f(z)}为正规. 定理2:设{f(z)}为域D内的亚纯函数族,其中每个f(z)的极点的级≥3.ρ(z)为D内仅有简单零点的全纯函数.若在D内f≠0,f~(k)(z)≠ρ(z),k≥0,则{f(z)}在D内为正规.     

亚纯函数的正规族

设F是区域D内的亚纯函数族,a,b为互相判别的非零复数,c是任意复数,k≥2,对于任意的f(z)∈F,f(z)-c的零点重级至少为k,若f(k)(z)=a(=>)f(z)=a,f(k)(z)=b(=>)f(z)=b和f(z)=c(=>)f(k)(z)=c,则F在区域D内正规.     

一类差分多项式的Picard型定理

本文利用值分布论作为工具得到以下结论:令f(z)为一个有限级超越整函数,c_1,c_2为两非零复常数并使得f(z+c_1)≠f(z+c_2),q(z)为非零多项式,则f(z)Δf_(c_1)(z)-q(z)和f(z)Δf_(c_2)(z)-q(z)两者中至少有一个具有无限多个零点.     

关于下级为有穷正数的整函数的亏整函数总数

杨乐、张广厚证明了:对於有穷正级整函数f(z),若P为f(z)的亏值总数,q是f(z)的Borel方向总数,则P≤q/2。定义1 设f(z)为亚纯函数,a(z)为∞或亚纯函数,满足     

亚纯函数的充满圆和公共Borel方向

设argz=θ0为λ级亚纯函数f(z)的λ级Borel方向(O<λ< ∞)．若argz=θo不是f′(z)的λ级Borel方向．则存在f(z)的一列λ级充满圆{DK}，K=1，…，使得，m(DK),f=0)=r(Dk，f=1)     

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.