面向e-引航的近海边缘计算网络优化与仿真

为提高船舶引航过程安全性,提出了一种基于智能航标(Intelligent Navigation Aid,INA)的近海边缘计算网络(INA-based Offshore Edge Computing Network,IOECN)架构,以提供助航信息保障。重点研究网络中网元节点的布局优化问题(Layout Optimization Problem, LOP)。通过数学建模,将LOP转化为整数线性规划(Integer Linear Programming,ILP)问题。在满足网络覆盖率及连通性条件下,以网络成本最低为求解目标,并使用Gurobi进行求解、运用Matlab进行仿真展示,最终得到不同规模下的网络优化方案,验证了模型的正确性及可扩展性。     

航海模拟器中海洋环境时空动态变化的仿真

海洋结构物始终受到环境干扰,对海洋环境的仿真会显著影响航海模拟器的真实感。基于数值波浪模型生成海洋环境场,并利用SQLite开发实海域数据库。通过数据库中获取实际的风,海流和海浪信息来与真实海洋保持一致。对环境扰动进行建模,并且将时空变化特征和耦合效应都融入仿真。通过提出的仿真方法再现了真实的航行情况,并利用船载传感器的测量数据进行验证。仿真结果与实测数据吻合良好,说明本方法可以进一步提高海洋模拟器的物理真实感。     

基于博弈模型与NetLogo仿真的网络攻防态势研究

针对现有建模方法缺乏对攻防博弈行为与态势演化趋势的分析问题,从对抗角度出发分析网络攻防博弈特征;基于非合作不完全信息静态博弈理论建立网络攻防博弈模型,给出收益量化、博弈均衡计算和策略对抗结果判定方法;构建网络攻防博弈多Agent仿真模型;采用NetLogo开展局中人不同策略组合、不同初始数量等场景下的仿真实验,得出网络攻防态势随时间演化情况,通过对比分析仿真结果,给出扭转网络攻防态势的建议。     

基于极大连通子图边界的复杂网络恢复研究

网络恢复是应对不可避免的故障或失效的重要途径,合理的恢复策略有助于降低资源损耗且提高网络鲁棒性能。为研究复杂网络恢复动力学行为及其与网络鲁棒性之间关系,构建了基于极大连通子图边界的复杂网络恢复模型(Recovery Model of Boundary Nodes,RMBN),设计了网络平均恢复(Average Recovery of Boundary Nodes,ARBN)和择优恢复(Priority Recovery of Boundary Nodes,PRBN)策略。不同恢复策略在3种网络模型上的仿真结果表明,随着恢复比例的增大,网络鲁棒性逐渐增强且恢复作用时间更早、恢复能力更强,为复杂网络拓扑结构设计与鲁棒性优化提供借鉴。     

仪表着陆系统下滑宽度仿真系统研究

在分析仪表着陆系统ILS(Instrument Landing System)下滑调制深度差DDM(Different in the Depth of Modulation)指标形成原理的基础上,找到了影响DDM的因素为纯边带SBO(Sideband Only)信号的幅值,采用控制变量法得出了在DDM线性变化范围内SBO信号的幅值与下滑宽度、半宽度的关系模型,并通过实测数据对模型进行了验证。基于数学模型并结合NM7000设备,搭建了仿真系统,可动态模拟下滑宽度的调整过程。测试结果表明,仿真系统精度相对误差小于1%。系统应用对指导校飞及设备维护具有重要意义。     

基于图像序列的学习表情识别

对学习者面部表情进行识别,能够判断学习者的情绪状态,分析其学习效果。针对面部表情具有持续性和时序性的特点,采用表情图像序列作为表情识别对象。通过组合网络的方式,将长短期记忆网络(Long Short Term Memory Network, LSTM)与VGGNet组合成VGGNet-LSTM模型,在此基础上进行表情识别,显著提高了识别准确率。借鉴迁移学习方法,将VGGNet通过基本表情数据集CK+进行预训练后迁移到学习表情数据集下,避免了学习表情数据集数据量不足的缺陷,解决了模型过拟合问题。     

基于可接受性标准的复杂产品仿真系统在线评估框架

针对当前复杂仿真系统评估的滞后性问题,提出了基于可接受性标准(Acceptability Criteria,AC)的仿真在线评估方法。通过定性和定量AC到指标的映射模型来建立评估指标体系;引入指标集和评估函数,提出了仿真评估流程有限自动机七元组模型,给出仿真流程到评估自动机的映射关系和基于数据驱动的状态转移机制,实现评估过程自动化执行过程;基于上述成果设计了在线评估工具,通过案例验证了在线评估方法的有效性,表明该方法能够有效解决仿真系统评估滞后性问题。     

面向网络仿真拓扑的多目标优化映射方法

