舰载软杀伤仿真中模型不确定性分析方法研究

舰栽软杀伤仿真系统中,不可避免地存在不确定性因素,分析仿真系统的不确定性是利用仿真系统进行效能评估的关键.研究了BMA方法在模型不确定性定量分析中的理论知识,介绍了软杀伤仿真中反舰导弹捕捉目标的数学模型,并把BMA方法应用到舰载软杀伤仿真系统.通过仿真结果比较,BMA方法的估值精度高,算法简单,计算速度快,BMA方法是分析模型不确定性的有效方法.     

一种雷达网系统误差校准方法及其精度分析

由于系统误差影响数据融合精度,提出了基于ECEF坐标转换的雷达网系统误差数据校准方法,定义了系统误差估计精度的评估方法,对系统误差估计精度采用克拉美-劳下限(CRLB)进行评估.最后进行了仿真分析,验证了该校准方法的可行性和误差估计精度评估方法的有效性.     

中世纪外国军事思想初探

军事思想是人们对战争、军队和国防的基本问题的理性认识。研究和总结人类各个时期军事思想的历史发展和特点,是对军事领域问题探讨的过程之一,是人类在军事领域自我认知的手段和途径,是超越自我、实现突破的必经之路。中世纪世界军事思想在特定的历史条件下.经历了一个缓慢的历史演变过程,其战争观、军队建设和战略战术思想有了较大的发展,呈现出缓慢性、演进性和多元性的特征。     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Bayesian enhanced decision making for deteriorating repairable systems with preventive maintenance

Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

带落角约束的再入机动弹头的复合导引律

针对再入机动弹头垂直打击目标的要求,研究了具有末端落角约束的复合导引律.该导引律包括俯冲平面内的制导方程和转弯平面内的制导方程,通过在最优导引律的基础上引入滑模变结构控制,增强导引律的鲁棒性.为了减小控制量的抖振和能量损耗,提出了采用RBF(径向基函数)神经网络自适应调节切换项增益的方案,数学仿真验证了该方案的有效性.仿真结果还表明,与最优导引律相比,复合导引律在外界干扰的影响下仍能保持较高的制导精度.     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

火灾事故调查引发行政诉讼案件的理性思考

根据《行政诉讼法》的合法性审查原则 ,并结合实际火灾案例 ,阐述在火灾事故调查工作中 ,公安消防机构如何适应行政诉讼的要求 ,切实做到依法行政。     

Designing a screening experiment for highly reliable products

Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039