Steady-state analysis of load balancing with Coxian-2 distributed service times

This paper studies load balancing for many-server (N servers) systems. Each server has a buffer of size b ? 1, and can have at most one job in service and b ? 1 jobs in the buffer. The service time of a job follows the Coxian-2 distribution. We focus on steady-state performance of load balancing policies in the heavy traffic regime such that the normalized load of system is λ = 1 ? N^?α for 0 < α < 0.5. We identify a set of policies that achieve asymptotic zero waiting. The set of policies include several classical policies such as join-the-shortest-queue (JSQ), join-the-idle-queue (JIQ), idle-one-first (I1F) and power-of-d-choices (Po d) with d = O(N^α log N). The proof of the main result is based on Stein's method and state space collapse. A key technical contribution of this paper is the iterative state space collapse approach that leads to a simple generator approximation when applying Stein's method.     

大情报系统信息服务架构研究

为构建一体化的空天作战信息环境,面向大情报系统的信息共享和应用重组集成目标,探讨了以信息服务理念架构大情报系统的总体思路,总结筛选了大情报系统信息服务组件开发与集成应遵循的技术规范与标准.有助于大情报系统的体系结构设计,高效集成多元化的现有或即将建设的关联系统,并逐步过渡到统一的信息技术体制上.     

基于可组合服务的陆军作战仿真模型集成

陆军仿真模型体系的复杂性决定了其建模与集成的复杂度,本文基于模型组件化技术,设计了模型组件库、对象库,通过逻辑组合实现了基本库和作战单元库,并以可组合的模型服务实现不同分辨率、异构模型的聚合集成目标,使得陆军作战仿真模型具备模块化、可复用、可扩展和可控制的应用特点和战技术性能。     

潜射无人机及其对潜艇作战带来的变化

从水下航母的历史出发,简述了现代战争对潜射无人机的需求,分析了潜艇(尤其是核潜艇)装备潜射无人机的优势和给作战带来的变化,说明了它对发展水下航母的重要性。之后,以美国潜射无人机研发为例,总结了其研究进展,探讨了它目前面临或需要解决的问题,表明了其发展方向。     

基于营区精、气、神文化表达的自然仿生设计

精、气、神文化是营区规划设计的核心.自然仿生设计为营区精、气、神文化的表达提供了独特而有效的方式.通过对营区精、气、神文化的解读,发掘出自然仿生的3个层面,即“形”之仿生,“意”之仿生和“结构”之仿生.在营区规划设计中,当自然仿生的这3个层面得到有效表达,实现有机统一,营区就会产生独特的文化气质与魅力,从而体现其精、气、神特色,展现部队的“军营魂”.     

雷达虚拟维修训练中交互系统的通用性

基于USB接口技术对"通用雷达装备虚拟维修训练系统(URVMTS)"的人机交互系统进行研究,通过合理的软、硬件设计实现了系统的通用性。不同的实装操作部件经过适当的信号调理均可以通过该系统方便地实现与雷达虚拟样机之间的交互。着重介绍了交互系统的通用性设计与实现方法,包括系统的通用性设计方案,USB硬件电路的通用性设计及相应的软件开发。     

红外/雷达传感器协同跟踪算法研究

通常情况下 ,主动传感器在检测到目标之前就暴露了携带它的飞行器 ,因此 ,在作战环境下 ,限制主动检测设备的使用是必要的。被动传感器工作时具有隐蔽性 ,在现代军事跟踪系统中起着重要作用。研究了红外 /雷达的协同跟踪 ,以满足跟踪精度和隐蔽性双重要求     

Profust故障树建模与分析

实际中普遍存在的有显著渐近失效行为的系统 ,难以用经典故障树加以分析 ,于是 ,以“模糊事件的普通概率”这一理论为基础 ,建立了Profust故障树模型 ,并进行了部分定量分析 ,该模型的最大特点是综合运用了可以得到的关于系统运行的可能性信息和概率信息     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001