具有Heine性质空间的刻划

本文证明了下述两个定理：(1)拓扑空间X是具有Heine性质的空间当且仅当X是序列空间；(2)序列空间性质是有限到一闭映射逆保持性质。     

三角代数上部分ξ-Lie可导映射的刻画

运用代数分解方法研究了三角代数U=Tri(A,M,B)上的部分ξ-Lie可导映射.证明了如果对任意A∈A存在整数k使得kIA-A可逆,则U上的线性映射为导子当且仅当它是部分ξ-Lie可导映射.作为应用,证明了非平凡套代数上的线性映射是内导子当且仅当其为部分ξ-Lie可导映射.     

Banach代数之间保单位线性映射的若干性质

引入了代数的复同态分离性质,证明如果φ是从有单位Banach代数A到有单位且具有复同态分离性质的Banach代数B中的保单位线性映射,则以下等阶：①φ是保可逆映射;②φ是保乘法映射;③φ是保逆运算映射;④φ是保平方映射;⑤φ是谱压缩映射;⑥φ是Jordna同态。作为应用,证明了从Banach代数到半单交换Banach代数的保单位且保可逆的线性映射是自动连续的代数同态。最后,还证明了当n不小于2时,从矩阵代数Mn（C）到任一具有复同态分离性质的代数的任一代数同态必为零。     

多项式理想计算的神经网络方法

提出一种用于多项理想计算的理想同余神经元,其工作方式既不同于过去感知器输入加阈值的激活方式,也不同于通常意义下激活函数选取,且保持神经元的运算特性,以Grobner基计算为例,给出利用该神经元计算Grobner基神经网络描述性学习算法。     

序线性空间中(y,O_Z;U_+)-广义次似凸集值映射的最优性条件

讨论序线性空间中(y,OZ;U+)-广义次似凸集值映射的性质,且对此类映射证明了Farkas-Minkowski型择一性定理。并利用此定理,讨论了集值映射向量最优化问题的最优性条件。     

具有Grbner基理论的商代数

给出了商代数具有诱导Grobner基理论的充要条件,从而部分地回答了Green提出的公开问题，该问题是:已知一个箭图Γ，对于kΓ中的理想I，I的什么性质是k-代数kΓ/I具有Grobner基理论的充分必要条件.     

弱跟踪性的一些性质

设 X是紧度量空间 ,f是 X上的自同胚或连续自映射 .将伪轨跟踪性的一些性质推广到弱跟踪性上 ,证明了 :( i) f有弱跟踪性当且仅当逆极限空间上的转移同胚 σf 有弱跟踪性 ;( ii) f 经投射作用后保持弱跟踪性等几个性质 .并举例说明了一些性质对于伪轨跟踪性成立 ,但对弱跟踪性不成立 ,如 f在提升作用后不能保持弱跟踪性等     

Grobner Shirshov基在广义布尔函数中的一个应用

设Fq是一个域,X={x1,x2,…,xn),利用合成钻石引理给出了Fq的一个Grobner Shirshov 基和代数Fq/Id(S)作为Fq-空间的一个基底.作为推论证明了广义布尔函数的一个性质.     

关于完备格成分理论中两个问题的探讨

研究了完备格成分理论中两个尚未解决的问题：（i)在非分配的完备格中,有限宽元素的成分也是有限宽的吗？（ii)什么样的映射能保持颗粒表示性质或颗粒性质？通过构造反例证明了在非分配的完备格中,有限宽元素的成分不必是有限宽的;还证明了完备格间的同构映射能保持颗粒表示性质和颗粒性质,通过反例证明了同构映射的条件不能减弱,从而解决了以上两个问题。     

半拓扑线性空间及其性质(Ⅰ)

首先在一般的拓扑空间中引入了准半连续映射的概念,并借助此概念引入了半拓扑线性空间,得到了这一新空间的如下基本性质:(1)给出了半拓扑线性空间中半开集和0点的邻域的特征刻画;证明了半拓扑线性空间中0点的局部S基可通过平移作为任何一点的局部S基;证明了半拓扑线性空间中半开集和任何集的和仍然是半开集.(2)证明了半拓扑线性空间的局部S基的每一个元是吸收集,并且它包含0点的一个平衡S邻域;证明了对具有C性质的半拓扑线性空间中的0的每个S邻域u,存在0点的S邻域v,使得v的半闭包v-u;证明了对具有C性质的半拓扑线性空间的局部S基的每一个元u,存在局部S基的元v,使v+vu成立.(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.