Study on Power Grid Partition and Attack Strategies Based on Complex Networks

Based on the community discovery method in complex network theory, a power grid partition method considering generator nodes and network weightings is proposed. Firstly, the weighted network model of a power system is established, an improved Fast-Newman hierarchical algorithm and a weighted modular Q function index are introduced, and the partitioning algorithm process is practically improved combined with the characteristics of the actual power grid. Then, the partition results of several IEEE test systems with the improved algorithm and with the Fast-Newman algorithm are compared to demonstrate its effectiveness and correctness. Subsequently, on the basis of subnet partition, two kinds of network attack strategies are proposed. One is attacking the maximum degree node of each subnet, and the other is attacking the maximum betweenness node of each subnet. Meanwhile, considering the two traditional intentional attack strategies, that is, attacking the maximum degree nodes or attacking the maximum betweenness nodes of the whole network, the cascading fault survivability of different types of networks under four attack strategies is simulated and analyzed. It was found that the proposed two attack strategies based on subnet partition are better than the two traditional intentional attack strategies.

Discovery of key function module in complex mechanical 3D CAD assembly model for design reuse

Purpose Complex mechanical 3D computer-aided design (CAD) model embodies rich implicit design knowledge. Through discovering the key function parts and key function module in 3D CAD assembly model in advance, it can promote the designers’ understanding and reuse efficiency of 3D assembly model in design reuse. Design/methodology/approach An approach for discovering key function module in complex mechanical 3D CAD assembly model is proposed. First, assembly network for 3D CAD assembly model is constructed, where the topology structure characteristics of 3D assembly model are analyzed based on complex network centrality. The degree centrality, closeness centrality, betweenness centrality and mutual information of node are used to evaluate the importance of the parts in 3D assembly model. Then, a multi-attribute decision model for part-node importance is established, and the comprehensive evaluation for key function parts in 3D assembly model is accomplished by combining Analytic Hierarchy Process and Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS). Subsequently, a community discovery of function module in assembly model-based Clauset–Newman–Moore (CNM)-Centrality is given in details. Finally, 3D CAD assembly model of worm gear reducer is taken as an example to verify the effectiveness and feasibility of proposed method. Findings The key function part in CAD assembly model is evaluated comprehensively considering assembly topology more objectively. In addition, the key function module containing key function part is discovered from CAD assembly model by using CNM-Centrality-based community discovery. Practical implications The approach can be used for discovering important design knowledge from complex CAD assembly model when reusing the assembly model. It can help designers capture and understand the design thinking and intent, improve the reuse efficiency and quality. Originality/value The paper first proposes an approach for discovering key function module in complex mechanical 3D CAD assembly model taking advantage of complex network theory, where the key function part is evaluated using node centrality and TOPSIS, and the key function module is identified based on community discovery.

X-Mark: a benchmark for node-attributed community discovery algorithms

Grouping well-connected nodes that also result in label-homogeneous clusters is a task often known as attribute-aware community discovery. While approaching node-enriched graph clustering methods, rigorous tools need to be developed for evaluating the quality of the resulting partitions. In this work, we present X-Mark, a model that generates synthetic node-attributed graphs with planted communities. Its novelty consists in forming communities and node labels contextually while handling categorical or continuous attributive information. Moreover, we propose a comparison between attribute-aware algorithms, testing them against our benchmark. Accordingly to different classification schema from recent state-of-the-art surveys, our results suggest that X-Mark can shed light on the differences between several families of algorithms.

TSCDA: A novel greedy approach for community discovery in networks

In this paper, we introduce a new approach for detecting community structures in networks. The approach is subject to modifying one of the connectivity-based community quality functions based on considering the impact that each community's most influential node has on the other vertices. Utilizing the proposed quality measure, we devise an algorithm that aims to detect high-quality communities of a given network based on two stages: finding a promising initial solution using greedy methods and then refining the solutions in a local search manner. The performance of our algorithm has been evaluated on some standard real-world networks as well as on some artificial networks. The experimental results of the algorithm are reported and compared with several state-of-the-art algorithms. The experiments show that our approach is competitive with the other well-known techniques in the literature and even outperforms them. This approach can be used as a new community detection method in network analysis.