新环状势的狄拉克与薛定谔方程束缚态解

本文提出了一种新的环状非球谐振子势V(r,θ)=K/2r2+A/r2+β/(r2sin2θ)+(γcos2θ)/(r2sin2θ.在标量势与矢量势相等的条件下,给出了Dirac方程和薛定谔方程的束缚态波函数解u(β′r)=1/Γ(L+3/2)(√2β′·Γ(Nr+L+3/2))/(nr!)·(β′r)(L+1),e(B...     

非球谐环形振子势的Schrdinger方程的解析解

量子力学中除了无限深势阱、一维线性谐振子、库仑势和三维各向同性谐振子势外,绝大部分Schrdinger方程是没有精确解的,这给具体问题的深入研究带来了很大的障碍。本文从求解Schrdinger方程的NU Method方法出发,求解了非球谐环形振子势V(r,θ)=μω2r2/2 h-2α/(2μr2) -h2βcosθ/(2μr2sin2θ)的本征方程的角向方程,获得解析解,将求解的过程大大简化;同时用特殊函数的方法求解了非球谐环形振子势的Schrdinger方程的径向方程,借以拓宽对Schrdinger方程求解方法的研究。     

非球谐环形振子势的Schrdinger方程的解析解

量子力学中除了无限深势阱、一维线性谐振子、库仑势和三维各向同性谐振子势外，绝大部分Schrodinger方程是没有精确解的，这给具体问题的深入研究带来了很大的障碍。本文从求解Schrodinger方程的NU Method方法出发，求解了非球谐环形振子势V（r，θ）=μω^2r^2／2＋h^2α／（2μr^2）＋h^2βcosθ／（2μr^2sinθ）的本征方程的角向方程，获得解析解，将求解的过程大大简化；同时用特殊函数的方法求解了非球谐环形振子势的Schodinger方程的径向方程，借以拓宽对Schrodinger方程求解方法的研究。     

Asymptotic Approximations of Jacobi Polynomials and Their Zeros with Error Bounds

IntroductionUniform asymptotic expansions and error boundsof the (α,β>- 1 ) two- term approximations of theJacobi polynomials P(α,β)n ( cosθ) were obtained[1] .Their result wassin θ2α cosθ2βP(α,β)n ( cosθ) =Γ( n +α + 1 )n!θsinθ1/ 2 Jα( Nθ)Nα +θB0 (θ) Jα+1( Nθ)Nα+1+σ2 ,|σ2 |≤ E2 θ2 +αN -2 ,　 0≤θ≤ π2 ,where E2 is a construct.Baratella and Gatteschiused the first two terms of this expansion[2 ] toconstructa more accurate one- term approximation:x(θ)x′(θ)…     

用阿基米德滚刀加工渐开线齿形的原理误差计算

分析了阿基米德滚刀加工渐开线齿形的原理误差,推导出滚刀切削刃连续位置的包络线方程及齿形误差的计算式:θ=(nβ)/(Hcos αcos λ)r2sin2α+2r2ha+ha2-((ρnβ)/(Hcos αcos λ))2-1+cos-1((H)/(ρnβ)cos αcos λ)-α△fF=ρ{[(1)/(cos α)((nβ)/(Hcos λ)-(1)/(r2))r22sin2α+2r2ha+ha2]-[((ρnβ)/(Hcos αcos λ))2-1-((ρ)/(r2cos α))2-1]+[cos-1((H)/(ρnβ)cos αcos λ)-cos-1((r2cos α)/(ρ))]}所用的方法,也可用于其它齿形的范成法.     

具第二类Chebyshev节点的拟和扩充Hermite-Fejer插值算子的逼近度

设U_n(x)=(sin(n 1)θ)/(sinθ)(x=cosθ)是第二类Chebyshev多项式,b_k=b_k~(n)=cos((kπ)/(n 1))(k=1,2,……n)是U_n(x)的零点,以{-1,b_1……,b_n,1}为基点的2n 1次拟Hermite-Fejer插值多项式是     

调幅波平均功率的讨论

本文通过积分证明了调幅波 u(t)=V_0.(1+m_a cos(aπ)/(T_n)t)cos((2π)/(T_0))t的平均功率P_调=(V_0~2)/(2R_1)(1+(1/2)m~2).指出了文献[3]中的错误之处.最后,用帕斯瓦尔定理对调幅波的平均功率做了进一步的简明解释.     

关于一些Hermite-Fejer算子逼近度的注记

本文研究以Jacobi多项式的J_n(x)=sin(2n+1)/2θ/sinθ/2(x=cosθ,0≤θ≤π)的零点为基点的Hermite-Fejer插值过程H_(2n-1)(f,x).对于Lipα(0<α<1)类中函数,改进了[1]的结果:得到了H_(2n-1)(f,x)逼近有界变差函数的阶估计. 设函数f(x)∈C〔-1,1〕,x=cosθ(0≤θ≤π),J_n(x)是n阶Jacobi多项式,x_k=x_k~(n)=cosθk=cos(2kπ)/(2n+1)(k=1,2,…,n)是J_n(x)的零点,以{x_1,x_2,…,x_n}为基点的Hermite-Fejer插值算子是(见文〔1〕(4))     

缔合勒让德函数的展开及公式P_l~m(cosθ)=(-1)~m((l+m)！/(l-m！))-P_l~(-m)(cosθ)的直接证明

在量子力学中讨论有心力场时,一开始就要遇到球谐函数Y_l,m的归一化问题。解决的办法之一涉及要证明P_l~m(cosθ)=(-1)~m((l+m)!/(l-m!))-P_l~(-m)(cosθ)这一公式。由于P_l~m(cosθ)与P_l~(-m)(cosθ)完全用cosθ表示时,很难进行展开,因而不能将二者直接比较。故一般对上述公式的证明都不采用展开比较的办法。作者在教学中常遇到同学们希     

締合勒让德函数的展开及公式P_l~m(cosθ)=(-1)~m(l+m)!/(l-m)!P_l~(-m)(cosθ)的直接証明

在量子力学中讨论有心力场时,一开始就要遇到球谐函数Y_l,m的归一化问题。解决的办法这一涉及要证明P_l~m(cosθ)=(-1)~ml[(l+m)!/(l-m)!]P_l~(-m)(cosθ)这一公式。由于P_l~m(cosθ)与P_l~(-m)(cosθ)完全用cosθ表示时,很难进行展开,因而不能将二者直接比较。故一般对上述公式的证明都不采用展开比较的办法。作者在教学中常遇到同学们希     

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.