Gas,power, and norms: competing logics for the declining use of chemical warfare

ABSTRACT

What restrains states from employing chemical weapons during modern war? Despite widespread and consistent efforts by the international community to outlaw chemical weapons in the twentieth century, major deviations from this goal occur. Two of the strongest explanations that exist for this trend are the logics of deterrence and norms that consider the use of chemical weapons to be a taboo. We test these theories using factor analysis and find that norms provide a better explanation of non-use in the twentieth century among states with a chemical-weapon capability. We then conclude with avenues for future research in this burgeoning field of study, which includes closer qualitative examination of norms, as well as the expansion of the dataset to include intrastate warfare and non-state warfare.     

Coordination mechanisms for a three‐stage reverse supply chain to increase profitable returns

In this article, we consider a generic electronic product that can be remanufactured or recycled at the end of its life cycle to generate new profit. We first describe the product return process and then present a customer segmentation model to capture consumers' different behaviors with respect to product return so that the retailer can work more effectively to increase the return volume. In regard to the collaboration between the retailer and the manufacturer, we explore a revenue‐sharing coordination mechanism for achieving a win‐win outcome. The optimality and sensitivity of the critical parameters in four strategies are obtained and examined both theoretically and numerically, which generate insights on how to manage an efficient consumer‐retailer‐manufacturer reverse supply chain, as well as on the feasibility of simplifying such a three‐stage chain structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

GPS L1C信号LDPC译码器设计

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

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Waypoint analysis for command and control

Command and Control (C2) in a military setting can be epitomized in battles‐of‐old when commanders would seek high ground to gain superior spatial‐temporal information; from this vantage point, decisions were made and relayed to units in the field. Although the fundamentals remain, technology has changed the practice of C2; for example, enemy units may be observed remotely, with instruments of varying positional accuracy. A basic problem in C2 is the ability to track an enemy object in the battlespace and to forecast its future position; the (extended) Kalman filter provides a straightforward solution. The problem changes fundamentally if one assumes that the moving object is headed for an (unknown) location, or waypoint. This article is concerned with the new problem of estimation of such a waypoint, for which we use Bayesian statistical prediction. The computational burden is greater than an ad hoc regression‐based estimate, which we also develop, but the Bayesian approach has a big advantage in that it yields both a predictor and a measure of its variability. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

一种新的基于二阶统计量的信道盲辨识与均衡算法

通过对接收信号进行过采样,应用过采样接收信号产生的循环平稳特性,给出单输入单输出系统的等效单输入多输出系统模型,据此模型给出了一种新的基于二阶统计量的盲辨识与均衡算法,给出的算法只需要接收信号的二阶统计量即可以辨识与均衡信道。     

射击精度小样本检验理论和方法应用研究初探

给出了多维正态分布与x2分布的概率性质,讨论了在小样本检验中如何检验同方差的二维正态分布的方差问题.给出了检验中所涉及到的拒真和纳伪概率的重要物理参数和OC曲线.该结论在武器装备小样本检验中具有重要的意义.     

初相未知信号联合检测与估计的序贯实现

在未知参数的充分统计量和再生概率密度函数的基础上,引入了联合检测与估计的序贯算法,给出了算法的实现框图,并将该算法应用于高斯噪声中初相位未知信号的联合检测与估计当中.仿真实验表明,新算法较传统算法有一定的性能改善.     

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     

武警学院学术论文统计系统开发及功能实现

针对目前手工学术论文统计工作量大、效率不高的问题,开发计算机学术论文统计系统。通过该系统,可方便实现论文录入、论文统计、论文学术分值自动打分、统计结果保存等主要功能。该系统利用pb8.0开发建立,后台数据库选用的是pb自带的数据库管理系统AdaptiveServerAnywhere7.0(ASA7.0)。