CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

Capacity investment decisions under risk aversion

This article studies the optimal capacity investment problem for a risk‐averse decision maker. The capacity can be either purchased or salvaged, whereas both involve a fixed cost and a proportional cost/revenue. We incorporate risk preference and use a consumption model to capture the decision maker's risk sensitivity in a multiperiod capacity investment model. We show that, in each period, capacity and consumption decisions can be separately determined. In addition, we characterize the structure of the optimal capacity strategy. When the parameters are stationary, we present certain conditions under which the optimal capacity strategy could be easily characterized by a static two‐sided (s, S) policy, whereby, the capacity is determined only at the beginning of period one, and held constant during the entire planning horizon. It is purchased up to B when the initial capacity is below b, salvaged down to Σ when it is above σ, and remains constant otherwise. Numerical tests are presented to investigate the impact of demand volatility on the optimal capacity strategy. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 218–235, 2016     

排队论方法在评估防空武器系统能力方面的应用

针对当前评估舰炮武器系统作战效能的局限性,运用排队理论,建立评估单舰防空武器系统对持续入侵空中目标负荷能力的数学模型,分析了武器配置、火力单元工作性能对系统处理多批次空中目标能力的影响.针对作战平台的安全性,提出了评估舰炮武器系统功能的参数模型,对多种情况下的系统防空能力做出理论上的评价.最后,基于最一般情况给出舰炮武器系统防空作战中的几种可行配置方案.     

一种可靠的协作式频谱感知方案

高可靠性的频谱感知是认知无线电实现的基础.在认知无线电网络环境下,提出了一种可靠的合作频谱感知方案.认知网络中的独立节点分别计算频谱感知结果的可信任程度,融合中心预分选各节点的感知结果,剔除终端的错误感知数据,利用D-S证据融合方法得到最终感知结果.该方式能够克服阴影效应、衰落信道以及自私设备所造成的感知信息失真问题....     

ARUAV前沿判别法抗多点源诱偏性能研究

基于反辐射无人机的时域鉴别技术,提出了一种以小波分析为手段的前沿判别法。将被动雷达导引头使用固定波门对脉冲前沿进行采样所得的信号作小波分析,对分析结果进行判定,当判定采样信号内为单辐射源信号时对其进行测向、测频、跟踪和打击。针对两点源诱偏系统分析表明,在大部分空域中,反辐射无人机总是能首先跟踪诱饵信号。通过建模与仿真,验证了前沿判别法能够有效对抗两点源诱偏系统,并由固定波门得到了有效的判别空域。     

基于黑板模型的空袭目标识别专家系统

在对空袭目标信息进行综合利用的基础上,建立了基于黑板模型的多传感器空袭目标识别融合专家系统模型,模拟专家识别思维.给出了知识库的构造方法和知识的表示方法;推理机的设计结合了问题求解的黑板模型和D-S证据推理方法.该模型对目标的综合应用识别具有很好的借鉴作用,测试表明该系统具有很强的推理能力,融合模型有较高的识别准确性和可靠性.     

模式转换器耦合波方程组的微波网络矩阵解法

求解具有边值条件的耦合波微分方程组是研究变截面波导或弯曲波导模式转换器的基本方法。利用微波网络理论,给出了一种求解边值条件耦合波微分方程组的新方法,以简化求解过程,并使得解的物理意义更加明确。对于一个考虑了N个微波模式相互作用的耦合波微分方程组,通过分别赋予其2N个不同的初值条件并求解,可得到该方程组所描述模式转换器的传输矩阵和散射矩阵,进一步利用散射矩阵可得到给定边值条件下微分方程组的解。     

用胡锦涛创新军事理论建设现代化武警——学习胡锦涛同志关于建设现代化武警指导思想的体会

建设现代化武警,是胡锦涛同志新时期创新军事理论在武警部队建设中的体现。用胡锦涛创新军事理论指导现代化武警建设,必须运用科学发展观统筹兼顾机械化与信息化建设的关系,革命化、现代化、正规化建设的关系,发展信息化武器装备与培养高素质新型军事人才的关系,发展信息化武器装备与创新信息化条件下武警部队建设和作战军事理论的关系。     

Counterinsurgency and the limits of state-building: An analysis of Colombia's policy of territorial consolidation, 2006–2012

Since 2002 the Colombian government has been implementing a series of policy initiatives that have sought to coordinate state resources in a neo-classical counterinsurgency approach to fight the country's main insurgent group, the Fuerzas Armadas Revolucionarias de Colombia (FARC), and recover and consolidate the territory. Despite impressive operational successes against the insurgency and other illegal groups, the government has been unable to reassert its control and build legitimacy via the state-building effort known as ‘Consolidación’, in some of the most recalcitrant areas of the country. This article examines two areas where government efforts at consolidation appear to be failing to discuss the limits of COIN theory and practice.     

基于网络演算理论计算车电系统总线的最大时延

以车电系统总线为研究对象,以网络演算理论为数学工具,提出一种基于网络演算理论的车电系统总线的最大时延计算模型.通过仿真实验得到了车电系统总线中各个信息帧的到达曲线、高优先级的信息帧集合的到达曲线、服务曲线和最大时延的数值结果.与相关研究相比,所建模型输入参数少,计算量小,可以快速求解车电系统总线的最大时延,具有良好的适应性和通用性,可以作为车电系统总线分析、设计与优化的理论支持工具.