Analysis of identification methods of key nodes in transportation network

The identification of key nodes plays an important role in improving the robustness of the transportation network. For different types of transportation networks, the effect of the same identification method may be different. It is of practical significance to study the key nodes identification methods corresponding to various types of transportation networks. Based on the knowledge of complex networks, the metro networks and the bus networks are selected as the objects, and the key nodes are identified by the node degree identification method, the neighbor node degree identification method, the weighted k-shell degree neighborhood identification method (KSD), the degree k-shell identification method (DKS), and the degree k-shell neighborhood identification method (DKSN). Take the network efficiency and the largest connected subgraph as the effective indicators. The results show that the KSD identification method that comprehensively considers the elements has the best recognition effect and has certain practical significance.     

A memristive map with coexisting chaos and hyperchaos

By introducing a discrete memristor and periodic sinusoidal functions, a two-dimensional map with coexisting chaos and hyperchaos is constructed. Various coexisting chaotic and hyperchaotic attractors under different Lyapunov exponents are firstly found in this discrete map, along with which other regimes of coexistence such as coexisting chaos, quasi-periodic oscillation, and discrete periodic points are also captured. The hyperchaotic attractors can be flexibly controlled to be unipolar or bipolar by newly embedded constants meanwhile the amplitude can also be controlled in combination with those coexisting attractors. Based on the nonlinear auto-regressive model with exogenous inputs (NARX) for neural network, the dynamics of the memristive map is well predicted, which provides a potential passage in artificial intelligence-based applications.     

基于度的正/负相关相依网络模型及其鲁棒性研究

利用典型的Barabási-Albert无标度网络构建了基于度的正/负相关相依网络模型, 该模型考虑子网络间的相依方式及相依程度, 主要定义了两个参数F和K, F表示相依节点比例, K表示相依冗余度. 在随机攻击及基于度的蓄意攻击模式下, 针对网络的级联失效问题, 研究了不同的F值和K值对该相依网络模型鲁棒性的影响, 与随机相依网络模型进行了对比研究. 仿真结果表明:无论是随机相依或是基于度的正/负相关相依网络, 其鲁棒性都是随着F的增大而减弱, 随着K的增大而增强; 在随机攻击下, 全相依模式(F=1)时, 基于度正相关相依网络模型鲁棒性最优, 部分相依模式 (F =0.2, 0.5, 0.8)时, 基于度的负相关相依网络模型则表现出更好的鲁棒性. 而在基于度的蓄意攻击下, 无论F为何值, 基于度的正相关相依网络模型表现出弱鲁棒性.     

具有无穷共存吸引子的简单忆阻混沌系统的分析与实现

利用忆阻器构建特殊混沌系统是非常有趣且充满意义的,本文提出了一个存在无穷共存吸引子的四维忆阻混沌系统,该系统的形式较为简单却能够表现出复杂的动力学行为.本文利用数值仿真手段对系统进行深入研究,基于分岔图展现了参数影响下系统动力学行为演化过程,发现系统在不同的参数下,能够产生丰富的混沌吸引子与周期吸引子,在相平面图中观测到不同初始值下共存的无穷多形态各异的周期、混沌吸引子,且系统的状态变量的震荡幅度与初始值密切相关.最后,在电路实验中观测到与数值仿真一致的结果,说明了系统的存在性与可行性.