网络仿真是新型网络技术验证的重要支撑,针对给定的网络仿真拓扑,实现有效映射是其关键。综合考虑多种资源需求,提出了多目标优化映射方法MOTM (Multi-Objective Topology Mapping Method),实现物理资源的有效利用。该方法分析网络中节点、链路资源需求,赋予相应权值;将映射问题转化为图划分问题,采用多级图划分方法进行划分,并通过远程吞吐量阈值优化调整;最后,基于映射策略实现了仿真拓扑的自动部署。实验表明,MOTM相对于Openstack映射方法、随机映射方法,负载不均衡指数平均降低66.5%,95.5%,远程通信开销指数平均降低69.1%,65.2%。     

沿岸建筑物对VTS雷达的遮蔽建模与仿真

为研究沿岸建筑物对VTS (vessel traffic service)雷达的遮蔽影响程度,提出雷达遮蔽盲区的数学表达模型,基于表达模型和几何关系计算得出遮蔽盲区的范围和高度;提出一种三维建模和仿真方法来研究雷达遮蔽区域。以太子湾邮轮母港建筑对蛇口雷达的影响为例,将遮蔽盲区的计算结果、仿真结果和实船试验进行对比,验证了仿真方法的正确性和工程实用性。本文的研究可用于评估建筑物对现有VTS雷达站的影响,还可为海事部门的补充监管措施以及拟建VTS雷达站选址提供重要参考。     

一种基于环境预报数据的阵风建模方法

针对现有飞行器仿真试验自然环境模型,研究环境预报数据转换和处理方法;基于随机波浪理论,建立二元阵风紊流数学模型,并研究该模型的仿真建模方法;基于Davenport谱建立基于环境预报数据的阵风紊流模型,并引入到飞行器六自由度数学仿真试验中,得到阵风紊流对于飞行器飞行状态的影响情况。试验结果表明,阵风紊流对于飞行器攻角影响较大,对于飞行高度影响较小,利用阵风紊流模型开展飞行器航迹仿真试验切实可行。     

Relative Degree Structural Hole Centrality,CRD−SH: A New Centrality Measure in Complex Networks

In order to assess influential nodes in complex networks, the authors propose a novel ranking method based on structural hole in combination with the degree ratio of a node and its neighbors. The proposed method is a response to the limitations of other proposed measures in this field. The structural hole gives a comprehensive attention of the information about the node topology in relation to its neighbors, whereas the degree ratio of nodes reflects its significance against the neighbors.Combination of the two aforementioned measures summarized in the structural hole leverage matrix demonstrates the importance of a node according to its position in the network structure. So a more accurate method for ranking influential nodes is established. The simulation results over different-scale networks(small networks with less than 30 nodes, medium networks with less than 150 nodes and large networks with more than 1000 nodes) suggest that the proposed method can rank important nodes more effectively and precisely in complex networks specifically in larger ones.     

Statistical Identification of Important Nodes in Biological Systems

Biological systems can be modeled and described by biological networks. Biological networks are typical complex networks with widely real-world applications. Many problems arising in biological systems can be boiled down to the identification of important nodes. For example, biomedical researchers frequently need to identify important genes that potentially leaded to disease phenotypes in animal and explore crucial genes that were responsible for stress responsiveness in plants. To facilitate the identification of important nodes in biological systems, one needs to know network structures or behavioral data of nodes(such as gene expression data). If network topology was known, various centrality measures can be developed to solve the problem; while if only behavioral data of nodes were given, some sophisticated statistical methods can be employed. This paper reviewed some of the recent works on statistical identification of important nodes in biological systems from three aspects, that is,1) in general complex networks based on complex networks theory and epidemic dynamic models; 2)in biological networks based on network motifs; and 3) in plants based on RNA-seq data. The identification of important nodes in a complex system can be seen as a mapping from the system to the ranking score vector of nodes, such mapping is not necessarily with explicit form. The three aspects reflected three typical approaches on ranking nodes in biological systems and can be integrated into one general framework. This paper also proposed some challenges and future works on the related topics. The associated investigations have potential real-world applications in the control of biological systems, network medicine and new variety cultivation of crops.     

A New K-Shell Decomposition Method for Identifying Influential Spreaders of Epidemics on Community Networks

An efficient method for the identification of influential spreaders that could be used to control epidemics within populations would be of considerable importance. Generally, populations are characterized by its community structures and by the heterogeneous distributions of out-leaving links among nodes bridging over communities. A new method for community networks capable of identifying influential spreaders that accelerate the spread of disease is here proposed. In this method, influential spreaders serve as target nodes. This is based on the idea that, in k-shell decomposition method,out-leaving links and inner links are processed separately. The method was used on empirical networks constructed from online social networks, and results indicated that this method is more accurate. Its effectiveness stems from the patterns of connectivity among neighbors, and it successfully identified the important nodes. In addition, the performance of the method remained robust even when there were errors in the structure of the network.     

