Strategic defense and attack for series and parallel reliability systems: reply 1 to comment 1

Kovenock and Roberson's [2011] comment provides initial work which has the potential, when suitably extended, to advance the research frontier. Kovenock and Roberson's paper consists of three sections. The first section is an interesting introduction. The second section, titled ‘Model and Main Result,’ provides no contribution beyond Hausken [2008a]. It consists of Equations (1)–(10) which are equivalent to equations developed by Hausken, and Equation (11) which is equivalent to the utility requirements u???0 and U???0 provided after Equation (17) in Hausken. The third section provides interesting ideas about mixed-strategy equilibria that can be extended in future research.     

人本主义教育思想的德育解读与借鉴

人本主义教育思想在教育理念、教育目标、教育过程、教育方法、教育评价等方面均对德育具有借鉴意义。德育的目标指向：培育受教育者的完美人性;实施途径：强调受教育者的直接经验;德育模式：凸显受教育者的主体地位。     

在任职教育中开发学员任职经验的探讨

任职教育是在受训学员有着一定的任职经验基础上,提高岗位任职能力的一种短期培训。在教学实施过程中,必须注重挖掘任职经验,交流任职经验,再把经验上升为理论从而去指导部队实践。这种任职经验的开发,有利于在教学过程中按需施教,扩大师生的视野,丰富教学资源,实现理论与实践的统一,有效达成任职教育的目标。     

Information security: Designing a stochastic‐network for throughput and reliability

Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于灰熵方法的综合评估

以灰色系统理论中的灰靶技术为基础,在对原靶心度求解公式加以改进,给出了了一种系统效能的评定方法。首先用灰靶理论建立评定方法的数学模型,以能反映武器系统效能的战技性能指标构造各比较方案或模式的指标序列,进而求得各指标序列的标准模式。通过求各比较模式对标准模式的靶心度,并按大小排序,最终确定各比较方案效能的优劣。方法的计算过程为简单的代数运算,且不涉及传统方法中类似人工打分等带有一定主观性因素,所以,就同时满足可操作性和客观性而言,本方法较传统方法为优。     

F—K理论在堆积固体自燃火灾调查中的应用

堆积固体自燃火灾是常见多发火灾,由于其规模庞大、着火延迟期长等特点,难以进行全尺寸的模拟实验,为火灾预防和调查工作带来了一定的难度。基于F—K（Frank—Kamenetskii）理论,将小规模实验结果外推,从而预测或判断一定尺寸的堆积固体在一定的环境温度下自燃起火的危险性。     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008