基于时频图像三维熵特征的雷达信号识别

针对雷达信号识别算法存在着准确率低以及抗噪性差的问题,提出基于时频图像三维熵特征的雷达信号识别算法。该方法对雷达信号时频变换后得到的时频灰度图提取其香农熵(Sh En)、奇异谱熵(Ss En)和范数熵(No En),并将三维熵值作为信号识别的特征向量,采用支持向量机实现信号的分类识别。仿真实验表明,提出的算法能够在低信噪比下得到较高的正确识别率。     

基于数据场的作战单元价值评估模型

作战单元价值是目标选择的重要依据。根据作战单元在作战体系中的效用和影响,提出作战单元的属性价值和级联价值及其量化方法,利用层次分析法和数据场理论,分别评估作战单元的属性价值和级联价值,建立作战单元价值评估模型,并进行仿真分析,验证该评估模型的有效性。     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016     

基于综合集成赋权法的导弹攻击目标价值分析

合理选择打击目标是导弹攻击作战中的首要问题,分析了目标价值影响因素,改进了信息熵权法,采用目标偏好的主观赋权法和综合集成赋权法确定因素权重,并结合模糊综合评估的方法对目标价值进行分析排序,给出了算例实现,为解决导弹攻击作战过程的目标价值评估排序问题提供决策依据。     

基于指标体系的火力分配模型研究

火力分配是现代作战中的关键问题,如何有效地进行火力分配对高效发挥火力、提高作战效能、争取作战的主动权具有重大意义。根据评价指标筛选原则,建立了一个反映目标价值的多层次评价指标体系,提出了火力分配的GEM-AHP计算模型。实例研究表明,该模型对多指标决策的火力分配问题具有很好的适用性。     

On the hierarchy of γ‐valid cuts in global optimization

Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 ( 17 ), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

捷联惯导大失准角误差模型在快速传递对准中的应用

针对快速传递对准中主子惯导相对姿态存在大角度的情况,推导了捷联惯导大失准角误差模型.该模型采用欧拉角表示姿态误差,并用欧拉运动方程准确描述其传播规律.鉴于该模型中的姿态观测方程是复杂的非线性函数,采用无需求导的UKF算法,并采用奇异值分解(SVD)解决方差阵的病态问题.仿真结果表明,该算法在小角度误差条件下滤波精度优于线性模型,并且适用于大角度误差条件.     

四元数长方矩阵的同时复对角化

利用四元数矩阵的奇异值分解(SVD),对两个四元数长矩阵给出了其同时复对角化的充要条件,进一步对一个四元数长矩阵集合,针对其同时复对角化问题,给出了一系列充分必要条件.