战场态势一致性技术专题讲座(一) 第1讲 战场数据融合概述

文章介绍了数据融合定义和模型发展历程,概述了基于JDL模型的五级战场数据融合模型及各层功能,简要分析了用于多目标跟踪的融合系统结构和关键技术,概括了数据融合系统评估、理论研究和应用现状。     

基于CA与MAS的军用装备维修保障建模仿真

在装备维修保障建模仿真中引入元胞自动机(CA)与多智能体系统(M A S),提出了基于CA与M A S的装备维修保障系统双层结构建模框架,设计了系统的环境模型和主要A gen t模型。采用N etlogo平台开发了装备维修保障仿真系统,通过实例仿真分析了不同维修协作策略对系统整体效能的影响方式及程度,得出信息化条件下通过实施区域化的协作保障可以提高维修保障效率、节约维修资源的结论。     

灰色系统理论的装备维修保障系统协调性分析

针对已有的协调度计算方法的不足,结合灰色系统理论的GM(1,N)模型和灰色关联分析,提出了基于灰色系统理论的协调度计算方法,对维修保障系统十年间的协调发展情况作以分析;并通过计算各因素的灰关联熵和系统综合协调度,得出了系统的信息资源方面和物质资源方面与系统其他方面发展缺乏协调性的结论.证明应用灰色系统理论建立基于小样本数据的模型进行的协调性分析可以得到较为准确合理的结果.     

基于实时端到端自适应位与功率分配O-OFDM传输性能

首次对实时的端到端自适应的位与功率分配O-OFDM收发性能进行了实验测试和比较,得出结论是低复杂度的功率分配相比较于高复杂度的位功率分配,性能下降了大约7%.     

Search and the introduction of improved technologies

Modeling R&D as standard sequential search, we consider a monopolist who can implement a sequence of technological discoveries during the technology search process: he earns revenue on his installed technology while he engages in R&D to find improved technology. What is not standard is that he has a finite number of opportunities to introduce improved technology. We show that his optimal policy is characterized by thresholds ξ_i(x): introduce the newly found technology if and only if it exceeds ξ_i(x) when x is the state of the currently installed technology and i is the number of remaining introductions allowed. We also analyze a nonstationary learning‐by‐doing model in which the monopolist's experience in implementing new technologies imparts increased capability in generating new technologies. Because this nonstationary model is not in the class of monotone stopping problems, a number of surprising results hold and several seemingly obvious properties of the stationary model no longer hold. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Allocating capacity in parallel queues to improve their resilience to deliberate attack

We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Evaluation of infrared camouflage effectiveness via a multi-fractal method

This paper reports an alternative approach to the evaluation of infrared camouflage effectiveness via a multi-fractal method. By calculating multi-fractal spectra of the target region and the background re-gions in an infrared image, the spectrum shape features and the discrete Fréchet distances among these spectra were used to analyze the camouflage effectiveness of the target qualitatively and quantitatively, and the correlation coefficients of the spectra were further used as the index of camouflage effectiveness. It was found that the camouflaged target had better camouflage effectiveness than the target without camouflage in the same one background, and the same one camouflaged target had different camouflage effectiveness in different backgrounds. On the whole, the target matching well with its background had high camouflage effectiveness value. This approach can expand the application of multi-fractal theory in infrared camouflage technology, which should be useful for the research of infrared camouflage mate-rials, the design of camouflage patterns as well as the deployment of military equipment in battlefield.