基于主成分分析法的反导态势要素提取研究

针对弹道导弹及其攻防作战的特点,深入分析反导作战态势评估的过程,研究影响反导预警态势评估的主要因素,构建了反导战场态势要素集模型。在此基础上,采用主成分分析法进行要素分析与提取,优化重构要素集模型。研究结果为提高反导预警态势评估的准确性和指挥决策的及时性提供了重要依据和保障。     

一种楔块式单向超越离合器结构参数优化设计

为优化楔块式单向超越离合器的结构参数,根据漂浮式微型波力发电装置对超越离合器的要求,建立楔块式超越离合器结构参数的数学模型。以体积最小为优化目标,建立接触疲劳强度和各个尺寸的约束条件,并利用Matlab软件的优化工具箱求解数学模型。最后将常规设计参数和优化设计参数进行比较,结果表明:优化设计的体积只有常规设计的72.33%;漂浮式发电装置的传动系统结构更加紧凑,质量更轻。     

复杂信息网络的安全防御体系构建原则研究

针对复杂信息网络的特点,从网络的脆弱性、广域性、复杂性、机动性、集成性、开放性等方面,分析了导致复杂信息网络安全问题的根源,从体系原则、木桶原则、多维结构、纵深结构、多技术集成、针对性、实时更新等方面,提出了构建复杂信息网络防御体系的原则,并分析了美国海军的计算机网络纵深防御体系。     

Layers of Experiments with Adaptive Combined Design

In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

声自导鱼雷导引方法的研究现状与发展趋势

全面系统地总结了目前声自导鱼雷上各种常用的导引方法,包括各种经典导引方法和各种基于现代控制理论设计的导引方法,分析了其优缺点,提出了在选择鱼雷导引方法时应考虑的因素,最后简要指出了其发展趋势,以便对声自导鱼雷的导引方法有个全面的认识,为鱼雷导引方法的改进和设计提供一定的参考。     

基于加权MHD的反舰导弹预定目标选择方法

平均Hausdorff距离(MHD)方法基于编队的整体形状进行匹配来寻找对应点,因此,不像距离选择区法和扩展搜索图选择法那样受导弹自控段的导航误差和目标机动散布的影响。为了进一步提高反舰导弹的目标选择能力,考虑所匹配点集不同区域对Hausdorff距离函数的贡献程度不一样,提出了加权MHD(WMHD)来研究编队预定目标选择问题。首先通过刚体变换方法将火控雷达和末制导雷达探测到的编队点集进行位置匹配,然后利用WMHD方法获取其最优变换位置,最后据此最优变换位置预测预定选择目标在末制导雷达开机的位置。通过仿真实验表明其具有较强对抗冲淡干扰和形状扭曲失真的能力,且性能明显优于MHD方法。     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004