Preparation and applications of a polymer-supported phosphoryl azide

A polymer-supported diphenylphosphoryl azide was prepared. This polymer-supported version of DPPA is useful due to its lower toxicity, moisture tolerance and ease of workup after reaction. The synthetic application of this solid-phase reagent was explored by conversion of a variety of carboxylic acids to urethanes and ureas through Curtius rearrangement reactions. Carboxylic acids bearing different functional groups (aromatic, aliphatic and heterocyclic carboxylic acids) were subjected to the reaction. The corresponding products were isolated with satisfactory yields.     

硅基两维光子晶体的制备和光子带隙特性

利用反应离子束刻蚀设备制备了硅基的两维空气柱光子晶体，并用红外显微镜测试了样品的 反射谱. 理论上用时域有限差分(FDTD)方法计算了样品的光子带隙，从测试结果看光子带隙 和理论计算的光子带隙符合得很好.  关键词： 光子晶体 光子带隙 反射谱 时域有限差方法     

Space time-index plots for probing dynamical nonstationarity

We propose a simple method to efficiently probe dynamical nonstationarity in observed time series. In a space time-index plot, the density distributions as a function of normalized time-index are V-shaped due to nonstationarity. We show that this method is workable for short data sets and typical examples are illustrated.     

Zn0.76Cd0.24Se/ZnSe多量子阱的共振喇曼光谱

本文报道了在Zn0.76Cd0.24Se/ZnSe多量子阱(MQWs)中,用不同的Ar+激光线激发,观察到了共振增强的喇曼散射。首次在室温和77K的条件下,用Ar+的457.9nm谱线激发,观察到分别来自ZnSe垒层和Zn0.76Cd0.24Se阱层的限制纵光学声子模(LO)的喇曼散射,并对上述不同的光学模的起因进行了分析。     

周期系数三种群Lotka－Volterra混合模型分析

考虑三种群Ｌｏｔｋａ－Ｖｏｌｔｅｒｒａ周期系数模型，种群间既有捕食关系又有竞争关系，得到唯一存在全局渐近稳定周期解的条件，并举例说明条件的可行性．     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.