不同入射角度下强流脉冲电子束能量沉积剖面和束流传输系数模拟计算

 强流脉冲电子束在材料中的能量沉积剖面、能量沉积系数和束流传输系数受其入射角的影响很大，理论计算了0.5~2.0MeV的电子束以不同的入射角在Al材料中的能量沉积剖面和能量沉积系数，并且还计算了0.4~1.4MeV电子束以不同入射角穿透不同厚度C靶的束流传输系数。计算结果表明，随着入射角的增大，靶材表面层单位质量中沉积的能量增大，电子在靶材料中穿透深度减小，能量沉积系数减小，相应的束流传输系数也减小；能量为0.5~2.0MeV的电子束当入射角在60°~70°时在材料表面层单位质量中沉积的能量较大。     

多相体系中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干涉仪进行了详细比较. 关键词： 双折射滤光片 群延迟 二阶色散 三阶色散     

High photosensitivity in cis-polyphenylacetylene films irradiated with 60Co γ-ray

This paper reports that ⁶⁰Co γ-ray irradiation can convert cis-polyphenylacetylene (cis-PPA) films prepared with rare-earth coordination catalysts to highly photosensitive materials. The dependence of the photosensitivity on irradiation dose, preparation methods, and microstructure of the PPA films has been investigated by means of a potential discharge technique. The photosensitivity was enhanced with increasing irradiation dose. The critical dose to produce a light response was 5 × 10³ Gy. The maximum surface potential discharge rate was 618 V/s, and the dark decay was approximately 2 V/s for cis-PPA films irradiated with ⁶⁰Co γ-ray (dose: 2 × 10⁵ Gy). The cis-transoidal-PPA and an electrophotographic photoreceptor device incorporating cis-PPA showed a higher irradiation effect. The structure and properties of ⁶⁰Co γ-ray irradiated rare-earth PPA films are similar to the unirradiated films.     

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     

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.     

A theoretical study of the ion pair SN2 reaction between lithium isocyanates with methyl fluoride with inversion and retention mechanism

This paper is devoted to a detailed theoretical study of an ion pair S_N2 reaction LiNCO+CH₃F in the gas phase and in solution at the level of MP2(full)/6-31+G**//HF/6-31+G**. Two possible reaction mechanisms, inversion and retention, are discussed. There are eight possible reaction pathways. The inversion mechanism is more favorable no matter in the gas phase or in solution based on analyses of the transition structures. Methyl isocyanate should form preferentially in the gas phase and more stable methyl cyanate is the main product in solution. The retardation of the reaction in solvents was attributed to the difference in solvation in the separated reactants and in the transition state.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005