基于神经网络和遗传算法对反装甲目标威胁度评估研究

针对威胁度估计问题和装甲车辆在战场上的实际情况,运用神经网络和遗传算法理论探索反装甲目标威胁度评估问题。基于BP神经网络模型的算法,利用神经网络良好的自适应能力和遗传算法强大的全局搜索能力,通过样本数据训练,提高了威胁度估计的准确性和适应性。经过验证该算法能够有效反应出反各种反装甲目标的威胁度,其稳定性、精确性也比较高。     

一种基于二分法的无线传感器网络拓扑控制算法

文中针对传感器节点分布不均和拓扑建立时间长的问题,提出了一种基于二分法的拓扑控制算法,每个节点自适应选择发射功率以获得预设的度。仿真显示,与基于均匀功率增量的算法相比,基于二分法的拓扑控制算法大大减少了功率切换次数且形成的拓扑简单,减少了网络拓扑形成时间和平均发射功率。     

城市居民小区地震火灾发生率的非线性预测

利用人工神经网络对地震火灾发生率进行非线性预测具有实用价值和理论意义。分析了人工神经网络预测的优势和不足,并提出算法改进意见,在综合分析人工神经网络预测的工作机理、构造方式以及影响城市居民小区地震火灾发生率的主要因素的基础上,构造人工神经网络模型进行火灾发生率的实例预测,并针对预测结果分析了各影响要素对地震火灾发生率发生影响的强弱程度,非线性预测的结果与预期结果相符。     

基于遭遇角决策的并行双模切换舵减摇控制

结合舵减摇控制中通用线性模型与模糊线性模型的优缺点,采用了一种根据遭遇角的不同自动切换控制器设计模型的并行双模切换舵减摇控制方案。为在线自动辨识遭遇角,提出基于横摇功率谱密度柱状图的神经网络辨识方法。仿真结果表明,该方法辨识精度较高,且比传统重心法节省了在线计算量与存储数据库所需的存储空间,简化了辨识流程。     

军用无线传感器网络体系结构研究

无线传感器网络作为一种全新的监测系统被广泛认为是军用侦查探测系统的发展方向,已经成为国际军事领域研究热点。在总结了几种无线传感器网络体系结构的基础上,针对军用领域特定的性能需求,对这些体系结构进行了比较。     

一种基于神经网络的彩色图像分割方法

提出了适于彩色图像分割的加强型径向基函数网络方法,采用在线自适应聚类学习算法确定隐层节点的数目、激活函数中心值;通过Hebb学习算法迅速将隐层节点中心值分为目标颜色聚类中心和背景颜色聚类中心两类;输出层用竞争规则将目标与背景分开。通过对多幅彩色图像进行分割处理验证了该方法的有效性。     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于神经网络的内燃机燃烧过程的辨识

发动机燃烧过程的数值计算精度是计算有害排放物和发动机结构优化的基础。跳出基于零维模型、准维模型和多维模型的数值计算方法,基于利用神经网络对燃烧过程进行辨识,并给出了仿真结果。     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

稳定自组织网络结构中单点突变对网络稳定性影响

从战场恶劣环境通信设备无法正常通信的条件下,介绍了一种自组织网络稳定度的模型。通过比较自组织网络结构中微结构和巨结构的优缺点,动态地描述了结构间的聚合和裂解。基于结构分析,考虑单点突变对网络稳定性的影响,从时间因素策略方面,提出了一个基于预测最稳定链路生存时间的一种分布式成群策略。通过合理建模以及优化路由算法,尽可能地维护网络结构的稳定。