The circuit topology of an electronic circuit is the form taken by the network of interconnections of the circuit components.  Different specific values or ratings of the components are regarded as being the same topology.  Topology is not concerned with the physical layout of components in a circuit, nor with their positions on a circuit diagram; similarly to the mathematical concept of topology, it is only concerned with what connections exist between the components.  There may be numerous physical layouts and circuit diagrams that all amount to the same topology.

Strictly speaking, replacing a component with one of an entirely different type is still the same topology.  In some contexts, however, these can loosely be described as different topologies.  For instance, interchanging inductors and capacitors in a low-pass filter results in a high-pass filter.  These might be described as high-pass and low-pass topologies even though the network topology is identical.  A more correct term for these classes of object (that is, a network where the type of component is specified but not the absolute value) is prototype network.

Electronic network topology is related to mathematical topology. In particular, for networks which contain only two-terminal devices, circuit topology can be viewed as an application of graph theory.  In a network analysis of such a circuit from a topological point of view, the network nodes are the vertices of graph theory, and the network branches are the edges of graph theory.

Standard graph theory can be extended to deal with active components and multi-terminal devices such as integrated circuits.  Graphs can also be used in the analysis of infinite networks.

Circuit diagrams
The circuit diagrams in this article follow the usual conventions in electronics; lines represent conductors, filled small circles represent junctions of conductors, and open small circles represent terminals for connection to the outside world.  In most cases, impedances are represented by rectangles.  A practical circuit diagram would use the specific symbols for resistors, inductors, capacitors etc., but topology is not concerned with the type of component in the network, so the symbol for a general impedance has been used instead.

The Graph theory section of this article gives an alternative method of representing networks.

Topology names
Many topology names relate to their appearance when drawn diagrammatically.  Most circuits can be drawn in a variety of ways and consequently have a variety of names.  For instance, the three circuits shown in Figure 1.1 all look different but have identical topologies.

This example also demonstrates a common convention of naming topologies after a letter of the alphabet to which they have a resemblance.  Greek alphabet letters can also be used in this way, for example Π (pi) topology and Δ (delta) topology.

Series and parallel topologies
For a network with two branches, there are only two possible topologies: series and parallel.

Even for these simplest of topologies, there are variations in the way the circuit can be presented.

For a network with three branches, there are four possible topologies.

Note that the parallel-series topology is another representation of the Delta topology discussed later.

Series and parallel topologies can continue to be constructed with greater and greater numbers of branches ad infinitum.  The number of unique topologies that can be obtained from  series or parallel branches is 1, 2, 4, 10, 24, 66, 180, 522, 1532, 4624,  .

Y and Δ topologies

Y and Δ are important topologies in linear network analysis due to these being the simplest possible three-terminal networks. A Y-Δ transform is available for linear circuits.  This transform is important because there are some networks that cannot be analysed in terms of series and parallel combinations. These networks arise often in 3-phase power circuits as they are the two most common topologies for 3-phase motor or transformer windings. An example of this is the network of figure 1.6, consisting of a Y network connected in parallel with a Δ network.  Say it is desired to calculate the impedance between two nodes of the network.  In many networks this can be done by successive applications of the rules for combination of series or parallel impedances.  This is not, however, possible in this case where the Y-Δ transform is needed in addition to the series and parallel rules.

The Y topology is also called star topology.  However, star topology may also refer to the more general case of many branches connected to the same node rather than just three.

Simple filter topologies

The topologies shown in figure 1.7 are commonly used for filter and attenuator designs.  The L-section is identical topology to the potential divider topology.  The T-section is identical topology to the Y topology.  The Π-section is identical topology to the Δ topology.

All these topologies can be viewed as a short section of a ladder topology.  Longer sections would normally be described as ladder topology.  These kinds of circuits are commonly analysed and characterised in terms of a two-port network.

Bridge topology

Bridge topology is an important topology with many uses in both linear and non-linear applications, including, amongst many others, the bridge rectifier, the Wheatstone bridge and the lattice phase equaliser.  There are several ways that bridge topology is rendered in circuit diagrams.  The first rendering in figure 1.8 is the traditional depiction of a bridge circuit.  The second rendering clearly shows the equivalence between the bridge topology and a topology derived by series and parallel combinations.  The third rendering is more commonly known as lattice topology.  It is not so obvious that this is topologically equivalent.  It can be seen that this is indeed so by visualising the top left node moved to the right of the top right node.

It is normal to call a network bridge topology only if it is being used as a two-port network with the input and output ports each consisting of a pair of diagonally opposite nodes.  The box topology in figure 1.7 can be seen to be identical to bridge topology but in the case of the filter the input and output ports are each a pair of adjacent nodes.  Sometimes the loading (or null indication) component on the output port of the bridge will be included in the bridge topology as shown in figure 1.9.

Bridged T and twin-T topologies

Bridged T topology is derived from bridge topology in a way explained in the Zobel network article.  There are many derivative topologies also discussed in the same article.

There is also a twin-T topology which has practical applications where it is desirable to have the input and output share a common (ground) terminal.  This may be, for instance, because the input and output connections are made with co-axial topology.  Connecting together an input and output terminal is not allowable with normal bridge topology and for this reason Twin-T is used where a bridge would otherwise be used for balance or null measurement applications.  The topology is also used in the twin-T oscillator as a sine wave generator.  The lower part of figure 1.11 shows twin-T topology redrawn to emphasise the connection with bridge topology.

Infinite topologies

Ladder topology can be extended without limit and is much used in filter designs.  There are many variations on ladder topology, some of which are discussed in the Electronic filter topology and Composite image filter articles.

The balanced form of ladder topology can be viewed as being the graph of the side of a prism of arbitrary order.  The side of an antiprism forms a topology which, in this sense, is an anti-ladder.  Anti-ladder topology finds an application in voltage multiplier circuits, in particular the Cockcroft-Walton generator.  There is also a full-wave version of the Cockcroft-Walton generator which uses a double anti-ladder topology.

Infinite topologies can also be formed by cascading multiple sections of some other simple topology, such as lattice or bridge-T sections.  Such infinite chains of lattice sections occur in the theoretical analysis and artificial simulation of transmission lines, but are rarely used as a practical circuit implementation.

Components with more than two terminals
Circuits containing components with three or more terminals greatly increase the number of possible topologies.  Conversely, the number of different circuits represented by a topology diminishes and in many cases the circuit is easily recognisable from the topology even when specific components are not identified.

With more complex circuits the description may proceed by specification of a transfer function between the ports of the network rather than the topology of the components.

Graph theory
Graph theory is the branch of mathematics dealing with graphs.  In network analysis, graphs are used extensively to represent a network being analysed.  The graph of a network captures only certain aspects of a network; those aspects related to its connectivity, or, in other words, its topology.  This can be a useful representation and generalisation of a network because many network equations are invariant across networks with the same topology.  This includes equations derived from Kirchhoff's laws and Tellegen's theorem.

History
Graph theory has been used in the network analysis of linear, passive networks almost from the moment that Kirchhoff's laws were formulated.  Gustav Kirchhoff himself, in 1847, used graphs as an abstract representation of a network in his loop analysis of resistive circuits.  This approach was later generalised to RLC circuits, replacing resistances with impedances.  In 1873 James Clerk Maxwell provided the dual of this analysis with node analysis.  Maxwell is also responsible for the topological theorem that the determinant of the node-admittance matrix is equal to the sum of all the tree admittance products.  In 1900 Henri Poincaré introduced the idea of representing a graph by its incidence matrix, hence founding the field of algebraic topology.  In 1916 Oswald Veblen applied the algebraic topology of Poincaré to Kirchhoff's analysis.  Veblen is also responsible for the introduction of the spanning tree to aid choosing a compatible set of network variables.

Comprehensive cataloguing of network graphs as they apply to electrical circuits began with Percy MacMahon in 1891 (with an engineer friendly article in The Electrician in 1892) who limited his survey to series and parallel combinations.  MacMahon called these graphs yoke-chains.  Ronald M. Foster in 1932 categorised graphs by their nullity or rank and provided charts of all those with a small number of nodes.  This work grew out of an earlier survey by Foster while collaborating with George Campbell in 1920 on 4-port telephone repeaters and produced 83,539 distinct graphs.

For a long time topology in electrical circuit theory remained concerned only with linear passive networks.  The more recent developments of semiconductor devices and circuits have required new tools in topology to deal with them.  Enormous increases in circuit complexity have led to the use of combinatorics in graph theory to improve the efficiency of computer calculation.

Graphs and circuit diagrams

