尾流自导鱼雷射击诸元解算模型优化及解算方法

通过对舰船尾流和尾流自导鱼雷导引机制的研究,讨论了尾流自导鱼雷射击瞄点选择的依据和方法,分析原有模型的不足,建立了新的尾流自导鱼雷攻击解算模型.新模型修正了原有模型因简化和近似而造成的误差,使计算结果更加精确,并首次采用迭代的方法进行求解,通过实例验证了模型及解算方法的正确性.     

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

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

More military base closure? Considering the alternatives*

Despite multiple base closing rounds, the United States Department of Defense still has excess base capacity, and thus President Trump and high-level Defense Department officials are calling for more base closure through the Base Realignment and Closure (BRAC) process. However, another BRAC may not be the optimal solution, because simple base closure is not an efficient way to reduce surplus base capacity. Thus, Defense Department officials should consider other methods to reduce surplus capacity, including reduction in base size, leasing excess base property, or transferring it to another government agency for a variety of alternative uses. The surplus capacity issue also offers an opportunity to DOD to reassess base utilization, to update base requirements with current and future force structure. While BRAC focuses on American military bases, the process and alternatives also have international applications.     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

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.     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016