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     

潜艇耐压壳动力学响应和声辐射研究概况与趋势

论述了流场中潜艇耐压壳自由振动、受简谐力或力矩作用和受冲击载荷情况下的动力学响应和声辐射研究概况 ,讨论了带有阻尼材料的复合潜艇耐压壳的动力学和声辐射研究情况 ,以及阻尼材料的破坏研究概况 ,并指出了今后的研究方向     

一类线性规划模型的求解方法

应用矩阵理论知识得到了一类特殊的线性规划模型的相关定理,给出了一种简便求解方法,讨论了求解方法的推广问题.     

屏蔽网遮挡电磁干扰效果评估研究

采用计算机仿真实验和实装对抗试验相结合的方法,完成了屏蔽网遮挡低仰角电磁干扰效果的评估。首先推导了绕射数学公式,建立了数学模型,并进行了计算机仿真实验。通过实装对抗试验检验了屏蔽网遮挡低仰角电磁干扰效果,通过比对分析仿真结果和实装对抗试验数据,结果基本一致,证明了采用的评估方法科学可行,给出了屏蔽网遮挡低仰角电磁干扰的效果。     

导弹贮存寿命预估的组合模型

在分析比较了几种寿命预估方法优缺点的基础上,针对单一预估方法在解决实际问题中所暴露的局限性,优选了GM-BPNN组合预估模型。该组合模型既利用了灰色预估理论具有所需要的样本数据少、原理简单、运算方便、短期预估精度高、可检验等优点,也发挥了神经网络并行计算、容错能力强、自适应能力强等优点。最后利用该组合模型对弹上某设备寿命进行了预估,取得了较好的预测效果。     

基于教育价值论视角探析兵团精神的教育价值

兵团精神是社会主义核心价值体系在兵团的具体体现,是兵团文化的核心与精髓,是指引兵团人实现兵团跨越式发展和长治久安的精神动力和智力支持。开展兵团精神教育是屯垦戍边和＂教育戍边＂事业进程中的一个重要课题。本文在教育价值论的视角下分析开展兵团精神教育所依托的优势资源,包括文化资源优势、特殊体制优势、理论指导优势及实践经验优势等,并在此基础上分别从本质属性、理论创新及学生发展三个方面进一步探讨了兵团精神的教育价值。     

隧道防火涂料的研究进展与发展趋势

对隧道防火涂料的组成、工作原理、生产工艺流程及技术指标等作了简要阐述,并对近年来国内外隧道防火涂料研究中存在的问题及今后的发展方向进行了探讨与展望,认为隧道防火涂料既要满足隧道防火设计的要求,又要具有较高的性价比及环保性。