Networks are commonly classified by the kind of electrical elements making them up. In a circuit diagram these element-kinds are specifically drawn, each with its own unique symbol.  Resistive networks are one-element-kind networks, consisting only of R elements.  Likewise capacitive or inductive networks are one-element-kind.  The RC, RL and LC circuits are simple two-element-kind networks.  The RLC circuit is the simplest three-element-kind network.  The LC ladder network commonly used for low-pass filters can have many elements but is another example of a two-element-kind network.

Conversely, topology is concerned only with the geometric relationship between the elements of a network, not with the kind of elements themselves.  The heart of a topological representation of a network is the graph of the network.  Elements are represented as the edges of the graph.  An edge is drawn as a line, terminating on dots or small circles from which other edges (elements) may emanate.  In circuit analysis, the edges of the graph are called branches.  The dots are called the vertices of the graph and represent the nodes of the network.  Node and vertex are terms that can be used interchangeably when discussing graphs of networks.  Figure 2.2 shows a graph representation of the circuit in figure 2.1.

Graphs used in network analysis are usually, in addition, both directed graphs, to capture the direction of current flow and voltage, and labelled graphs, to capture the uniqueness of the branches and nodes.  For instance, a graph consisting of a square of branches would still be the same topological graph if two branches were interchanged unless the branches were uniquely labelled.  In directed graphs, the two nodes that a branch connects to are designated the source and target nodes.  Typically, these will be indicated by an arrow drawn on the branch.

Incidence

Incidence is one of the basic properties of a graph.  An edge that is connected to a vertex is said to be incident on that vertex.  The incidence of a graph can be captured in matrix format with a matrix called an incidence matrix.  In fact, the incidence matrix is an alternative mathematical representation of the graph which dispenses with the need for any kind of drawing.  Matrix rows correspond to nodes and matrix columns correspond to branches.  The elements of the matrix are either zero, for no incidence, or one, for incidence between the node and branch.  Direction in directed graphs is indicated by the sign of the element.

Equivalence
Graphs are equivalent if one can be transformed into the other by deformation.  Deformation can include the operations of translation, rotation and reflection; bending and stretching the branches; and crossing or knotting the branches.  Two graphs which are equivalent through deformation are said to be congruent.

In the field of electrical networks, there are two additional transforms that are considered to result in equivalent graphs which do not produce congruent graphs.  The first of these is the interchange of series connected branches.  This is the dual of interchange of parallel connected branches which can be achieved by deformation without the need for a special rule.  The second is concerned with graphs divided into two or more separate parts, that is, a graph with two sets of nodes which have no branches incident to a node in each set.  Two such separate parts are considered an equivalent graph to one where the parts are joined by combining a node from each into a single node.  Likewise, a graph that can be split into two separate parts by splitting a node in two is also considered equivalent.

Trees and links

A tree is a graph in which all the nodes are connected, either directly or indirectly, by branches, but without forming any closed loops.  Since there are no closed loops, there are no currents in a tree.  In network analysis, we are interested in spanning trees, that is, trees that connect every node present in the graph of the network.  In this article, spanning tree is meant by an unqualified tree unless otherwise stated.  A given network graph can contain a number of different trees.  The branches removed from a graph in order to form a tree are called links, the branches remaining in the tree are called twigs.  For a graph with n nodes, the number of branches in each tree, t, must be;

An important relationship for circuit analysis is;

where b is the number of branches in the graph and ℓ is the number of links removed to form the tree.

Tie sets and cut sets
The goal of circuit analysis is to determine all the branch currents and voltages in the network.  These network variables are not all independent.  The branch voltages are related to the branch currents by the transfer function of the elements of which they are composed.  A complete solution of the network can therefore be either in terms of branch currents or branch voltages only.  Nor are all the branch currents independent from each other.  The minimum number of branch currents required for a complete solution is l.  This is a consequence of the fact that a tree has l links removed and there can be no currents in a tree.  Since the remaining branches of the tree have zero current they cannot be independent of the link currents.  The branch currents chosen as a set of independent variables must be a set associated with the links of a tree: one cannot choose any l branches arbitrarily.

In terms of branch voltages, a complete solution of the network can be obtained with t branch voltages.  This is a consequence the fact that short-circuiting all the branches of a tree results in the voltage being zero everywhere.  The link voltages cannot, therefore, be independent of the tree branch voltages.

A common analysis approach is to solve for loop currents rather than branch currents.  The branch currents are then found in terms of the loop currents.  Again, the set of loop currents cannot be chosen arbitrarily.  To guarantee a set of independent variables the loop currents must be those associated with a certain set of loops.  This set of loops consists of those loops formed by replacing a single link of a given tree of the graph of the circuit to be analysed.  Since replacing a single link in a tree forms exactly one unique loop, the number of loop currents so defined is equal to l.  The term loop in this context is not the same as the usual meaning of loop in graph theory.  The set of branches forming a given loop is called a tie set.  The set of network equations are formed by equating the loop currents to the algebraic sum of the tie set branch currents.

It is possible to choose a set of independent loop currents without reference to the trees and tie sets.  A sufficient, but not necessary, condition for choosing a set of independent loops is to ensure that each chosen loop includes at least one branch that was not previously included by loops already chosen.  A particularly straightforward choice is that used in mesh analysis in which the loops are all chosen to be meshes.  Mesh analysis can only be applied if it is possible to map the graph on to a plane or a sphere without any of the branches crossing over.  Such graphs are called planar graphs.  Ability to map onto a plane or a sphere are equivalent conditions.  Any finite graph mapped onto a plane can be shrunk until it will map onto a small region of a sphere.  Conversely, a mesh of any graph mapped onto a sphere can be stretched until the space inside it occupies nearly all of the sphere.  The entire graph then occupies only a small region of the sphere.  This is the same as the first case, hence the graph will also map onto a plane.

There is an approach to choosing network variables with voltages which is analogous and dual to the loop current method.  Here the voltage associated with pairs of nodes are the primary variables and the branch voltages are found in terms of them.  In this method also, a particular tree of the graph must be chosen in order to ensure that all the variables are independent.  The dual of the tie set is the cut set.  A tie set is formed by allowing all but one of the graph links to be open circuit.  A cut set is formed by allowing all but one of the tree branches to be short circuit.  The cut set consists of the tree branch which was not short-circuited and any of the links which are not short-circuited by the other tree branches.  A cut set of a graph produces two disjoint subgraphs, that is, it cuts the graph into two parts, and is the minimum set of branches needed to do so.  The set of network equations are formed by equating the node pair voltages to the algebraic sum of the cut set branch voltages.  The dual of the special case of mesh analysis is nodal analysis.

Nullity and rank
The nullity, N, of a graph with s separate parts and b branches is defined by;

The nullity of a graph represents the number of degrees of freedom of its set of network equations.  For a planar graph, the nullity is equal to the number of meshes in the graph.

The rank, R of a graph is defined by;

Rank plays the same role in nodal analysis as nullity plays in mesh analysis.  That is, it gives the number of node voltage equations required.  Rank and nullity are dual concepts and are related by;

Solving the network variables
Once a set of geometrically independent variables have been chosen the state of the network is expressed in terms of these.  The result is a set of independent linear equations which need to be solved simultaneously in order to find the values of the network variables.  This set of equations can be expressed in a matrix format which leads to a characteristic parameter matrix for the network.  Parameter matrices take the form of an impedance matrix if the equations have been formed on a loop-analysis basis, or as an admittance matrix if the equations have been formed on a node-analysis basis.

These equations can be solved in a number of well-known ways.  One method is the systematic elimination of variables.  Another method involves the use of determinants.  This is known as Cramer's rule and provides a direct expression for the unknown variable in terms of determinants.  This is useful in that it provides a compact expression for the solution.  However, for anything more than the most trivial networks, a greater calculation effort is required for this method when working manually.

Duality
Two graphs are dual when the relationship between branches and node pairs in one is the same as the relationship between branches and loops in the other.  The dual of a graph can be found entirely by a graphical method.

The dual of a graph is another graph.  For a given tree in a graph, the complementary set of branches (i.e., the branches not in the tree) form a tree in the dual graph.  The set of current loop equations associated with the tie sets of the original graph and tree are identical to the set of voltage node-pair equations associated with the cut sets of the dual graph.

The following table lists dual concepts in topology related to circuit theory.

The dual of a tree is sometimes called a maze  It consists of spaces connected by links in the same way that the tree consists of nodes connected by tree branches.

