对加强公安边防部队基层党支部能力建设的几点思考

为加强公安边防部队基层党支部能力建设,必须着力提高基层党支部从政治上思想上建设部队、管边控边、强化自身建设、领导决策和依法办事的能力,在执勤执法和推进＂爱民固边＂中发挥战斗堡垒作用。     

基于下方近场平面磁场的潜艇高空磁场计算方法

潜艇高空磁场一般由包络面磁场计算得到,但实际中包络面磁场较难测量,而下方近场平面磁场则容易获得.在下方近场平面磁场的基础上,利用边界积分法计算得到下方远场磁场,再根据潜艇远场磁场分布的全空间一致性,计算出远场等效磁矩,得到高空远场磁场.实验分析表明了潜艇远场磁场分布的全空间一致性,由下方近场平面磁场可以较准确地得到潜艇...     

加权主成分TOPSIS法的防空导弹型号论证决策

针对防空导弹型号论证决策问题,讨论了影响型号论证的主要因素,建立了基于加权主成分TOPSIS法的防空导弹型号论证决策模型,实现了对新研制型号方案的综合评价和分析.在此基础上,通过实例验证了方法的实用性与有效性.论文的研究成果为防空导弹型号论证提供了辅助决策方法和智力支持.     

数据挖掘故障诊断专家系统

为了及时准确地对防空导弹飞行试验故障进行诊断,克服传统专家系统获取专家知识的瓶颈,立足于防空导弹飞行试验历史数据,利用数据挖掘的方法获得飞行试验故障模式判定决策树,进而得出导弹故障判定规则,形成故障诊断专家知识库,构建防空导弹故障诊断专家系统.这使数据挖掘和专家系统两者的优点得到充分发挥.     

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.     

增强路由器安全性的一种措施

路由器是军用电子信息系统的关键互联设备,提高路由器自身的安全性非常必要。首先对路由器涉及到的安全问题作了较为详细地分析,然后给出一种增强路由器安全性的技术措施。该措施重点处理终点包对路由器的威胁,将入侵检测模块与数据包过滤模块进行联动,通过入侵预防、入侵时的检测和响应、入侵后的快速分析与恢复等三个环节,提高路由器抗攻击的能力。最后探讨了该措施对路由器性能的影响。     

排队论在导弹防御体系射击效能中的应用

针对当前空袭手段多样化、综合化和一体化的特点,运用排队论方法,设计了一种基于排队论的射击效能评估模型。该模型综合考虑了各种因素对舰空导弹射击效能的影响,当编队的配置(如防御层数、通道数量)有所变化时,依然可以灵活运用上述模型对编队射击效能做出准确评估。     

过程方法在防化科研质量管理系统中的应用

介绍了根据国军标要求建立的科研质量管理系统．运用“过程方法”,对现行科研体制下的科研进程进行了识别,并提出了具体的控制要求。     

基于遗传算法的弹炮混编防空群火力分配

近期局部战争中的防空作战经验表明:实施弹炮混编可以大大提高防空武器系统的作战效能,而如何实施有效的火力分配又是其中的一个重要环节.针对陆军弹炮混编防空群射击指挥中的火力分配问题,简要分析了防空导弹和高炮武器系统射击的不同特点,提出了弹炮混编防空群的火力分配方法,并建立了优化火力分配方案的数学模型.在此基础上,采用遗传算法对此模型求解.结果表明,遗传算法为弹炮混编防空群的火力优化分配问题提供了一条有效途径.     

Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests

While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006