资源有限的加权总完工时间单机排序问题

本讨论资源有限的加权总工时间单机排序问题，对现在仍为OPEN问题1｜pj=bj-ajuj，∑uj≤U｜∑wjCj给出了一个有关最优解中最优资源分配的重要性质，并利用该性质分别给出了三种情况bj=b,wj=w,aj=a；bj=b,wj=w,uj=u；aj=a,wj=w,uj=u的最优算法。     

多重休假的带启动--关闭期的Geom/G/1排队

本研究多重休假的带启动——关闭期的Geom／G／1离散时间排队，给出稳态队长，等待时间分布的母函数及其随机分解结果，推导出忙期的全假期的母函数，给出该模型的几个特例。     

非线性Schrdinger方程的高精度守恒差分格式

本文首先分析线性Schrodinger方程一种高阶差分格式的构造方法,得到方程的耗散项.在此基础上对三次非线性Schrodinger方程,提出了一种精度为O(r2 h2)的差分格式,证明了该格式保持了连续方程的两个守恒量,且是收敛的与稳定的.并通过数值例子与已有隐格式进行了比较,结果表明,本文格式在计算量类似的情况下,提高了数值精度.     

Survivability in IP-over-WDM Networks: WDM Lightpath Protection versus IP LSP Protection

This article compares the performance of WDM lightpath protection and IP LSP protection schemes for IP-over-WDM networks. A mathematical formulation of the maximum throughput problem is presented and analytical expressions for recovery time are derived for both schemes. The throughputs and recovery times are analyzed and compared. Results show that the IP LSP protection scheme presents higher throughputs then WDM lightpath protection. The IP LSP protection scheme, providing individual IP LSP protection has, however, scalability problems. This scheme presents high recovery times when a failure affects many lightpaths and many hops are allowed for the primary routes of IP LSPs.     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.     

对流扩散方程的一种新型差分格式

对流扩散方程可以描述众多的物理化学现象，因而对其寻求稳定的，实用的数值解法有着重要的现实意义。本文针对形式较一般的一维非定常对流扩散方程，构造了对角元严格占优的Crank-Nicholson差分格式，然后对其分别用分离变量的方法以及能量估计的方法作了稳定性的分析，最后给出了数值试验的结果，数值结果表明本文构造的格式能够较好的处理经典的Crank-Nicholson格式所不能处理的对流项系数较大的对流扩散方程，并具有较好的精度。     

Comment on: “Confined states in two-dimensional flat elliptic quantum dots and elliptic quantum wires” [Physica E 11 (2001) 345]

We argue that the two-dimensional elliptic quantum dot problem with finite barrier cannot be exactly solved, contrary to a recent assertion (van den Broek and Peeters, Physica E 11 (2001) 345. We also prove it explicitly by numerically calculating the correct energy spectrum.     

用于强磁场的快响应真空规的研制进展

研制了能在强磁场、强干扰环境下工作的快响应真空电离规(快规),用于对HL 2A装置偏滤器室和等离子体附近的中性粒子密度和通量进行原位测量。介绍了快规的结构、工作原理、设计要点以及实验结果。在无磁场的情况下,快规对气体压强的测量范围为6.4×10-6～0.15Pa,在1×10-5～0.15Pa范围内,快规收集极离子流与发射电子流之比与气压保持良好线性关系;在0 15T的磁场下,快规的规管常数未发生显著变化,在规管对称轴与磁力线的夹角小于15o时,规管常数的变化小于10%。     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

Subgroup separability of graphs of abelian groups

In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.