Duals cannot be formed for every graph.  Duality requires that every tie set has a dual cut set in the dual graph.  This condition is met if and only if the graph is mappable on to a sphere with no branches crossing.  To see this, note that a tie set is required to "tie off" a graph into two portions and its dual, the cut set, is required to cut a graph into two portions.  The graph of a finite network which will not map on to a sphere will require an n-fold torus.  A tie set that passes through a hole in a torus will fail to tie the graph into two parts.  Consequently, the dual graph will not be cut into two parts and will not contain the required cut set.  Consequently, only planar graphs have duals.

Duals also cannot be formed for networks containing mutual inductances since there is no corresponding capacitive element.  Equivalent circuits can be developed which do have duals, but the dual cannot be formed of a mutual inductance directly.

Node and mesh elimination
Operations on a set of network equations have a topological meaning which can aid visualisation of what is happening.  Elimination of a node voltage from a set of network equations corresponds topologically to the elimination of that node from the graph.  For a node connected to three other nodes, this corresponds to the well known Y-Δ transform.  The transform can be extended to greater numbers of connected nodes and is then known as the star-mesh transform.

The inverse of this transform is the Δ-Y transform which analytically corresponds to the elimination of a mesh current and topologically corresponds to the elimination of a mesh.  However, elimination of a mesh current whose mesh has branches in common with an arbitrary number of other meshes will not, in general, result in a realisable graph.  This is because the graph of the transform of the general star is a graph which will not map on to a sphere (it contains star polygons and hence multiple crossovers).  The dual of such a graph cannot exist, but is the graph required to represent a generalised mesh elimination.

Mutual coupling

In conventional graph representation of circuits, there is no means of explicitly representing mutual inductive couplings, such as occurs in a transformer, and such components may result in a disconnected graph with more than one separate part.  For convenience of analysis, a graph with multiple parts can be combined into a single graph by unifying one node in each part into a single node.  This makes no difference to the theoretical behaviour of the circuit so analysis carried out on it is still valid.  It would, however, make a practical difference if a circuit were to be implemented this way in that it would destroy the isolation between the parts.  An example would be a transformer earthed on both the primary and secondary side.  The transformer still functions as a transformer with the same voltage ratio but can now no longer be used as an isolation transformer.

More recent techniques in graph theory are able to deal with active components, which are also problematic in conventional theory.  These new techniques are also able to deal with mutual couplings.

Active components
There are two basic approaches available for dealing with mutual couplings and active components.  In the first of these, Samuel Jefferson Mason in 1953 introduced signal-flow graphs.  Signal-flow graphs are weighted, directed graphs.  He used these to analyse circuits containing mutual couplings and active networks.  The weight of a directed edge in these graphs represents a gain, such as possessed by an amplifier.  In general, signal-flow graphs, unlike the regular directed graphs described above, do not correspond to the topology of the physical arrangement of components.

The second approach is to extend the classical method so that it includes mutual couplings and active components.  Several methods have been proposed for achieving this.  In one of these, two graphs are constructed, one representing the currents in the circuit and the other representing the voltages.  Passive components will have identical branches in both trees but active components may not.  The method relies on identifying spanning trees that are common to both graphs.  An alternative method of extending the classical approach which requires only one graph was proposed by Chen in 1965.  Chen's method is based on a rooted tree.

Hypergraphs
Another way of extending classical graph theory for active components is through the use of hypergraphs.  Some electronic components are not represented naturally using graphs.  The transistor has three connection points, but a normal graph branch may only connect to two nodes.  Modern integrated circuits have many more connections than this.  This problem can be overcome by using hypergraphs instead of regular graphs.

In a conventional representation components are represented by edges, each of which connects to two nodes.  In a hypergraph, components are represented by hyperedges which can connect to an arbitrary number of nodes.  Hyperedges have tentacles which connect the hyperedge to the nodes.  The graphical representation of a hyperedge may be a box (compared to the edge which is a line) and the representations of its tentacles are lines from the box to the connected nodes.  In a directed hypergraph, the tentacles carry labels which are determined by the hyperedge's label.  A conventional directed graph can be thought of as a hypergraph with hyperedges each of which has two tentacles.  These two tentacles are labelled source and target and usually indicated by an arrow.  In a general hypergraph with more tentacles, more complex labelling will be required.

Hypergraphs can be characterised by their incidence matrices.  A regular graph containing only two-terminal components will have exactly two non-zero entries in each row.  Any incidence matrix with more than two non-zero entries in any row is a representation of a hypergraph.  The number of non-zero entries in a row is the rank of the corresponding branch, and the highest branch rank is the rank of the incidence matrix.

Non-homogeneous variables
Classical network analysis develops a set of network equations whose network variables are homogeneous in either current (loop analysis) or voltage (node analysis).  The set of network variables so found is not necessarily the minimum necessary to form a set of independent equations.  There may be a difference between the number of variables in a loop analysis to a node analysis.  In some cases the minimum number possible may be less than either of these if the requirement for homogeneity is relaxed and a mix of current and voltage variables allowed.  A result from Kishi and Katajini in 1967 is that the absolute minimum number of variables required to describe the behaviour of the network is given by the maximum distance between any two spanning forests of the network graph.

Network synthesis
Graph theory can be applied to network synthesis.  Classical network synthesis realises the required network in one of a number of canonical forms.  Examples of canonical forms are the realisation of a driving-point impedance by Cauer's canonical ladder network or Foster's canonical form or Brune's realisation of an immittance from his positive-real functions.  Topological methods, on the other hand, do not start from a given canonical form.  Rather, the form is a result of the mathematical representation.  Some canonical forms require mutual inductances for their realisation.  A major aim of topological methods of network synthesis has been to eliminate the need for these mutual inductances.  One theorem to come out of topology is that a realisation of a driving-point impedance without mutual couplings is minimal if and only if there are no all-inductor or all-capacitor loops.

Graph theory is at its most powerful in network synthesis when the elements of the network can be represented by real numbers (one-element-kind networks such as resistive networks) or binary states (such as switching networks).

Infinite networks
Perhaps, the earliest network with an infinite graph to be studied was the ladder network used to represent transmission lines developed, in its final form, by Oliver Heaviside in 1881.  Certainly all early studies of infinite networks were limited to periodic structures such as ladders or grids with the same elements repeated over and over.  It was not until the late 20th century that tools for analysing infinite networks with an arbitrary topology became available.

Infinite networks are largely of only theoretical interest and are the plaything of mathematicians.  Infinite networks that are not constrained by real-world restrictions can have some very unphysical properties.  For instance Kirchhoff's laws can fail in some cases and infinite resistor ladders can be defined which have a driving-point impedance which depends on the termination at infinity.  Another unphysical property of theoretical infinite networks is that, in general, they will dissipate infinite power unless constraints are placed on them in addition to the usual network laws such as Ohm's and Kirchhoff's laws.  There are, however, some real-world applications.  The transmission line example is one of a class of practical problems that can be modelled by infinitesimal elements (the distributed-element model).  Other examples are launching waves into a continuous medium, fringing field problems, and measurement of resistance between points of a substrate or down a borehole.

Transfinite networks extend the idea of infinite networks even further.  A node at an extremity of an infinite network can have another branch connected to it leading to another network.  This new network can itself be infinite.  Thus, topologies can be constructed which have pairs of nodes with no finite path between them.  Such networks of infinite networks are called transfinite networks.

Notes

See also
 Symbolic circuit analysis
 Network topology

References

