到一类对称空间的调和映射

研究从单连通区域Q包含R^2U{∞}到一类对称空间——G-Grassmann流形Mk(其中包括实Grassmann流形和四元Grassmann流形)的调和映射，引入了G-Grassmann-uniton的概念，并通过dressing作用给出了由已知G-Grassmann-uniton构造新的G-Grassrnann-uniton的方法．证明了任意具有有限uniton数的调和映射φ：Ω→Mk可因子分解为有限个G-Grassmann-uniton的乘积．最后，给出了一种到G-Grassmann流形的迷向调和序列的构造方法．     

代数方法增加Grassmann Uniton及G-Grassmann Uniton数

给出了增加从单连通区域Ω(∈)R2∪{∞}到Grassmann流形和G-Grassmann流形调和映射uniton数的充要条件,并得到可交换G-Grassrnann扩张n-uniton的两种具体构造方法.     

到辛群的多重调和映射的极小辛-uniton数

研究从连通复流形M到辛群Sp（N）多重调和映射，将调和映射的结论推广到多重调和映射上，证明了到辛群的多重调和映射的极小辛-uniton数不大于N，而极小uniton数不大于2N-1．     

到四元Grassmann流形的迷向调和映射

利用孤立子理论研究了到四元Grassmann流形的迷向调和映射，给出了其uniton等价刻画，并给出了四元Grassrnann迷向调和序列的一种构造方法。     

群在集合上的广义作用及广义自同构群

设G1,G2是群,映射φ:G1→G2叫做G1到G2的广义同态映射,如果a,b∈G1,等式(ab)φ=aφbφ和(ab)φ=bφaφ,至少有一个成立.称群G广义作用在集合Ω上,如果群G到变换群SΩ有一个广义同态映射.通过研究有限群在集合上的广义作用及广义自同构群,得到了若干结果,推广了一些相关的经典定理.     

通过增加uniton数实现G-uniton的显式构造

研究从单连通区域Ω包含R^2∪{∞}到酉群U（N）的实形式G（包括正交群和辛群）的调和映射，给出了增加G-uniton数的两种充要条件．证明任何G-n-uniton可以从一个0-uniton通过纯代数运算和求解δ^-问题的积分变换构造而得，并给出了可增加G-uniton数的G-旗因子的两种纯代数构造方法．     

有限群的某些数量关系

在有限单群分类过程中，其阶恰包含3个素因子的群，即所谓K3-群构成了一类需要单独进行处理的单群类．利用Sylow定理和G1auberman正规p-补定理分别对两类阶具有3个素因子的群：p^2qr和p^3qr阶群进行了讨论，在一定条件下证明了它们都是非可换单群，即K3-群，并且分别同构于A5和L(2，7)．     

非次正规子群共轭类数对有限群结构的影响

设G是有限群,π(G)表示G的阶的素因子集合,μ(G)表示G的非次正规子群的共轭类类数。本文证明了满足条件μ(G)≤2|π(G)|的有限群G可解,并完全刻画非次正规子群共轭类类数不大于群的阶的素因子个数的有限群,即满足不等式μ(G)≤|π(G)|的有限群G的结构。     

有限幂零群的若干刻划

从极大子群、中心主因子和正规子群的G 主列的角度来讨论有限幂零群,获得了有限幂零群的若干新刻划.设M是有限群G的任一极大子群,H G.令 G=G/Φ(G),则G是幂零群当且仅当下列条件之一成立:(1)如H≤\M,则H∩M G且H/H∩M≤Z(G/H∩M);(2)如H≤\M,则M≤CG(H/H∩M);(3)如H≤\M,则H≤CG(M/H∩M);(4)如H≤\M,则M补于G的一个中心主因子;(5)F( G)有一个 G 主列,其中每个主因子都是 G中心的且CG(F( G))可解;(6)Soc( G)有一个 G 主列,其中每个主因子都是 G 中心的;(7)K∞(G)≤H,H/Φ(H)有一个 G 主列其中每个主因子都是 G 中心的;(8)HCG(H)≤Z∞(G).     

有限超可解群的一些充要条件Ⅱ

主要证明了如下的结果假设M是有限群G的任意极大子群,则下列命题是等价的(1)G是超可解群;(2)M补于G的某个素数阶主因子;(3)有H(△)G使M∩H为H的正规的极大子群;(4)M/MG为幂指数整除p-1的Abel群且|G∶M|为素数p的幂;(在下面的(5)～(8)中假设G之所有含于F(G)和Φ(G)之间的主因子在G中的中心化子之交是可解群.)(5)Φ(G)=H0＜H1＜…＜Hr=F(G)为G的一个主列片段,其中每个主因子Hi+1/Hi是素数阶的;(6)若F(G)≤(△＼)M,则M补于G的素数阶主因子;(7)若F(G)≤(△＼)M,则M/MG是幂指数整除p-1的Abel群且|G∶M|为素数p的幂;(8)若F(G)≤(△＼)M,则M∩F(G)为F(G)的极大子群.     

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.