Optimal intensity control of a multi-class queue

We study a mixed problem of optimal scheduling and input and output control of a single server queue with multi-classes of customers. The model extends the classical optimal scheduling problem by allowing the general point processes as the arrival and departure processes and the control of the arrival and departure intensities. The objective of our scheduling and control problem is to minimize the expected discounted inventory cost over an infinite horizon, and the problem is formulated as an intensity control. We find the well-knownc is the optimal solution to our problem.Supported in part by NSF under grant ECS-8658157, by ONR under contract N00014-84-K-0465, and by a grant from AT&T Bell Laboratories.The work was done while the author was a postdoctoral fellow in the Division of Applied Sciences, Harvard University, Cambridge, Massachusetts 02138.     

Strong approximation of Riesz means at critical index on Hp(T) (0<p≤1)

This paper is a continuation of [3]. Suppose f∈H^p(T), 0σ _r ^σ f,σ=1/p?1. When p=1, it is just the partial Fourier sums S_kf. In this paper we establish the sharp estimations on the degree of approximation: $$\left\{ { - \frac{1}{{logR}}\int\limits_1^R {\left\| {\sigma _r^\delta f - f} \right\|_{H^p (T)}^p \frac{{dr}}{r}} } \right\}^{1/p} \leqq C{\mathbf{ }}{}_p\omega \left( {f,{\mathbf{ }}( - \frac{1}{{logR}})^{1/p} } \right)_{H^p (T)} ,0< p< 1,$$ and \(\frac{1}{{\log L}}\sum\limits_{k - 1}^L {\frac{{\left\| {S_k f - f} \right\|_H 1_{(T)} }}{k} \leqq Cp\omega (f; - \frac{1}{{\log L}})_H 1_{(T)} } \) Where $$\omega (f,{\mathbf{ }}h)_{H^p (T)} \begin{array}{*{20}c} { = Sup} \\ {0 \leqq \left| u \right| \leqq h} \\ \end{array} \left\| {f( \cdot + u) - f( \cdot )} \right\|_{H^p (T).} $$ .     

On the factor-thickness of regular graphs

For eachr-regular graphG, define a binary sequence(G) = ( ₁, ₂,..., _r-1) by _k = 0 ifG has ak-factor, and _k = 1 otherwise. A binary sequence = ( _i |i = 1, 2,...,r – 1) is said to be realizable if there exists anr-regular graphG such that(G) = . In this paper we characterize all binary sequences which are realizable.     

小样本参数估计算法及其应用

本文简要介绍了Minimax法和MSAR法对小样本数据的研究,随之重点介绍了1种实用的新算法IMSAR法及其应用。该法是通过变权松弛最小二乘法,确定适当的权因子来实现的。它克服了MSAR法的运算量随样本数据量增加而显著增加的突出缺点,仿真结果表明:IMSAR法具有较强的抗干扰能力,可适应于噪声分布未知的情况。最后,本文将IMSAR法应用于转炉炼钢动态模型及药物房室模型的建立,收到了令人满意的效果。     

ICP-AES法测定录音带磁粉中七种痕量元素

用顺序ICP光谱仪测定录音带磁粉中Ca、Mg、Cr、Co、Mn、Zn和Ti等痕量元素。样品用H_2SO_4/H_3PO_4/HNO_3混合酸分解。利用仪器的扫描程序,确定被测元素的分析线及背景校正点波长,并求干扰元素校正系数。估计了七个元素的检出限。测得平均回收率在90～104%之间。     

甜菜块根三生构造的形成及发育过程初探

通过“新甜二号”块根三生构造的形成及发育过程观察看出:甜菜块根三生构造的形成始于一对真叶期,从二对真叶到块根糖分增长期前期是块根三生维管束环的主要形成时期。块根内对三生维管束环上的三生维管束束数随块根三生维管束环数的增加而增加,二者之间里显著的直线相关。而且块根内的三生维管束环数及环上的束数都具有极限性。块根最外2—3环上的三生维管束束数虽多,但成熟的较少。块根内各环间距随三生维管束环数的增加而呈动态变化,环间距增长最快在叶丛繁茂中期到块根糖分增长期中后期。生育后期,根内以第三环间距最大,而且根内各环间距的大小与环数之间呈Y=ae~(bx)·x的函数关系。     

The asymptotic properties of the multichannel autoregressive spectral estimates

If we fit a-vector stationary time series using observationsx(1), ...,x(T) with AR models , then the spectral densityf() of {x(t)} can be estimated byf _k ^(T) ()=(2)^– A _k ^(T) (e ^–)^–1 _k ^(T) A _k ^(T) (e ^–i)^–, where are estimates of the variance matrix of(t), the residuals of the best linear prediction. By extending some results for the scalar case, this paper treats the asymptotic properties of the estimates in the multichannel case.     

Feller—Trotter算子的局部饱和定理

利用Bajsanski-Bajanic抛物线引理建立Feller-Trotter算子的局部小“ο”饱和定理,进一步地应用所得到结论建立了(C_)类算子半群概率表示的局部饱和定理。