A procedure for the synthesis of a fundamental loop or cut set matrix

Download
Author
Lohse, Hans Jurgen
Date
1968-12Advisor
Parker, Sydney R.
Metadata
Show full item recordAbstract
Existing realization procedures for a fundamental loop
or cut set matrix are reviewed, compared, and classified
broadly on the basis of their underlying approach. A new
combinatorial synthesis technique is presented utilizing
the concepts of trunk branches, main branches, limbs, and
unique connections which are introduced. This procedure is
direct, easy to apply and learn, general, and yields an expression
for the number of physically different or alternate
realizations which are possible. A general computer program
for realization of the graphs is presented and illustrated
with some examples. Existing realization procedures for a fundamental loop
or cut set matrix are reviewed, compared, and classified
broadly on the basis of their underlying approach. A new
combinatorial synthesis technique is presented utilizing
the concepts of trunk branches, main branches, limbs, and
unique connections which are introduced. This procedure is
direct, easy to apply and learn, general, and yields an expression
for the number of physically different or alternate
realizations which are possible. A general computer program
for realization of the graphs is presented and illustrated
with some examples.
Rights
Copyright is reserved by the copyright owner.Collections
Related items
Showing items related by title, author, creator and subject.
-
Approximating the chromatic number of an arbitrary graph using a supergraph heuristic
Eggen, Loren G. (Monterey, California. Naval Postgraduate School, 1997-06-19);We color the vertices of a graph G, so that no two adjacent vertices have the same color. We would like to do this as cheaply as possible. An efficient coloring would be very helpful in optimization models, with applications ... -
A generalized procedure for determining transient response of third order systems.
Harrison, Joe P. (Monterey, California: U.S. Naval Postgraduate School, 1965);For any system whose input-output relationship may be described by a ratio of polynomials in S (the complex number ѵ±jw), one of the measures of the system performance is its transient response to a step input. For ... -
Interoperability, data control and battlespace visualization using XML, XSLT and X3D
Neushul, James D. (Monterey, California. Naval Postgraduate School, 2003-09);This work represents the realization of Network-Centric goals of interoperability, information management, systems integration and cohesive battlespace visualization using networked computer technology. The application of ...