To ensure the stable operation of power systems, critical nodes need to be identified for key protection. The leaderrank algorithm is a fast and accurate algorithm for identifying key nodes, but it has obvious inappro...
详细信息
To ensure the stable operation of power systems, critical nodes need to be identified for key protection. The leaderrank algorithm is a fast and accurate algorithm for identifying key nodes, but it has obvious inappropriateness when targeting the power system. For this reason, this paper considers the scheduling function of the information network and the power flow betweenness of the power grid. A TrendRank algorithm is proposed to identify key nodes in complex power grids. TrendRank values can be computed iteratively by a weighted distribution strategy of internally linked nodes and then ranked. The performance of the TrendRank method has been fully tested and benchmarked on IEEE39 and IEEE118. The comparison of four performance metrics fully validates the effectiveness and superiority of the method. The TrendRank algorithm provides an idea in protecting the power system, which makes the economic cost of protecting the power system lower.
Purpose The development of complex products and systems is a continuously iterative process from customer requirements to a mature design. Design changes derived from multisources occur frequently during the design pr...
详细信息
Purpose The development of complex products and systems is a continuously iterative process from customer requirements to a mature design. Design changes derived from multisources occur frequently during the design process. Furthermore, change propagation will impose impacts on design costs and lead times. In view of this, how to predict and control the propagation of multisource design change to reduce the changes impact is an urgent issue in the development of complex product. Design/methodology/approach In this paper, a new four-phase routing approach based on weighted and directed complex networks is proposed for multisource design change propagation. Phase I: as the foundation of this research, a product network model is established to quantify describe the complex product. Phase II: the hub nodes are identified based on the leaderrank algorithm, which can be regarded as multisource nodes of design changes. Phase III: a calculation method for change propagation intensity is proposed, which improves the systematicness and accuracy of the evaluation results. In this paper, change propagation intensity is defined by four assessment factors: importance degree of parts, execution time of design tasks, coupling strength between parts and propagation likelihood. Phase IV: a routing method of multisource design change propagation and ant colony optimization algorithm are proposed in this paper, which can solve the coupling conflicts among change propagation paths and improve the search efficiency by using the parallel search strategy. Findings The proposed method and another method are used to search the optimal propagation path of multisource design change of a motorcycle engine;the results indicate that this method designed in this study has a positive effect on reducing the change impact, market response time and product design costs when design change occurs in the products design process. Originality/value The authors find a new method (a network-based four-phase
High-speed railway (HSR) is an important carrier of China railway passenger transportation. It is of great significance to improve the performance of HSR network. This paper studies the optimization of HSR network wit...
详细信息
ISBN:
(纸本)9780784482742
High-speed railway (HSR) is an important carrier of China railway passenger transportation. It is of great significance to improve the performance of HSR network. This paper studies the optimization of HSR network with the goal of optimal global accessibility. Based on the degree of stations, clustering coefficient of stations, and other indicators, the topology characteristics of China's HSR network in 2030 are analyzed. The leaderrank algorithm is used to identify the important stations of HSR network from the perspective of topology. Then the optimization model is established and solved with the goal of optimal accessibility of global network. The results show that Changsha is the most important station in China's HSR network in 2030. Considering the investment restrictions of railway construction, constructing HSR links between Tongliao and Yixian, Datong and Yulin, Wuhai and Wuwei, Mianzhu and Mianyang, and Huanghua and Zibo can maximize the global accessibility of China's HSR network in 2030. The optimization model can improve the performance of HSR network effectively, it also has certain reference significance to construction of HSR network.
In recent years, with the rapid development of network technology, the scale of social networks has become increasingly large and diversified. The detection of community has become a hot spot in the research of social...
详细信息
ISBN:
(纸本)9798350374377
In recent years, with the rapid development of network technology, the scale of social networks has become increasingly large and diversified. The detection of community has become a hot spot in the research of social network. Label propagation algorithm (LPA) has been widely concerned since it has the advantages of linear time complexity. However, the randomness of LPA affects the accuracy and stability of the community. This paper proposes an improved label propagation algorithm for undirected weighted networks. In the first stage, considering both node importance and local topological information, an improved LPA is designed to divide the undirected weighted network into initial communities, thereby reducing the instability of LPA. In the second stage, a strategy for increasing modularity is designed to merge small communities, thereby improving the quality of community partitioning. Experimental results show that the proposed community detection algorithm has better community detection quality compared to LPA and four classical community detection algorithms.
暂无评论