基于复杂网络理论的配电网节点脆弱度评估

配电网中节点脆弱性的大小是其结构鲁棒性的重要体现,为实现对配电网节点脆弱度的评估,提出对配电网节点脆弱度大小排序的方法。首先,构建配电网的复杂网络加权模型;其次,针对节点脆弱度评估中的度值、介数、凝聚度和紧密度等几个指标,结合主观和客观两方面信息构建描述各指标重要性的权重;最后,提出综合逼近理想排序(Technique for Order Preference by Similarity to Ideal Solution,TOPSIS)和灰色关联度的方法,实现对配电网节点脆弱度大小的排序。对几种典型的中压配电网进行计算,验证了本文方法的可行性,对IEEE123系统分析,结果表明多指标综合评估较单一指标评估更符合配网的实际特点。     

一种采用混合抗干扰方法的路由恢复机制

针对工业无线传感器网络中的干扰攻击问题,得出一种基于WirelessHART图路由的被干扰攻击节点路由恢复机制。通过干扰攻击检测方法获取被干扰攻击节点与干扰攻击区域,利用非协调跳频扩频技术生成被干扰攻击节点与周围节点的跳频序列,从而进行传统跳频扩频,对被干扰攻击节点进行再检测,结合路由代价与WirelessHART图路由算法将被干扰攻击节点恢复到网络中。仿真结果表明路由恢复机制能够帮助被干扰攻击节点消除干扰攻击影响,并在保证吞吐量的情况下成功加入到网络中。     

Finding Key Node Sets in Complex Networks Based on Improved Discrete Fireworks Algorithm

Finding out the key node sets that affect network robustness has great practical significance for network protection and network disintegration. In this paper, the problem of finding key node sets in complex networks is defined firstly. Because it is an NP-hard combinatorial optimization problem,discrete fireworks algorithm is introduced to search the optimal solution, which is a swarm intelligence algorithm and is improved by the prior information of networks. To verify the effect of improved discrete fireworks algorithm(IDFA), experiments are carried out on various model networks and real power grid.Results show that the proposed IDFA is obviously superior to the benchmark algorithms, and networks suffer more damage when the key node sets obtained by IDFA are removed from the networks. The key node sets found by IDFA contain a large number of non-central nodes, which provides the authors a new perspective that the seemingly insignificant nodes may also have an important impact on the robustness of the network.     

能力与权力:大规模复杂网络重要节点识别的二重异质指标及算法

为快速识别大规模复杂网络中的重要节点,本研究将人类社会普遍存在的两类不平等映射为节点在网络中的能力与权力的二重异质性,设计了评价复杂网络节点重要度的DH指标,构造了用于DH指标快速分布式计算的并行随机距离渐进(parallel random distance approach,简称PRDA)算法.通过网络最大连通率、网络均衡熵、算法有效性和算法效率的评价实验验证DH指标及PRDA算法的有效性,得出结论如下:DH指标在识别重要节点时能适应不同拓扑特征的复杂网络,识别性能优于或同于时间复杂度更高的介数;PRDA估计算法在最短路径获得概率p=1-10~(-1.5)的水平上得到的节点效率估计值■与真实值η_i的Pearson相关系数在0.975以上,且在大规模网络上进行节点效率估计结果更可靠;在Apache Spark并行内存计算环境中应用时间复杂度为O(n~2/l)的PRDA算法求解DH指标耗时远小于介数求解耗时,这表明算法的时间特性也适于大规模网络.     

基于贝叶斯学习的复杂系统研制风险演化分析

大型复杂装备的系统结构和研制流程呈现网络化特征,研究风险演化机理有助于控制风险、降低复杂性.通过系统动态过程建模仿真获取数据样本,运用贝叶斯学习从仿真数据样本中提炼风险演化网络,识别不同风险等级的节点之间存在的关联关系,降低了仅凭经验构建风险网络的主观性.对贝叶斯学习获得的风险网络进行概率推理,在总体高风险等级下计算风险网络节点的风险后验概率分布,进而确定风险演化关键节点和传播链路.最后,通过与复杂网络特征指标评估下的静态特征进行对比分析,研究风险网络动态特征与静态特征的差异性,结果表明网络结构特征和风险传播的动态特征共同决定了风险演化关键节点和传播链路.     

基于Agent的多代数码产品扩散仿真研究

数码产品具有多代并存扩散的特点,多代产品扩散模型是研究其扩散规律的重要工具,但现有模型忽略了一些显著影响扩散过程的产品、消费者和环境因素。采用ABMS、模糊推理、复杂网络和效用理论,提出一种考虑了这些因素的多代数码产品扩散模型。实验结果显示,该模型能很好地再现iPhone手机的扩散过程,说明历史数据充分时其模拟/预测能力良好,可作为数码产品营销分析与决策的辅助工具。