An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

数字阵列雷达宽带快速跳频源设计

介绍了一种基于直接数字合成技术(DDS)与直接频率合成(DS)相结合的数字阵列雷达T/R组件设计,其主要核心思想就是运用DDS技术中的相位控制功能代替传统高频移相器,并且运用其幅度控制功能代替传统的数控衰减器,从而实现阵列雷达发射信号的数字波束形成;并且设计出高稳定度的800 MHz高频源作为输入参考,利用DDS技术实现宽带下快速跳频;输出端采用DS方法,保证得到所需频带低相噪特性。     

基于模糊层次分析法的高层建筑火灾风险评估

火灾风险评估是降低火灾损失的有效方法。利用模糊层次分析法,建立了高层建筑火灾风险评估体系,并应用于具体高层建筑的火灾风险评估中。评估结果与实际情况取得了较好的一致性,从而为高层建筑火灾风险评估提供了一种简便可行的方法。     

浅谈发挥军旅格言的战斗文化功能

论述了如何充分发挥军旅格言的战斗文化功能,营造崇尚战斗、敢于战斗、争当战斗英雄的浓厚战斗文化氖围,努力把武警部队建设成为军心凝聚、士气高昂、英勇顽强的文明之师、威武之师,更好地履行党和人民“忠诚卫士”的神圣使命。     

激波诱导异质气体界面失稳的数值模拟

基于二维N-S方程,利用有限差分数值离散方法,对激波诱导异质气体界面失稳的现象进行了数值模拟,与文献中实验结果和计算结果进行了定性比较,并进一步分析了整个流动的非定常动态变化特性和非线性特征.研究表明,本文数值模拟的非定常流场图谱与文献中的实验结果和数值结果吻合较好;数值结果捕捉到了六氟化硫界面的演变过程及流场中复杂的波系结构.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

Interdiction models for delaying adversarial attacks against critical information technology infrastructure

Information technology (IT) infrastructure relies on a globalized supply chain that is vulnerable to numerous risks from adversarial attacks. It is important to protect IT infrastructure from these dynamic, persistent risks by delaying adversarial exploits. In this paper, we propose max‐min interdiction models for critical infrastructure protection that prioritizes cost‐effective security mitigations to maximally delay adversarial attacks. We consider attacks originating from multiple adversaries, each of which aims to find a “critical path” through the attack surface to complete the corresponding attack as soon as possible. Decision‐makers can deploy mitigations to delay attack exploits, however, mitigation effectiveness is sometimes uncertain. We propose a stochastic model variant to address this uncertainty by incorporating random delay times. The proposed models can be reformulated as a nested max‐max problem using dualization. We propose a Lagrangian heuristic approach that decomposes the max‐max problem into a number of smaller subproblems, and updates upper and lower bounds to the original problem via subgradient optimization. We evaluate the perfect information solution value as an alternative method for updating the upper bound. Computational results demonstrate that the Lagrangian heuristic identifies near‐optimal solutions efficiently, which outperforms a general purpose mixed‐integer programming solver on medium and large instances.     

动态滑翔运动建模、机理分析与航迹优化

信天翁凭借动态滑翔的飞行技巧从梯度风中获取能量,从而在几乎不拍翅膀的情况下进行长时间、长距离飞行,这种技巧应用于小型无人机上可拓展其完成任务的能力。基于飞行器动力学对梯度风场中的无人机运动方程进行推导和简化处理;利用简化的运动方程,分别从非惯性参考系中的动能定理和机械能变化的角度,对动态滑翔获取能量的机理进行分析;利用微分平坦法,以最小平均控制输入变化率为目标函数,对徘徊模式和平移模式的动态滑翔航迹进行优化计算。分析结果表明:逆风爬升、顺风下滑是动态滑翔基本获能方式。优化结果表明:控制输入变得更加平滑,甚至出现阶段性的常值,使得控制更加简化;徘徊模式下,当风梯度作为决策变量时,优化过程可在[0,0.5 s-1]的区间上找到使得目标函数值最小的风梯度;平移模式下,目标函数值在该区间上单调递减。     

商务印书馆函授学校英文科学员来源地考察——基于《英语周刊》(1921-1922)记载的分析

商务印书馆函授学校英文科在中国近现代成人教育史、职业教育史上都占据着非常重要的位置.1921年至1922年期间的《英语周刊》对英文科学员来源地等信息均有着较为详细的记载,弥补了已发现的相关史料的不足,从而可以对其办学效果做出一个客观、精确的评价.通过《英语周刊》的相关记载,可以发现英文科学员来源地范围覆盖区域非常广泛,其学员来源地构成状况呈现出了多元化、多样化的特点.仅仅从学员来源地状况的角度去审视、考察,商务函授学校英文科取得了显著的办学效果,它在一定程度上弥补了普通学校教育资源的不足,有力促进了中国教育近代化事业的发展.     

基于算法估计的网络端到端时延测量方法

在网络端到端延迟的测量中,常用的方法大多是通过发送探测包来直接得到端到端的时延值.由于存在时钟不同步的问题,所以测量结果的误差较大.针对此问题,在Sue B.Moon提出方法的基础上进一步改进,提出了一种基于算法估计的软件方法,该方法更好地解决了收发时钟不同步的问题,提高了测量的精度.