迭代法求解某型鱼雷射击诸元研究

分析了美国MK46-5型鱼雷的发射弹道,建立了迭代法求解模型,将鱼雷入水后的弹道进行了详细分析,并且综合考虑了该鱼雷发射后的各种误差,采用迭代的方法求解其转角,进而求解出一次搜索主航向、自导开机距离及直航搜索距离等射击诸元,采用迭代的方法进行求解,射击参数的解算不仅提高了精确度,而且易于系统工程上实现.研究成果对进一步研究其作战作用问题打下了基础,对提高水面舰艇反潜防御能力和生存概率具有重大的现实意义.     

A hard knapsack problem

In this article we develop a class of general knapsack problems which are hard for branch and bound algorithms. The number of alternate optimal solutions for these problems grows exponentially with problem parameters. In addition the LP bound is shown to be ineffective. Computational tests indicate that these problems are truly difficult for even very small problems. Implications for the testing of algorithms using randomly generated problems is discussed.     

超图约束和改进归一化互相关方法相结合的图像配准算法

为提高图像配准算法的精度和适应能力,将超图约束和改进归一化互相关方法应用于图像配准。利用Hessian-Affine检测得到的仿射不变区域代替固定窗口来改进归一化互相关方法,获得初始匹配点对;通过马氏距离计算超边间的相似度,采用超图约束计算匹配分数对匹配对进行排序;利用分数高的部分匹配点对初始化变换矩阵,通过过滤匹配对来循环更新得到最优变换矩阵实现配准。实验结果表明,该方法具有较好的匹配和剔除错误匹配的效果,在不同类型的图像配准中也有较好的配准效果。     

Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

Innovation in China’s Defense Technology Base: Foreign Technology and Military Capabilities

ABSTRACT

China’s defense science, technology, and industrial system has been undergoing a far-reaching transformation over the past two decades and the single biggest factor behind this turnaround is the role of external technology and knowledge transfers and the defense industry’s improving ability to absorb these inputs and convert into localized output. China is pursuing an intensive campaign to obtain defense and dual-use civil–military foreign technology transfers using a wide variety of means, which is explored in this article.     

喷嘴结构对高压水射流影响及结构参数优化设计

喷嘴是产生高压水射流的关键部件,其结构形式对射流动力学性能有很大影响。以圆柱形喷嘴为对象,进行喷嘴结构对高压水射流的影响分析及结构参数优化设计。采用两相流计算流体力学模型进行喷嘴内外的射流流场分析。为节省计算资源,在优化设计时引入Kriging代理模型替代计算流体力学模型。分别采用改进的非劣分类遗传算法和基于分解的多目标进化算法进行单目标和多目标优化设计。研究结果表明:直线型喷嘴总体性能较优,凹型喷嘴的次之,凸型喷嘴性能最差。以直线型喷嘴为设计对象,以射流初始段长度和流量为目标,得到了单目标和多目标优化设计结果。单目标优化时,两个指标较基准外形分别提高14.71%和27.56%。多目标优化时,优化得到的半锥角处于[15.4°,89.8°]区间内。运用代理模型和进化算法的全局优化方法在进行喷嘴的优化设计时是有效的。     

基于改进线性二次型调节器的近地轨道编队卫星鲁棒控制

为解决编队卫星在近地空间复杂力学环境特别是地球非球形摄动作用下构型易发散的问题,给出一种基于改进线性二次型调节器的编队卫星构型控制方法。该方法先估计近地空间编队卫星构型设计时由未建模摄动力引起的误差最大有界范围,再利用误差最大有界范围的二范数改进经典的线性二次型调节器控制方法,提高经典线性二次型调节器控制器在控制编队卫星构型时的鲁棒性。为评价改进方法的有效性,给出了一种鲁棒性强弱的量化评判标准。仿真结果表明,改进的方法可以大大提高经典线性二次型调节器方法的鲁棒性,增强编队卫星控制方法对各种不确定项的抵御能力。     

武器装备作战效能灰色聚类评估

武器装备作战效能的指标是多样的,而且意义不同、量纲不同,且指标的实现值往往在数量上悬殊很大,如何在这种情况下比较好的解决作战效能综合评估问题,提出了基于灰色定权聚类和三角白化权函数的灰色聚类评估方法解决此问题,给出了应用的一般步骤。以某型水陆坦克为例,对其改装前后的作战效能进行了对比分析,并为其将来进一步改进提出了建设性建议。     

狭长受限空间火灾临界可燃距离实验研究

油料洞库的安全一直是各级主管部门非常关心的问题。狭长受限空间是地下建筑及地下油料洞库的关键结构,针对狭长受限空间发生火灾能否持续燃烧问题,在公称直径分别为50mm、100mm、150mm和250mm的模拟狭长受限空间上,以柴油作为燃烧工质,置于尺寸、形状各异的3种油盘中,进行了系统实验研究与分析,证实了狭长受限空间临界可燃距离的存在,并在此基础上,提出了计算方法,得出一些有益的结论,对研究油料洞库消防新技术有一定的价值。