重复脉冲激光辐照InSb(PV)型探测器的热损伤

在建立高斯型重复脉冲激光辐照InSb(PV)型探测器物理模型的基础上,采用近似解析解的形式计算了圆柱形InSb靶板的二维温度场。通过数值分析得出了在激光辐照时,InSb(PV)型探测器的温升与时间的关系,并计算出相应的损伤阈值。研究表明:在高斯型重复脉冲激光辐照下,损伤阈值受到脉冲数目、宽度、重复频率以及脉冲激光光斑半径的影响,InSb(PV)型探测器会发生熔融损伤,发生于迎光面的光斑中心。对于一定厚度胶层的InSb(PV)型探测器,只有强度大于一定阈值时重复脉冲激光的辐照才可能发生熔融损伤,越薄的胶层对应的损伤阈值越大。为了增加InSb(PV)型探测器的激光对抗能力,应该减小胶层厚度。     

广义S变换和阈值分割联合抗频谱扩展-压缩移频干扰

根据频谱扩展-压缩(spectrum spread and compression, SSC)移频干扰信号和回波信号时频分布特性的差异,提出一种基于广义S变换和Tsallis交叉熵阈值分割的干扰抑制方法。分析了SSC移频干扰的干扰原理和干扰信号经过解线调后的信号形式,并利用时频聚焦性较好的广义S变换获取接收信号经过解线调后的时频图像,根据时频图像对应的灰度图像,以Tsallis交叉熵最小化作为目标函数,求出灰度图像的最佳分割阈值,并根据分割阈值构建时频滤波器,实现干扰抑制。仿真结果表明:该方法对于SSC移频干扰产生的假目标具有较好的抑制效果,干扰抑制比可达30 dB以上。     

The underlying causes of military outsourcing in the USA and UK: bridging the persistent gap between ends,ways and means since the beginning of the Cold War

This article reappraises the two most-studied country cases of military outsourcing: the USA and the UK. It argues that the contemporary wave of military contracting stretches back to the beginning of the cold war and not only to the demobilisation of armies in the 1990s or the neoliberal reforms introduced since the 1980s. It traces the political, technological and ideational developments that laid the groundwork for these reforms and practices since the early cold war and account for its endurance today. Importantly, it argues that a persistent gap between strategic objectives and resources, i.e. the challenge to reconcile ends and means, is an underlying driver of military contracting in both countries. Contemporary contracting is thus most closely tied to military support functions in support of wider foreign and defence political objectives. Security services in either state may not have been outsourced so swiftly, if at all, without decades of experience in outsourcing military logistics functions and the resultant vehicles, processes and familiarities with public-private partnerships. The article thus provides a wider and deeper understanding of the drivers of contractualisation, thereby improving our understanding of both its historical trajectory and the determinants of its present and potential futures.     

美军军官职业军事教育政策探析

美军在军事人才培养的体系构筑、目标设定、课目设置等方面有着众多独到之处。《军官职业军事教育政策》是美军规范军官职业军事教育的指导性文件,研究掌握其核心内容的发展演变,从中提取美军职业教育改革的先进理念和成熟做法,可为我军军事职业教育建设提供经验借鉴。     

世界科研诚信建设的动向及其对我国的启示

许多国家和国际性科学组织在科研诚信建设方面都开展了大量工作。目前,国内对于国外这方面的做法和经验,特别是近年来的最新实践只有零星的报道。文章比较全面地介绍国外科研诚信建设的主要发展动向和各国面临的一些共同挑战,进而分析提出其对我国科研诚信建设策略的启示,并就今后应加强的若干方面工作提出建议。     

Governmental Re-organization in Counterinsurgency Context: Foreign Policy Program Transfer and Operation Switchback in South Vietnam

Foreign policy program transfer, the shifting of implementation responsibility for a foreign policy program from one organization to another, is a ubiquitous, yet under-studied, counterinsurgency phenomenon. This article conceptually develops program transfer as an important object of study; analyzes, using archival sources, an empirical case of program transfer, Operation Switchback, drawn from US counterinsurgency practice in South Vietnam; and formulates two preliminary theoretical claims related to program transfer: (1) transferred programs will tend to be altered in accordance with the characteristics of the gaining organization, and (2) program transfer may act as a signal or early-warning indicator of foreign policy change.     

基于判别分析阈值滤波协作通信系统信道估计

在基于正交频分复用技术的放大转发协作通信系统中,针对传统信道估计算法估计精度差的问题,提出一种基于判别分析阈值滤波离散傅立叶变换信道估计算法。该算法首先通过设置改进的阈值门限初步获得信道有效抽头,然后利用马氏距离判别分析对已检测出的信道抽头修正。仿真结果表明:和传统方法相比,提出方法有效地滤除了信道估计中的噪声,改善了信道估计精度和误码率性能。     

基于年龄更换策略的威布尔分布备件需求计算方法

备件需求量预测在装备保障工作中发挥着重要作用。预防性维修可以消除装备潜在的故障或避免装备发生故障后所导致的严重后果,从而使装备始终处于期望状态。预防性维修策略下备件需求量建模能够以可预见的可靠性数据为基础进行,其关键问题是最佳更换间隔时间的确定。针对威布尔分布装备备件,采用年龄更换策略,确定最佳更换间隔时间,并在此基础上导出威布尔型备件需求计算模型,为备件需求量的预测提供了一种简单有效的方法。     

Multi‐item capacitated lot‐sizing problems with setup times and pricing decisions

We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010