Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

串联电路的谐振及其实验方法的研究

本文主要介绍电路中的串联谐振的利弊、串联谐振曲线的测试以及串联谐振曲线与品质因数的关系、品质因数与选择性及灵敏性的关系并研究实验测试电路和方法。     

小子样下命中概率的估计

研究了当试验次数较少时 ,命中圆域的概率估计。给出了自助估计法和融合估计方法 ,对于估计的精度进行了分析。方法易于实现 ,适用于工程应用     

半挠性喷管挠性板弹性曲线计算方法

本文基于梁弯曲变形的小挠度线性理论,提出了半挠性喷管挠性板弹性曲线的计算方法。并对挠性板弹性曲线与气动力学给出的型面进行了对比研究,两者吻合得较好,研究表明,结构设计中撑杆合理布局,是影响匹配的关键问题,足应引起设计者的重视。     

一种基于粒子滤波的水下地形匹配算法研究

引入了剩余重采样的概念,通过权值分类和剩余权值重采样两个步骤完成粒子的复制,提高了运算速度.使用三次样条插值的方法对深度数据进行插值,构建了湖泊水下数字高程模型.通过仿真证明了该算法的可行性,并分析了匹配误差与水下地形的关系.     

一种新的低阻弹弹道坐标数据的异常值判别方法

分析了弹道测试中误差产生的原因和类型,以及各种传统数据处理方法的不足之处,针对数据处理中的主要问题和难点,提出了一种新的判别异常值方法。     

Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems

Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we fit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation is useful to find the neighborhood of preferred regions of the nondominated vectors with very little computational effort. Further computational effort can then be spent in the identified region to find the actual nondominated vectors the decision maker will prefer. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于表面电荷法的像管静电场计算

与传统的有限差分法和有限元法相比,表面电荷法可降低单元剖分难度并能处理开放边界,更适于计算静电透镜的静电场。针对轴对称及非轴对称两类结构,采用样条函数及奇异形状函数改进电极表面的电荷密度估计,讨论了二维及三维表面电荷法的实现。与具有解析解的单位圆盘进行比较,分析了表面电荷法的电位计算精度,并用于轴对称及非轴对称像管计算。结果表明：对轴对称系统,在文中给定步长下,二维及三维表面电荷法与有限差分法计算相对误差不超过10^-3,且二维方法精度整体高于三维方法,二维、三维表面电荷法对3种像面位置的计算结果与有限差分法结果相比,最大误差不超过0.6mm;对非轴对称系统,3种方案下轴外电子运行轨迹的差异明显,非对称因素所产生的干涉场影响是不可忽略的。     

光顺样条函数的再生核表示与计算

光顺样条是散乱数据拟合的理想函数,是噪声数据最优平滑的重要工具。因此,光顺样条的数学表示和计算的研究具有重要的意义。本文在一般的线性微分算子和线性泛函的情况下讨论光顺样条函数的构造和计算,通过构造一个适当的再生核Hilbert空间,使得所讨论的微分算子光顺样条成为该空间中的最小范数问题,再利用投影理论建立了光顺样条函数的再生核表示方法,并得到了插值偏差表达式。作为特例,还给出了奇次多项式光顺样条函数新的简洁的计算方法。