IETM在信息化装备保障中的应用研究

IETM是装备保障CALS的关键技术,本文依据IETM的主要技术特点、结构形式、关键技术,介绍了IETM的开发流程和国际标准,并展望了IETM的应用前景,对于IETM在信息化装备保障中的应用有着比较重要的指导意义。     

一种面向任务的通用仿真资源集成管理平台的设计与实现

针对当前仿真领域中对仿真资源可重用性的需求,根据实践经验及相关理论知识对仿真资源管理系统的设计与实现进行了研究。提出了一种面向任务的通用仿真资源集成管理平台,该平台用面向任务的视角集成管理资源,以B/S系统结构及Web服务技术保证其通用性,以细粒度的用户验证机制保证其安全性。通过对实际原型系统的测试,与其它同类系统比较,该资源管理平台具有明显优势,能够很好的满足仿真资源管理的需求,并具有较强的通用性。     

离散小波变换在被动声目标识别中的应用

研究了战场被动声目标鲁棒特征参数的提取,分析了战场声信号与语音信号特征的相似性,提出基于MFCC参数的战场声目标识别方法。针对战场环境存在强噪声干扰情况,提出一种改进的MFCC特征参数(DWTMFCC)提取方法,该方法将小波分析和MEL倒谱分析结合,提高了特征参数的鲁棒性。仿真结果表明:在噪声条件下,利用DWTMFCC参数进行声目标识别,平均识别率比MFCC参数高出3.134个百分点,信噪比为5dB时,识别率仍达到93.67%。     

基于平衡计分卡的武器装备维修绩效评价指标体系构建

武器装备维修是武器装备维修保障的重要内容,加强装备维修绩效评价,建立科学规范的绩效评价指标体系,对深入推进装备维修工作健康发展将发挥积极作用。以平衡计分卡为研究手段,运用"5M1E"分析法,从一个内核和四个维度出发,分析武器装备维修绩效评价的影响因素,据此建立评价指标体系,并应用于装备维修管理实践,为有效提高装备维修保障效益提供有益借鉴。     

基于大数据的战区联合作战装备保障决策

大数据技术在决策领域的不断应用,将给装备保障决策方式带来重大变革。本文研究基于大数据的战区联合作战装备保障决策问题,提升信息化条件下装备保障准确、高效的决策方式等方面发挥重大作用。阐述了大数据的基本内涵,在决策领域的应用价值。通过系统推理的方法对战区联合作战装备保障决策的分析,提出基于大数据的战区联合作战装备保障决策基本构想,画出科学决策过程示意图,构建大数据战区联合作战装备保障辅助决策系统。结合研究大数据在战区联合作战装备保障决策领域的现实情况,提出相对应的措施建议。     

A Markovian model for process setup and improvement

We examine the setup and improvement policies for a production process with multiple performance states. Assume that the production process deteriorates randomly over time, following a Markovian process with known transition probabilities. In order to reduce the production cost incurred because of process deterioration, the process is inspected at the end of each period. Then one of three actions may be taken: do nothing, perform routine process setup, or perform routine setup and process improvement. The routine setup operation returns the process to its best performance state, whereas the process improvement action may reduce future production and setup costs and improve the process-state transition probabilities. A discounted Markovian model is formulated to find the strategy that minimizes the total cost of operating the production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 383–400, 1997     

高平面分辨率穿透成像雷达的研究与实现

穿透成像雷达利用电磁波对介质的穿透特性,对非金属介质内的不连续点进行高分辨成像。为实现该雷达系统的毫米级高平面分辨率、高探测效率和高便携适用性,设计了高平面分辨率穿透成像雷达系统。采用连续波体制和快速扫描空间采样方案以确保小型化和高成像性能,实现了一体化雷达射频前端;提出了参数未知条件下的自聚焦成像处理等数据处理方法,研制了穿透成像雷达系统样机,质量仅为2.5 kg,可单人手持操作;开展了成像分辨率和穿透能力实验测试,验证了方案的可行性和有效性。     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

基于马尔科夫决策的目标选择策略

目标选择是军事计划的关键要素之一。基于马尔科夫决策方法,解决具有复杂目标间关联的多阶段目标选择问题。使用与或树描述目标体系各层状态间的影响关联,并以目标体系整体失效为求解目的,建立了基于离散时间MDP的多阶段打击目标选择模型。在LRTDP算法基础上提出一种启发式方法,通过判断从当前目标体系状态到达体系失效状态的演化过程中的可能资源消耗和失败概率,来提供对当前状态的评估值,该方法能有效排除问题搜索空间中不能到达体系失效目的的中间状态,压缩了由于目标间复杂关联而增长的巨大状态空间。用实验验证了该方法有效性,实验结果表明,该方法直观实用,对目标间具有复杂关联关系的目标打击决策有一定参考价值。