Bibliography
Brittain, James E., The introduction of the loading coil: George A. Campbell and Michael I. Pupin", Technology and Culture, vol. 11, no. 1, pp. 36–57, The Johns Hopkins University Press, January 1970 .
Campbell, G. A., "Physical theory of the electric wave-filter", Bell System Technical Journal, November 1922, vol. 1, no. 2, pp. 1–32.
Cederbaum, I., "Some applications of graph theory to network analysis and synthesis", IEEE Transactions on Circuits and Systems, vol.31, iss.1, pp. 64–68, January 1984.
Farago, P. S., An Introduction to Linear Network Analysis, The English Universities Press Ltd, 1961.
Foster, Ronald M., "Geometrical circuits of electrical networks", Transactions of the American Institute of Electrical Engineers, vol.51, iss.2, pp. 309–317, June 1932.
Foster, Ronald M.; Campbell, George A., "Maximum output networks for telephone substation and repeater circuits", Transactions of the American Institute of Electrical Engineers, vol.39, iss.1, pp. 230–290, January 1920.
Guillemin, Ernst A., Introductory Circuit Theory, New York: John Wiley & Sons, 1953
Kind, Dieter; Feser, Kurt, High-voltage Test Techniques, translator Y. Narayana Rao, Newnes, 2001 .
Kishi, Genya; Kajitani, Yoji, "Maximally distant trees and principal partition of a linear graph", IEEE Transactions on Circuit Theory, vol.16, iss.3, pp. 323–330, August 1969.
MacMahon, Percy A., "Yoke-chains and multipartite compositions in connexion with the analytical forms called "Trees"", Proceedings of the London Mathematical Society, vol.22 (1891), pp.330–346 .
MacMahon, Percy A., "Combinations of resistances", The Electrician, vol.28, pp. 601–602, 8 April 1892.Reprinted in Discrete Applied Mathematics, vol.54, iss.Iss.2–3, pp. 225–228, 17 October 1994 .
Minas, M., "Creating semantic representations of diagrams", Applications of Graph Transformations with Industrial Relevance: international workshop, AGTIVE'99, Kerkrade, The Netherlands, September 1–3, 1999: proceedings, pp. 209–224, Springer, 2000 .
Redifon Radio Diary, 1970, William Collins Sons & Co, 1969.
Skiena, Steven S., The Algorithm Design Manual, Springer, 2008, .
Suresh, Kumar K. S., "Introduction to network topology" chapter 11 in Electric Circuits And Networks, Pearson Education India, 2010 .
Tooley, Mike, BTEC First Engineering: Mandatory and Selected Optional Units for BTEC Firsts in Engineering, Routledge, 2010 .
Wildes, Karl L.; Lindgren, Nilo A., "Network analysis and synthesis: Ernst A. Guillemin", A Century of Electrical Engineering and Computer Science at MIT, 1882–1982, pp. 154–159, MIT Press, 1985 .
Zemanian, Armen H., Infinite Electrical Networks, Cambridge University Press, 1991 .

Electrical engineering
Electronic engineering

Circuit topology (electrical)


A pet exotic felid, also called pet wild cat or pet non-domestic cat, is a member of the family Felidae (excluding the house cat and hybrids thereof) kept as an exotic pet.

Definition and differentiations
Hybrids of the domestic cat with non-domestic species (e. g. the Bengal cat or the Savannah cat) are not normally considered wild cats. While this distinction is often overlooked in the media and in the public eye, such cat breeds (especially the F5 and subsequent generations) are much closer to the domestic cat in terms of housing and husbandry requirements, behavior, and legality.

Unlike many other exotic pet species, wild cats usually cannot be kept indoors and require a large outdoor enclosure. This blurs the distinction between a wild cat being kept as an exotic pet and a private animal collection or menagerie. Usually, an enclosure meant for a pet exotic cat is built adjacent to the house in order to give the animal access into the living quarters.

Tame big cats kept by animal trainers (e. g. in circuses, private zoos or the film animal industry) are commonly mistaken for exotic pets. While the husbandry conditions and handling might be similar to a purely private setting, the common definition of a pet only includes animals kept for companionship or pleasure. Professional holders, breeders, or exhibitors do not meet this definition.

History
Exotic felids have a long tradition in human care. The ancient Egyptians kept servals in the same role as the African Wildcat (the wild ancestor of modern house cats). Cheetahs have also been kept throughout the world, both as companions and as hunting aides. Caracals have also been tamed and trained, primarily by Arabian and Asian rulers. Other large cats sometimes were also kept as companions, but were mostly limited to menageries owned by royal families. Large cats have been kept as pets for hundreds of years.

Species kept as exotic pets
In general, small cat species are more commonly kept as exotic pets than larger ones. Big cats are substantially more expensive to maintain, pose a greater danger when being handled in direct contact, and may not always remain handleable when fully grown. This typically limits their keeping to professional animal trainers and zoo settings.

Servals and caracals
Servals and caracals have the longest history as human companions. Part of their popularity can be attributed to the fact that they readily hybridize with domestic cats. The resulting crosses (savannahs and caracats) inherit traits of both the domestic cat and the wild species. Like domestic cats they are sometimes kept as pest controllers.

Lynxes and bobcats
Nearly all species of the genus Lynx (with the exception of the Iberian lynx) are kept as exotic pets. Unlike other small cat species, they are not known to hybridize with the domestic cat.

Ocelots
Ocelots were popular as an exotic pet in the 50s and 60s. The passage of the Endangered Species Act in the United States effectively ended their keeping outside of zoological facilities due to interstate animal movement restrictions. Their popularity is also limited by their comparatively high aggression. No hybrids with domestic cats are known.

Pumas
While being considered small cats taxonomically, pumas are comparable in size to some of the big cats. They are typically less aggressive and more affectionate than big cats, which has led to some popularity as exotic pets.

Cheetahs
The cheetah has a long history as a human companion. However, difficulties in breeding prevented this species from becoming a widespread exotic pet in modern times.

Leopards
Leopards were originally kept by royalty in Ancient Egypt; today it is a popular exotic pet due to its small size, exotic beauty and its striking coat featuring rosettes and spots. Black leopards are also kept as pets like their spotted counterparts.

Tigers

Tigers were once only kept by royalty; today it is a popular exotic pet.

Lions

Lions were also once only kept by royalty; today in some areas one has to have a permit to keep one; in some areas one can get one from the pet shop, while in other areas one may not own one. Lions are social animals; they accept their owners as part of the pride and form deep bonds.

See also
 Exotic pet
 Feline Conservation Federation
 Lion taming

References

Pets
Wildlife
Cats
Cats as pets
Exotic pets
Animal law
Domesticated animals

Exotic felids as pets


Árni Þórarinsson is an Icelandic writer born in Reykjavík on 1 August 1950. He received his B.A. in 1973 from the University of East Anglia in Norwich, England.

He started out as a journalist and has worked in print, radio, and television. In 1989 he was on the board of the Reykjavik Film festival. His first novel was in that same year and was a crime novel. He has written several other crime novels some of which may become films.

Bibliography

Einar crime novel series
Nóttin hefur þúsund augu (1998)
Hvíta kanínan (2000)
Blátt tungl (2001)
Tími nornarinnar (2005) (English translation by Anna Yates: Season of the Witch, 2012)
Dauði trúðsins (2007)
Sjöundi sonurinn (2008)
Morgunengill (2010)
Ár kattarins (2012)
Glæpurinn - Ástarsaga (2013)
13 dagar (2016) (eng.: 13 Days)

See also

 Leyndardómar Reykjavíkur 2000 (multi-author crime novel with one chapter by Árni)
 List of Icelandic writers
 Icelandic literature

References

External links
Iceland literature site

Living people
1950 births
Alumni of the University of East Anglia

Arni Torarinsson
Arni Torarinsson
Arni Torarinsson

Árni Þórarinsson


Eduardo Humberto del Río García (June 20, 1934 – August 8, 2017), better known by his pen name Rius, was a Mexican intellectual, political cartoonist and writer. He was born in Zamora, Michoacán. He was a supporter of the Cuban revolution and was a strong critic of Fidel Castro's rule. His best known works were Cuba for Beginners and It's a Pity, Cuba.

Rius died on 8 August 2017 in Cuernavaca, Morelos at the age of 83.

References

Other websites
 Website about Rius  (in Spanish)
Rius' recent works (in Spanish, last updated August 2006)
 Current articles from Rius from Vinculando.org (in Spanish)
 Webpage about issue #1 of comic book Los Supermachos  from Los Supermachos Remasterizados (in Spanish)
 El Chamuco, official web site of El Chamuco, a comic magazine about Mexican politics and critics founded by Rius (in Spanish)

1934 births
2017 deaths
Mexican activists
Mexican cartoonists
Mexican writers

Rius


Bute Inlet is one of the principal inlets of the British Columbia Coast. It is  long from the estuaries of the Homathko and Southgate Rivers at the head of the inlet, to the mouth, where it is nearly blocked by Stuart Island, and it averages about  in width. Bute Inlet is in a spectacular wilderness setting and is one of the most scenic waterways in the world. In the upper reaches of the inlet mountains rise  feet above sea level. Bute Inlet is a spectacular wilderness that is visited by very few people. In more recent years tourists are travelling from around the world to view grizzly bears in a natural setting and explore the wilderness of Bute Inlet.

Name origin
Bute Inlet took its name from John Stuart, 3rd Earl of Bute who was Prime Minister of Great Britain from 1762 to 1763. His grandson Charles Stuart was a master's mate on Vancouver's Discovery.

History

Waddington's Road and the Chilcotin War of 1864

Bute Inlet had an interesting role in the early history of the Colony of British Columbia. Entrepreneur Alfred Waddington sought to build a route to the Cariboo goldfields that was shorter and easier than the existing routes via the Fraser Canyon and the Douglas Road. In competition with the projected Cariboo Road, still under construction at that time, Waddington got a license from the colonial government to undertake the construction of a wagon road from the head of Bute Inlet via the Homathko River to the Chilcotin Plateau, thence east across the Fraser to the Cariboo goldfields. The plan was that steamers from Victoria would voyage to the head of the inlet, and travellers would take what was to be a toll road overland from there. He was granted a townsite at the head of the inlet (still on maps as Port Waddington but as nothing more than a land survey) and commenced construction up the Grand Canyon of the Homathko from there.

