锯齿型与扶手椅型碳化硅纳米管光电性质第一性原理研究

本文基于密度泛函理论计算分析了手性参数为(17,0)、(20,0)、(26,0) (10,10)、(12,12)、(15,15)的碳化硅纳米管的能带图,态密度及主要光学性质。结果表明：锯齿型与扶手椅型碳化硅纳米管均具有明显的半导体性质;在相近直径下,扶手椅型碳化硅纳米管带隙宽度要大于锯齿型碳化硅纳米管的带隙宽度;碳化硅纳米管的光吸收峰在100nm~200nm之间,可用于制作紫外线探测器件。     

SO_2和NO_2在γ-Al_2O_3(110)表面吸附的第一性原理计算

采用基于平面波基组的Vienna Ab-initio Simulations Package (VASP)程序研究了SO_2和NO_2在γ-Al_2O_3(110)表面和羟基化γ-Al_2O_3(110)表面的吸附,获得了SO_2和NO_2吸附的不同构型和结构参数.对吸附能,电荷转移,差分电荷密度和投影态密度等进行分析和讨论.对比发现,在γ-Al_2O_3(110)表面SO_2的吸附能力强于NO_2.SO_2或NO_2在非羟基化γ-Al_2O_3(110)表面吸附时O原子的2p轨道和Al原子的3s3p轨道作用形成O-Al键,且SO_2吸附时键结强度高于NO_2.NO_2吸附时费米能级以下有部分反键态,削弱了与γ-Al_2O_3(110)表面相互作用.在羟基化γ-Al_2O_3(110)表面SO_2或NO_2的吸附能力会低于非羟基化表面,但是SO_2的吸附能力依旧强于NO_2.计算结果说明SO_2与γ-Al_2O_3(110)表面的相互作用强于NO_2.以上研究,将有助于理解SO_2和NO_2在γ-Al_2O_3的反应性,为进一步研究它们的非均相转化和在灰霾形成中的促进作用奠定基础.     

平面波超声成像中的波束合成方法研究进展

平面波成像通过单次全孔径发射-接收即可获取整幅图像,将成像帧频显著地提升至1000帧/秒以上.然而,平面波成像过程中发射的非聚焦波束将导致回波信号信噪比降低,进而使图像的分辨率和对比度变差.通过多角度相干复合成像技术可以改善平面波成像的图像质量,但是会以牺牲帧频为代价.因此研究人员们开始将新型波束合成技术引入平面波成像...     

Asymptotic behavior of solutions of forced nonlinear neutral delay differential equations with impulses

Sufficient conditions for asymptotic behavior of the solutions of nonlinear forced neutral delay differential equations with impulses are found. The results given in [2,4,6,7] are generalized and improved.     

On the summability of the formal solutions for some PDEs with irregular singularity

In this Note, we consider some classes of nonlinear partial differential equations with regular singularity with respect to t=0 and irregular one with respect to x=0. Our purpose is to establish a result which is similar to the k-summability property, known in the case of singular ordinary differential equations. We can prove that, except at most a countable set, the formal solution is Borel summable or k-summable with respect to x in all other directions. To cite this article: Z. Luo et al., C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

THE LIMIT SET OF A CONTINUOUS SELF-MAP OF THE TREE

Let f denote a continuous map of a tree T to itself. A point x ∈ T is called a 7-limit point of f if it is both an ω-limit point and an α-limit point. In the present paper, we show that (1) Ω-Γ is countable, (2) A -Γ and P - Γ are either empty or countably infinite, where P denotes the closure of the set of periodic points P.     

Error estimates for Hermite interpolation on spheres

In this paper, we prove convergence rates for spherical spline Hermite interpolation on the sphere S^d−1 via an error estimate given in a technical report by Luo and Levesley. The functionals in the Hermite interpolation are either point evaluations of pseudodifferential operators or rotational differential operators, the desirable feature of these operators being that they map polynomials to polynomials. Convergence rates for certain derivatives are given in terms of maximum point separation.     

The asymptotic behaviors of a stage-structured autonomous predator-prey system with time delay

In this paper, we consider an autonomous predator-prey Lotka-Volterra system in which individuals in the population may belong to one of two classes: the immatures and the matures, the age to maturity is represented by a time delay. By using eigenvalue analysis, principal term analyze method, reduction to absurdity, and iterative method, we obtain some simple conditions for global asymptotic stability of the unique positive equilibrium point. Moreover, a condition that the prey population in the system get extinction and the predator population in the system get permanence will be obtained. Meanwhile the theorems extend the corresponding conclusions in which there have no two stage structures.     

On the convergence of the affine-scaling algorithm

The affine-scaling algorithm, first proposed by Dikin, is presently enjoying great popularity as a potentially effective means of solving linear programs. An outstanding question about this algorithm concerns its convergence in the presence of degeneracy. In this paper, we give new convergence results for this algorithm that do not require any non-degeneracy assumption on the problem. In particular, we show that if the stepsize choice of either Dikin or Barnes or Vanderbei, et al. is used, then the algorithm generates iterates that converge at least linearly with a convergence ratio of , wheren is the number of variables and (0,1] is a certain stepsize ratio. For one particular stepsize choice which is an extension of that of Barnes, we show that the cost of the limit point is within O(/(1–)) of the optimal cost and, for sufficiently small (roughly, proportional to how close the cost of the nonoptimal vertices are to the optimal cost), is exactly optimal. We prove the latter result by using an unusual proof technique, that of analyzing the ergodic convergence of the corresponding dual vectors. For the special case of network flow problems with integer data, we show that it suffices to take = 1/(6mC), wherem is the number of constraints andC is the sum of the cost coefficients, to attain exact optimality.This research is partially supported by the U.S. Army Research Office, contract DAAL03-86-K-0171 (Center for Intelligent Control Systems), by the National Science Foundation, grant NSF-ECS-8519058, and by the Science and Engineering Research Board of McMaster University.     

Fuzzy集的基数

关于Fuzzy集的基数，[1]中曾对有限支集的Fuzzy集以及极苛刻条件下的无限Fuzzy集给出过一种定义。但是，正如本文将要指出的那样，该定义是不合理的。本文将从研究Fuzzy映射入手，给出Fuzzy集基数的一般性定义。基于这一定义，不但得到有关基数的大部分结论，而且有其自身的特殊性。