基于深浅知识的混合诊断模型

针对大型电子设备的诊断问题,提出一种基于深、浅知识的混合诊断模型,给出了诊断知识的组织模型,论述了混合诊断模型的建立,并给出了完整的推理控制算法。基于这种模型,研制了ＰＬＴＳ平台罗经自动测试系统．     

水面舰艇新一代指挥控制系统新技术应用研究

本文着重介绍了８０年代以来国外发展新一代舰载指挥控制系统所采用的新技术,以及这些新技术对提高指挥控制系统作战效能的影响。     

武器系统的效能分析

本文对武器系统效能分析的有关问题作了简要介绍,以期对此一新的领域有所了解。     

Fire truck relocation during major incidents

The effectiveness of a fire department is largely determined by its ability to respond to incidents in a timely manner. To do so, fire departments typically have fire stations spread evenly across the region, and dispatch the closest truck(s) whenever a new incident occurs. However, large gaps in coverage may arise in the case of a major incident that requires many nearby fire trucks over a long period of time, substantially increasing response times for emergencies that occur subsequently. We propose a heuristic for relocating idle trucks during a major incident in order to retain good coverage. This is done by solving a mathematical program that takes into account the location of the available fire trucks and the historic spatial distribution of incidents. This heuristic allows the user to balance the coverage and the number of truck movements. Using extensive simulation experiments we test the heuristic for the operations of the Fire Department of Amsterdam‐Amstelland, and compare it against three other benchmark strategies in a simulation fitted using 10 years of historical data. We demonstrate substantial improvement over the current relocation policy, and show that not relocating during major incidents may lead to a significant decrease in performance.     

Optimal allocation of minimal repairs in parallel and series systems

In reliability engineering, the concept of minimal repair describes that the repair brings the failed unit (eg, system or component) to the situation which is same as it was just before the failure. With the help of the well‐known Gamma‐Poisson relationship, this paper investigates optimal allocation strategies of minimal repairs for parallel and series systems through implementing stochastic comparisons of various allocation policies in terms of the hazard rate, the reversed hazard rate, and the likelihood ratio orderings. Numerical examples are presented to illustrate these findings as well. These results not only strengthen and generalize some known ones in the seminal work of Shaked and Shanthikumar, but also solve the open problems proposed by Chahkandi et al.'s study and Arriaza et al.'s study.     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

【专题】无人系统互操作性发展现状与关键问题

无人系统正在加速由专用化、单一化向通用化、标准化发展,多无人系统协同、无人-有人系统协同、无人系统集群等新型作战概念不断成熟。无人系统互操作性是提高无人系统联合作战能力的倍增器和推动无人系统系列化发展的重要抓手,也是适应无人系统协同化、集群化发展的必然需求。本文详细阐述了无人系统互操作性的概念内涵,从顶层规划、技术创新和能力验证三个方面分析了无人系统互操作性发展现状,提出了一种针对跨域、多域无人系统互操作的等级模型,构建了自底向上和自顶向下相结合的互操作性关键支撑技术体系,剖析了通用/开放体系架构、标准协议与模块化组件、自主能力评估验证、数据传输与数据策略等技术因素,并展望了下一步研究重点。     

《计算机操作系统》课程教学探讨

本文介绍了在操作系统课程教学中的几点体会,提出在教学过程中应不断使用先进的教学方法才能激发学生的学习兴趣,提高学习效率,希望和讲授这门课程的老师共同探讨。     

舰载雷达发现目标的效能概率计算

根据舰载雷达保障火炮射击任务的要求,结合火炮自身使用特点,提出舰载雷达发现目标的效能概率计算问题。应用概率分析方法,对多种距离上舰载雷达发现目标保障火炮系统有效射击的概率进行了推导,得出舰载雷达保障火炮系统有效射击的概率计算公式,并进行了实例分析。实际作战运用中,可以应用此算法对火炮系统的射击概率计算,可以较好地保障火炮系统的射击准备时间,但影响实际火炮射击的因素很多,表征雷达发现目标的效能指标也很多,应综合考虑。     

新型防空武器系统抗击CM建模与仿真

在分析巡航导弹技术、战术特点的基础上,给出了抗击CM的基本要求,结合新型武器系统的特点提出了抗击作战的数学模型,并通过仿真实验验证了武器系统抗击巡航导弹作战的可用性与高效性,为我新型防空武器系统抗击CM作战的效能评估提供了必要的方法和依据。