Conflict with warriors of the Tsilhqot'in Nation quickly ensued when Waddington's foreman threatened smallpox on the warriors, who had been working as labourers due to famine in their country, which is over the mountains on the inland side of the range. Discussing his threats that night, the warriors, led by Klattasine of the Xeni Gwet'in of Nemaia Valley near Chilko Lake, rose up and slaughtered Waddington's work party. Three men escaped despite severe injuries. As a result of their reports, expeditions were launched by troops from Victoria and a posse of volunteers from the Cariboo and a long bait-and-wait game ensued known to history as the Chilcotin War of 1864. It ended with the surrender on terms of amnesty by Klattasine, who was betrayed and hanged at Quesnellemouthe (near modern-day Quesnel).

Proposed Canadian Pacific Railway route

The Bute Inlet route was later considered for the mainline of the Canadian Pacific Railway (CPR), which would have seen extensive blasting down the west shore of the inlet and a series of bridges to reach Vancouver Island near Campbell River via Seymour Narrows. This route was passed over in favour of the Fraser Canyon route to a new port-city at Burrard Inlet, which was to become the city of Port Moody. The residual political impact of the Chilcotin War was one factor dissuading the CPR from using Bute Inlet; the other was the severe grades required in the canyon of the Homathko River in order to reach the elevation of the Chilcotin Plateau on the inland side of the Coast Range, as well as the cost of blasting along the inlet and the deep water bridges needed below it.

2020 Elliot Creek megatsunami
On 28 November 2020, unseasonably heavy rainfall triggered an  landslide into a glacial lake at the head of Elliot Creek, generating a magnitude 5.0 earthquake and a  high megatsunami that rushed  down Elliot Creek and the Southgate River to the head of Bute Inlet, covering a total distance of over  and destroying over  of salmon habitat along Elliot Creek.

Political geography

Bute Inlet is located in the Coast Land District, Range 1 and is part of the Sunshine Coast Forest District of the Coast Forest Region, which is headquartered in Powell River, and the Lower Mainland Ministry of Environment Region, headquartered in Surrey. It is also within the mainland portion of the Strathcona Regional District, which has only municipal powers such as sewage and building permits on non-Indian reserve lands in rural areas. The inlet lies in the overlapping traditional territories and land claims of the Homalco, Klahoose, Kwiakah and We Wai Kai First Nations.

Geology
Bute Inlet in British Columbia is a classic fjord formation formed during the Holocene by glacial erosion. Bute Inlet is one of the deepest fjords in British
Columbia with its depth of , with a sill of . The majority of freshwater entering the inlet, ~95%, is supplied by the Homathko River and the Southgate River at the head of the fjord. An underwater channel system is incised in the fjord basin sediments which carries sediment to the fjord.

See also
Homathko Estuary Provincial Park

References

External links

Bute Inlet, Long Term Trends in Deep Water Properties of BC Inlets, Fisheries and Oceans Canada - Pacific Region
Map (PDF, 3,5 MB)
hydropower project in Bute Inlet

Fjords of British Columbia
History of British Columbia
South Coast of British Columbia
Central Coast of British Columbia
Inlets of British Columbia

Bute Inlet


London has centres of worship for many faiths. According to the 2021 Census, the largest religious groupings are Christians (40.66%), followed by those of no religion (27.05%), Muslims (14.99%), no response (7%), Hindus (5.15%), Jews (1.65%), Sikhs (1.64%), Buddhists (1.0%), and others (0.9%).

Distribution

Christianity in London

Historically, London has been predominantly Christian. This is clear from the large number of churches around the area, particularly in the City of London, which alone contains around 50 churches. The Church of England is the primary denomination, and the Archbishop of Canterbury's main residence is at Lambeth Palace. Most parts of London north of the Thames and west of the River Lee are within the diocese of London under the Bishop of London at St Paul's Cathedral in the City; parishes east of the River Lee are within the Diocese of Chelmsford; and most parts south of the river are administered from Southwark Cathedral as the diocese of Southwark. Important national and royal ceremonies are divided between St Paul's and Westminster Abbey.

The preeminent Catholic cathedral in England and Wales is Westminster Cathedral, from which the Archbishop of Westminster leads the English and Welsh Catholic churches. Other Christian denominations also have headquarters in the city, including the United Reformed Church, the Salvation Army, and the Quakers, and immigrant communities have established their own denominations or dioceses (e.g. the Eastern Orthodox Church). Many evangelical denominations also have church buildings in the city.

The largest nonconformist church is the Metropolitan Tabernacle.

Islam in London

Islam is London's second largest religion. Muslims make up 15% of London's population. There were 1,318,755 Muslims reported in the 2021 census in the Greater London area.

London's first mosque was established by Mohamad Dollie in 1895, in modern-day Camden. The East London Mosque is the largest Muslim centre in central Europe. London Central Mosque is a locally well-known landmark on the edge of Regent's Park, and there are many other mosques in the city. There are over 1,000 mosques in London, which are expected to outnumber churches by 2030.

Hinduism in London

Over half of the UK's Hindu population lives in London, where they make up 5% of the population. British Hindus primarily live in Western London; however, every borough has a significant Hindu population and, as per the 2011 census, the London borough of Harrow has the largest concentration of Hindus at 25%.

The Hindu temple at Neasden was the largest temple of Hinduism in Europe until the opening of the Shri Venkateswara (Balaji) Temple in Tividale in 2006.  Other temples are in nearby Wembley, Harrow and Willesden, as well as Wimbledon and Newham in South and East London.

Hare Krishna are sometimes seen on the streets of London, particularly near the Radha Krishna Temple in Soho.

Judaism in London

Over two-thirds of British Jews live in London, which ranks thirteenth in the world as a Jewish population centre. There are significant Jewish communities in parts of north London such as Stamford Hill and Golders Green. There are currently two eruvin in London; one that covers Hendon, Golders Green, and Hampstead Garden Suburb, and another in Edgware. There are two more planned eruvin: one in Stanmore, and one covering Elstree/Borehamwood.

The first written record of Jewish settlement in London dates from 1070, although Jews may have lived there since Roman times. The Bevis Marks Synagogue, built in 1701 in the city of London, is the oldest synagogue in the United Kingdom still in use. In 1899, a map was published showing, by colour, the proportion of the Jewish population to other residents of East London, street by street. It illustrates clearly the predominantly Jewish population at the time in the areas of Whitechapel, Spitalfields, and Mile End in particular.

Sikhism in London

London has a sizable Sikh population, most of whom live in the west of the city in areas such as Southall, Hounslow, and Hayes. In southeast London, there are some Sikhs in Bexleyheath, Erith, Sidcup, Plumstead, and Woolwich. In northeast London, there are some in North Newham and Ilford. In northwest London, some live in northwest Brent and some parts of Harrow. The largest Sikh temple in London (and outside India) is Gurdwara Sri Guru Singh Sabha in Southall.

Irreligion in London

Roughly one in five Londoners have no religion, and much of London's civic life and civil society is secular in the sense that it has no religious character.

To the extent that non-religious movements have actively organised in the UK, many organise nationally from London. The non-religious humanist movement in the UK largely began in London in the 19th century with the foundation of various "ethical churches" and "ethical societies". Over time, these groups came to form the basis of non-religious charities in the UK: Conway Hall, based in the former South Place Ethical Society in Holborn, and Humanists UK, which was formed by the merger of the UK's remaining ethical societies. Of Humanists UK's London chapters, the largest is the Central London Humanist Group, which frequently meets at Conway Hall.

The 19th-century non-religious congregational model of the ethical churches still persists to some extent. The non-religious Sunday Assembly movement began in London in 2013. Unitarian groups in Islington and Hackney also now organise under the umbrella of the "New Unity" church, which describes itself as "a non-religious church".

See also

Wembley's Conference of Living Religions 1924
List of churches in London
Demography of London
Religion in England

External links
Reassessing what we collect website History of minority religions in London with objects and images

References

Religion in London


Caleana nigrita, commonly known as the small duck orchid or flying duck orchid is a species of orchid endemic to the south-west of Western Australia. It is the most common of the flying duck orchids and has the widest distribution of the Western Australian species. It has a single smooth leaf and is distinguished from the others by its labellum which has a hump in the middle and calli covering two thirds of its outer end. Its dull colouration makes it difficult to find, especially in areas that are blackened by fire.

