不连续不可逆二维映象的动力学特性

总结两个保守映象不可逆地分段连续链接(称为类耗散系统)以及一个保守映象与一个耗散映象不可逆地分段连续链接(称为半耗散系统)情况下得到的五项共同动力学特征：不连续边界象集构成的随机网成为唯一的混沌轨道；由于某些相点具有两个逆象而导致的相空间塌缩(类耗散)；由于系统的不连续不可逆性质而出现的胖分形禁区网；在具有吸引子共存时占据不连续边界象集随机网和胖分形禁区网区域的点滴状吸引域以及由此导致的吸引子不可预言性；即使在传统强耗散存在的情况下点滴状吸引域仍由类耗散机制主宰.以一个累积-触发电路为例，说明这五项系统动 关键词： 随机网 禁区网 点滴状吸引域     

催化剂薄层内甲烷水蒸气重整反应强化管内对流换热的数值模拟

本文以竖直圆管内壁催化剂薄层内发生甲烷水蒸气重整反应强化对流换热作为研究对象,对其进行了数值模拟．结果发现,催化剂薄层内的吸热化学反应可以有效地强化对流换热,降低流体和壁面温度,从而对壁面起到保护作用;极限热流密度的大小与流体的入口温度有关,存在最佳入口温度使极限热流密度最大．     

非参数回归函数估计的渐近正态性

本文研究了独立或相依样本时非参数回归函数的Ｎａｄａｒａｙａ-Ｗａｔｓｏｎ估计，在简洁合理的条件下，证明了估计量的渐近正态性．获得的结论可在时间序列分析中得到应用．     

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

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