战术互联网模拟训练系统军事总体问题研究

军事总体设计是技术总体设计的基础,是模拟训练系统设计的首要任务.对于战术互联网模拟训练系统军事总体设计中的有关问题,采用对比和比较法,对系统军事总体需求和框架进行了研究,明确了战术互联网模拟训练系统的训练方式、使用流程、功能体系等内容,为下一步系统的技术总体方案设计以及实现奠定了良好基础.     

参数化时频分析的匀加速旋转目标ISAR成像

对于机动目标,运动补偿后目标相对于雷达的转动不能近似为匀速转动,而是更接近于匀加速转动,此时传统的距离多普勒成像算法不能得到很好的成像结果.分析总结了几种针对非匀速转动的时频联合分析算法,提出了一种基于参数化时频分析-AGCD快速算法的匀加速旋转目标成像算法,仿真表明了该算法具有精度高、速度快且无交叉项的优点,比原有的一些算法有较大的改进.     

影响图建模算法的改进

影响图建模方法是一种规范化的复杂系统建模方法,其实质是将表征复杂系统的参量及参量间的耦合关系进行分类,并以此为基础建立系统的数学模型.影响图建模算法就是将系统的参量及参量间的耦合关系进行分类的算法.目前使用的算法是James R.Burns于1979年提出的.该算法仅考虑了最小的反馈回路,而没有考虑影响图中存在的一般反馈回路,且一些操作造成了不必要的循环.在分析该算法的基础上,考虑了一般的反馈回路,并对原算法的操作步骤进行了优化重组.     

Estimation from binomial data with classifiers of known and unknown imperfections

Observations from inspection by a “test” method and a standard method are combined to provide estimators of population proportion, and of probabilities of misclassification for the test method. Results of Hochberg and Tenenbein [3] and of Albers and Veldman [1] are extended to the case where the standard method is not perfect, but its misclassification probabilities have known values. Both moment and maximum-likelihood estimators are considered and some asymptotic properties of the resulting estimators are compared.     

Approximating nonstationary two-priority non-preemptive queueing systems

An approximation for analyzing transient and nonstationary two-priority non-preemptive queueing systems is presented. This system has a three-dimensional state space, and through use of state-space partitioning in conjunction with use of conditional surrogate distributions with constant parameters an approximation is designed. Regardless of system capacity K, the approximation requires the numerical solution of only ten differential equations, compared to the K² + K+1 Kolmogorov-forward equations required for the classic solution. Time-dependent approximations of the mean number of entities of type i and of the probability of a type-i entity being in service are obtained. Empirical test results over a wide range of systems indicate the approximation is quite accurate.     

The orienteering problem

Orienteering is a sport in which start and end points are specified along with other locations. These other locations have associated scores. Competitors seek to visit, in a fixed amount of time, a subset of these locations on the way from the start point to the end point in order to maximize the total score. An effective center-of-gravity heuristic is presented that outperforms heuristics from the literature.     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Economic Losses From a Fire in a Dense-Packed U.S. Spent Fuel Pool

In 2013, the staff of the U.S. Nuclear Regulatory Commission estimated the reduction of the off-site economic losses from a fire in a drained U.S. spent fuel pool if fuel that had cooled for more than five years were transferred to dry cask storage—an option it called “expedited transfer.” In this article, it is shown that the savings would be much higher than the NRC estimated. Savings increase to about $2 trillion if: losses beyond 50 miles are included; the land-contamination threshold for long-term population relocation is changed to that used for the Chernobyl and Fukushima accidents and recommended by the U.S. Environmental Protection Agency; and, based on the experience of Japan, decontamination of land areas to levels acceptable for population return is assumed to take at least four years. If expedited transfer were implemented, the off-site economic losses would be reduced by about 98%.     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

Bernard Fall and Vietnamese Revolutionary Warfare in Indochina

This article assesses Bernard Fall’s concept of Vietnamese Revolutionary Warfare in Indochina between 1953 and 1958. It also investigates differences in the conceptualization of Revolutionary Warfare between Fall and proponents of French military doctrine known as la guerre révolutionnaire. The last component of the article considers limits of Fall’s influence on counterinsurgency doctrine.