信源数动态变化的一种稳健超定盲分离算法

针对大多数现有盲分离算法都假定信源数已知,分析了信源数未知且动态变化时的超定盲分离(接收天线数多于信源数)算法,通过奇异值分解在线估计信源个数,并修正自适应神经网络的维数。文章在经典Cichocki-Unbenauen算法中加入动量项,设置可变步长,使分离性能得到较大的改进,同时避免训练陷入局部最小。与文献[1]新提出的ANA算法相比,仿真结果证明本文算法具有更快的收敛速度和更小的稳态误差。     

The Harmful and Residual Effects on Civilians by Bombing Dual-purpose Facilities

This article addresses what we owe to the civilians of a state with which we are militarily engaged. The old notion of noncombatant immunity needs to be rethought within the context of both human rights and into the postwar phase. No doubt, civilians will be killed in war. However, much more can be done during and after the fighting to protect civilians’ basic human rights from the ills of war. I argue for making belligerents accountable ex post by requiring them to repair destroyed dual-purpose facilities that are essential for securing basic human rights of the civilian populace. I argue also that a belligerent’s targeting decisions should be reviewed ex post by an impartial commission.     

三重化交错并联DC/DC变换器优化控制研究

设计了一种适用于大容量储能系统功率控制的三重化交错并联双向DC/DC变换器。针对具有强非线性、滞后和参数存在漂移的DC/DC变换器,采用平均状态空间法进行了数学建模及分析,提出了基于电流和电压的双闭环PID控制方案,使用了幅相裕度法对PI参数进行整定,最后设计实验验证了所采用的控制策略。实验结果表明,变换器在较宽的工作范围内实现了零电压开关工作,消除了动态电流变化导致的过充和过放,在较大负载变化范围内实现了95%以上的效率。     

飞机发动机关键系统智能故障诊断方法

飞机发动机是一个非常复杂的大系统,由于其结构复杂,工作环境恶劣,对其关键系统的故障进行准确诊断始终是困扰业界的技术瓶颈之一。提出了采用EMD小波阈值降噪与主元分析相结合的方法,对飞机发动机气路系统故障诊断进行了深入研究。针对某型真实飞机发动机进行测试试验采集的气路多参量数据,首先采用经验模态分解(Empirical Mode Decomposition,EMD)对气路系统各参量信号进行EMD分解,然后采用软阈值函数对其进行降噪,并进行信号重构,从而可得到飞机发动机气路工作状态有效数据。在此基础上,设计了飞机发动机气路系统主元分析故障诊断模型,并结合预处理得到的飞机发动机气路有效数据,运用所设计的主元分析故障诊断模型对飞机发动机进行故障诊断技术研究。研究结果表明,所提出的方法能够很好地诊断出飞机发动机气路系统实际运行时所出现的故障,具有重要的实际应用价值,并有广泛的应用前景。     

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     

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     

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),对两个四元数长矩阵给出了其同时复对角化的充要条件,进一步对一个四元数长矩阵集合,针对其同时复对角化问题,给出了一系列充分必要条件.     

Dual-Ignition Musket Locks Including a Matchlock — a Note on their Design and Utility

Abstract

A review is presented of dual-ignition musket locks, including a matchlock, to identify the key design variants and their subtleties, and to initiate a discussion on their utility.