视频编码标准H．264运动矢量搜索算法

高清视频的信息量巨大,传输比较困难。 H．264作为视频压缩的主流标准,可以有效去除视频的冗余信息,提高视频的网络传输能力。针对H．264中运动估计算法耗时严重的问题,提出一种新的X型搜索算法。 X型算法由粗到细地进行搜索,先以X型快速搜索确定运动矢量的可能范围,然后在可能范围内进行局部全搜索,最终确定运动矢量。试验结果表明,X型搜索能够在保证视频质量的情况下大幅度缩短编码时间,有效提高运动估计算法的效率,兼顾了速度与精度,为高清视频的实时传输提供了保障。     

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     

Level workforce planning for multistage transfer lines

In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016     

伴随维修组维修模型聚合方法

面向装备维修保障系统的多分辨率建模问题,提出了一种装备维修模型的聚合方法,为装备维修保障系统模型的聚合研究提供了一种新的思路。该方法通过聚合故障输入和推理维修状态实现维修模型的聚合。最后通过基于MATLAB的仿真实验验证了该方法的可行性。通过实例验证可以看出,该方法缩短了仿真时间,减少了复杂系统底层建模的工作量。     

一种新型的目标分配形式及算法

提出了一种新型的目标分配形式--顺序攻击目标分配形式,并以地空导弹拦截攻击机机群为研究对象,给出了均匀目标分配形式和顺序攻击目标分配形式,以及在机群无干扰武器和有干扰武器状态下,地空导弹拦截效果的算法模型.数值分析表明,顺序攻击目标分配形式有较好的攻击效果.     

Estimating distribution functions from partially observed samples

Suppose that some components are initially operated in a certain condition and then switched to operating in a different condition. Working hours of the components in condition 1 and condition 2 are respectively observed. Of interest is the lifetime distribution F of the component in the second condition only, i.e., the distribution without the prior exposure to the first condition. In this paper, we propose a method to transform the lifetime obtained in condition 1 to an equivalent lifetime in condition 2 and then use the transformed data to estimate F. Both parametric and nonparametric approaches each with complete and censored data are discussed. Numerical studies are presented to investigate the performance of the method. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 521–530, 2000     

Investigation on the spatial distribution characteristics of behind-armor debris formed by the perforation of EFP through steel target

The behind-armor debris (BAD) formed by the perforation of an EFP is the main damage factor for the secondary destruction to the behind-armor components. Aiming at investigating the BAD caused by EFP, flash X-ray radiography combined with an experimental witness plate test method was used, and the FEM-SPH adaptive conversion algorithm in LS-DYNA software was employed to model the perforation process. The simulation results of the debris cloud shape and number of debris were in good agreement with the flash X-ray radiographs and perforated holes on the witness plate, respectively. Three-dimensional numerical simulations of EFP's penetration under various impact conditions were conducted. The results show that, an ellipsoidal debris cloud, with the major-to-minor axis radio (a/b) smaller than that caused by shaped charge jets, was formed behind the target. With the increase of target thickness (h) and decrease of impact velocity (v₀) and obliquity (θ), the value of a/b decreases. The number of debris ejected from target is significantly higher than that from EFP. Based on the statistical analysis of the spatial distribution of the BAD, An engineering calculation model was established considering the influence of h, v₀ and θ. The model can with reasonable accuracy predict the quantity and velocity distribution characteristics of BAD formed by EFP.     

多传感器任务分派的快速启发式规划新算法

在多目标多传感器管理中经常采用的线性规划算法中,随着传感器个数和目标个数的增加,计算量会爆炸式增长,使得跟踪系统不能实时计算,为此,根据传感器管理中线性规划的特点,提出了一种快速启发式算法,考虑组合中的传感器个数将组合的分配效用转化为权重,递推分配权重最大的组合,逐步减小组合和目标的个数.证明了权重最大的组合分派能实现组合中的传感器的最大效用.仿真结果表明该算法在与采用线性规划方法的跟踪精度相当的情况下,能有效地减小计算量.     

基于蚁群算法的舰艇编队多目标识别模型

现代海战中,舰艇编队面临的威胁目标复杂多样,正确识别目标是做出准确的军事决策的前提。基于蚁群算法的并行最优化特点,引入近邻函数,将目标识别问题转化为最优化聚类问题,提出了一种新的多目标识别算法。实验结果表明此方法是有效的,具有一定的军事现实意义。     

并行基因组合型遗传算法求解防空部署优化问题研究

针对防空部署研究的特点,探讨遗传算法求解防空部署优化问题。分析了传统遗传算法求解武器部署优化问题的缺点,提出了并行的基因组合型改进遗传算法,克服了编码不唯一和基因重码的现象,提高了搜索速度和解的质量;利用启发式信息缩小了解空间,并保证了算法寻优的每个个体都是可行解;对遗传操作算子进行了改进,克服了整数编码固有的缺点。该方法应用于求解防空部署优化问题中得到了较好的结果。