Z［α］［x1,…,xn］中理想的Grobner基在Z上的计算

设α∈C是一个代数整数,Z［α］ 是 Z的单代数扩张环,A=Z［α］［x1,…,xn］是 Z［α］上的n元多项式环,AA^U=Z［t,x1,…,xn］是Z上n+1元多项式环.本文证明, A的一个由q个元素{f1,…,fq}生成的理想I的 Grbner基的计算可转化为AA^U的一个由q+1个元素{Af^G1,…,Af^Gq,p(t)} 生成的理想AI^U的Grbner基的计算, 并给出具体的转换计算方法.此外,作者利用计算机代数系统Macaulay2给出了使用这一方法的计算实例.     

关于中心外的同阶元共轭的有限群的注记

令G是一个非Abel的有限群,并设G的中心外的同阶元是共轭的. 钱国华等证明了GS3, 但证明很复杂且依赖有限单群分类定理. 如其所述, 定理的证明是否可以避免对于有限单群分类定理的依赖是一个值得关注的问题. 本文在不依赖有限单群分类定理的条件下讨论对G的Sylow 2 子群加以某个限制的几种情形的证明, 如当G的Sylow 2 子群是Abel群时的证明.     

Stirling数关于3的一个整除性质

在本文中, 作者主要研究了第二类Stirling数S(n,k)及其差的3-adic赋值. 设m,n为正整数且nm4. 作者证明了ν3(S(3n+1,3m)－S(3n,3m))=n－m+3.     

ρ-混合序列部分和之和乘积的渐近分布

设{Xn,n≥1}为一严平稳ρ 混合的正的随机变量
序列, 满足EX1=μ>0, Var X1=σ2<∞. 记Sn=∑〖DD(〗n〖〗i=1〖DD)〗X
i, Tn=∑〖DD(〗n〖〗i=1〖DD)〗Si, γ=σ/μ. 利用ρ 混合序列的强极限定理
, 在较弱的条件下证明了〖JB((〗∏〖DD(〗n〖〗k=1〖DD)〗〖SX(〗2Tk〖〗k(k+1)
μ〖SX)〗〖JB))〗1/(γσ1〖KF(〗n〖KF)〗)〖FY(〗d〖FY)〗e〖K
F(〗10/3〖KF)〗N(n→∞),
其中: σ21=1+〖SX(〗2〖〗σ2〖SX)〗∑〖DD(〗∞〖〗j=2〖DD)〗Cov(X1,X
j)>0; N为标准正态随机变量.     

全纯函数差分算子的值分布

本文主要研究了全纯函数的差分算子分担一个值的唯一性问题,并且得到了：若f与g为超级ρ2<1的两个非常数的超越全纯函数, n,k,m为满足n≥5k+4m+13的整数, c是满足f(z+c)－f(z)≠0且g(z+c)－g(z)0的非零常数,则若f(z)n(f(z)m－1)(f(z+c)－f(z))(k)与g(z)n(g(z)m－1)(g(z+c)－g(z))(k)IM分担1, 则f=tg, 其中t为满足tn+1=1与tm=1的常数.     

关于H(k)2n(m)数素数指数模的一些同余式

对于任意给定的正整数k,m,H(k)2n(m)数是由生成函数(sectcos(mt))k展开式中t2n(2n)!的系数定义的特殊数列.通过解析方法研究了H(k)2n(m)与短区间特征和Sβ,k(χ)的关系,给出了H(k)2n(m)数素数指数模的同余式与Dirichlet L函数、广义Bernoulli数的一些关系式.     

关于H_(2n)~((k))(m)数素数指数模的一些同余式

对于任意给定的正整数k,m,H2n(k)(m)数是由生成函数(sectcos(mt))~k展开式中t~(2n)/(2n)!的系数定义的特殊数列.通过解析方法研究了H2n(k)(m)与短区间特征和Sβ,k(χ)的关系,给出了H2n(k)(m)数素数指数模的同余式与Dirichlet L函数、广义Bernoulli数的一些关系式.     

一类特殊的算术级数存在性

已有结论表明:素数集中存在任意长的算术级数.且对任意正整数k,任何具有正密度的素数子集都含一k项算术级数.考虑4h 1型素数(h为正整数),显然可得结论:一定存在k项算术级数, 其中每项都能表成 m2 n2的形式(m,n为整数). 当k=4时,有无穷多组这种类型的4 项算术级数(n-1)2 (n-8)2,(n-7)2 (n 4)2,(n 7)2 (n-4)2,(n 1)2 (n 8)2.注意到82 12=72 42,为了回答:是否存在互异正整数a,b,c,d满足a2 b2=c2 d2,使得对任何正整数n,8个数(n a)2 (n b)2,(n a)2 (n-b)2,(n-a)2 (n b)2,(n-a)2 (n-b)2, (n c)2 (n d)2, (n c)2 (n-d)2, (n-c)2 (n d)2,(n-c)2 (n-d)2中总存在5项算术级数这一问题,本文采用组合方法,证明了不存在这样的正整数a,b,c,d.同时提出了3个猜想.     

一类以Lucas数为系数的线性不定方程

设a ,b为整数 ,b≠ 0。广义的Lucas序列 {Vn}定义为v0 =2 ,υ1=α ,υn z=αvn 1bvn(n≥ 0 )。设a ,b ,c ,n ,k ,m ,r为整数 ,求解关于t1,… ,tm -r 的不定方程　　 ∑m -ri=1tieiυk(m 1-i) =c(k >0 ,m - 1>r≥ 0 ,c∈Z ,ei =± 1,i=1,… .m -r) .给出了在求解及构造F-L恒等式方面的应用例子。     

一类Gk(a,b;c,d)图的着色

令Gk(a,b;c,d)表示θ(a,b,c k)∪ Pd(d≥2),其中Pd的一个端点与θ(a,b,c k)的一个3度点u重合,Pd的另一个端点w在Pc k上,且Pc k上w与θ(a,b,c k)的另一个3度点v间的路长为k.给出了G2(m,m;m,m)(m≥2)的着色.     

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.