Quantum Key Distribution Using Four-Qubit W State

A new theoretical quantum key distribution scheme based on entanglement swapping is proposed, where four-qubit symmetric W state functions as quantum channel. It is shown that two legitimate users can secretly share a series of key bits by using Bell-state measurements and classical communication.     

Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error

Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.      

Recent radiochemical studies of the fission process

This article summarizes the recent radiochemical investigations on mass, charge kinetic energy and fragment angular distributions in low energy fission of actinides.     

Skew Models II

If g and G are the pdf and the cdf of a distribution symmetric around 0 then the pdf 2g(u)G(λ u) is said to define a skew distribution. In this paper, we provide a mathematical treatment of the skew distributions when g and G are taken to come from one of Pearson type II, Pearson type VII or the generalized t distribution.      

重离子治疗计划系统的构想

对重离子柬治癌的优势进行简要的回顾，并着重介绍了用于重离子放射治疗的治疗计划系统。治疗计划系统是一套软件系统，不同的硬件设施应有与其相匹配的软件系统，即治疗计划系统。在此基础上，针对兰州重离子加速器的特点提出一些关于治疗计划系统方面的构想。After a brief review concerning the advantages of heavy ions in radiotherapy, more interests are concentrated on treatment planning system （TPS） for heavy ion radiotherapy. Compared to the hardware devices such as accelerator and beam delivery system, the TPS is a set of software system, and different therapy facilities require their corresponding TPSs. Based on the specialities of the Heavy Ion Research Facility in Lanzhou （HIIRFL）, some suggestions on the TPS for tumor therapy at HIRFL finally are given.     

介绍一种二元阈值方法在股票指数上的应用

二元极值的阈值方法的一个发展是用来考虑两个变量的联合分布。这个方法是建立在二元极值的点过程表示法的基础上。本文用参数 (Logistic模型 )和非参数模型对 1992 1999年的上海、深圳日收盘指数对数收益进行分析并给出分析结果。     

拉盖尔-高斯光束通过有硬边光阑光学系统的传输

采用将硬边光阑展为有限个复高斯函数之和的方法,得到了拉盖尔-高斯光束通过有硬边光阑近轴ABCD光学系统中传输的近似解析公式,作了数值计算以说明传输公式的应用,并对使用该式的误差作了讨论。     

部分相干光束通过硬边光阑的推广光束传输M2因子

给出部分相干光通过硬边光阑后的强度二阶矩的计算公式，由此可得到部分相干光通过硬边光阑后的推广光束传输M^2因子。以部分相干高斯－谢尔模型光束为例，推导出相应的M^2因子，并作了数值计算和分析讨论。     

有Edgeworth展式的分布的随机加权逼近的重对数律

本文研究了未知分布的逼近问题，利用随机加权法，给出了有Edgeworth展式的一类（未知）分布的模拟分布，证明了在一定条件下，模拟分布与未知分布的逼近精度达到O(n^-1√lnlnn），称之为随机加权逼近的重对数律。     

On bulk-service MAP/PH L,N /1/N G-Queues with repeated attempts

We consider a retrial queue with a finite buffer of size N, with arrivals of ordinary units and of negative units (which cancel one ordinary unit), both assumed to be Markovian arrival processes. The service requirements are of phase type. In addition, a PH^L,N bulk service discipline is assumed. This means that the units are served in groups of size at least L, where 1≤ L≤ N. If at the completion of a service fewer than L units are present at the buffer, the server switches off and waits until the buffer length reaches the threshold L. Then it switches on and initiates service for such a group of units. On the contrary, if at the completion of a service L or more units are present at the buffer, all units enter service as a group. Units arriving when the buffer is full are not lost, but they join a group of unsatisfied units called “orbit”. Our interest is in the continuous-time Markov chain describing the state of the queue at arbitrary times, which constitutes a level dependent quasi-birth-and-death process. We start by analyzing a simplified version of our queueing model, which is amenable to numerical calculation and is based on spatially homogeneous quasi-birth-and-death processes. This leads to modified matrix-geometric formulas that reveal the basic qualitative properties of our algorithmic approach for computing performance measures. AMS Subject Classification: Primary 60K25 Secondary 68M20 90B22.