圆形球面虚共焦非稳腔的三维数值研究

 通过对1/2共焦腔和稳定腔的计算,考查了同三维菲涅耳积分方程相应的C 8程序的可靠性。对激光在三维圆形球面虚共焦非稳腔中的传输作了计算和分析。取相同的远场传输距离且放大率由大变小时，强度分布由近场的投影分布逐渐趋于远场的高斯、超高斯分布。     

汽车尾气颗粒物的STXM和NEXAFS研究

为了研究汽车尾气颗粒物的结构和氮的种态,使用扫描透射X射线显微成像(STXM)技术研究了桑塔纳3000和高尔汽车尾气颗粒物.STXM表明单颗粒物的粒径为500nm,颗粒物质量分布不均匀,有中间空洞.比较汽车尾气颗粒物和(NH4)2SO4和NaNO3中N的1sX射线近边吸收精细结构谱(NEXAFS),铵盐在406eV有显著的σ*吸收峰,有肩部结构;汽车尾气颗粒物和NaNO3中N的近边吸收谱在412eV和418.5eV有明显的σ吸收峰;(NH4)2SO4中N的近边吸收谱在413.5eV和421.8eV更宽的σ吸收峰.硝酸盐是汽车尾气颗粒物中的N化学种态的主要存在形式.在395—418eV能量范围内对桑塔纳3000汽车尾气颗粒物进行堆栈扫描,经过主成分分析和聚类分析,发现其表层主要为硝酸盐,内部有少量铵盐.     

苝四甲酸二酐在Au(111)表面的取向生长及电子结构研究

利用X射线光电子能谱(XPS),同步辐射紫外光电子能谱(SRUPS),近边X射线吸收精细结构(NEXAFS)以及原子力显微镜(AFM)等技术研究了苝四甲酸二酐(PTCDA)与Au(111)的界面电子结构、PTCDA分子取向及有机薄膜的表面形貌.SRUPS价带谱显示,伴随PTCDA分子的微量沉积(0·5ML),位于费米能级附近Au的表面电子态迅速消失,但却观察不到明显的界面杂化态,这说明PTCDA分子和Au(111)界面间存在弱电子传输过程,但并没有发生明显的化学反应.角分辨NEXAFS以及SRUPS结果证明PTCDA分子是平铺在衬底表面.根据Au4f7/2和C1s峰积分强度随薄膜厚度的变化以及AFM图像可知,PTCDA分子在Au(111)表面是一种典型的Stranski-Krastanov生长模式,即先层状生长,再岛状生长,并且在层状生长到岛状生长的转变过程中,存在有机分子的去润湿过程.     

Cu吸附(SiO3)n(n=1—8)团簇几何结构和电子性质的密度泛函研究

运用密度泛函理论下的广义梯度近似和交换关联函数对Cu吸附(SiO₂)n(n=1—8)团簇的几何结构、电荷分布、稳定性和电子性质进行了较详细的研究,结果表明: Cu原子易于和带有悬挂键的Si原子作用并形成"铜岛膜"; Cu吸附(SiO₂)_n团簇后Si原子失去电子能力减弱,O原子得到电子能力增强;Cu(SiO₂)n(n 关键词： 密度泛函理论 2)_n (n=1—8)团簇')" href="#">Cu(SiO₂)_n (n=1—8)团簇 近红外吸收     

Improved blue photorefractive properties of near‐stoichiometric LiNbO3:Mn:Fe:Zr crystal

