Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017     

Peace enforcement in Africa: Doctrinal distinctions between the African Union and United Nations

When the United Nations (UN) Security Council needs to authorize a peace enforcement operation in Africa, its partner of choice is the African Union (AU). Africa has developed significant peace operations capacity over the past decade. In addition to deploying eight AU operations, Africa now contributes 50% of all UN peacekeepers. African stability operations, like its mission in Somalia, are often described as peace enforcement operations. In this article, I question whether it is accurate to categorize African stability operations as peace enforcement? I answer the question by considering what the criteria are that are used to differentiate between peace enforcement and peacekeeping operations in the UN context. I then use the peace enforcement criteria to assess whether AU stabilization operations would qualify as peace enforcement operations. In conclusion, I consider the implications of the findings for the strategic partnership between the AU and the UN.     

用于消除缓变伪距偏差的抗差扩展卡尔曼滤波方法

针对卫星导航系统中伪距观测量存在缓变伪距偏差,导致定位精度下降的问题,提出了一种基于滑动积累的抗差扩展卡尔曼滤波方法。该方法在抗差扩展卡尔曼滤波算法的基础上,通过滑动窗口内多个历元残差矢量的累积,增大标准化残差矢量的伪距偏差,来提高对缓变伪距偏差故障的抗差能力。仿真表明,该方法能有效消除或者减弱微小伪距偏差和缓慢增长伪距偏差造成的位置误差,与传统抗差扩展卡尔曼滤波算法比较,定位精度得到明显改善。     

直接力/气动力复合控制系统鲁棒稳定性分析

脉冲发动机作为直接力与空气舵复合控制能有效提高导弹的快速性和末端大过载机动能力。由于脉冲发动机的喷流干扰会对复合控制系统的稳定性产生影响,本文在考虑脉冲发动机自身喷流因子效应以及对导弹气动干扰的情况下,把直接力喷流作用等效为弹体的气动力进行建模,并结合复合控制系统的性能指标以及稳定判据,对一类复合控制自动驾驶仪的鲁棒稳定性进行了分析,给出了直接力喷流作用下复合控制系统的满足性能要求的稳定边界。     

基于二阶锥规划的MIMO雷达稳健自适应波束形成

针对MIMO雷达自适应波束形成中期望目标导向矢量的失配问题,提出了一种基于二阶锥规划(SOCP)的稳健自适应波束形成算法。该算法首先将1个MN维(M,N分别为发射和接收阵元数)的权矢量分解成2个低维(1个M维和1个N维)权矢量的Kronecker积,然后分别限制实际的目标发射导向矢量和目标接收导向矢量与假定的导向矢量之间的误差范数的边界,通过优化最差性能,利用SOCP求得分解后的2个权矢量,最后再合成原权矢量。通过降维处理,算法在保证波束形成器性能的基础上,有效地降低了运算复杂度。仿真结果验证了算法的有效性。     

一类不确定时滞混沌系统的全局鲁棒自适应神经网络同步控制器设计

研究一类不确定时滞混沌系统的全局鲁棒自适应神经网络同步控制器设计,其系统中的不确定时滞项不是简单的线性有界条件,而是允许其存在高阶项,因此具有全局特性．在控制器的设计上;首先通过选取合适的径向基函数（RBF）神经网络的权向量去逼近时滞系统中的未知连续有界部分;然后在RBF神经网络输出的基础上,选用一个鲁棒自适应控制器来趋近时滞系统的不确定部分;同时,利用Lyapunov稳定性理论对混沌同步的条件给出了论证;最后,数据仿真的结果表明该方法的有效性．     

A mathematical programming approach for improving the robustness of least sum of absolute deviations regression

This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于离散余弦变换的数字水印技术

针对当前在开放的网络环境下对数字产品版权保护和认证来源及完整性的需求,在人们寻求办法保护他们在网络上传输的信息时,数字水印变得越来越重要,提出了基于离散余弦变换的数字图像水印方案。利用离散余弦变换嵌入的数字水印具有感官上的不可见性,并且原图像信息丢失量少,根据离散余弦变换抗几何变换的性质,使水印图像能够抵抗缩放和剪切等一系列攻击。具有很好的鲁棒性。并且能使用密钥较高精度地恢复水印。     

针对旋转和平移的一种电子稳像算法

提出了一种新的基于Fourier-Mellin的电子稳像算法,用于消除由于推扫平台系统姿态不稳所造成的图像抖动。采用Fourier-Mellin算法和相位相关算法求取待稳定图像帧与参考图像帧之间的旋转角度和缩放及平移参数,并通过校正一组抖动的图像帧来验证所提出的算法。实验结果表明算法很好地估计并补偿了旋转和平移运动,能够满足一般要求。     

数字位置差动瞄准线独立控制系统原理分析与试验研究

基于数字伺服技术介绍了自行高炮数字位置差动瞄准线独立控制系统结构原理,给出了传递函数分析及试验研究结果。指出该系统具有动态精度高、通用性强等特点。