Ti－H合金中γ氢化物与α－Ti界面结构的HRTEM研究

通过高分辨电子显微术（ＨＲＴＥＭ）研究了Ｔｉ－２１．７％（原子分数）Ｈ合金中γ氢化物与α－Ｔｉ基体之间的界面结构．取向关系为＜２　０＞α／／＜１１０＞γ，｛０　１　０｝α／／｛１　０｝γ的α／γ界面从［０００１］α，［２　０］α和［２　３］α．三个方向进行观察．结果表明：（０　１　０）α／（１　０）。界面保持共格关系，并且发现γ氢化物的长大是通过α／γ界面上的台阶的形成和侧向扩展而进行的．     

随机游动一个派生链的性质

设｛Ｘｎ，ｎ≥０｝为随机游动，令Ｔ０＝０，Ｔｊ＝ｍｉｎ｛ｎ＞Ｔｊ－１；Ｘｎ－ｘｎ－ｚ＞０｝，ｊ≥１，本文在条件Ｐ（Ｔｊ＜∞）＝１下，讨论了派生链的常返性与正常返性。     

关于E^n中p维与q维超平面间的距离

设Ｅｎ中ｐ维与ｑ维超平面分别为πｐ：α１∧α２∧…∧αｐ∧（ｘ－ｘ０）＝０，πｑ：β１∧β２∧…∧βｑ∧（ｙ－ｙ０）＝０，｛γ１，γ２，…，γｔ｝是向量组｛α１，α２，…，αｐ，β１，β２，…，βｑ｝的一个极大线性无关组，则πｐ与πｑ间的距离平方为：ｄ２（πｐ，πｑ）＝｜δ０｜２－γ１δ０，…，γｔδ０［］γｉγｊ［］－１γ１δ０，…，γｔδ０［］Ｔ其中δ０＝ｘ０－ｙ０．     

非线性积分微分方程组的振动性

本文建立了积分微分方程组（１）不存在［Ｔ，∝］，Ｔ≥０上的解，使得其每一分支在［０，∝］上恒正或恒负的条件；其次，我们建立了方程组（１）存在［Ｔ，∝］，Ｔ＞０上的解使其每一分支在［０，∝］上恒正的条件；最后，上述结果还被推广到非线性积分微分方程组。     

L_a~2(D)上的Toeplitz算子

用一种较为直接的方法证明了当Ｔφ，φ＝Ｚｍα－Ｚ１－αＺｎ为加权位移时，α＝０     

积分C－半群及其谱映射定理

第一节在没有指数有界的假设条件下，讨论了积分Ｃ－半群的一些性质，以及积分Ｃ－半群与Ｃ－半群的关系，推广了［５，定理２］。第二节讨论了积分Ｃ－半群的谱映射定理。主要结果如下：设Ａ为积分Ｃ－半群｛Ｔ（ｔ）｝的生成元，ρｃ（Ａ）≠Φ，则（ｉ）ｔ＞０（ｉｉ）（ａ）反之，若存在ｘ∈Ｘ，ｘ≠０，使得对任何ｔ＞０那么，（Ａ）。（ｂ）若（Ａ），则对任何ｔ＞０，ｔ（Ｔ（ｔ）Ｃ－１）。反之，若对任何ｔ＞０，ｔ（Ｔ（ｔ）Ｃ－１），且存在Ｘ∈Ｘ，Ｘ≠０，使得Ｔ（ｔ）Ｃｘ＝ｔＸ，则，０（Ａ）（ｉｉｉ）｛（ｔ）。     

一类二阶Volterra-hammerstein型积分微分方程非线性边值问题

本文利用上下解方法研究了一类Ｖｏｌｔｅｒｒａ－ｈａｍｍｅｒｓｔｅｉｎ型积分微分方程非线性边值问题（｜ｕ｜ｐ－２ｕ）＝ｆ（ｔ，ｕ，Ｔ１ｕ，Ｔ２ｕ，ｕ）（ｐ＞１）Ｌ（ｕ（０），ｕ（０））＝０Ｒ（ｕ（１），ｕ（１））＝０｛［Ｔｉｕ］（ｔ）＝φｉ（ｔ）＋∫ｔｏＫｉ（ｔ，ｓ）ｕ（ｓ）ｄｓ（ｉ＝１，２）给出了解的存在性定理．     

光固化丙烯酸化异氰酸酯的合成及聚合反应动力学

以２，４－二异氰酸甲苯，丙烯酸β－羟丙酯、正戊醇，正壬醇为原料，合成了２种不饱和丙烯酸化异氰酸酯单体（ＡＡＴ，ＮＡＴ），并用自动记录膨胀计测定了２种单体在２－羟基－２－甲基－１－苯基－丙－１－酮（Ｄａｒｏｃｕｒ１１７３），α，α－二甲氧基苯乙酮（ＤＥＡＰ），α，α－二甲氧基－α－苯基苯乙酮（ＤＭＰＡ）为光引发剂时的聚合速率。结果表明，单体的活性ＮＡＴ＞ＡＡＴ，引发剂的引发活性为ＤＥＡＰ≥ＤＭＰＡ＞Ｄａｒｏｃｕｒ１１７３，单体的聚合速率受溶剂影响。     

椭圆变分不等式的小扰动

研究Ｂａｎａｃｈ空间中椭圆变分不等式的扰动问题，得到了扰动问题存在唯一解的一个充分条件；并用它处理了一类半线性微分积分方程的边值问题．设Ｖ是可分自反Ｂａｎａｃｈ空间，Ｖ′是Ｖ的对偶空间，Ｋ是Ｖ中非空闭凸子集，则有定理１设Ｔ：Ｖ→Ｖ′，Ａ：Ｋ→Ｖ′，且满足（ｉ）Ｔ是有界线性算子，存在常数α＞０，使得（Ｔｖ，ｖ）≥αｖ２，ｖ∈Ｖ；（ｉ）Ａ是伪单调算子，存在常数λ＞０，使得（Ａｕ－Ａｖ，ｕ－ｖ）≤λｕ－ｖ２，ｕ，ｖ∈Ｋ；（ｉｉ）α＞λ．则存在唯一的ｕ∈Ｋ，使得（Ｔｕ，ｖ－ｕ）＋（Ａｕ，ｖ－ｕ）≥（ｆ，ｖ－ｕ），ｕ∈Ｋ     

一类蜕化抛物型方程解的渐近性态

一类蜕化抛物型方程解的渐近性态黄骏（东南大学数学力学系，南京２１００１８）本文讨论下列Ｃａｕｃｈｙ问题的非负解ｕ＝ｕ（ｐ）当ｐ→∞时的渐近性态。其中ｍ＞１，Ｔ＞０，ｆ满足如下条件：且存在λ＞０，使ｆ（ｓ）＋λｓ单调非减。文［１，２］在ｆ（ｕ）≡０的情...     

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.