ARMY RE‐ENLISTMENT DURING OIF/OEF: BONUSES,DEPLOYMENT, AND STOP‐LOSS

In 2004, stretched by wartime deployments, the US Army countered declining retention by increasing re‐enlistment bonuses and implementing stop‐loss to prevent soldiers from separating at the end of their enlistment. We estimate the effects of bonuses, deployment, and stop‐loss on re‐enlistment between FY 2002 and 2006. We estimate that the baseline propensity to re‐enlist fell by 20%. However, we find that deployed soldiers are more likely to re‐enlist and that the estimated effects of re‐enlistment bonuses are similar to those estimated in peacetime. We evaluate the reasons for our findings, and calculate the cost effectiveness of re‐enlistment bonuses.     

Military expenditure and employment in South Africa*

Previous research into the impact of military expenditure on employment finds considerable variation across countries. This paper adds to the debate by examining the long run relationship between military burden and manufacturing employment in South Africa. Such an analysis provides an opportunity to test for crowding‐out effects and the impact of the marked decline in military spending on the South African economy. The paper finds evidence supporting the view that military expenditure will have a detrimental impact on long term manufacturing employment, adversely affecting industrial structure and efficiency.     

不同环境条件油气爆炸极限测试模拟实验系统

针对不同环境条件油气爆炸极限测试的特殊需要,研制了相应的测试实验台架和关键参数测试系统。对标准20L球形爆炸装置进行了改进,使之适用于不同环境条件油气爆炸极限的测定与分析,设计并构建了能够配制不同浓度油气的油气雾化循环配气系统、瞬态压力测试单元、温湿度测试单元和气体组分测试单元等。实验验证与分析结果表明：该模拟实验系统能够满足不同环境条件油气爆炸极限测试分析的需要,也可供其他相似可燃气体（液体蒸气）测试使用。     

交流杂散电流对埋地钢质管道腐蚀危害实验

为探究交流杂散电流的影响因素及其对阴极保护系统的影响,搭建交流干扰腐蚀实验平台研究了土壤电阻率、干扰电压大小、涂层电阻率和通断时间比对交流杂散电流密度的影响;采用腐蚀试片失重法研究了交流杂散电流密度对腐蚀速率的影响以及阴极保护电位分别为-850 mV和-1 000 mV时对阴极保护系统的影响。实验结果表明:土壤电阻率、干扰电压大小、涂层电阻率和通断时间比对交流杂散电流密度具有较为显著的影响;阴极保护电位为-1 000 mV时,即使交流电流密度为20 mA/cm2,腐蚀试片也能得到有效保护。因此,埋地管道应采用绝缘性能好的防腐涂层,规划合理的铺设路线,并在运行过程中采取强制电流阴极保护系统,设置合理的阴极保护电位。     

网络化巡飞攻击弹药鉴定试验方法研究

网络化巡飞攻击弹药(NLAA)是一种新型的信息化弹药,采用无人机技术、弹药技术和数据通信技术等多项高新技术,是未来弹药领域发展的重要方向.针对网络化巡飞攻击弹药的特点和关键技术,提出了网络化巡飞攻击弹药在鉴定试验中需要开展结构强度、制导精度、数据链测试、安全性和可靠性、毁伤评估以及弹道测试等关键试验技术研究,为网络化巡飞攻击弹药定型试验技术研究提供了方向.     

水中兵器延寿样本的装载可靠度鉴定试验方案

针对延寿样本子样少,按经典GJB899法对装载可靠度鉴定需要较长的试验时间这一实际情况,提出了一种减少试验时间的Bayes方法.该方法通过挖掘延寿前装载失效率信息,确定先验分布,再开展陆上加速装载试验以增加装载信息,并结合实际装载信息制定了装载可靠度鉴定试验新方案.实例计算表明:在确保鉴定效果的前提下,新方法可在较小的延寿样本条件下快速完成装载可靠度鉴定工作,满足水中兵器延寿工程的实际需要.     

FP GA软件测试过程及管理

船舶领域的FPGA软件测试严重滞后于应用增长的速度,部分型号甚至未将其纳入测试范畴。在研制过程中,由FPGA故障导致的修改调试已成为影响进度和增加成本的瓶颈。因此,针对FGPA软件特点及其测试的现状,对其测试过程、测试模型和过程管理进行研究,并给出完整的过程管理体系。通过采用规范化、有序化、系统化、面向工程的、面向任务的文档及配套管理手段进行正确引导、组织和实施测试活动,持续改进测试流程中各个阶段工作质量和效用,及早及时地发现和关闭开发过程中存在的缺陷,提高设计和测试的沟通效率,最终保证FPGA产品的质量,提升客户的满意度。     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013