Near‐stoichiometric LiNbO₃ single crystal tri‐doped with ZrO₂, MnO and Fe₂O₃ was grown from Li‐riched melt by Czochralski method. The defect structures and composition of these crystals were analyzed by means of ultraviolet‐visible and infrared transmittance spectra. The appearance of 3466 cm^‐1 peak in infrared spectra showed that the crystal grown from Li‐riched melt was near stoichiometric. The photorefractive properties at the wavelength of 488 nm and 633 nm were investigated with two‐beam coupling experiment, respectively. The experimental results showed that the response speed and sensitivity were enhanced significantly and the high diffraction efficiency was obtained at 488 nm wavelength. This manifested that near‐stoichiometric LiNbO₃:Mn:Fe:Zr crystal was an excellent candidate for holographic storage. (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Searching for a near neighbor particle in DSMC cells using pseudo-subcells

LeBeau et al. (2003) [4] introduced the ‘virtual-subcell’ (VSC) method of finding a collision partner for a given DSMC particle in a cell; all potential collision partners in the cell are examined to find the nearest neighbor, which becomes the collision partner. Here I propose a modification of the VSC method, the ‘pseudo-subcell’ (PSC) method, whereby the search for a collision partner stops whenever a ‘near-enough’ particle is found, i.e. whenever another particle is found within the ‘pseudo-subcell’ of radius δ centered on the first particle. The radius of the pseudo-subcell is given by δ = Fd_n, where d_n is the expected distance to the nearest neighbor and F is a constant which can be adjusted to give a desired trade-off between CPU time and accuracy as measured by a small mean collision separation (MCS). For 3D orthogonal cells, of various aspect ratios, d_n/L ≈ 0.746/N^0.383 where N is the number of particles in the cell and L is the cube root of the cell volume. There is a good chance that a particle will be found in the pseudo-subcell and there is a good chance that such a particle is in fact the nearest neighbor. If no particle is found within the pseudo-subcell the closest particle becomes the collision partner.     

Multi-set neighbor distinguishing 3-edge coloring

Let $G$ be a graph without isolated edges, and let $c:E\left(G\right)\to \{1,\dots ,k\}$ be a coloring of the edges, where adjacent edges may be colored the same. The color code of a vertex $v$ is the ordered $k$-tuple $(a_1,a_2,\dots ,a_k)$, where $a_i$ is the number of edges incident with $v$ that are colored $i$. If every two adjacent vertices of $G$ have different color codes, such a coloring is called multi-set neighbor distinguishing. In this paper, we prove that three colors are sufficient to produce a multi-set neighbor distinguishing edge coloring for every graph without isolated edges.     

路的字典积的邻和可区别边染色

图G的正常[k]-边染色σ是指颜色集合为[k]={1,2,…,k}的G的一个正常边染色.用w_σ（x）表示顶点x关联边的颜色之和,即w_σ（x）=∑_e∋x σ（e）,并称w_σ（x）关于σ的权.图G的k-邻和可区别边染色是指相邻顶点具有不同权的正常[k]-边染色,最小的k值称为G的邻和可区别边色数,记为χ'_∑（G）.现得到了路P_n与简单连通图H的字典积P_n[H]的邻和可区别边色数的精确值,其中H分别为正则第一类图、路、完全图的补图.     

Hadamard matrices of small order and Yang conjecture

We show that 138 odd values of n<10000 for which a Hadamard matrix of order 4n exists have been overlooked in the recent handbook of combinatorial designs. There are four additional odd n=191, 5767, 7081, 8249 in that range for which Hadamard matrices of order 4n exist. There is a unique equivalence class of near‐normal sequences NN(36), and the same is true for NN(38) and NN(40). This means that the Yang conjecture on the existence of near‐normal sequences NN(n) has been verified for all even n⩽40, but it still remains open. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 254–259, 2010     

3阶幂图的广义导出匹配可扩性

A graph G is induced matching extendable if every induced matching of G is included in a perfect matching of G. A graph G is generalized induced matching extendable if every induced matching of G is included in a maximum matching of G. A graph G is claw-free, if G dose not contain any induced subgraph isomorphic to K1,3. The k-th power of G, denoted by Gu, is the graph with vertex set V（G） in which two vertices are adjacent if and only if the distance between them is at most k in G. In this paper we show that, if the maximum matchings of G and G3 have the same cardinality, then G3 is generalized induced matching extendable. We also show that this result is best possible. As a result, we show that if G is a connected claw-flee graph, then G3 is generalized induced matching extendable.