粒子-转子模型和推转壳模型中的能谱统计分析

用粒子–转子模型和推转壳模型研究了6个粒子分别填充在单j壳和双j壳上的混沌行为.分析了单j壳和双j壳情况下能谱的最近邻能级间距分布和谱刚度随自旋及推转频率的变化,结果表明,当组态空间大小不变时,系统在双j壳(g_7/2+d_5/2)情况下比在单j壳(i_13/2)情况下更规则,而当组态空间从单j壳(i_13/2)扩大到双j壳(i_13/2+g_9/2)时,系统的混沌程度变化不大.同时比较了将6个粒子的两体相互作用分别取为δ力和对力时的系统的混沌行为     

多相体系中Ni-PMMA纳米复合材料的γ辐射制备

在多相体系中 ,运用γ射线辐射法 ,在常温常压下成功地一步合成了镍 聚甲基丙烯酸甲酯 (Ni PMMA)纳米复合材料 .XRD、TEM分析和IR光谱表明 ,在此实验条件下 ,镍离子和甲基丙烯酸甲酯已成功地被还原或聚合 ,镍粒子为面心立方 ,尺寸为 7.33nm .研究显示 ,用醋酸钠代替氢氧化钠或氨水作为碱性试剂 ,可以有效地控制体系的pH ,同时不影响单体的聚合 .     

Existence and Uniqueness of Endemic States for the Age-structured MSEIR Epidemic Model

The existence and uniqueness of positive steady states for the age-structured MSEIR epidemic model with age-dependent transmission coefficient is considered. Threshold results for the existence of endemic states are established; under certain conditions, uniqueness is also shown.     

量子点器件的三端电测量研究

利用三端电测量方法，研究了调制掺杂二维电子气结构的量子点器件输运特性.报道了可分别测量二维电子气电阻和量子点隧穿电阻的实验方法.实验结果表明：量子点的横向耦合控制了量子点器件在小偏压下的电输运特性. 关键词： 自组装量子点 二维电子气 量子隧穿 肖特基接触     

双折射滤光片的色散特性研究

研究了由理想线偏振片和单轴双折射晶体波片组成的双折射滤光片倾斜放置时的二阶色散和 三阶色散特性，包括波片厚度、光线入射角和光轴旋转角的变化对二阶和三阶色散的影响. 还给出了双折射滤光片的群延迟表达式，并就色散特性与GT干涉仪进行了详细比较. 关键词： 双折射滤光片 群延迟 二阶色散 三阶色散     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

Analysis of queueing policies in QoS switches

It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.