多目标数据关联的神经网络方法

数据关联是多目标跟踪的关键问题。基于 Hopfield神经网络的 JPDA是解决这一关键问题的有效方法之一 ,但此方法的难点在于优化系数的整定。提出一种改进算法 ,用于解决优化系数在线自适应整定问题。首先重新构造了李雅普诺夫能量函数 ,接着引入变化的优化系数因子 ,并给出了优化系数求解的迭代公式 ;最后对已有和改进的算法进行了仿真研究。结果表明改进的方法和原有的方法相比 ,一方面具有在线整定优化系数的功能 ,另一方面可以获得和原有算法非常接近的估计误差。     

多传感器多目标定位与跟踪技术研究

针对炮兵打击目标的特性和获取目标信息所采用的侦察设施 ,研究了多传感器多目标定位和跟踪问题。在闭圆和聚类概念的基础上 ,提出了一种多传感器多目标融合算法 ,并给出了状态估计的最优解。仿真结果证明了这种算法的有效性。这一模型的物理实现正在进一步研究之中。     

NDIS技术在网络监测中的实现

阐述了利用NDIS进行网络包的监测和分析的基本原理,在此基础上实现了对网络适配器在数据链路层网络包的监测,并通过数据报文结构的分析,再现了应用层协议的实现过程.     

CAN总线在战车综合电子系统仿真平台中的应用

利用CAN总线开发了战车综合电子系统仿真平台,规划了各终端的功能和信息流程,定义了各终端通信的协议规则,给出了CAN总线波特率的计算方法,实现了各终端间信息的准确、快速传输。测试结果表明,利用CAN总线开发的战车综合电子系统仿真平台性能稳定、可靠性高。     

无线传感器网络安全研究综述

无线传感器网络有着良好的应用前景,其安全问题同样受到了人们的高度重视。论文首先对无线传感器网络进行了简要的介绍,而后总结了这种网络的安全相关特点以及其存在的安全威胁,随后分别综述了无线传感器网络的三个安全研究热点方向:安全路由、安全认证协议和密钥管理。     

Dynamic evacuation routes for personnel on a naval ship

We propose a dynamic escape route system for emergency evacuation of a naval ship. The system employs signals that adapt to the causative contingency and the crew's physical distribution about the ship. A mixed‐integer nonlinear programming model, with underlying network structure, optimizes the evacuation process. The network's nodes represent compartments, closures (e.g., doors and hatches) and intersections, while arcs represent various types of passageways. The objective function integrates two potentially conflicting factors: average evacuation time and the watertight and airtight integrity of the ship after evacuation. A heuristic solves the model approximately using a sequence of mixed‐integer linear approximating problems. Using data for a Spanish frigate, with standard static routes specified by the ship's designers, computational tests show that the dynamic system can reduce average evacuation times, nearly 23%, and can improve a combined measure of ship integrity by up to 50%. In addition, plausible design changes to the frigate yield further, substantial improvements. Published 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

军事通信中ad hoc网络路由协议性能分析

移动ad hoc组网灵活,抗毁性很强,将在未来的军事通信中发挥重要作用。因此,对于移动ad hoc网络研究中的首要的路由问题作了探讨,先简要介绍了两种典型的路由协议OLSR(Optimized Link State Routing)和AODV(Ad hoc On-Demand Distance Vector Routing),接着利用网络仿真工具OPNET分析了AODV的协议特点,最后比较了两种路由协议的性能。仿真结果表明AODV路由开销小,但时延大,节点移动过快时存在路由稳定性的问题;OLSR路由开销很大,但时延相对较小。因此在搭建军用adhoc网时,应根据实际使用情形做出选择。     

SIP协议安全威胁分析

众所周知,Vo IP技术在未来语音通信中所占的比重越来越大。随着Vo IP的不断发展,基于SIP协议的Vo IP应用也不断增多。但是,由于SIP协议高度依赖于开放的IP网络,使得其安全性逐渐成为关注和探讨的焦点。主要分析了SIP协议网络面临的一些安全威胁,包括典型的外部攻击技术和协议自身存在的漏洞等。探讨了为应对SIP安全威胁提出的加密、认证等安全策略并且分析了这些安全策略的优缺点,提出了针对SIP安全策略进一步改进的方向,旨在不断提高和完善基于SIP协议的安全性能。     

基于动态可调簇的能量感知无线传感网数据收集协议

针对无线传感网中高效数据收集和传输的需要,提出了一种基于动态可调簇的能量感知数据收集协议ACEDGP(Adjusted Cluster-based energy-aware Data Gathering Protocol)。该协议初始时根据区域将节点等分成许多簇结构,簇首节点负责簇内部数据的收集和聚合,距离较远的簇通过其他簇首节点的转发实现数据的收集;随着时间的推移和节点能量的减少,ACEDGP能够统计各簇首能量消耗预测簇的通信频次,根据动态调整簇策略选择合适的簇首节点和合并分裂各个相邻的簇,保证各簇首节点簇内数据收集和簇间数据转发的能量平衡。仿真结果表明,与典型的分簇协议相比,ACEDGP能够更好地平衡节点的能耗,获得更长的网络生存期。     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001