Production to order and off‐line inspection when the production process is partially observable

This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

论机关干部素质和能力的修养

机关干部加强素质和能力修养,必须认清岗位责任,在激发工作积极性、主动性和创造性上有新进步;拓宽眼界,在从政治和全局高度观察、分析和处理问题上有新进步;把握机遇、中心、重点和主攻方向,在出大主意、当大参谋上有新进步;提升协调能力,在理顺关系、确保政令畅通和工作落实上有新进步。     

基于离散降雨衰耗状态的卫星信道模型

针对Ka频段卫星信道中降雨衰耗的统计分布特点,建立了基于离散降雨衰耗状态的卫星信道模型,模型中各状态组成离散的Markov链并由其转移概率矩阵来表示,分析此模型下的信道误比特性能和数据包丢失性能。此模型能够适用于链路层以及高层通信协议。     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

临空高超声速飞行器目标特性分析

临空高超声速飞行器经过几十年的发展,已经从概念原理探索阶段进入到成果应用阶段,其军事潜力和作战效能日益凸显。主要以美军高超声速无人飞行器、空天飞机和高超声速巡航导弹为研究对象,从临空高超声速飞行器的运动特性、电磁特性和红外特性3个方面展开论述,同时结合典型目标进行建模仿真分析;着重探讨了目标特性对未来作战性能的影响。临空高超声速飞行器目标特性的分析研究,为新型防空体系的构建提供了参考,为未来探测跟踪拦截此类目标奠定了基础。     

基于三方动态博弈模型的网络生存防御策略优化配置

针对网络攻防环境中防御方以提高系统生存能力为目的所进行的最优生存防御策略的选取问题,提出了一种基于完全信息动态博弈理论的生存防御策略优化配置算法。将恶意攻击方、故障意外事件及防御方作为博弈的参与人,提出了一种混合战略模式下的三方动态博弈模型,对博弈的主要信息要素进行了说明,以混合战略纳什均衡理论为基础,将原纳什均衡条件式的表达式转化为可计算数值结果的表达式,并据此增加了近似的概念,最后,将提出的模型和近似纳什均衡求解算法应用到一个网络实例中,结果证明了模型和算法的可行性和有效性。     

航空弹药供应保障存在的问题及对策

在现代高技术信息化战争中,航空弹药地位和作用日渐突出。在分析了信息化条件下现代战争对航空弹药供应保障提出的新需求基础上,指出了航空弹药供应保障存在的不足,并从航空弹药的储备、管理和供应三个方面分别提出了相应的对策。研究表明,着眼应急作战的实际需要,搞好航空弹药供应保障,提高应急作战弹药供应保障能力,是摆在面前的一个现实而又紧迫的任务。     

碳纤维混凝土抗冻性能试验研究

为了增强高昼夜温差地区营房屋面和墙体的抗裂性能,提高营房安全性、舒适性及使用寿命,利用快速冻融法对碳纤维混凝土进行了300次冻融循环试验,并测量其相对动弹性模量和质量损失情况。结果显示:普通混凝土在150次冻融循环试验后试件破坏严重,平均质量损失了0.695 kg,损失率为6.9%;碳纤维混凝土在300次冻融循环试验后外形仍保持较好的完整性,平均质量损失了0.514 kg,损失率为5.19%,相对动弹性模量最多下降了34%,其中体积分数为1%的碳纤维混凝土平均质量损失仅为0.398 kg,损失率为4.05%,相对动弹性模量下降了31%。试验表明碳纤维可以改善混凝土的抗冻性能,适用于高昼夜温差地区建筑。     

Layers of Experiments with Adaptive Combined Design

In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015