The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

海面空-空无线信道特征

针对海上远距通信场景,基于无人机之间的无线通信链路,对接收功率进行实际测量。在大尺度路径损耗方面,采用对数距离线性模型进行拟合,分析海上远距空-空无线信道特征,获取路径损耗指数,并采用射线跟踪方法进行仿真验证,通过仿真所得信道冲激响应在多径时延和功率方面分析产生接收功率快速变化的原因。分析结果表明,近岸的多径反射会造成接收功率的波动,并且会造成路径损耗的升高。利用三种分布函数对测量数据进行分布拟合,分析海面和近岸两种通信条件下空-空无线信道的小尺度分布特征。测量分析结果表明,小尺度特征受陆地反射影响明显,在距离陆地较远的海面呈现高斯分布特征,而在近陆地处未呈现典型分布特征。     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

基于神经网络技术和小波分析的发动机 气缸气密性能检测研究

提出了一种基于小波分析和神经网络技术检测发动机气缸气密性能的新方法。对电涡流位移传感器拾取的飞轮位移信号直接进行时域采样 ,通过处理和小波分析 ,获得反映发动机启动瞬时转速尺度参数 ,BP神经网络以此作为输入向量 ,从而有效地检测发动机气缸气密性能。     

软件无线电的关键技术及其发展趋势

软件无线电技术近年来得到了较快发展,其主要是利用软件来实现无线通信系统中的各种功能。介绍了软件无线电的关键技术、评价标准和发展过程,并展望了软件无线电的发展前景。     

基于神经网络和功率谱的水中目标信号检测方法

将功率谱和神经网络相结合,应用于高海况、低信噪比条件下,水中目标信号的特征提取中.文中首先对信号进行功率谱估计,利用目标信号功率主要集中在低频部分的特点,提取低频信号的能量作为特征,然后利用人工神经网络对目标信号进行检测.利用不同浪级情况下海洋水压场的仿真信号数据,对某型目标舰船的水压信号进行了检测计算,验证了该方法的有效性,尤其是达到了在高海况、低信噪比条件下,对目标信号检测率比较高、虚警率比较低的效果.     

Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem

In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于ANN模式识别的某型导弹测试车配电系统故障诊断

人工神经网络诊断特点与基于模式识别的诊断特点非常相似。将ANN模式识别技术应用于某型导弹测试车配电系统故障诊断。根据测试车配电系统的故障特点,设计ANN为4层BP网络,具有9个输入、10个输出,两个隐含层神经元数目分别为9和6。测试结果表明该方法能有效诊断测试车配电系统故障。     

基于复杂网络理论的指挥信息网络拓扑模型研究

从网络科学的观点出发对作战指挥机构进行研究,建立了指挥关系网络和通信网络,以及在两者基础上的指挥信息网络拓扑模型,分析了指挥信息网络的度分布特性,提出了描述指挥信息网络的特征参量,进行了针对指挥信息网络的体系破击仿真实验,得出了与战争实际相符的结论,为利用复杂网络知识研究信息化条件下的体系对抗进行了积极地尝试和探索。