含单负特异材料一维无序扰动周期结构中的光子局域特性研究

采用传输矩阵法研究了电磁波在由单负特异材料组成的一维无序扰动周期结构中的Anderson局域(Anderson Localization)行为,分别讨论了色散和非色散两种模型.结果发现,在对应周期结构的通带位置,无序的引入对局域长度的影响较大,而在带隙位置,影响较小,几乎可以忽略.该性质与我们曾讨论的随机结构有较明显不同.导致这种局域性质的主要原因应为,光在单负材料组成的系统中的传输主要依赖于两种单负材料间的界面.在无序扰动结构中,该界面数相对于周期结构并没有减少,因此对光的传输性质影响较小,而随机结构中     

矩阵不等式约束下矩阵方程AX=B的双对称解

本文讨论矩阵不等式CXD≥E 约束下矩阵方程AX=B的双对称解,即给定矩阵A,B,C,D和 E, 求双对称矩阵X, 使得AX=B 和 CXD≥E, 其中CXD≥E表示矩阵CXD-E非负.本文将问题转化为矩阵不等式最小非负偏差问题,利用极分解理论给出了求其解的迭代方法,并结合相关矩阵理论说明算法的收敛性.最后给出数值算例验证算法的有效性.     

Rb与H_2的反应碰撞:Rb(6~2D)+H_2→RbH+H

在样品池条件下,应用脉冲激光的泵浦-检测技术,研究了Rb(6~2D)激发态原子与H_2反应碰撞生成的RbH分子的振转能级的布居数密度分布及平均转动能、振动能、平动能的相对比值.发现RbH(X~1∑~+)只有v=0,1上有布居.转动带分布轮廓与池温下的统计分布接近,得到RbH的Boltzmann转动温度稍低于池温,而振动温度高.v=1和v=0上的布居数之比约为0.69,从而得到RbH(X~1∑~+)上平均转动能和平均振动能,由反应的有效能得到平均平动能,这三种能量的相对比值f_R:f_V:     

A new model for electromigration grain boundary noise based on free volume

Grain boundary plays a key role in electromigration process of polycrystal interconnection. We take a free volume to represent a 'vacancy--ion complex' as a function of grain boundary specific resistivity, and develop a new characterisation model for grain boundary noise. This model reveals the internal relation between the boundary scattering section and electromigration noise. Comparing the simulation result with our experimental result, we find the source as well as the form of noise change in the electromigration process. In order to describe the noise enhancement at grain boundary quantitatively, we propose a new parameter-grain boundary noise enhancement factor, which reflects that the grain boundary noise can characterise the electromigration damage sensitively.     

Investigation of the energy resolution with a RETGEM detector

A novel Micro-pattern gaseous detector (MPGD), thick GEM with electrodes made of a resistive material (RETGEM) is presented. In this paper we mainly investigate the energy resolution of a RETGEM in Ar+CO_2 with different gas mixtures. The results indicate that an energy resolution 30% in single and double mode can be obtained. The existence of an optimum energy resolution is discussed.     

V替代Mn对La_(0.45)Ca_(0.55)MnO_3电荷有序相及自旋玻璃态的影响

用固相反应法制备了La0.45Ca0.55Mn1-xVxO3(x=0.00,0.10)多晶样品.通过X射线衍射谱、质量磁化强度-温度曲线、电子自旋共振谱,研究了V5+替代Mn3+/Mn4+对La0.45Ca0.55MnO3电荷有序相和自旋玻璃态的影响.实验结果表明,当x=0.10时,不仅母体的电荷有序相基本破坏,而且母体在40K左右出现的自旋玻璃态也被融化.电荷有序相被破坏的主要原因是用V5+替代Mn3+/Mn4+后,增加了Mn3+与Mn4+的比例,使铁磁双交换作用优于反铁磁超交换作用;自旋玻璃态的融化是由于V替代Mn后破坏了反铁磁背景下有少量铁磁成分的自旋玻璃态的形成条件.     

Superconvergence of a Nonconforming Finite Element Approximation to Viscoelasticity Type Equations on Anisotropic Meshes

The main aim of this paper is to study the approximation to viscoelasticity type equations with a Crouzeix-Raviart type nonconforming finite element on the anisotropic meshes. The superclose property of the exact solution and the optimal error estimate of its derivative with respect to time are derived by using some novel techniques. Moreover, employing a postprocessing technique, the global superconvergence property for the discretization error of the postprocessed discrete solution to the solution itself is studied.     

一类矩阵方程的广义Hermite问题

该文主要解决了如下两个问题 问题I 已知矩阵 M∈ C^n×e, A∈C^n×m, B∈ C^m×m, 求 X∈ HC_M,n使得 A^HXA=B, 其中 HC_M,n={ X∈ C^n×n}|α^H(X-X^H)=0, for all α∈ C(M) }. 问题II 任意给定矩阵 X^* ∈C^n×n, 求 $\hat{X}\in H_E$ 使得 ||\hat{X}-X^*||=\min\limits_{X∈ H_E}||X-X^*||, 这里 H_E 为问题I的解集. 利用广义奇异值分解定理,得到了问题I的可解条件及其通解表达式, 获得了问题II的解,并进行了相应的数值计算.     

向列相液晶nCB(4-n-alkyl-4'-cyanobiphenyls,n=5-8)的旋转黏度及其奇偶效应的分子动力学模拟

在全原子力场模型的基础上,对向列液晶nCB(4-n-alkyl-4'-cyano biphenyls,n=5-8)进行了等压等温NPT系综下的分子动力学(MD)模拟.对MD的轨迹分析得到了二阶和四阶序参数以及描述液晶分子翻转运动的取向时间相关函数(TCF),并通过一个近似的单指函数对TCF拟合得到了相关时间.在此基础上,计算了nCB(n=5-8)的旋转扩散系数(Rotat ional diffusion coefficient,RDC).利用基于统计力学模型的Nemtsov-Zakharov方法和Fialkowski方法,分别计算了它们的旋转黏度系数(rotational viscosity coefficient,RVC),进而分别讨论了RVC,RDC和相关时间的奇偶效应.与文献中的实验结果比较表明,该方法得到了合理的计算结果和一致的奇偶效应.     

Efficient algorithms for a constrained k-tree core problem in a tree network

Let T=(V,E) be a free tree in which each vertex has a weight and each edge has a length. Let n=|V|. Given T and parameters k and l, a (k,l)-tree core is a subtree X of T with diameter l, having k leaves, which minimizes the sum of the weighted distances from all vertices in T to X. In this paper, two efficient algorithms are presented for finding a (k,l)-tree core of T. The first algorithm has O(n²) time complexity for the case that each edge has an arbitrary length. The second algorithm has O(lkn) time complexity for the case that the lengths of all edges are 1. The (k,l)-tree core problem has an application in distributed database systems.