期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Drawing Weighted Directed Graph from It's Adjacency Matrix 被引量:1
1
作者 毛国勇 张武 《Journal of Shanghai University(English Edition)》 CAS 2005年第5期407-410,共4页
This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, ... This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory. 展开更多
关键词 weighted directed graph adjacency matrix relationship matrix.
下载PDF
An Improved Iterative Reconstruction Algorithm for Traveltime Tomography
2
作者 Ma Ning Hu Zhengyi +1 位作者 Tang Xueyuan Wang Yanping (College of Electronic information,Wuhan University,Wuhan, 430072,China) 《Wuhan University Journal of Natural Sciences》 CAS 1996年第1期67-70,共4页
Traveltime tomography is a technique to reconstruct acoustic, seismic, or electromagnetic wave-speed distributions from first arrival traveltime data. The ray paths that should be used for tomographic techniques stro... Traveltime tomography is a technique to reconstruct acoustic, seismic, or electromagnetic wave-speed distributions from first arrival traveltime data. The ray paths that should be used for tomographic techniques strongly depend on the wave-speed distribution. In this paper, a new method is proposed for finding out the ray paths from Fermat's principle, that means the traveltime of the ray path should be a minimum value. The problem of finding out the ray path is actually an optimum problem. Our new method uses the idea to find out the shortest path in a weighted directed graph to solve the problem. The ray paths found out by this method are used in the iterative reconstruction algorithm. Computer simulation result produced by this reconstruction algorithm is better than that by the conventional ones. It also shows that the new algorithm is effective with good convergency and stability. 展开更多
关键词 traveltime tomography Fermat's principle weighted directed graph
下载PDF
Evaluation method of node importance for power grid considering inflow and outflow power 被引量:3
3
作者 Huifang WANG Zhengbo SHAN +3 位作者 Gaoliang YING Bo ZHANG Guoping ZOU Benteng HE 《Journal of Modern Power Systems and Clean Energy》 SCIE EI 2017年第5期696-703,共8页
The effective identifications of important nodes in power grid are foundations of differentiated management and stable operation of power grid. However, the current studies on this field are not thorough enough. This ... The effective identifications of important nodes in power grid are foundations of differentiated management and stable operation of power grid. However, the current studies on this field are not thorough enough. This paper applies the model based on co-citation(MBCC)-hypertext induced topic selection(HITS) algorithm used in web page ranking to power grid and proposes an index to determine node importance of power grid from the perspectives of inflow and outflow power. MBCC-HITS algorithm is modified considering load, power source, and line flow comprehensively for the differences between Internet and power grid in this paper. Then a method for evaluating node importance is proposed using the modified algorithm. Lastly, the rationality and validity of the proposed method are verified by comparisons with other methods in case studies of IEEE 14-bus and 118-bus systems. 展开更多
关键词 Node importance MBCC-HITS algorithm directed and weighted graph Inflow power Outflow power Power grid
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部