伽利略的自由落体定律研究——"最美丽"的十大物理实验之一

在伽利略的运动学研究中,自由落体运动是一个重要课题.他敏锐地认识到,通过打开自由落体运动这个缺口,会导致一门新科学的诞生.他在《两门新科学》(即《关于两门新科学的数学证明的对话》)一书中写道:"我的目的,是要阐述一门崭新的科学,它研究的却是非常古老的课题.也许,在自然界中最古老的课题莫过于运动了.     

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

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

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

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

The production of slow particles in 16O－Em interactions at 4.5 A GeV/c

A sample of 1233 events is used to study the general characteristics of {}^{16}O－Em interactions at 4.5 A GeV/c. Multiplicity and angular distributions of slow particles and correlations among them are discussed. The present data are compared with the corresponding results from the interactions of other projectiles at the same energy and also the same projectile at different energies. The results indicate that black particle production is independent of the energy and mass of the projectile, but for grey particles it is dependent on the mass of projectile.     

一个线性约束优化问题的广义梯度投影法

本文对线性约束优化问题提出了一个新的广义梯度投影法，该算法采用了非精确线性搜索，并在每次迭代运算中结合了广义投影矩阵和变尺度方法的思想确定其搜索方向．在通常的假设条件下，证明了该算法的整体收敛性和超线性收敛速度．     

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.