灰色关联投影法的威胁排序算法

威胁评估与排序是作战系统和C4I系统必须具备的重要功能.结合多指标决策理论和灰色系统理论,提出了基于多指标决策灰色关联投影法的威胁排序算法.首先通过建立灰色关联判断矩阵将威胁排序转化为多指标决策问题;其次为缩小极端值的影响提出了基于信息熵的威胁指标权重算法;最后从矢量投影角度应用灰色关联投影值进行威胁排序;并分别研究了分辨系数和指标权重对威胁排序的影响.通过现代防空作战实例验证了算法的有效性和工程实用性.     

海上编队传感器管理架构研究

在信息化海战场,获取信息优势是保障作战胜利的基础之一,海上编队传感器管理是提升传感器探测整体效能,从而达成信息优势的关键环节.首先分析了海上编队传感器管理需求,包括组成结构、作用以及编队、平台、传感器各层级的管理需求;其次研究了海上编队传感器管理的总体架构,提出采用混合式的体系结构,设计了事前规划与实时调度2个方面的处...     

一种时空数据流中范围聚集查询共享策略

根据查询谓词的相似性来实现计算共享是数据流查询优化的主要策略之一,主要针对时空数据流中基于滑动窗口的范围聚集问题进行查询优化,采用时间片段和空间片段分别描述滑动窗口之间和空间范围谓词之间的重叠。提出基于时空分片技术将时空数据流元组分成互不重叠的时空片段。范围聚集查询首先基于时空片段生成中间结果,然后根据查询条件与时空片段的映射关系生成查询结果。实验表明,提出的时空分片策略能大大提高时空数据流中范围聚集查询的性能。     

On a class of multiple failure mode systems

The primary objective of this work is to introduce and perform a detailed study of a class of multistate reliability structures in which no ordering in the levels of components' performances is necessary. In particular, the present paper develops the basic theory (exact reliability formulae, reliability bounds, asymptotic results) that will make it feasible to investigate systems whose components are allowed to experience m ≥ 2 kinds of failure (failure modes), and their breakdown is described by different families of cut sets in each mode. For illustration purposes, two classical (binary) systems are extended to analogous multiple failure mode structures, and their reliability performance (bounds and asymptotic behavior) is investigated by numerical experimentation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 167–185, 2002; DOI 10.1002/nav.10007     

双层隔振系统隔振效果研究

隔振系统的隔振效果与被隔离体、中间质量块及基座中的弹性模态有很大的关系.在考虑被隔离体、中间质量块及基座为弹性体的前提下,研究了它们的弹性模态对系统隔振效果的影响,得出了设计隔振系统时要遵循的一些原则.     

Age replacement policies in two time scales

We develop and estimate optimal age replacement policies for devices whose age is measured in two time scales. For example, the age of a jet engine can be measured in the number of flight hours and the number of landings. Under a single‐scale age replacement policy, a device is replaced at age τ or upon failure, whichever occurs first. We show that a natural generalization to two scales is to replace nonfailed devices when their usage path crosses the boundary of a two‐dimensional region M, where M is a lower set with respect to the matrix partial order. For lifetimes measured in two scales, we consider devices that age along linear usage paths. We generalize the single‐scale long‐run average cost, estimate optimal two‐scale policies, and give an example. We note that these policies are strongly consistent estimators of the true optimal policies under mild conditions, and study small‐sample behavior using simulation. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 592–613, 2003.     

Nonparametric estimation of some quantities of interest from renewal theory

In this paper, confidence intervals are given for two quantities of importance related to renewal processes. For each quantity, two confidence intervals are discussed. One confidence interval is given for general, all‐purpose use. Another confidence interval is given which is easier to compute, but not of general use. The case where data are subject to right censorship is also considered. Some numerical comparisons are made. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 638–649, 2003.     

基于未确知测度的多目标决策方法及其应用

定义策略、目标和评判三个空间以及满足非负性、归一性和可加性的未确知测度函数,给出了适合于有序分割类评判空间寻优的最优决策准则,从而提出了一种未确知信息数学处理理论基础上的未确知测度决策方法,对含多因素特别是难以量化因素的决策问题寻优建立了一个合理、精细、分辨率高、计算简单高效的数学模型,用来求解多目标决策问题中的最优策略,并结合火力打击选择的一个实例分析,获得了较为成功的应用.     

调运问题中基于栅格模型的快速路径规划方法

针对调运路径规划这一问题,采用栅格模型表示环境地图,通过设定路径搜索方向权重,剔除不必要的搜索区域,提高了搜索效率.仿真结果表明,该算法能有效地提高路径搜索效率,并能搜索到最优路径.     

New product introduction against a predator: A bilevel mixed‐integer programming approach

We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009