Description
Caleana nigrita has a single smooth green or red leaf,  long and  wide. One or two greenish-yellow and red flowers,  long and  wide are borne on a stalk  high. The dorsal sepal, lateral sepals and petals hang downwards with the dorsal sepal pressed against the column which has broad wings, forming a bucket-like shape. Two-thirds of the outer part of the labellum is covered with glossy black glands or calli and the labellum has a small hump at its centre. Flowering occurs from August to October.

Taxonomy and naming
The small duck orchid was first formally described in 1840 by John Lindley from an incomplete description by James Drummond in Edwards's Botanical Register. Drummond had given it the name Caleana nigrita and Lindley published his description in A Sketch of the Vegetation of the Swan River Colony. In 1972 Donald Blaxell changed the name to Paracaleana nigrita but the name change has not been accepted by the World Checklist of Selected Plant Families and in 1989 Mark Clements noted that none of the characters used to separate Paracaleana from Caleana is "sufficiently significant" to maintain two genera. The specific epithet (nigrita) is a Latin word meaning "blackened".

Distribution and habitat
Caleana nigrita is found in near-coastal areas between Eneabba and Esperance in the Swan Coastal Plain, WarrenAvon Wheatbelt, Esperance Plains, Jarrah Forest and Mallee biogeographic regions where it usually grows in woodland and shrubland.

Conservation
Caleana nigrita (as Paracaleana nigrita) is classified as "not threatened" by the Western Australian Government Department of Parks and Wildlife.

References

External links

nigrita
Orchids of Western Australia
Endemic orchids of Australia
Plants described in 1840
Endemic flora of Western Australia

Caleana nigrita


A file allocation table (FAT) is a way that computers look up stored data on a storage device. These include floppy disks, USB flash drives, SD cards and other high capacity storage devices.

A FAT is a list of clusters that show where a computer file is stored. These clusters are not necessarily right next to each other but can be scattered over the disk or storage medium. The FAT is always located in the first few clusters of a storage device.There are always two identical copies, one being a backup of the other.

The FAT file system is a legacy file system that is both simple and robust. It works well even in lightweight uses. But it cannot deliver the same speed, reliability and scalability as some modern file systems. It is, however, supported for compatibility reasons by nearly all currently developed operating systems for personal computers. It is also supported by many mobile devices and embedded systems. That makes it a well suited format for data exchange between computers and devices of almost any type and age from 1981 up to the present.

History
It was originally designed in 1977 for use on floppy disks. FAT was soon adapted and used almost universally on hard disks throughout the DOS and Windows 9x eras for two decades. As disk drives improved, the capabilities of the file system have been extended accordingly. This has resulted in three major file system variants: FAT12, FAT16 and FAT32. The FAT standard has also been expanded in other ways while generally preserving backward compatibility with existing software.

With the introduction of more powerful computers and operating systems FAT is no longer the default file system for use on Microsoft Windows computers.

Modern use
FAT file systems are still commonly found on floppy disks, USB sticks, flash and other solid-state memory cards. DCF uses FAT as the standard file system for digital cameras. FAT is also utilized in the boot stage of EFI-compliant computers.

References

Other websites
 File Allocation Table; YouTube
 FAT
 FAT File Systems, Microsoft

Computer file formats

File allocation table


Justice James Ogoola (sometimes referred to as James Munange Ogoola) is the former Principal Judge of the High Court of Uganda and a Justice of the COMESA Court of Justice in Lusaka, Zambia. He is the also the former chairperson of the Judicial Service Commission of Uganda. Previously, he served as the chairman of the commission of inquiry into the mismanagement of The Global Fund to Fight AIDS, Tuberculosis and Malaria. He was an Acting Justice of the Supreme Court of Uganda. He is a member of The East African Court of Justice.

Early life and education
Justice Ogoola was born an only child to Mr. and Mrs Yukana Madangu on 15 August 1945 at Lumino, Busia in the then Bukedi district (currently Samia-Bugwe county in Busia District). His mother, Norah Akuku, Nataboona from the Bataboona clan, died when he was five and he was thus raised by relatives He attended Nabumali High School for his O-Level studies and Kings College Budo for his A-Level education. He studied law at the University of Dar-es-Salaam, from 1966 until 1969, graduating with the degree of Bachelor of Laws.  His degree of Master of Laws, was obtained from Columbia University in 1974. He also holds the Diploma in Legal Practice from the Law Development Centre in Kampala, obtained in 1997.

Law
Beginning in 1969, James Ogoola has worked in different capacities, including the following:

 As a state attorney (legislative drafting), then senior parliamentary draftsman, then principal state attorney (Drafting), in the Department of First Parliamentary Counsel, at the Uganda Justice Ministry and the Chambers of the Attorney General, from 1969 until 1974.
 As a legal officer in the Privy Council Office, at the Federal Department of Justice, Ottawa, Canada
 He was the first African to be appointed legal adviser at the International Monetary Fund (IMF) in 1974. He was responsible for Latin American country operations between 1974 and 1978 at IMF headquarters, Washington DC, USA.
 As a legal officer at the IMF office in Paris, France, from 1978 until 1980.
 As the legal officer responsible for African & Middle East country operations at the IMF headquarters, in Washington, DC, from 1981 until 1988 and from 1991 until 1997.
 Retired from the IMF after 23 years of service.
 As Deputy Director of the Legal Department at the headquarters of the African Development Bank (AfDB), in Abidjan, Ivory Coast, from 1988 until 1991.
 Concurrently designated as Deputy General Counsel and Deputy Secretary General at AfDB.
 Served as the Chairman of the AfDB Staff Disciplinary Committee, from 1989 until 1990.
 Was an adjunct professor at the American University School of Law, in Washington, D.C., from 1996 until 1997. Taught a course on International Commercial Transactions and Banking Law to the Master of Laws class.
 Member, Chief Justice's technical committee on the establishment of the Commercial Court of Uganda from 1996 until 1997.
 Obtained certification to the Courts of Judicature, Uganda in 1997.
 Member of the tribunal investigating abuse of office by Iganga District chairman in 1999.
 Head of Commercial Court of Uganda from 1999 until 2004.
Chairman, Judicial Commission of Inquiry on Banking, January 2000 to October 2000.
 Member of the tribunal investigating abuse of office by Sembabule District chairman in 2000.
 Member of the judicial panel on National Referendum 2000.
 Appointed Principal Judge, High Court of Uganda, on 30 July 2004, replacing Justice Herbert Ntabagoba.
 Member, judges administrative advisory committee, which advises the Chief Justice of Uganda on the administration of the Judiciary.
 Represented the Judiciary at the Tripartite Conference of the Judiciaries of East African countries.
 Represented the East African judiciaries at the ministerial negotiations and drafting sessions of the proposed East African Treaty, with particular emphasis on the establishment of the East African Court of Justice.
In 2022 appointed chairperson of the Judicial Reform Committee of South Sudan.

Writing
Ogoola leisure time is taken up almost entirely by matters of personal faith. He has just completed a draft translation of the New Testament Bible into his mother tongue, Lusamia.

In 2009, Ogoola's first collection of poems, Songs of Paradise: A Harvest of Poetry and Verse, was published, to favourable critical acclaim. One reviewer called it a "landmark for the industry". For the first time in more than 30 years, the media showed a lot of interest in the book. The Observer called it "a jewel, and one to read once and again and enjoy more each time".
 The Independent called it "one heck of a piece of writing" but wondered why there was nothing before 2005. On its largely Christian themes, he said: "Ogoola has attempted to paraphrase biblical passages in a text that is every inch prose but chopped and arranged as to appear as poetry".

Personal life
Justice Ogoola is married to Florence Wandera and they have 5 adult children between them.

Published works

See also
 Busia Municipality
 Supreme Court of Uganda
 Eastern Region, Uganda

References

