Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000     

基于小波游程编码的改进算法

提出一种基于小波和数学形态学的自适应游程编码的改进算法.与其他优秀的小波图像编码算法一样,自适应游程编码是一种对小波域经数学形态学处理得到的小波显著系数的有效编码方式.图像小波分解.经数学形态学膨胀处理后,位平面将出现大量极长的连"0",利用游程编码将是非常有效的.改进的自适应游程编码算法最突出的新特点是其可以将原始比特流转换成码长的二进制编码.实验结果表明,当连续码流相等的情况下,改进的算法可以有效减少编码长度.     

The effects of information on a queue with balking and phase‐type service times

This article generalizes the models in Guo and Zipkin, who focus on exponential service times, to systems with phase‐type service times. Each arriving customer decides whether to stay or balk based on his expected waiting cost, conditional on the information provided. We show how to compute the throughput and customers' average utility in each case. We then obtain some analytical and numerical results to assess the effect of more or less information. We also show that service‐time variability degrades the system's performance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种短交织长度匹配交织器设计

针对无迫零比特结构Turbo码,给出了一种短交织长度匹配交织器设计准则,通过确保局部坏点对应Turbo码码重,有效减少了Turbo码字中小重量码字数量。仿真结果表明,与两种传统方法设计的交织器相比,文中算法所得交织器性能更加优良。     

Optimal staffing in nonstationary service centers with constraints

This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017     

A three-stage model for the perforation of finite metallic plates by long rods at high velocities

A three-stage theoretical model is presented herein to predict the perforation of a thick metallic plate struck normally by a long rod at high velocities. The model is suggested on the basis of the assumption that the perforation of a thick metallic plate by a long rod can be divided into three stages: (1) initial penetration; (2) plug formation and (3) plug slipping and separation. Various analytical equations are derived which can be employed to predict the ballistic limit, residual velocity and residual length of the long rod. It is demonstrated that the present model predictions are in good agreement with available experimental results for the perforation of finite steel targets struck normally by steel as well as tungsten alloy long rods at high velocities. It is also demonstrated that the dynamic maximum shear stress of a plate material has strong effect on plug formation and plug thickness which, in turn, exerts considerable influence on the residual velocities and lengths of a long rod at impact velocities just above the ballistic limit.     

均匀设计法在建立PELE爆裂效应关系模型中的应用

为了研究钢壳体PELE爆裂效应与影响因素之间的数学关系,对钢壳体PELE侵彻钢板进行了数值仿真和试验。采用均匀设计法设计仿真工况,将仿真结果进行回归分析,得出爆裂效应与影响因素之间的数学关系式,实弹侵彻实验结果与仿真结果基本吻合。研究表明,影响因素均与壳体爆裂长度成非线性关系,增大靶板厚度、弹芯长度和着速或减小壳体厚度均有利于提高钢壳体的爆裂效应。相关结论为PELE的工程设计和应用提供了理论基础。     

基于湍流冲击振动的输油管道稳定性研究

要水流冲刷管底形成悬空管道,悬空管道假设为一端固定一端铰支的均质等截面简支梁。在分析管道垂直载荷对悬空管道临界长度影响的基础上,考虑到输油管道振动引起的动应力以及管道振动时的外部阻尼、管道轴向力和内压对管道的作用,对悬空管道进行受力分析,导出管道振动微分方程。以保证管道强度的安全可靠为判据,计算求出悬空管道的临界长度,以便预测管道失稳条件,并对其及时采取稳固及抢修措施。     

Decentralized admission control of a queueing system: A game‐theoretic model

Consider a distributed system where many gatekeepers share a single server. Customers arrive at each gatekeeper according to independent Poisson processes with different rates. Upon arrival of a new customer, the gatekeeper has to decide whether to admit the customer by sending it to the server, or to block it. Blocking costs nothing. The gatekeeper receives a reward after a customer completes the service, and incurs a cost if an admitted customer finds a busy server and therefore has to leave the system. Assuming an exponential service distribution, we formulate the problem as an n‐person non‐zero‐sum game in which each gatekeeper is interested in maximizing its own long‐run average reward. The key result is that each gatekeeper's optimal policy is that of a threshold type regardless what other gatekeepers do. We then derive Nash equilibria and discuss interesting insights. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 702–718, 2003.     

Strategic spectrum occupancy for secondary users in cognitive radio networks with retrials

This article investigates joining strategies and admission control policy for secondary users (SUs) with retrial behavior in a cognitive radio (CR) system where a single primary user (PU) coexists with multiple SUs. Under a certain reward‐cost structure, SUs opportunistically access the PU band when it is not occupied by the PU. If the band is available upon arrival, an SU decides with a probability either to use the band immediately or to balk the system. If the band is occupied, the SU must decide whether to enter the system as a retrial customer or to leave the system. Once the PU requests for service, the service of SU being served, if any, will be interrupted, and the interrupted SU leaves the band and retries for service after a random amount of time. In this article, we study the equilibrium behavior of non‐cooperative SUs who want to maximize their benefit in a selfish, distributed manner with delay‐sensitive utility function. The socially optimal strategies of SUs are also derived. To utilize the PU band more efficiently and rationally, an admission control policy is proposed to regulate SUs who enter the system in order to eliminate the gap between the individually and socially optimal strategies.