基于GAHP的模糊综合评判法在潜艇作战方案评估中的应用

潜艇作战方案评估是辅助对潜指挥员决策的重要方法,而评估的科学性对决策的有效性影响很大。利用多人层次分析法（GAHP）和模糊综合评判相结合的方法,对潜艇作战方案进行评估,评估的结果可信度高,有利于对潜指挥员的正确决策。最后,通过实例证明了方法的有效性。     

浅析小型史馆建筑内部展示造型与多媒体表现

作为现代展览展示建筑的一个发展分支,小型史馆就是一部精练的“物化”历史,表达出一个丰富而统一的信息传播展示空间。小型史馆的设计往往在有限的空间内,充分体现出观演类建筑的主要特点,其内部的展示造型设计和多媒体表现手段起到了重要的作用。主要从小型史馆建设出发,对其内部展示造型设计与多媒体表现手段进行分析与探讨,阐述了它们的设计手法及达到的视觉创意效果。     

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     

气动式振动台气锤产生激励信号的机理及其性能研究

建立了阶梯式活塞气锤的力学模型,揭示了该类气锤产生碰撞信号的机理,针对两种不同型号的气锤,结合大量工程实验仿真生成了不同气压作用下两种气锤产生的激励信号,以激励信号的低频能量为气锤的性能指标,进一步评价了两种气锤的性能优劣.研究结果表明:大气锤的性能明显优于小气锤的性能.     

基于ARIS的战时修理业务流程仿真研究

利用ARIS建模方法与工具,对战时装备修理业务流程进行了仿真研究。以陆军某机步师某型装备为例,给出了战时修理业务的主流程模型以及各分支模型,通过仿真运行及结果分析,得出了制约该流程的瓶颈和需要进一步优化的对象,为装备维修保障过程仿真提供了一个很好的思路和方法。该方法对于开发战时维修保障效能仿真评估系统,实现维修保障系统的动态仿真和全要素评估具有重要的支撑作用。     

基于频谱分析的飞行模拟器飞行性能验证

介绍频谱分析用于仿真系统模型验证的原理和方法,提出一种应用频谱分析进行飞行模拟器飞行性能验证的方案。结合飞行试验和仿真模型的输出数据,分别采用窗谱估计和最大熵谱估计方法对某型飞行模拟器的飞行性能进行验证,并对验证结果进行分析。结果表明,频谱分析法用于飞行模拟器飞行性能的验证是有效的,可为其他训练模拟器的性能验证提供参考。     

陆军武器装备需求生成程序研究

借鉴美军"联合能力集成与开发系统"的分析流程,以"面向任务、基于能力"的需求牵引观为指导,研究提出我陆军武器装备需求生成程序,确定了每一环节的具体任务和要求,对完善陆军武器装备需求生成机制和需求的统一论证具有一定的现实和理论意义。     

基于层次分析法的人为电磁环境复杂程度评估

针对战场电磁环境复杂多变,定性、定量描述难的特点,运用层次分析法(AHP)探索人为电磁环境复杂程度评估问题。建立了评估人为电磁环境的递阶层次结构,细化了评估指标,明确了评价标准,并通过对组合权重的计算,最终将对人为电磁环境复杂程度的评估转换为13个底层参量的检测数据,4个分值标准和5个评定层次。该方法对评估电磁环境的一般复杂性和特定复杂性具有一定的指导意义,较好地满足了战场电磁环境复杂程度评估的需求。     

准静态受遮蔽的Rician衰落信道中空时格码的性能上界

针对准静态受遮蔽的 Rician 衰落信道,在收端已知信道状态信息的条件下,文中分析了空时格码的性能.推导了码字差相关阵为对角阵的空时格码系统的成对差错概率的确切表达式,得到了相应空时格码在准静态受遮蔽的 Rician 衰落信道中的性能上界。仿真结果表明,在遮蔽不太严重的信道中,文中得到的 union 界与相应编码系统的实际性能有很好的近似度。     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.