External links
Justice Ogoola's Mind
Justice James Ogoola: 'The Age of The Rule of Tear Gas'
Ogoola Calls for Special Law on Breastfeeding Inmates (Adapted from The New Vision
"43 Case W. Res. J. Int'l L. 181 (2010–2011) Lawfare: Where Justice Meets Peace; Ogoola, James"

20th-century Ugandan lawyers
1945 births
Living people
Ugandan writers
21st-century Ugandan poets
21st-century Ugandan judges
University of Dar es Salaam alumni
Ugandan Christians
Columbia University alumni
Law Development Centre alumni
People from Busia District, Uganda
American University faculty and staff
Washington College of Law faculty
Ugandan male poets
21st-century male writers

James Munange Ogoola


Hackelia cronquistii is a species of flowering plant in the borage family known by the common name Cronquist's stickseed.

This species was formerly treated as a variety of Hackelia patens, until elevated to its own species status in 1972.

Distribution
It is endemic to Oregon and Idaho in the Great Basin region and the Northwestern United States. It is native to a small area around the Oregon−Idaho border. It was known from just one population until 1982, when more were found. It was thought to be just from Oregon until 1993, when it was found in Idaho. There are about 52 populations known today. Though endemic to only the one small region and a listed Vulnerable species, it is considered locally stable.

It It grows on sandy soils in sagebrush scrub habitat dominated by Artemisia tridentata.

Associated plant species include Achillea millefolium, Achnatherum hymenoides, Arabis sp., Balsamorhiza sagittata, Chrysothamnus viscidiflorus, Crepis acuminata, Ericameria nauseosa, Eriophyllum lanatum, Erysimum capitatum, Festuca idahoensis, Leymus cinereus, Lupinus argenteus, Phlox longifolia, Poa secunda, Pseudoroegneria spicata, and Purshia tridentata.

Description
Hackelia cronquistii is a perennial herb growing up to 65 centimeters tall, growing from a taproot and branching caudex. The erect stems are lightly hairy toward the top and hairless near the bases. The leaves near the base of the plant are up to 21 centimeters long and 3.5 wide. They become smaller farther up the stem. The forget-me-not flowers are blue-tinged white and measure up to 1.5 centimeters wide. Flowering occurs mainly in May. The fruit is a small nutlet.

References

External links
USDA Plants Profile for Hackelia cronquistii (Cronquist's stickseed)

cronquistii
Endemic flora of the United States
Flora of Idaho
Flora of Oregon
Flora of the Great Basin

Hackelia cronquistii


Bangladesh Vision 2041 (Vision '41) is a national strategic plan to further develop the socio-economic standing of the People's Republic of Bangladesh, issued by Prime Minister Sheikh Hasina and formulated by National Economic Council. As a part of four 5-year perspective plan to be undertaken between 2022 and 2041, Bangladesh is aiming to achieve high income status through industrialization. The initiative encourages expansion of manufacturing capacity and investment in human capital development to develop exports from Bangladesh. As Bangladesh marks its fiftieth year of independence, it stands adorned with numerous significant achievements. Presently, the nation is positioned favorably to endeavor towards the ambitious goal of attaining a poverty-free and advanced economy by the year 2041. While the challenges ahead are formidable, they are not beyond conquering. Bangladesh's existing impressive track record serves as a testament to its capabilities. Immunization stands as a pivotal benchmark within the global health domain, and Bangladesh emerges as an exemplary and pioneering nation in this aspect. Having immunized a substantial count of 38 million children since 2003, Bangladesh's success story is one that resonates globally. Remarkably, the country achieved polio-free status in 2006 and effectively eradicated the menace of neonatal tetanus.

Selected goals
 Per capita income of $12,500 (more than $16,000 in 2041 prices)
 Maintain 9% GDP growth until 2031.
 Increase investment/GDP ratio to 46.9%
 Increasing tax revenue to 15% of GDP.
 Export diversification.
 Increase exports earnings to $330 billion.
 Bangladesh exported a total of $65 billion in FY 2022-23 compared to $52 billion in FY 2021/22.
 Increase life expectancy to 80 years.
 Extend universal health care to 75% of the population.
 Increase adult literacy rate to 100% by 2031.
 Free education for up to 12 years.

Projections

See also
 List of megaprojects in Bangladesh

References

Economy of Bangladesh
Bangladesh articles needing attention

Bangladesh Vision 2041


Vernon Louis "Lefty" Gomez (November 26, 1908 – February 17, 1989) was an American professional baseball player. A left-handed pitcher, Gomez played in Major League Baseball (MLB) between 1930 and 1943 for the New York Yankees and the Washington Senators. Gomez was a five-time World Series champion with the Yankees. He was also known for his colorful personality and humor.

Gomez grew up in California and played for the San Francisco Seals after high school. He made his MLB debut with the Yankees in April 1930. He was selected as an All-Star every year between 1933 and 1939. He sustained an arm injury in 1940. Though he rebounded well in 1941, he pitched his last full season in 1942, then appeared in one game in 1943 before retiring with the Washington Senators.

In 1933, Gomez married June O'Dea, who had a brief career as a Broadway actress. After his retirement, he became a popular public speaker. Gomez was elected to the National Baseball Hall of Fame by the Veterans Committee in 1972. He made an appearance at Yankee Stadium in 1987, when he and Whitey Ford were honored with plaques at the stadium's Monument Park. He died in California in 1989.

Early life
Gomez was born in Rodeo, California. His father, Francisco Gomez, had been born in California to a Spanish father, Juan Gomez, and a Portuguese mother, Rita. His mother, Lizzie Herring, was an American of Welsh-Irish descent. He was the youngest out of eight children in his family. His father grew up as a cowboy and was known as "Coyote" most of his life. He managed a 1,000-acre ranch in Franklin Canyon where Lefty and his brothers would ride horses and became hired hands when they were children. They would wake up as early as 4:00 am to milk the cows and clean out the stalls before they headed to school for the day. When he was 6 years old he attended the San Francisco World's Fair and watched the famous pilot Lincoln Beachy crash into the bay while trying to complete a stunt. He was very outgoing and liked to try many different hobbies out. When he was 8 years old, he attended a 4 July parade where he found a new passion to play the saxophone. His brother Earl was a big help in this passion and purchased Lefty his first saxophone on his ninth birthday. Lefty took a job plucking chickens at the local butcher shop to earn money for lessons.

Gomez started playing sandlot baseball for the Rodeo town team when he was only 13 years of age. He excelled right off the bat at the age of 14 and pitched throughout central California. He caught the eyes of a scout for the San Francisco Seals, who told Lefty to reach back out when he put on some weight as he was  but only . He then got a summer job at a union oil scraping sludge from the stills at the refinery. He attended Richmond high school because his local school did not have a baseball team. In his senior year of high school, he was offered a scholarship to play baseball at St. Mary's College, a smaller school that was just east of Oakland. However, his father told him to give up baseball and focus on schoolwork to become an engineer like his older brother Milfred.

Career
Although his father was not a fan of continuing baseball, he went ahead and signed the contract for Lefty to play for the Seals at the 1928 spring training camp. He was not off to a hot start but picked up quit and was sent to the Utah–Idaho League for the season.

The New York Yankees purchased Gomez from the Seals for an estimated $39,000. He reported in at  and weighing in at . This scared many people that he was not ready for the big leagues. Gomez made his major league debut on April 29, 1930. He pitched in only 15 games and finished the season with a 2–5 win–loss record, a 5.55 earned run average (ERA). Coming into the 1931 season, Gomez had good pitching velocity, but the Yankees were concerned about the pitcher's slender frame of  and . Following a common medical strategy of the time, the team had most of his teeth extracted; they also had him drink three quarts of milk daily and gave him an unlimited meal allowance for road games. Gomez registered the second-best ERA in the American League in 1931.

A 20-game winner four times and an All-Star every year from 1933 to 1939, Gomez led the league twice each in wins, winning percentage and ERA; he was a three-time league leader in shutouts and strikeouts. In the first major league All-Star Game (July 6, 1933), Gomez was the winning pitcher for the American League (AL) and drove in the first run of the game. This was out of character for him; he was notorious for poor hitting even by AL standards. Late in life, Gomez commented, "I never even broke a bat until last year when I was backing out of the garage." His career OPS+ of -7 is the fifth-worst in baseball history among players with at least 1,000 plate appearances. Gomez holds the record for the most innings pitched in a single All-Star game (six, in 1934).

Lefty's best season came in 1934, when he won 26 games and lost just five. In both 1934 and 1937, he won pitching's "Triple Crown" by leading the league in wins, ERA and strikeouts; he also led the AL both seasons in shutouts. His .649 career winning percentage ranks 15th in major league history among pitchers with 200 or more decisions. Among pitchers who made their MLB debuts from 1900 to 1950, only Lefty Grove, Christy Mathewson and Whitey Ford have both more victories and a higher winning percentage than Gomez.

Gomez won six World Series games without a loss.  As of 2021, this is a postseason record as well as a World Series record. He won a World Series game in 1932, two in 1936, two in 1937 and one in 1938. He also set a World Series record by receiving two walks in the same inning on October 6, 1937.

Nicknamed "El Goofo" and "Goofy Gomez", he was known for his sense of humor, even on the field. In one game, he came up to bat when it was slightly foggy. Bob Feller was on the mound and Gomez struck a match before stepping into the batter's box. "What's the big idea?" asked the umpire. "Do you think that match will help you see Feller's fast one?" Gomez replied, "No, I'm not concerned about that. I just want to make sure he can see me!" Another time, a reporter asked the noted brushback pitcher, "Is it true that you'd throw at your own mother?" Gomez replied, "You're damn right I would. She's a good hitter." Gomez also often remarked, "I'd rather be lucky than good."

In 1940, Gomez suffered an arm injury, which left him up for grabs by another team, but in 1941 he played fairly well, winning 15 and losing 5. During that season, he was said to be a great starting pitcher, but won through the support of Johnny Murphy, who relieved him in later innings. After the 1942 season ended, Gomez took a job as a dispatcher with the General Electric River Works, a defense plant in Lynn, Massachusetts, which only paid $40 a week. Then on January 27, 1943, the Yankees sold him to the Boston Braves for $10,000 ($ in current dollar terms).

Gomez never appeared in a game with the Braves, as later in the year he was released from his contract and signed with the Washington Senators. He pitched just one game ― on May 30, 1943, allowing four hits, four runs and walking five men ― before pulling a shoulder muscle in the fifth inning and retiring from baseball. He had a 189–102 career record with 1,468 strikeouts and a 3.34 ERA in 2,503 innings pitched.

Marriage

On February 26, 1933, Gomez married June O'Dea (1912–1992). A Broadway headliner who starred in Of Thee I Sing, she gave up her career in 1936. By 1937 the marriage was on shaky ground. Gomez traveled to Hollywood that April and June returned to Massachusetts to stay with family. Through the tabloids, she learned in December that Gomez was filing divorce papers in Mexico, charging incompatibility. Being a devout Catholic, June refused a divorce but agreed to a formal separation, citing abandonment and cruel and inhuman treatment. Publicly, Gomez said the whole idea of divorce was absurd, but after the first of the year he moved to Reno to get a six-week divorce. It was his intention for the divorce to be finalized by the time he began spring training in Florida. Separation proceedings continued for months, but were called off in May 1938. Gomez and O'Dea had two daughters and two sons.

After baseball
In retirement, Gomez became a sought-after dinner speaker known for his humorous anecdotes about his playing days and the personalities he knew. He was a bit of a screwball, nicknamed "El Goofo" or "Goofy Gomez" (a likewise-alliterative counterpart to his contemporary, Dizzy Dean), and delighted in playing practical jokes on everyone from teammates to umpires. On February 2, 1972, the Veterans Committee unanimously inducted Gomez into the National Baseball Hall of Fame, along with Giants outfielder Ross Youngs and former American League President Will Harridge. The Committee noted that Lefty pitched in seven World Series games with no losses and five wins. Wearing a Yankee cap, Gomez became the second player of Hispanic descent to be inducted.

The 1983 Major League Baseball All-Star Game was dedicated to Gomez as he was the last surviving player from the 1933 All-Star Game. He also threw out the ceremonial first pitch. On August 2, 1987, he and Whitey Ford were honored with plaques to be placed in Monument Park at Yankee Stadium. Gomez's plaque says he was "Noted for his wit and his fastball, as he was fast with a quip and a pitch." Despite advancing age, he was able to attend the ceremony. Although he was honored with the plaque, his uniform #11 has not been retired, and has since been worn by several Yankees including Joe Page, Johnny Sain, Héctor López, Fred Stanley, Dwight Gooden, Chuck Knoblauch, Gary Sheffield, Doug Mientkiewicz, Brett Gardner, and now Anthony Volpe.

Gomez spent the last years of his life in Novato, California; he died of congestive heart failure on February 17, 1989, in Marin General Hospital in Larkspur, California. A decade later, he was ranked #73 on The Sporting News list of the 100 Greatest Baseball Players, and was a nominee for the Major League Baseball All-Century Team.

Hall of Fame
There has been some controversy on who makes it into the Hall of Fame. There are pitchers that make it to the Hall of Fame because they are good pitchers, and others make it because they are good pitchers who have pitched for a long time. Lefty Gomez was a great pitcher when he pitched. He did not pitch for a very long time. He had only pitched for 11 seasons. Andy Pettitte had been a great pitcher but pitched 5 more seasons than Gomez did. For that reason, he may be inducted into the Hall of Fame due to the amount of time that he pitched. They played in different eras but had very similar career stats. Gomez won at least 20 games in 4 different seasons, while Pettitte did that twice. Pettitte had a 3.88 career ERA and Gomez 3.34 career ERA. As far as the World Series, Gomez appeared in 5 while Pettit appeared in 8. As for as dominance goes, Lefty Gomez has taken control of that. He is perfect in the World Series as he went 6-0 with a 2.86 ERA in the span of those games. In the span of all of this, Gomez faced some tough hitters throughout the way. This does not take anything away from Andy Pettitte. Gomez was a great pitcher and a fairly consistent one for the Yankees during his time with them. Jimmy Foxx said that Gomez was one of the best pitchers he faced and almost never got him out. Jimmy Foxx ended his career with 2,646 hits from in 20-year seasons ranging from 1925-1945 with 515 home runs with a career batting average of .325. A quote directly from Lefty states, " I don't wanna throw him nothin', maybe he will get tired of waiting and leave. "This is an outstanding player and just an example of what kind of player he was pitching to during his career. When Inducted to the Hall of Fame in 1972, he was asked to say some words and he says, " The thing that helped me succeed was clean living, a fast outfield, and Johnny Murphy." Murphy was a top relief pitcher for the Yankees who helped saved games for Gomez.

Legacy

He is remembered as such a great left-handed pitcher that did it in a time where baseball was starting to be Americas game. He touched the lives of many for his fun a goofy personality. He is remembered to this day and there is an award named ABCA(American Baseball Coaches Association)/Wilson Lefty Gomez Award. This is an award of one of the most of all amateur baseball. Each year, this award is given to an individual that has distinguished himself and has contributed a significant amount to his team and the game. This can be either as a coach, or a player. The first time this award was given was 1962, all the way to 2023. Lefty Gomez was so impactful, there are many different awards that he has received as well as awards that are named in his memory.

These awards are the following:

 The Lefty Gomez Volunteer of the year award
 The Lefty Gomez Softball Volunteer of the year award

Baseball Field Dedications:

 Lefty Gomez Ballpark (Fairfax, California)
 Lefty Gomez Field (Rodeo, California)
 Lefty Gomez Varsity Baseball Field (San Marin, California)

National Honors

 United States Goodwill Ambassador 1958
 Congressional Record Commemoration 1976
 Good Guy Award 1976
 Lou Gehrig Pride of The Yankees Award 1987

Baseball Honors

 MLB World Series Champion Team:1932, 1936, 1937, 1938, 1939, 1941
 MLB All- Star Team: 1933, 1934, 1935, 1936, 1937, 1938, 1939
 Triple Crown of Pitching: 1934, 1937
 AL Pitching Champion: 1934, 1937
 Elected to All- American All Stars and Japan Goodwill Tour: 1934
 Director, Babe Ruth Baseball League International: 1964-1989
 Annual National All-Star Promotion Tour: 1969-1985
 Honorary Co-Captain of the MLB 50th All-Star Game: 1979
 Honorary 50th Anniversary All-Star Game Pitcher: 1983
 Smithsonian Museum Guest of Honor: 1984
 King Of Baseball: 1986

See also

 List of Major League Baseball annual ERA leaders
 Major League Baseball Triple Crown
 List of Major League Baseball annual strikeout leaders
 List of Major League Baseball annual wins leaders
 Major League Baseball titles leaders
 Bay Area Sports Hall of Fame

Footnotes

Further reading

External links

 , or Retrosheet
 Interview with Lefty Gomez conducted by Eugene Murdock, June 3, 1982, in Williamstown, West Virginia (90 minutes)

National Baseball Hall of Fame inductees
American League All-Stars
American League ERA champions
American League strikeout champions
American League wins champions
American League Pitching Triple Crown winners
American people of Spanish descent
American people of Portuguese descent
American people of Welsh descent
American people of Irish descent
New York Yankees players
Washington Senators (1901–1960) players
New York Yankees scouts
1908 births
1989 deaths
Minor league baseball managers
Salt Lake City Bees players
San Francisco Seals (baseball) players
St. Paul Saints (AA) players
Binghamton Triplets managers
Binghamton Triplets players
People from Rodeo, California
Baseball players from Contra Costa County, California
Dispatchers
People from Novato, California
Baseball players from Marin County, California
Richmond High School (Richmond, California) alumni
Sportspeople of Spanish descent

Lefty Gomez