广义测不准关系对电子自旋极化输运性质的影响

基于广义测不准关系下的量子理论,研究了电子在FM/FI/FM构成的磁性隧道结中的输运过程中隧穿电导随两铁磁层磁矩与势垒分子场夹角的变化趋势。结果表明广义测不准关系下得到的隧穿电导的值与通常量子理论有很大不同,隧穿磁阻的最小值大于通常量子理论的结果,同时在分子场夹角θ1=0,θ2=π和θ1=π,θ2=0处,隧穿磁阻的值小于通常量子理论的值。     

耦合量子线-量子点体系中的Fano效应

利用非平衡格林函数方法,研究了耦合量子线-量子点体系的相干电子输运性质.研究发现:对于旁耦合一个2能级量子点的量子线的线性电导呈现有趣的电导降中带电导峰的现象;而对于耦合2量子点体系,线性电导表现为有趣的多共振现象.由于Fano干涉,上述电导峰电子的线型不是洛仑兹型的.     

温度对量子点接触电导量子化的影响

利用简单的２Ｄ－准１Ｄ－２Ｄ（二维－准一维－二维）理论模型，研究了零温和有限温度下，介观尺寸量子点接触中的电导随费米能的变化关系，计算表明，在较低温度下（如８Ｋ），温度效应使一定纵横比的量子点接触电导一台振荡消失，但电导仍２ｅ＾２／ｈ为单位的量子化。     

温度对量子环磁矩振荡规律的影响

应用统计理论计算了量子环中电子的热力势 和磁矩,研究了温度对量子环磁矩随磁场振荡规律的影响。结果表明：当温度一定时,强磁场作用下的量子环磁矩主要随磁感应强度B的倒数1/B作振荡,而弱磁场时则随B作振荡。对Au量子环,强磁场作用下磁矩随1/B的振荡周期为 ,而弱磁场作用下磁矩随B的振荡周期为 。而磁场一定时,量子环的磁矩随温度成非线性变化。其中磁场较小时,磁矩随温度升高而增大且为负;而磁场较大时,则随温度升高而减小且为正,而一般情况下,磁矩会随温度升高而变号。磁矩随磁场的振荡随温度升高而减弱。     

温度对量子环磁矩振荡规律的影响

应用统计理论计算了量子环中电子的热力势Ω和磁矩,研究了温度对量子环磁矩随磁场振荡规律的影响.结果表明：当温度一定时,强磁场作用下的量子环磁矩主要随磁感应强度B的倒数1/B作振荡,而弱磁场时则随B作振荡.对Au量子环,强磁场作用下磁矩随1/B的振荡周期为6.823×10－3T－1,而弱磁场作用下磁矩随B的振荡周期为1.377×10－2T.而磁场一定时,量子环的磁矩随温度成非线性变化.其中磁场较小时,磁矩随温度升高而增大且为负;而磁场较大时,则随温度升高而减小且为正,而一般情况下,磁矩会随温度升高而变号.磁     

量子盒的弹道电导

应用量子力学波函数阻抗匹配方法,作者研究了准一维无相互作用电子气通过量子盒的弹道传播。在通过量子盒时,电子除受到盒边界的弹性散射外是自由的。作者计算了量子盒电导作为盒长度和宽度的函数。计算结果表明,当长度较短时,电导显示带有规则脉冲振荡的确定的量子化台阶;随着长度的增加,电导曲线逐渐趋于无规振荡的图样。     

势垒对量子线电子输运性质的影响

理论研究了势垒对量子线中电子弹道输运性质的影响．我们采用了转移矩阵方法和截断近似技术．计算结果表明,当不存在势垒时,量子线的电导呈现出台阶的性质．电导的每一台阶对应于一横向能级被占据．当量子线的一边存在势垒时,电导的台阶特征仍能保持．但当量子线的两边都存在势垒时,电导的台阶特征被破坏了．     

量子霍耳效应探讨

本文从线性响应理论的久保公式出发，用正则系综求统计平均的方法，导出了整数量子霍耳电导。从而解释了整数量子霍耳效应。     

与非共线铁磁引线耦合的双量子点环中电子的输运

用非平衡格林函数理论研究与两个铁磁引线连接的平行连耦合双量子点系统中电子输运性质。两个铁磁引线的磁矩相互成任意角度,即磁矩是非共线性的。通过调节磁矩间的角度,可以控制不同自旋方向电子的输运性质,从而能充分操作通过整个系统的电流和隧穿磁阻。两个铁磁弓I线磁矩间的相对角度对量子点中不同自旋电子的占据数有显著的影响,是决定电流和隧穿磁阻性质的内在机制。量子点间的耦合强度、量子点与引线的耦合强度等也会对系统的电流有明显的作用,从而提供了丰富的电流操控手段。本文研究的系统可以用作自旋阀,在自旋电子学器件中有实际的应用价值。     

点间耦合强度对耦合量子点系统电导及AB效应的影响

本文利用非平衡格林函数的运动方程方法,研究了与两个电极耦合在一起的三耦合量子点系统的电子输运中的微分电导的AB振荡.给出了在无外磁场作用下,量子点间耦合强度相等(我们称为同位耦合)时的电导曲线,发现体系是存在部分简并的,但如果令量子点3脱耦或者强烈的与系统耦合,则可以解除系统的简并.在有磁场作用下,观察到了微分电导明显的AB振荡效应,AB效应的振荡周期同是否存在偏压有关,并且在不同的磁通量的情况下,体系将会在简并态与非简并态间振荡.     

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.