民族宗教分裂势力对国家安全的影响及对策

极端民族宗教分裂势力恐怖活动已严重危害我国领土主权完整、威胁社会政治稳定,对国家安全构成严重威胁,必须采取相应对策予以打击。     

地方物流供应商“偷懒”行为监管机制研究

军民融合现代军事物流体系中,地方物流供应商往往会"偷懒",这必将损害军民融合现代军事物流体系的整体绩效。首先描述了"偷懒"行为及其危害性,从机制入手,基于博弈论建立地方物流供应商"偷懒"行为监管机制;分析并证明了监管机制的有效性。这一机制的构建对于监管地方物流供应商具有重要作用。     

货郎担问题新算法

将指派问题的匈牙利解法用于货郎担问题,通过恰当地添加大正数构造效率矩阵,得到了计算货郎担问题较快的算法。文中给出的2个例子具体地说明了算法实施过程,该算法具有一定的实用性。     

螺杆泵转子型线研究

对现有三螺杆泵从动螺杆的修正齿型进行分析 ,找出存在的问题 ,提出了齿型修正方案     

高场强电磁脉冲模拟器及其生物学研究

介绍了一种新建的适用于生物效应研究的高场强电磁脉冲(EMP)模拟器,描述了其工作原理、设计参数。调试结果表明,此模拟器达到了设计要求,且性能稳定。动物实验已初步表明,高场强EMP可致大鼠中枢神经系统血液循环障碍,神经细胞变性,突触结构模糊等改变。     

Due-date assignment and early/tardy scheduling on identical parallel machines

This article examines the problem of simultaneously assigning a common due date to a set of independent jobs and scheduling them on identical parallel machines in such a way that the costs associated with the due date and with the earliness or tardiness of the jobs are minimized. We establish that, for certain values of the due-date cost, an optimal schedule for this problem is also optimal for an early/tardy scheduling problem studied by Emmons. We discuss the solution properties for the two problems, and show that both problems are NP-hard even for two machines. We further show that these problems become strongly NP-hard if the number of machines is allowed to be arbitrary. We provide a dynamic programming solution for the problems, the complexity of which indicates that the problems can be solved in pseudopolynomial time as long as the number of machines remains fixed. Finally, we present the results of a limited computational study. © 1994 John Wiley & Sons, Inc.     

On the solution of a stochastic bottleneck assignment problem and its variations

In this article, we study the stochastic version of the so-called bottleneck assignment problem. Our primary objective is to maximize the probability that the bottleneck value satisfies a specified target. Under general stochastic assumptions, we show that the solution in this case is easily obtained by solving a linear assignment problem. We next examine the situation where the target is to be minimized, given that the probability of satisfying the target exceeds a specified threshold. Finally, we address extensions to the original problem where a second objective is also considered.     

Framing Political Violence: Success and Failure of Religious Mobilization in the Philippines and Thailand

How do religious civil wars evolve? Many violent conflicts are fought between groups of different faiths. The paper argues, however, that religious differences rarely directly lead to conflict onset. Rather, the apparent religious dimension of many civil wars is a consequence of successful religious framing. Political and military leaders offer religious interpretations designed to legitimize the use of force and to mobilize believers to violent action. Such framing processes can be more or less successful, depending inter alia on the authority of the political and religious leadership, on the coherence and appropriateness of the frames, on the existence of persuasive counter-frames, and on the availability of communication infrastructures that allow for effective dissemination of religious frames. Comparing violent conflicts in the Philippines and Thailand, the paper shows that religious mobilization can fail along the theoretically predicted lines.     

Collective action and the common enemy effect

How is collective defence by players affected when they face a threat from an intelligent attacker rather than a natural threat? This paper analyses this question using a game-theoretic model. Facing an intelligent attacker has an effect if players move first and visibly set their defence strategies, thereby exposing any players who do not defend, and if the attacker is, moreover, not able to commit to a random attack. Depending on the parameters of the game, the presence of an intelligent attacker either increases the probability that players jointly defend (where such joint defence either does or does not constitute a utilitarian optimum), or decreases the probability that players jointly defend (even though joint defence is a utilitarian optimum).     

A dynamic allocation heuristic for centralized safety stock

An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.