A location‐inventory model with lateral transshipments

We study an infinite horizon periodic stochastic inventory system consisting of retail outlets and customers located on a homogenous line segment. In each period, the total demand, generated by the customers on the line, is normally distributed. To better match supply and demand, we incorporate lateral transshipments. We propose a compact model in which the strategic decisions—the number and locations of retail outlets—are determined simultaneously with the operational decisions—the inventory replenishment and transshipment quantities. We find the optimal balance between the risk‐pooling considerations, which drive down the optimal number of retail outlets, and lateral transshipments, which drive up the optimal number of retail outlets. We also explore the sensitivity of the optimal number of retail outlets to various problem parameters. This article presents a novel way of integrating lateral transshipments in the context of an inventory‐location model. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A note on equity across groups in facility location

An equity model between groups of demand points is proposed. The set of demand points is divided into two or more groups. For example, rich and poor neighborhoods and urban and rural neighborhoods. We wish to provide equal service to the different groups by minimizing the deviation from equality among groups. The distance to the closest facility is a measure of the quality of service. Once the facilities are located, each demand point has a service distance. The objective function, to be minimized, is the sum of squares of differences between all pairs of service distances between demand points in different groups. The problem is analyzed and solution techniques are proposed for the location of a single facility in the plane. Computational experiments for problems with up to 10,000 demand points and rectilinear, Euclidean, or general ?_p distances illustrate the efficiency of the proposed algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A1 Qaeda and the radical Islamic challenge to western strategy

The September 11 global crisis prompted by the attacks on the World Trade Center and the Pentagon raises major questions concerning the nature and trajectory of terrorism in the post-Cold War global order. Hitherto, terrorism has been largely debated by analysts at the level of nation states. Terrorist and insurgent movements have also been largely anchored in nationalist and ethnic power bases even when they have sought to mobilise a transnational ideological appeal on religious or class grounds. There have been a few exceptions to this pattern such as the alliance between the German Baader-Meinhof group and the Japanese Red Army Faction, but even such international alliances as this did not, until at least the 1980s, presage anything like a global terrorist network necessitating a global strategic response. This study examines terrorism and global strategic responses.     

基于脉冲串信号的无源定位系统频差估计误差CRLB分析

频差估计是无源定位系统中的关键部分,其估计精度直接决定了无源定位系统的性能。本文对单频脉冲信号频差估计误差方差的Cramer-Rao下限(CRLB)进行了理论分析研究。在建立数学模型的基础上,定量分析了频差估计误差CRLB与接收信号参数的数学关系。通过直接公式推导和数值仿真归纳,分别得出了相参/非相参单频脉冲信号频差估计误差CRLB的解析表达式,该结论可用于指导基于频差估计的无源定位系统设计。     

测时差定位的误差分析及表征方法

测时差无源定位具有很高的测量精度,但是时差定位在不同的定位区域定位误差差异非常大,更为重要的是误差区域分布形状复杂,用传统的误差半径和误差面积都很难表征具体点误差在军事上的意义.引入了概率椭圆来表示目标的概率分布,可较好地表征不规则的误差分布,有很强的军事应用价值.并给出了目标处于不同位置时的概率椭圆算法.     

三星时差定位系统欺骗干扰效能评估

通过简单复制转发被保护目标信号可对三星时差定位系统进行欺骗干扰.目前对于三星时差定位系统欺骗干扰效能评估的研究鲜有公开资料发表.分析了针对三星时差定位系统的转发式欺骗干扰原理,提出了将假目标数量和虚假目标干扰分布熵2个评估指标结合的干扰评估方法.通过仿真分析对转发式欺骗干扰效能进行了评估,实验结果验证了所提方法的有效性.     

基于弹迹跟踪预测的舰艇定位方法

舰艇采用实测舰位法对岸上不可见目标进行远程攻击时,在已获取目标地理信息的情况下,我舰定位误差往往成为影响打击精度的关键因素。针对惯性导航长时间工作产生积累误差,以及卫星导航在战时易受干扰等情况,提出利用对单发弹丸的跟踪与预测,结合提取的岸上目标绝对定位数据和弹丸落点的偏差信息,反向推算发射舰相对岸上目标的位置,可较为精确地修正我舰的绝对定位数据,为后续射击提供修正手段。该方法减少了战时舰炮武器系统对导航的依赖,仅靠对单发弹丸跟踪和预测,即可提高后续对岸射击的精度。     

带运力限制及单边时变约束下多出发机场航空战略投送兵力分配模型研究

利用民航力量由多个机场向一个目标机场实施航空战略投送时,由于各民航机场都具有运力限制约束,不可能无限制地快速投送兵力,因此,考虑了在多个出发机场存在运力限制约束的情况下,构建了"投送时间最短,动员机场最少"多目标决策模型,并给出了优化算法和算例.     

基于博弈论计算机网络对抗问题研究

针对日益普遍和多样的网络攻击行为,如何对网络各种攻防过程进行分析已逐渐成为热点研究方向。在对计算机网络对抗问题复杂性表现和产生根源进行探讨基础上,从完全信息静态博弈、完全信息动态博弈、不完全信息静态博弈、不完全信息动态博弈4个视角,对计算机网络对抗问题进行分类论述,对各解决方法进行了综合比较,并对今后的研究进行了展望。