海战场态势评估问题的研究

对海战场综合态势进行态势评估和威胁分析是信息融合系统的最高层级,态势评估结果将对指挥员的指挥决策起到非常重要的作用。根据海军作战理论分析了海战场态势的表示方法,并基于模板方法设计了一种战场当前态势与模板数据库中态势进行匹配的算法。该算法特别适用于高层推理如态势或威胁评估。     

Discrete stochastic optimization using variants of the stochastic ruler method

We present two random search methods for solving discrete stochastic optimization problems. Both of these methods are variants of the stochastic ruler algorithm. They differ from our earlier modification of the stochastic ruler algorithm in that they use different approaches for estimating the optimal solution. Our new methods are guaranteed to converge almost surely to the set of global optimal solutions under mild conditions. We discuss under what conditions these new methods are expected to converge faster than the modified stochastic ruler algorithm. We also discuss how these methods can be used for solving discrete optimization problems when the values of the objective function are estimated using either transient or steady‐state simulation. Finally, we present numerical results that compare the performance of our new methods with that of the modified stochastic ruler algorithm when applied to solve buffer allocation problems. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

THE DEMOCRATIC REPUBLIC OF CONGO

The armed conflict in the DRC has been characterised by appalling, widespread and systematic human rights violations. It varies from civil war to a war between national armies. Much of the conflict falls between these two categories due to the involvement of foreign troops in civil strife, as well as foreign rebel groups fighting their home government's troops but on Congolese soil. The most pressing need is to cease hostilities and address the humanitarian situation in the country. Questions of justice and accountability, and issues relating to the rule of law will have to be addressed soon in order to achieve a durable peace in the country and in the region. Since there are links between different conflicts in the region, a broader solution should preferably be found. However, this would further complicate an already difficult proposition. Efforts limited to the DRC would be more feasible and could lead to similar measures in other conflict ridden countries in the region. This essay therefore discusses the available processes for justice.     

ON RATIONAL CHOICE THEORY AND THE STUDY OF TERRORISM

When rational choice theory is applied to the study of terrorism, it is important that attention be given to the derived principles of constrained utility maximization. Particularly useful is the Slutsky equation, which rigorously analyzes the quantity response in one activity to a price change in another. By directing attention to assumptions and/or information about compensated cross price elasticities, expenditure shares, and income elasticities, the Slutsky equation can provide critical guidance in both theoretical and empirical analysis.     

潜在故障状态可测的一种故障检查模型

从系统的功能故障状态和潜在故障状态两方面讨论了故障检查模型,基于延迟时间模型推导了系统的期望可用度模型并对其适用性进行了讨论与验证。     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Doubly Stochastic Sequential Assignment Problem

This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016