关于小高炮射击偏差观测方法之我见

小高炮射击偏差观测的提前时间观测时机法与传统的等距法,两者的观测时机虽不同,精度也不同,但从原理上讲,都是一种近似方法,不能说哪个原理上有问题,哪个原理上无问题。从部队现装备看,在部队日常训练打靶中,前者的观测时机更易于把握,作为现装备的一种革新,有研究必要。     

火控系统软件测试和质量评估

在火控系统硬件技术日益成熟的今天,软件的质量问题愈发显得突出。如何测试火控系统的软件和评估软件质量是当前亟待解决的问题。该文提出了火控系统软件生存周期各阶段的质量工作,着重研究了火控系统的软件测试的方法和进行质量评估的基本原则。     

Nonperiodic preventive maintenance for repairable systems

As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

防空反导智能战场态势估计研究

在军事科技理论面临着巨大变革的背景下,为解决防空反导战场态势估计智能化发展的问题,通过对态势估计的三层模型进行分析以及对防空反导态势的要素构成进行探讨,研究了OODA环中防空反导态势估计的过程,建立了防空反导智能战场态势估计的系统模型,深入地探讨了阻碍防空反导智能化战场态势估计研究的五方面问题以及有望解决问题的关键技术措施,从而为防空反导智能战场态势估计研究提供了新思路。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于监测数据的电磁频谱地图构建与验证

提出基于广义回归神经网络拟合和聚类克里金的构建方法,通过趋势面拟合,将电磁频谱地图构建分解为路径衰减和阴影衰落分量的估计问题,以提升构建精度;设计监测数据聚类和自适应最优邻域选取机制,在保证构建精度的条件下减小计算数据量,以提升构建速度,从而利用数量有限的电磁环境监测数据,在不需要先验信息的条件下实现电磁频谱地图的准确、快速构建。设计并实现电磁频谱地图验证系统,搭建车载数据采集设备,利用实测电磁环境监测数据,验证所提方法的可行性及构建性能。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

DOS环境下双机实时火控系统软件设计

在舰载作战指挥与火力控制系统中,基于Multibus总线的计算机系统常配置成双机或多机工作方式,该文以某型火控系统为例介绍一种DOS环境下双机实时系统软件设计方法．     

把CAD技术引入机械课程设计的探索

总结了近2年来在《机械设计》课程设计教学实践中引入CAD技术,引导学员在课程设计中采用计算机辅助设计技术,使学员既掌握了一般机械设计基础知识,又基本学会了计算机辅助设计这一现代设计方法。     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007