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     

基于有限条件的多波束雷达干扰系统目标分配算法

针对多波束干扰系统同时干扰多个目标的资源分配问题,通过分析目标分配算法的一般流程及涉及到的关键问题和技术难题,提出了基于实战化和有限条件的针对多波束干扰系统的非线性0-1整数规划数学模型。针对该模型采取开源软件SCIP进行求解,最后给出数值仿真来说明模型和算法的有效性。     

基于龙芯1A+BMN2200S的加固手持终端设计与实现

结合国产化工程实践需要介绍了一款新型的基于龙芯1A+BMN2200S的GPS/北斗加固手持终端设计思路与方法,该手持终端主要应用于单兵指挥系统。详述了手持终端系统的硬件设计,国产麒麟linux操作系统内核的移植,BMN2200S模块的原理,GPS和北斗信息的实时解算。该系统经实验证明能满足军用系统的高安全性和可靠性,并且有良好的实时性和实用性的特点。     

基于整数规划的地地导弹打击目标优化选取

地地战役战术导弹火力运用中,对导弹打击目标的选取是导弹部队制定合理科学作战方案所面临的现实问题。针对给定弹量和特定作战意图对打击目标进行优化选择问题,运用0-1型整数规划,建立合理的数学模型并确定最优打击目标。通过应用实例表明,此方法简便易行,可操作性较强,具有一定的实用价值。     

拟带宽 Toeplitz 系统的秩 1 修正算法

本文以带宽Ｔｏｅｐｌｉｔｚ系统的快速并行解法为基础,通过建立秩１的修正格式讨论了拟带宽Ｔｏｅｐｌｉｔｚ系统的一种快速并行算法,其串行运算量为９ｎｈ＋Ｏ（ｈ）．设ｐ为处理机台数,当ｐ≤ｎ时,并行运算量为　;当ｐ＝３ｎ时,运算量为２ｈ￣２ｌｏｇ２ｎ＋Ｏ（１）,其中ｈ表示拟带宽宽度。     

武器精度截尾SPOT 检验最大风险计算

就正态圆分布的武器命中精度的截尾序惯验后加权检验犯两类错误概率上界的计算问题,指出了目前沿用的计算公式的错误,推导了新的计算公式,并给出了算例,分析了计算结果的合理性;同时,指出了目前截尾点选取方法存在的问题     

Laplace分布的均值被半序约束时的极大似然估计

讨论了Laplaoe分布中,方差已知的情况下,均值θ在简单半序约束下的最小L_1保序回归(ML_1IR),就最小L_1保序回归的唯一性以及一些其它性质予以了讨论,并且给出了计算方法。     

军事素质基础综合训练的改革与实践研究

以提高军事素质为核心,结合“4+1”培养模式对复合型军事人才的要求,对军事素质基础综合训练教学进行了改革。重点阐述了深化军事素质基础综合训练的教学改革特点和实践效果,为总装备部乃至全军院校进一步深化军事基础教学改革提供一些思路和参考。     

A queueing system with vacations after N services

This article is devoted to the study of an M/G/1 queue with a particular vacation discipline. The server is due to take a vacation as soon as it has served exactly N customers since the end of the previous vacation. N may be either a constant or a random variable. If the system becomes empty before the server has served N customers, then it stays idle until the next customer arrival. Such a vacation discipline arises, for example, in production systems and in order picking in warehouses. We determine the joint transform of the length of a visit period and the number of customers in the system at the end of that period. We also derive the generating function of the number of customers at a random instant, and the Laplace–Stieltjes transform of the delay of a customer. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 646–658, 2015     

Radar pulse interleaving for multi‐target tracking

In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.