▽n(G)={1}的有限群

设Ｇ满足标题的条件。１、若ｎ＝４,则下述结论之一成立;;（１）Ｇ可解;;（２）Ｇ≌Ａ~５;;（３）Ｇ≌ＰＳＬ（２,１３）;;（４）Ｇ≌ＰＳＬ（２,ｐ）,满足ｐ＝４ｐ１＋１＝６ｐ２－１,这里ｐ１≥４３,ｐ２≥２９;;（５）Ｇ≌ＰＳＬ（２,ｐ）,满足ｐ＝６ｐ１＋１＝４ｐ２—１,这里ｐ１≥７,ｐ２≥１１;;２、若ｎ＝５且Ｇ与ＰＳＬ（２,ｐ）无关,则下述结论之一成立：（１）Ｇ可解;;（２）Ｇ≌ＰＳＬ（２,２~３）;;（３）Ｇ≌ＰＳＬ（２,３~３）;;３、设３　π（Ｇ）,８≤ｎ≤２ｐ＋１．若对任ｑ＜ｐ,Ｇ与Ｓｚ（２~ｑ）无关,则Ｇ可解。     

关于Faudree－Schelp定理的改进

一个图Ｃ＝（Ｖ，Ｅ）是［ｌ，ｍ］－泛连通的，如果在Ｇ的任意一对节点ｘ与ｙ之间有长为Ｋ—１的路Ｐｋ（ｘ，ｙ），Ｋ＝ｌ，ｌ＋ｌ，…，ｍ。Ｇ具有性质Ｐ（Ｋ），如果对Ｇ的任何一对距离为２的节点ｘ和ｙ，有ｄ（ｘ）＋ｄ（ｙ）≥Ｋ。作者探讨了一类产（Ｋ）图的路连通性，改进了Ｆａｕｄｒｅｅ－Ｓｃｈｅｌｐ定理，得到两个定理：定理１设Ｇ＝（Ｖ，Ｅ）是ｎ阶Ｐ（ｎ—１）图。如果Ｇ是［ｎ—１，ｎ］－泛连通的，则Ｇ是［８，ｎ］－泛连通图（ｎ≥８）．定理２设Ｇ是３－连通ｎ阶Ｐ（ｎ）图。如果Ｇ的独立数α（Ｇ）＜ｎ／２，则Ｇ是［５，ｎ］－泛连通图，ｎ≥５．     

关于Hermite-Fejēr插值算子的p方收敛

在以第二类Ｃｈｅｂｙｓｈｅｖ多项式Ｕｎ（ｘ）的零点ｘｋ＝ｃｏｓθｋ＝ｃｏｓｋπｎ＋１，（ｋ＝１，２，…，ｎ）为插值节点的条件下，讨论了Ｈｅｒｍｉｔｅ－Ｆｅｊēｒ插值算子在［－１，１］上以（１－ｘ２）１２为权函数的ｐ方收敛问题，得到的收敛阶为Ｏ（１）ｗ１ｎＰ＋Ｂｎｐ｛｝．     

关于方程(n) σ(n)=3n的一个注记

证明了：对１≤ｓ＜ｒ－ ２，如果 ｑ＝ ７· ２（ｒ－２）＋２ｓ－１与ｐ＝ ４９· ２－５·２（ｒ－ｓ－２）－１均为素数，则为方程的解．通过在微机上的探索，对４≤ｒ≤５００，找到了方程的３３组解．     

