What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Performance and properties of Q‐Statistic monitoring schemes

In this article, we study the Shewhart chart of Q statistics proposed for the detection of process mean shifts in start‐up processes and short runs. Exact expressions for the run‐length distribution of this chart are derived and evaluated using an efficient computational procedure. The procedure can be considerably faster than using direct simulation. We extend our work to analyze the practice of requiring multiple signals from the chart before responding, a practice sometimes followed with Shewhart charts. The results show that waiting to receive multiple signals severely reduces the probability of quickly detecting shifts in certain cases, and therefore may be considered a risky practice. Operational guidelines for practitioners implementing the chart are discussed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

一种舰船目标一维距离像识别的新方法

提出了一种基于傅里叶-梅林变换和二叉树支持向量机相结合的舰船目标一维距离像识别方法。该方法充分利用了傅里叶-梅林变换具有的时移与尺度不变性和支持向量机在小样本分类中的优势,可以改善目标的特征稳定性,提高识别性能。针对多类舰船目标的识别,提出采用聚类分析中的均值距离来生成二叉树,将分类器分布在各个节点上,构成了多类支持向量机,减少了分类器数量和重复训练样本的数量。对4类舰船目标仿真实验的结果表明,该分类方法具有较高的识别性能、较快的识别速度。     

舰机协同海上搜寻关键问题研究?

直升机应用于海上搜救可以大大提高搜救速度和成功率。针对水面舰船和直升机的使用特点,分析了在海上搜救中实施舰机协同的必要性,研究了直升机在水面舰船协同下实施海上搜寻的搜寻方式,建立了直升机与舰船协同机动的数学模型,对实际的海上搜寻工作具有较高的实用价值。     

基于QIPF的弱目标检测前跟踪算法

针对低信噪比条件下弱目标检测跟踪问题,提出一种拟蒙特卡罗智能粒子滤波检测前跟踪算法(Quasi-Monte Carlo Intelligent Particle Filter Track Before Detect,QIPF-TBD)。首先,该算法采用拟蒙特卡罗技术改善探测空间中粒子分布的均匀性;其次,通过对更新阶段的粒子进行交叉变异等操作,提高粒子重采样之后的多样性。与同类算法的仿真分析表明,所提方法能有效改善低信噪比目标的检测概率和跟踪精度。     

The solution to an open problem for a caching game

In a caching game introduced by Alpern et al. (Alpern et al., Lecture notes in computer science (2010) 220–233) a Hider who can dig to a total fixed depth normalized to 1 buries a fixed number of objects among n discrete locations. A Searcher who can dig to a total depth of h searches the locations with the aim of finding all of the hidden objects. If he does so, he wins, otherwise the Hider wins. This zero‐sum game is complicated to analyze even for small values of its parameters, and for the case of 2 hidden objects has been completely solved only when the game is played in up to 3 locations. For some values of h the solution of the game with 2 objects hidden in 4 locations is known, but the solution in the remaining cases was an open question recently highlighted by Fokkink et al. (Fokkink et al., Search theory: A game theoretic perspective (2014) 85–104). Here we solve the remaining cases of the game with 2 objects hidden in 4 locations. We also give some more general results for the game, in particular using a geometrical argument to show that when there are 2 objects hidden in n locations and n→∞, the value of the game is asymptotically equal to h/n for h≥n/2. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 23–31, 2016     

基于损伤树及损伤征兆集的战场损伤定位研究

建立了基于损伤树的知识表示、知识推理模型及损伤树评估框架,利用损伤树各节点的损伤征兆集,进行装备战场损伤定位,较好地利用了装备专家的领域知识,提高了战场损伤评估的准确性和效率。     

多特征空间下的支持向量机及其在图像识别中的应用

分别在主成分分析(PCA)、独立成分分析(ICA)和线性鉴别分析(LDA)所构造的特征空间下用模糊支持向量机(FSVM)进行人脸识别。同时,提出了一种改进的FSVM方法,即利用FSVM和多叉决策树相结合的思想来设计人脸分类器,从而使FSVM分类器的速度得到了大幅度的提高。通过在ORL人脸库上的实验结果表明,该算法是有效的。     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于MCMC方法的Lorenz混沌系统的参数估计

基于贝叶斯理论,提出用马尔科夫链蒙特卡罗(MCMC)方法来估计Lorenz混沌系统的未知参数。首先导出了未知参数分布规律的后验概率密度函数;接着采用自适应Metropolis算法构造Markov链;然后截取收敛的链序列,计算混沌系统参数的估计值。数值试验表明:该方法具有很高的估计精度,同时具有较好的抗噪声性能。