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     

一类非线性规划问题的等价性证明

给出了非线性规划问题中目标函数单调变换前后的一个等价性证明.     

3,7-二硝基亚氨基-2,4-二氮杂双环[3,3,0]辛烷的放热分解反应动力学

在程序升温条件下 ,用DSC研究了标题化合物的放热分解反应动力学 .用线性最小二乘法、迭代法以及二分法与最小二乘法相结合的方法 ,以积分方程、微分方程和放热速率方程拟合DSC数据 .在逻辑选择建立了微分和积分机理函数的最可几一般表达式后 ,用放热速率方程得到相应的表观活化能 (Ea)、指前因子 (A)和反应级数 (n)的值 .结果表明 :该反应的微分形式的经验动力学模式函数、Ea 和A值分别为 (1-α) 0 .44、2 30 .4kJ/mol和 10 18.16s-1.借助加热速率和所得动力学参数值 ,提出了标题化合物放热分解反应的动力学方程 .该化合物的热爆炸临界温度为 30 2 .6℃ .上述动力学参数对分析、评价标题化合物的稳定性和热变化规律十分有用 .     

A New Two‐Dimensional Coordination Polymer of Mercury(II) with very High Thermal Stability

A 2D Hg^II coordination polymer containing ligands 1,2,4‐triazole (Htrz) and thiocyanate, [Hg(μ₃‐trz)(SCN)]_n ( 1 ) has been synthesized and characterized by elemental analysis and IR spectroscopy. The single‐crystal X‐ray data show the coordination number of Hg atoms is four and the ligand trz^? acts as a three‐fold donor. The thermal stability of compound 1 was studied by thermal gravimetric and differential thermal analyses. The composition and formation of the complex in methanol solution were found to be in support of its solid state structure.     

一种基于段的基音检测算法

作为语音信号处理领域一项基本、关键的技术,基音检测在语音信号处理中扮演着重要的角色,一直是语音信号处理的一个研究热点.首先对传统的基于短时自相关函数法的基音检测进行了研究;在此基础上提出了一种能同时检测一段语音信号基音周期的方法,有效地克服了传统基音检测算法只能检测一帧语音信号基音的缺点.进行了实验仿真,结果表明通过去野点,中值平滑等后处理的基于段的基音检测算法比传统的基于帧的基音检测算法具有更好的抗噪性.