期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
NORMALIZED ELEMENT NODE TOPOLOGICAL MATRIX OF FINITE ELEMENT MESHES
1
作者 Hao Yongping 《Computer Aided Drafting,Design and Manufacturing》 1996年第1期69-74,共2页
On the basis of concept of element node topological analysis, the normalized element node topological matrices for finite element meshes are presented in the paper, including 3-node and 6-node triangular element, 4-n... On the basis of concept of element node topological analysis, the normalized element node topological matrices for finite element meshes are presented in the paper, including 3-node and 6-node triangular element, 4-node and 8-node quadrilateral element, 8-node and 20-node hexahedral element. It is beneficial to further analyzing topological characteristics of finite element models and automatic generation of meshes 展开更多
关键词 ss: element node topological matrix relativity
全文增补中
MINIMIZING INTERMEDIATE MULTICAST ROUTING FOR DYNAMIC MULTI-HOP AD HOC NETWORKS
2
作者 Yu Quan Wu Kejun +1 位作者 Luo Guoming Jin Yongxin 《Journal of Electronics(China)》 2007年第3期412-416,共5页
A Minimizing Intermediate Multicast Routing protocol (MIMR) is proposed for dynamic multi-hop ad hoc networks. In MIMR,multicast sessions are created and released only by source nodes. In each multicast session proces... A Minimizing Intermediate Multicast Routing protocol (MIMR) is proposed for dynamic multi-hop ad hoc networks. In MIMR,multicast sessions are created and released only by source nodes. In each multicast session process,the source node keeps a list of intermediate nodes and destinations,which is encapsulated into the packet header when the source node sends a multicast packet. Nodes receiving multicast packets decide to accept or forward the packet according to the list. Depending on topology matrix maintained by unicast routing,the shortest virtual hierarchy routing tree is con-structed by improved Dijkstra algorithm. MIMR can achieve the minimum number of intermediate nodes,which are computed through the tree. No control packet is transmitted in the process of mul-ticast session. Load of the network is largely decreased. Experimental result shows that MIMR is flexible and robust for dynamic ad hoc networks. 展开更多
关键词 Ad hoc networks Multicast routing Unicast routing Topology matrix
在线阅读 下载PDF
Fault-line selection and fault-type recognition in DC systems based on graph theory 被引量:20
3
作者 Yan Xu Jingyan Liu Yuan Fu 《Protection and Control of Modern Power Systems》 2018年第1期276-285,共10页
When a fault occurs in a DC system,the fault current rises rapidly with no zero-crossing point which makes fault-line selection and fault-type identification difficult.In this paper,an online detection and protection ... When a fault occurs in a DC system,the fault current rises rapidly with no zero-crossing point which makes fault-line selection and fault-type identification difficult.In this paper,an online detection and protection method based on graph theory,namely the“double D method”,is proposed for fault-line selection and fault-type identification in DC systems.In the proposed method,the entire distribution network is visualized as a“map”with vertices representing the line convergence points and edges representing the connection lines.A network topology matrix“D”is formed by detecting the current directions as the current directions are altered following a fault,whereas the current directions at the ends of non-fault lines remain the same.In order to prevent misjudgment problems arising from power flow reversal,the rates of change of the fault currents are used to further determine whether a fault has occurred and the“double D method”is introduced to identify the fault type.Simulations results with different fault types verify the effectiveness and reliability of the proposed method. 展开更多
关键词 Network topology matrix Double D method Fault-line selection Fault-type identification Graph theory
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部