级数∑ from n=1 to ∞ 1/n~p(0

张学军 《延安大学学报(自然科学版)》1999,(3)

图的升分解问题的两个新结果

Ａｌａｖｉ等人在１９８７年定义了图的一种新分解,即“升分解”（ＡｓｃｅｎｄｉｎｇＳｕｂｇｒａｐｈＤｅｃｏｍｐｏｓｉｔｉｏｎ）,并且猜想：任意有正数条边的图都可升分解．该文证明了下面两个新结果：（１）Ｈｉ是ｉ条边的Ｋｎ的子图,当ｎ＋１≤ｉ≤２ｎ－２ｎ／３［］２－２时,Ｇ＝Ｋｎ－Ｈｉ可升分解为Ｋ１,１,Ｋ１,２,…,Ｋ１,ｎ－５,Ｋ１,ｎ－４,Ｇｎ－３（ｎ≥６）,其中Ｋ１,ｎ－４Ｇｎ－３．（２）Ｈｉ是ｉ条边的Ｋｎ的子图,当ｉ≥２ｎ－２ｎ／３［］２时,Ｇ＝Ｋｎ－Ｈｉ不一定有定理１形式的升分解．     

图的第二个最小特征值的界

设Ｇ是ｎ个顶点的简单图，λｎ－１（Ｇ）为Ｇ的第二个最小特征值。Ｇ的非孤立点形成的图记为Ｇ１，Ｖ（Ｇ１）＝ｓ，（３≤ｓ≤ｎ）。本文主要证明了：ａ．若Ｇ１不是完全偶图，则λｎ－１（Ｇ）≤λｓ－１（Ｋ２，ｓ－２＾－ｅ），等式成立＝Ｇ１≌Ｋ２，ｓ－２＾－＾ｅ。其中图Ｋ２，ｓ－２＾－＾ｅ为完全偶图Ｋ２，ｓ－２去掉一边ｅ而得到的图ｂ．若Ｇ１既不是完全偶图，又不是Ｋ２，ｓ－２＾－ｅ，则λｎ－１（Ｇ）＜－√２／２     

一个单叶解析函数族的推广

设函数在单位圆盘｜ｚ｜＜１内解析，且１，其中｛αｎ｝为一正实数序列．记具有这种性质的函数ｆ（ｚ）的全体为Ｓ（αｎ）．本文证明，如果ｆ（ｚ）∈Ｓ（αｎ），且αｎ≥［（ｎ－１）（αｐ－１）＋ｐ－１］／（ｐ－１），则ｆ（ｚ）为α阶星象函数，其中α＝（αｐ－ｐ）／（αｐ－１）．特殊情形，当αｎ＝ｎ，ｐ＝２时，Ｓ（ｎ）为众所周知的ＡＷ．Ｃｏｏｄｍａｎ（１９５７）关于原点的星象函数族，此外，本文还研究了Ｓ（αｎ）的单叶性条件，变形定理，旋转定理以及关于任意点为星象的条件，其中定理７和推论１推广了Ｈ．Ｓｉｌｖｅｒｍａｎ（１９５７）的一些结果．     

碱土金属邻苯二甲酸氢盐的振动光谱

测定了碱土金属邻苯二甲酸氢盐的晶体结构，Ｃａ（Ｃ８Ｈ５Ｏ４）２．２Ｈ２Ｏ为正交晶系，属Ｃ２ｖ＾７－Ｐｍｎ２１（Ｎｏ．３１）空间群，晶胞参数为α＝２．７４８２，ｂ＝０．９４２５，ｃ＝０．６９２６ｎｍ，Ｚ＝４；Ｓｒ（Ｃ８Ｈ５Ｏ４）２．２Ｈ２Ｏ是正交晶系，属Ｃ２ｖ＾１＾２－Ｃｍｃ２１（Ｎｏ．３６）空间群，晶胞参数为α＝２．８４６５，ｂ＝０．８７９，ｃ＝０．６９８０ｎｍ，Ｚ＝４，Ｂａ（Ｃ８Ｈ５Ｏ４）２．Ｈ     

关于带作用群的有限群的幂零性

设Ｇ是一个有限群，Ｇ的自同构群Ａ作用于Ｇ，且（｜Ａ｜，｜Ｇ｜）＝１．在未假设Ｃ＿ｃ（Ａ）＝１的情形下，证明了关于群Ｇ幂零性的几个充分条件，其中主要定理为：定理２．４设Ａ≤Ａｕｔ（Ｇ）（｜Ａ｜，｜Ｇ｜）＝１，若Ｇ有Ａ－不变的幂零π－Ｈａｌｌ子群Ｈ，且Ｈ的Ｓｙｌｏｗ２－子群Ｈ＿２为Ａｂｅｌ群，对则Ｇ幂零。     

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.