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.     

综采工作面粉尘运动规律的数值模拟

运用气固两相流动理论,建立粉尘运动的数学模型. 根据综采工作面的具体特点和实测数据,采用计算流体力学的FLUENT软件,对工作面的粉尘运动规律进行数值模拟. 模拟结果显示,粉尘产生后多数随风流在煤壁一侧运动,少数粉尘随机扩散. 综采工作面的除尘重点应该放在采煤机下风向10m以内的煤壁一侧;预湿煤壁对降低工作面粉尘浓度也有很大作用.     

LFM寄生调相对海上目标检测的影响

本文就HF Radar中数字直读法产生LFM电路出发,分析了LFM寄生调相产生的原因,以及对系统检测性能的影响,最后给出了计算机的仿真结果。     

Bipartite Consensus of Linear Multi-Agent Systems by Distributed Event-Triggered Control

For multi-agent systems with competitive and collaborative relationships, signed graph can more intuitively express the characteristics of their interactive networks. In this paper, the bipartite consensus is investigated for multi-agent systems with structurally balanced signed graph. In order to reduce actuation burden in dynamical network environment, the event-triggering strategy is applied to bipartite consensus protocol for the multi-agent systems. The triggered condition for each agent is designed by using its own information and transmitted information of its neighbors at sampling instant and make the number of triggers of the whole systems be reduced. Based on the distributed eventtriggered control, some sufficient conditions are derived to guarantee the leaderless and leader-following bipartite consensus. Finally, some numerical examples are shown to demonstrate the effectiveness of the theoretical results.