The Experts below are selected from a list of 22506 Experts worldwide ranked by ideXlab platform
Chin-der Yang - One of the best experts on this subject based on the ideXlab platform.
-
Complex power tracing technique of load extraction using Incidence Matrix multiplication
2011 6th IEEE Conference on Industrial Electronics and Applications, 2011Co-Authors: Tung-sheng Zhan, Chin-der YangAbstract:In this paper, a complex power flow tracing technique based on the converged AC power flow solution is proposed to determine the participations of each load in line flows. This method is formulated by using mathematical derivations without topological analysis and proportional-sharing principle, where electrical circuit theories are satisfied. There four Incidence Matrixes found by the relationship of electrical circuit theories, and these Matrixes will be integrated by Matrix multiplication. With Matrix formulations, this is an algorithm to find tracing components for line flows, generators and loads. Besides, the component of counter flows can also be found to show its effect on the line flow. This tracing technique can calculate power distributions of transmission network effectively, and can be easily integrated into the existent tariffs of charging for transmission services.
Wang Xiang - One of the best experts on this subject based on the ideXlab platform.
-
topology identification of power network based on Incidence Matrix
Power system technology, 2001Co-Authors: Wang XiangAbstract:An algorithm of topology identification based on Incidence Matrix for power networks is presented. This algorithm denotes the basic topology of power network by node branch incident Matrix, defines an “AND OR” multiplication of two matrices, then use the transmission characteristics of connectivity to implements the topological identification of power network. On this basis, using the node branch Incidence Matrix and the symmetry of node node connectivity Matrix, the technique to quicken the calculation speed and its implementation method is put forward. This algorithm can be implemented either by programming in assemble language or high level language, or by hardware such as single chip processor system or ASIC.
T Murata - One of the best experts on this subject based on the ideXlab platform.
-
generating basis siphons and traps of petri nets using the sign Incidence Matrix
IEEE Transactions on Circuits and Systems I-regular Papers, 1994Co-Authors: Erwin R Boer, T MurataAbstract:This paper introduces a new Matrix called the sign Incidence Matrix for Petri nets. Using this sign Incidence Matrix, we present a simple algorithm for generating all basis siphons or traps without first generating all siphons or traps. Any siphon (trap) can be expressed as an union of basis siphons (basis traps). The concept of siphons and traps plays an important role in the analysis of Petri nets. In particular, criteria for liveness and reachability of some subclasses of Petri nets can be stated in terms of siphons and traps. >
Hongzhu Gao - One of the best experts on this subject based on the ideXlab platform.
-
on region crossing change and Incidence Matrix
Science China-mathematics, 2012Co-Authors: Zhiyun Cheng, Hongzhu GaoAbstract:In a recent work of Ayaka Shimizu, she studied an operation named region crossing change on link diagrams, which was proposed by Kishimoto, and showed that a region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that the region crossing change on a 2-component link diagram is an unknotting operation if and only if the linking number of the diagram is even. Besides, we define an Incidence Matrix of a link diagram via its signed planar graph and its dual graph. By studying the relation between region crossing change and Incidence Matrix, we prove that a signed planar graph represents an n-component link diagram if and only if the rank of the associated Incidence Matrix equals c − n + 1, where c denotes the size of the graph.
-
on region crossing change and Incidence Matrix
arXiv: Geometric Topology, 2011Co-Authors: Zhiyun Cheng, Hongzhu GaoAbstract:In a recent work of Ayaka Shimizu$^{[5]}$, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region crossing change on a 2-component link diagram is an unknotting operation if and only if the linking number of the diagram is even. Besides, we define an Incidence Matrix of a link diagram via its signed planar graph and its dual graph. By studying the relation between region crossing change and Incidence Matrix, we prove that a signed planar graph represents an $n$-component link diagram if and only if the rank of the associated Incidence Matrix equals to $c-n+1$, here $c$ denotes the size of the graph.
Tung-sheng Zhan - One of the best experts on this subject based on the ideXlab platform.
-
Complex power tracing technique of load extraction using Incidence Matrix multiplication
2011 6th IEEE Conference on Industrial Electronics and Applications, 2011Co-Authors: Tung-sheng Zhan, Chin-der YangAbstract:In this paper, a complex power flow tracing technique based on the converged AC power flow solution is proposed to determine the participations of each load in line flows. This method is formulated by using mathematical derivations without topological analysis and proportional-sharing principle, where electrical circuit theories are satisfied. There four Incidence Matrixes found by the relationship of electrical circuit theories, and these Matrixes will be integrated by Matrix multiplication. With Matrix formulations, this is an algorithm to find tracing components for line flows, generators and loads. Besides, the component of counter flows can also be found to show its effect on the line flow. This tracing technique can calculate power distributions of transmission network effectively, and can be easily integrated into the existent tariffs of charging for transmission services.
