共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
针对路径在线重规划中的威胁代价评估问题,提出了基于最大综合拦截概率的在线威胁代价评估改进算法.在该算法中,以已有威胁代价评估模型为基础,给出不同信息支持条件下的“瞬时跟踪概率”计算模块,进而引入“连续跟踪概率”概念,并结合“杀伤概率”得到“拦截概率”概念模块.在此基础上,提出“最大拦截概率”概念,以此作为单个主动威胁作用下的在线威胁代价评估标准,最后将其拓展到“最大综合拦截概率”作为多个主动威胁作用下的在线威胁代价评估标准.在此基础上,结合MPC算法给出路径在线重规划的模型.通过仿真结果对比,说明上述模型的合理性和算法的有效性. 相似文献
3.
4.
针对指挥控制关系网络受到攻击时的目标节点选择问题,分析提出了攻击目标选择的三个影响因素:网络节点的重要性、攻击方信息探知广度和信息探知误差.在将攻击目标选择策略分为针对性攻击和试探性攻击的基础上,给出了网络中任意一个节点被选为攻击目标的概率解析计算公式.最后通过仿真计算,得到三种不同网络拓扑结构下节点被选为攻击目标的概率随各影响因素的变化关系. 相似文献
5.
贝叶斯网络下考虑攻击企图的目标威胁评估 总被引:1,自引:0,他引:1
为解决舰艇编队的防空目标威胁评估问题,针对现有威胁评估方法中忽略目标攻击企图,且只进行静态评估而未考虑目标机动导致的运动参数变化对威胁评估的影响之不足,提出了利用目标攻击时所表现出来的特征参数进行攻击企图估计,并分析了影响机动目标威胁程度的相关参数和变量,以目标信息更新周期为不同时间片,建立了用于动态评估目标威胁度的离散模糊动态贝叶斯网络结构模型。为适应编队防空中火力通道多、目标批次多的特点,将一般威胁等级从3级划分扩展为5级划分。给出了网络中主要节点的状态转移概率表和条件概率表。通过对机动目标按照典型攻击航路的威胁度变化仿真表明,所建立的模型和采用的方法合理有效,能够较为准确地反映目标威胁,贴近实战。 相似文献
6.
针对指挥控制关系网络受到攻击时节点及网络毁伤程度的量化评价问题,首先形式化定义了攻击强度和节点自修复能力函数,在此基础上,分别给出了网络中节点无自修复能力和自修复能力随时间变化时的节点毁伤模型。最后通过仿真计算,得到了节点的失效过程描述以及随机攻击和选择性攻击两种不同攻击目标选择方式下网络效率随攻击时间的变化关系。 相似文献
7.
8.
9.
以战时交通运输路径优化问题为研究对象,分析问题特点,考虑多式联运,以运输时间代价、运输费用代价、路段和运输节点的危险性代价为优化目标,建立起广义运输代价最小的运输路径优化模型,并设计了蚁群算法来求解问题模型。给出的算例表明,文中模型符合战时交通运输的特点和实际需要,可为确定战时运输路径提供决策支持,而采用的蚁群算法是求解该问题的一种有效方法。 相似文献
10.
提出了一种用普通战机挂载中远程空空反辐射导弹,对抗雷达探测距离占有绝对优势的先进飞机或隐身飞机的新战法,并计算最大发射距离.该战法是在被敌方机载雷达截获并面临导弹威胁的情况下,主动发射空空反辐射导弹攻击目标辐射源,然后进行置尾机动,破坏来袭导弹的中制导,使它脱靶,达到消除来袭导弹的威胁和攻击对方的双重效果. 相似文献
11.
12.
13.
星载无线数据网络可以解除航天器内错综复杂的线缆网的束缚,是航天器轻小型化的重要技术储备。旨在替代航天器内现有的点对点三线制的低电压差分信号线缆,提出了一种基于脉冲超宽带(IRUWB)技术的星载高速无线数据网络的设计方案,并重点介绍了高速无线网络协议的设计和实现。网络协议设计参考了美国军用数据总线标准MIL-STD-1553B协议,采用时分制指令响应机制,按物理层、链路层、网络层和应用层进行了详细说明,以适应星载高速率无线数据传输的要求,具有灵活性高、可靠性高、扩展性高的特点。网络协议的IP核经过地面演示系统进行验证,实验测得应用层数据传输的误码率小于10-9。 相似文献
14.
An optimization model which is frequently used to assist decision makers in the areas of resource scheduling, planning, and distribution is the minimum cost multiperiod network flow problem. This model describes network structure decision-making problems over time. Such problems arise in the areas of production/distribution systems, economic planning, communication systems, material handling systems, traffic systems, railway systems, building evacuation systems, energy systems, as well as in many others. Although existing network solution techniques are efficient, there are still limitations to the size of problems that can be solved. To date, only a few researchers have taken the multiperiod structure into consideration in devising efficient solution methods. Standard network codes are usually used because of their availability and perceived efficiency. In this paper we discuss the development, implementation, and computational testing of a new technique, the forward network simplex method, for solving linear, minimum cost, multiperiod network flow problems. The forward network simplex method is a forward algorithm which exploits the natural decomposition of multiperiod network problems by limiting its pivoting activity. A forward algorithm is an approach to solving dynamic problems by solving successively longer finite subproblems, terminating when a stopping rule can be invoked or a decision horizon found. Such procedures are available for a large number of special structure models. Here we describe the specialization of the forward simplex method of Aronson, Morton, and Thompson to solving multiperiod network network flow problems. Computational results indicate that both the solution time and pivot count are linear in the number of periods. For standard network optimization codes, which do not exploit the multiperiod structure, the pivot count is linear in the number of periods; however, the solution time is quadratic. 相似文献
15.
针对现有的软件定义卫星网络中流表占用的三态内容寻址存储器空间不断增加,复杂的流表项查找、匹配过程导致路由转发效率降低,无法满足多样化应用需求的问题,提出基于神经网络的软件定义卫星网络智能路由架构。控制器通过训练神经网络获取数据流的传输模式,并用训练后的神经网络代替流表,在此基础上提出基于Chebyshev神经网络的智能路由策略,交换机根据数据流的业务类型预测其转发路径,以满足卫星网络应用的服务质量要求。仿真结果表明:所提路由策略显著减少了占用的三态内容寻址存储器存储空间,提高了路由效率。 相似文献
16.
A set of edges D called an isolation set, is said to isolate a set of nodes R from an undirected network if every chain between the nodes in R contains at least one edge from the set D. Associated with each edge of the network is a positive cost. The isolation problem is concerned with finding an isolation set such that the sum of its edge costs is a minimum. This paper formulates the problem of determining the minimal cost isolation as a 0–1 integer linear programming problem. An algorithm is presented which applies a branch and bound enumerative scheme to a decomposed linear program whose dual subproblems are minimal cost network flow problems. Computational results are given. The problem is also formulated as a special quadratic assignment problem and an algorithm is presented that finds a local optimal solution. This local solution is used for an initial bound. 相似文献
17.
R. D. Wollmer 《海军后勤学研究》1970,17(2):207-216
This paper presents an algorithm for determining where to place intercepting units in order to maximize the probability of preventing an opposing force from proceeding from one particular node in an undirected network to another. The usual gaming assumptions are invoked; namely, the strategy for placing the units is known to the opponent and he will choose a path through the network which, based on this knowledge, maximizes his probability of successful traverse. As given quantities, the model requires a list of the arcs and nodes of the network, the number of intercepting units available to stop the opposing force, and the probabilities for stopping the opposition at the arcs and nodes as functions of the number of intercepting units placed there. From these quantities, the algorithm calculates the probabilities for placing the unit at the arcs and nodes when one intercepting unit is available, and the expected numbers of units to place at the arcs and nodes when multiple intercepting units are available. 相似文献
18.
针对目前网络性能评价中多元指标之间权重难以确定的问题,将信息熵理论应用于网络性能评价中.提出采用熵权方法确定指标权重,进而对网络性能进行评价的方法.为了获取反映不同网络状态的性能数据,采用网络仿真方法获得计算熵权所需的样本.实例表明,信息熵能够客观地反映各指标贡献信息量的大小,基于信息熵的熵权能够客观反映各指标的相对重要程度. 相似文献
19.
神经网络模型具有强大的问题建模能力,但是传统的反向传播算法只能进行批量监督学习,并且训练开销很大。针对传统算法的不足,提出全新的增量式神经网络模型及其聚类算法。该模型基于生物神经学实验证据,引入新的神经元激励函数和突触调节函数,赋予模型以坚实的统计理论基础。在此基础上,提出一种自适应的增量式神经网络聚类算法。算法中引入"胜者得全"式竞争等学习机制,在增量聚类过程中成功避免了"遗忘灾难"问题。在经典数据集上的实验结果表明:该聚类算法与K-means等传统聚类算法效果相当,特别是在增量学习任务的时空开销方面具有较大优势。 相似文献
20.
NDIS技术在网络监测中的实现 总被引:1,自引:0,他引:1
王发坤 《海军工程大学学报》2002,14(5):63-66
阐述了利用NDIS进行网络包的监测和分析的基本原理,在此基础上实现了对网络适配器在数据链路层网络包的监测,并通过数据报文结构的分析,再现了应用层协议的实现过程. 相似文献