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     

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     

希尔伯特-黄变换在脉冲涡流信号消噪与识别中的应用

针对传统方法无法有效识别不同尺寸细小裂纹所产生的脉冲涡流信号,提出一种基于希尔伯特-黄变换的脉冲涡流信号消噪与识别算法。对脉冲涡流信号进行集成经验模态分解并通过归一化自相关函数及其方差特性分选出含有噪声的本征模态函数;对含噪声的本征模态函数进行阈值消噪并与未做处理的本征模态函数重构成无噪声信号;对无噪声信号进行希尔伯特-黄变换并计算出希尔伯特边际谱;根据希尔伯特边际谱的差异识别出不同细小尺寸的表面与下表面裂纹。实验结果表明了所提方法的有效性,经过集成经验模态分解消噪,消除了噪声对脉冲涡流信号的干扰;而基于希尔伯特-黄变换的方法则能够有效识别出不同尺寸的裂纹。     

运用改进正交匹配追踪算法精确估计跳频信号跳变时刻

现有方法得到的跳变时刻精度不高、抗干扰能力较弱,为此提出一种运用改进正交匹配追踪算法的跳变时刻精确估计方法。根据跳频信号原理建立跳变时刻估计的稀疏表示模型,用改进正交匹配追踪算法求解该模型,获取跳变时刻。理论分析和仿真结果证明该方法能够获取高精度的跳变时刻,估计性能方面优于现有算法。     

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     

末段多层反导作战的任务分解

任务分解是末段多层反导任务规划的基础和前提。为有效提高任务的执行效率,界定了作战任务分解的基本概念,改进了任务分解的方法,提出了任务分解的基本原则,建立了作战任务属性数据表,明确了子任务的结构关系、优先顺序和资源需求。任务分解进一步明晰和细化了反导作战任务,可降低决策的复杂性,提高作战资源的利用效率。     

舰艇编队保障性指标的分解方法

针对目前保障性分配仅限于单船的问题,借鉴基本可靠度的分配思想,通过对舰艇编队使用可用度与单船使用可用度关系的分析,建立了舰艇编队保障性指标分解模型,并采用多因子评分系数分配法来确定舰艇编队保障性指标的权重。最后,通过实例给出了具体分解操作步骤,证明了该模型的正确性和有效性。分解结果可优化舰艇编队的编成,为编队里同型单船保障性指标的确定提供修正,同时为完善舰艇编队的综合保障工程提供参考。     

非高斯背景噪声下的微弱磁异常信号检测算法

针对传统的OBF分解算法在非高斯噪声下检测性能较差的问题,提出了一种带通滤波结合OBF分解的磁异常信号检测算法.首先,根据磁异常信号的频域特征,设计了Parks-McClellan最优FIR滤波器.通过对舍噪信号的带通滤波,实现对非高斯噪声的近似高斯化,同时最大程度地保留磁异常信号的信息.然后,对滤波后的信号进行OBF...     

基于小波包分解和样本熵的电磁干扰分析方法

为了定量分析不同状态下电磁环境的变化,并有效提取电磁环境变化的干扰特征,提出了基于小波包分解和样本熵的电磁干扰分析方法.首先,时电磁环境的样本信号进行小波包分解,然后分别计算分解后备频带信号的能量谱系数和样本熵,通过能量谱系数和样本熵这两个指标的对比,综合判断电磁环境是否发生变化.仿真分析表明:样本熵可以弥补能量谱系数...     

采用包络检波去除SISAR直达波干扰的新方法

为了去除直达波干扰,从强的直达波干扰背景中有效提取SISAR侧影成像的目标全息信号,提出了对接收的含有目标全息信号和强直达波的混合信号直接进行包络检波,然后通过对检波后的输出进行时域的正交分解,恢复目标的全息信号的新方法.仿真结果验证了理论分析的正确性.