TERRORISM: FACTS FROM FIGURES 1

If international terrorism is on a rising trend, an important source of confirmation or refutation of this is time‐series data on terrorist activity. Using chiefly data collected by the RAND/MIPT consortium we show using basic statistical analysis that in the period 1968–2005 the yearly number of all international terrorist incidents shows no trend over time, but fluctuates year on year in a random manner. On the other hand some indicators do show a definite trend over time, principally the steady rise in the number of incidents that are death‐dealing in nature. A further conclusion is drawn, showing that the proportion of these incidents leading to deaths above a given level is virtually fixed.     

Asymptotic analysis of periodic policies for the inventory routing problem

In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013     

GPS L1C信号LDPC译码器设计

GPS现代化中的L1C信号使用了LDPC码,以提高接收机的弱信号接收能力。L1C信号中使用的LDPC码没有循环或准循环结构,这为译码器设计带来了难度。为了降低译码器实现复杂度,在分析L1C信号LDPC码校验矩阵结构的基础上,通过对校验节点分类和改变变量节点更新方法,提出了一种低存储量和简化译码器控制逻辑的低复杂度译码器结构,并通过仿真验证了译码器译码结果的正确性。     

The view from above: how the Royal Air Force provided a strategic vision for operational intelligence during the Malayan Emergency

It has long been held that the Federation of Malaya’s counter-insurgency campaign during the First Malayan Emergency (1948–60) was determined by the use of intelligence. Special Branch — the Federation’s primary intelligence agency — dominates the prevailing paradigm of how the insurgent threat was tackled. Conversely, the role of the Royal Air Force (RAF) within this paradigm is very limited. Most observers simply dismiss the role of photoreconnaissance or airstrikes as being largely inconsequential to the counter-insurgency effort. This is perhaps understandable: the Emergency was after all a ‘policing action’ and the insurgents were largely hidden under Malaya’s jungle canopy and amongst the Chinese community. However, further scrutiny reveals that the RAF made a much more significant contribution to the intelligence element of the counter-insurgency campaign than previously realised. First, the RAF decided to locate their Advanced Headquarters with the Army’s General Headquarters. This led to the creation of the Land/Air Operations Room, through which intelligence, tasking and resources were coordinated. Moreover, the RAF put its intelligence teams into the field to provide a practical link between local units and theatre-level assets. Second, with the support of the Army, the RAF established at the beginning of the Emergency the Joint Air Photographic Intelligence Board (Far East). This coordinated all photographic intelligence requirements throughout the Emergency, which was then delivered via the Joint Air Photographic Centre (Far East). Hence, via Joint Operations Centre and JAPIB (FE), the RAF provided both the practical means for effective joint intelligence operations at theatre level throughout the Emergency.     

精密加工过程切削用量和表面粗糙度关系的模糊化处理方法

在金属切削原理中,用切削用量可以估计理论表面粗糙度。由于切削过程的复杂性,实际加工表面粗糙度和理论表面粗糙度有较大差距。本文采用模糊模式识别方法,对切削用量和表面粗糙度的关系进行了实验研究。本人介绍的理论方法、实现技术路线和实验结果,为以后开展ＦＭＳ或ＣＩＭＳ中智能化质量监控技术的进一步研究打下了基础。     

椭圆曲线密码在电子商务现金系统中的应用研究

针对现有电子现金系统的不足,提出了一类基于椭圆曲线密码的离线电子现金方案.方案中自动更新的现金数据库可以删除过期的电子现金,避免了银行现金数据库可能无限增大的问题;在通信会话协议中,同时实现了签名、认证、加密传输和数据恢复,签名与认证的协议过程同时也是加密通信的过程,减化了常规的密码协议过程.与已有的方案相比,方案中协议与算法简洁、高效,在安全强度不变的条件下,降低了软硬件实现的系统开销,可广泛应用于电子商务等网络业务环境.     

用遗传算法实现雷达网目标分配

通过对雷达网目标分配问题的深入研究,建立了数学模型.为了获得发现概率最大的目标分配方案,引入了遗传算法来对模型求解,并给出了实现的步骤和方法.最后经过验证,证明该方法应用在雷达网目标分配问题上切实可行.     

陆军作战复杂系统ABMS机理研究

研究陆军作战复杂系统,需要解决两个不可回避的基本问题。一是怎样利用复杂性理论研究陆军作战系统的复杂性,即怎样借鉴复杂性理论构建复杂性思维模式。要解决这个问题,首先必须弄清复杂性理论概念的核心原理。二是在复杂性思维模式下,怎样进行陆军作战复杂系统的ABMS。要解决这个问题,首先必须弄清陆军作战复杂系统ABMS的机理所在。就这两个问题,在研究复杂性理论概念核心原理的基础上,构建了复杂性思维模式框架——复杂性分析二维结构,并由此探索了陆军作战复杂系统ABMS的机理:二维结构、"四个要素"、基本过程和陆战Agent模型框架,为陆军作战复杂系统的ABMS奠定了基础。     

履带车辆转向性能指标分析及实验研究

转向性能是评价履带车辆机动性的重要指标之一.文中针对转向角速度、转向半径和转向消耗功率3个指标,分别在不考虑履带滑转滑移的理想条件下和考虑履带滑转滑移的实际情况下,对履带车辆的转向性能进行了讨论和分析,对2种条件下履带车辆的转向性能的变化进行了比较.为了对履带车辆在转向过程中履带的滑转和滑移程度进行定量的分析,定义了履带的滑转和滑移系数.通过实车实验,对分析结果进行了验证.     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005