基于SINS/GPS组合导航的AUV半实物仿真系统设计(英文)

为了满足水下航行远航程和长时间的要求,远航程自主水下航行器(AUV)采用的是以SINS导航为主、卫星导航定期修正的方式,以提高导航的精度和可靠性.设计一种采用GPS卫星定位导航模拟器、GPS接收机、惯性测量器件(IMU)和实时仿真计算机构成的采用SINS/GPS组合导航方式的AUV导航半实物仿真系统,并对该系统的硬件接口设计、算法和软件开发进行了论述.所开发的系统通过外部的线运动补偿实现了惯性导航系统的完整计算,通过时间同步策略解决了各导航子系统的并行同步问题.部分仿真试验的结果表明,所设计的半实物仿真系统方案可行,可用于更高置信度的AUV组合导航仿真实验.     

太阳能光电热系统换热器性能实验研究

设计了新型半圆管形式的不锈钢板式换热器,对其作为太阳能光电热综合利用一体化系统集热组件的性能进行实验研究。通过新型集热光电热组件及光电组件系统的对比实验,研究该光电热组件在重庆地区夏季应用情况,分析其光电和光热特性。结果表明:在以晴朗为主的天气,半圆管形式的不锈钢板式光电热组件电热系统的电热性能与光电组件系统的相比较,前者的太阳能电池输出功率提高约26.48%,热利用效率提高23.70%以上,新型半圆管形式的光电热组件整体光电热(光电+光热)综合效率可达到25.70%,有效提高了光电热系统的综合效率。新型半圆管形式不锈钢板式换热器的换热面积增大,提高了换热效率,为太阳能光电热综合利用一体化系统在重庆等太阳辐射强度较小地区的应用提供了参考。     

防空导弹总体设计方法的新发展——弹族化设计

研究了防空导弹一种新的总体设计思想———弹族化设计 ,论述了防空导弹弹族的设计与研制采用预先计划的产品改进P3 I(Pre PlannedProductImprovement)系统方法的必要性与有效性 ,通过对一个覆盖全空域、包含有 3种导弹的防空导弹弹族进行一体化优化设计 ,其结果证明了弹族化设计方法的可行性和优越性     

导弹光学告警系统及对抗技术综述

详述了导弹羽烟热辐射的光电高速采集方法 ,并实时对导弹逼近告警。同时介绍了国外红外告警技术的发展现状     

分布孔径红外系统的研究现状及其展望

介绍了分布孔径红外系统 ( DAIRS)的基本概念与研制现状 ,讨论了DAIRS在先进战斗机及其它作战平台上的应用 ,并简略介绍了其中涉及的关键技术 ,对 DAIRS系统将来可能的发展趋势作了预测。     

What Is Known About Defence Research And Development Spill-Overs?

This article surveys the body of available evidence regarding the spill-over effects of defence R&D. It reviews the routes through which defence R&D spills over to the economy with positive externalities – in terms of new products, technologies or processes; the barriers that impede or block such a process; potential negative repercussions, and the measure of such effects. The main conclusion is that the uncertainty of these effects, and the inaccurate appraisal of their value, hardly supports informed decisions concerning defence R&D policies.     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.     

Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems

Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we fit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation is useful to find the neighborhood of preferred regions of the nondominated vectors with very little computational effort. Further computational effort can then be spent in the identified region to find the actual nondominated vectors the decision maker will prefer. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009