Maximizing project cash availability

Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

雷达组网系统抗压制干扰部署优化算法研究

针对雷达组网系统抗压制干扰部署优化问题,讨论了雷达及其组网系统的残剩可探测区动态定量评估模型,定义了雷达及其组网系统的探测能力下降指数、雷达装备利用率及其抗干扰效能指数,给出了一套完整的组网系统抗压制干扰综合效能动态定量评估模型、优化布站决策模型及相应的实用算法。3部雷达组网的仿真试验证明了其有效性。     

RBF网络用于战车火控系统弹道解算的方法

弹道解算问题对战车火控系统的性能有着直接的影响.传统的弹道解算方法在精度和实时性方面都存在一定的局限性.为了提高解算精度、战车首发命中率和解算的实时性,基于RBF网络的函数逼近及预测能力,将RBF网络用于弹道解算,对传统算法进行优化,得到了新的弹道解算方法.最后对所提方法进行了仿真,发现新方法在解算精度没有降低的条件下,大大提高了弹道解算的实时性.     

作战飞机信息通信方法

通过对作战飞机信息通信方法的研究,指出了作战飞机进行信息通信的两种方法-语音通信和数码通信;并分析了数码通信的硬件结构和机载通信的硬件设备的工作原理.探讨了未来的网络中心战中基于网络化数码通信的方法,为未来空战基于网络中心战技术的实际应用奠定基础.     

基于粗糙神经网络和网络撕裂的故障诊断方法

利用网络撕裂法逐层将复杂装备撕裂为较为简单的单元,并充分利用粗糙集和神经网络融合方法的优点进行故障诊断。提出了基于粗糙神经网络的网络撕裂故障诊断方法,总结出基于粗糙神经网络和网络撕裂的故障算法流程图。以L-F滤波器为例进行实验,结果证明:该算法明显优于普通的基于粗糙神经网络的故障诊断方法,网络结构得到简化,训练速度得到加快。     

分层任务网络在UCAV规划中的应用

无人战斗机任务规划对提高它的生存能力、突防能力、作战效能具有重要意义.分层任务网络规划是一个有效的规划方法,HTNP的最大好处在于,搜索受控于细心设计的方法.在某种意义上讲,一个HTN规划器只描述了如何使用操作,给实际使用带来了困难.在HTNP中引入目标协调机制、禁忌表等,将原有"离线"式方法变为"在线"式方法,提高了方法的适应性能.可以根据情况的变化,随时生成新的规划,降低了预先设计方法的数量,从而降低工程实施的难度.     

基于神经网络的模糊理论在桥梁状态评估中的应用

探讨了模糊数学中的隶属函数在桥梁技术等级状态评估中的应用.在研究现有桥梁状态评估方法的基础上,把人工神经网络和模糊数学理论结合起来应用于大跨度预应力斜拉桥的等级状态评估,建立了基于三层神经元的模糊神经网络模型,并建立结构损伤度函数及等级隶属度模型,通过样本学习训练,获取评估专家的知识及直觉思维,最终确定桥梁所对应的技术状态等级.以检测的480组索力数据作为学习样本,另外4组作为验证样本进行了索力状态评估预测.计算结果表明,网络预测值与期望值吻合良好.     

污水处理过程软测量系统辅助变量的选择方法

辅助变量的选择包括变量类型、数量及检测点的选择,是软测量建模的第一步,直接关系到软测量质量的好坏.针对活性污泥法,从微生物生长繁殖的角度出发,探讨了各要素对于微生物生长活动能力的影响及其相互关系,通过影响力大小及相互间耦合性的复杂程度选取辅助变量的原则,完成了污水处理辅助变量类型的初选,并对辅助变量的精选进行了讨论.     

Research on construction of operation architecture based on complex network

Operation architecture plays a more important role in Network Centric Warfare (NCW), which involves dynamic operation networks with complex properties. Thus, it is essential to investigate the operation architecture under the informatization condition within NCW and find a proper network construction method to efficiently coordinate various functional modules on a particular situation, i.e., the aerial combat. A new method integrating the physical level and functional level of NCW is proposed to establish the operation architecture, where the concept of network operation constraints unit and net constructing mechanisms are employed to avoid conflicts among different platforms. Meanwhile, we conduct simulations to assess the effectiveness and feasibility of the constructed operation architecture and analyze the influence of the network parameters.     

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.