Adjacency matrix concepts for the analysis of the interconnection of networks

A mathematical theory is developed for an imagined device termed a “junctor”. A junctor could be used to interconnect two n-terminal networks giving rise to another n-terminal network. Actually a junctor is itself a simple network with three banks of n-terminals internally connected in some fashion by perfectly conducting wires. Adjacency matrices are formulated to analyze various junctors and their current flows. The main problem treated concerns conditions which would ensure that the junctor operation is associative.     

Definition in science teaching

Summary Definitions, I have suggested, have both a function and a form. The function pursued and the form used should depend on the situation and on the term being defined. In the situation described at the outset, Mr. Beta should probably have seen to it that a stipulation of some sort was given-just in order to get on with the task at hand. The stipulation might have been based upon a true reported definition-or it might not-depending on political considerations and the linguistic flexibility of the people concerned. Since no one involved could plausibly have been trying to embody a program in a definition of dough, a programmatic definition was not appropriate in that situation.Several different forms for a definition of dough might reasonably have been used, but in this case the old reliable classification form was probably best, because of its completeness, neatness, and brevity. Two reasonable alternatives are the equivalent-expression form and the range form. The synonym, example-nonexample, and operational forms were probably not appropriate.My main point is that there is not just one way to define. I hope that my delineation of some major possibilities and variations will help those who read this article to be flexible in handling problems of definition when they arise; and they arise more often than most people realize.An ealier draft of this article was presented at a colloquium at the University of Illinois in honor of Professor B. Othanel Smith at his retirement.     

Circular Plate on Multipoint Supports

Formulae are derived for the deflection surface of a symmetrically loaded circular plate having several points supports which are situated at equal distances apart on a single concentric circle. There is no restriction on the diameter of the support circle, which may be as large as the diameter of the plate itself. The results of this paper compare favorably with published experimental results. Numerical deflection coefficients for a uniformly loaded plate are provided, and these could be utilized for optimizing the positions and the number of concentrated supports.     

The graph-theoretic field model—I. Modelling and formulations

The Graph-Theoretical Field Model provides a unifying approach for developing numerical models of field and continuum problems. The methodology examines the field problem from the first stages of conceptualization without recourse to the governing differential equations of the field problem; this is accomplished by deriving discrete statements of the physical laws which govern the field behaviour. There are generally three laws, and these are modelled by the “cutset equations”, the “circuit equations”, and the “terminal equations”. In order to establish these three sets of equations it is expedient first to spatially discretize the field in a manner similar to the finite difference method and then to associate a linear graph (denoted as the field graph) with the spatial discretization. The concept of “through” and “across” variables, which underlies the cutset and circuit equations respectively, enables one to define the graph in an unambiguous manner such that each “edge” of the graph identifies a pair of complementary variables. From a knowledge of the constitutive properties and the boundary conditions of the field it is possible to associate terminal equations with sets of edges. Since the resulting sets of equations represent the field equations, these equations provide the basis for a complete (but approximate) solution to the field or continuum problem. In fact, this system approach uses a two part model: one for the components and another for the interconnection pattern of the components which renders the formulation procedures totally independent of the solution procedure.This paper presents the theoretical basis of the model and several graph-theoretic formulations for steady-state problems. Examples from heat conduction and small- deformation elasticity are included.     

Ladder realizations of multivariable positive real functions

Necessary and sufficient conditions are obtained for the realization of an m-variable positive real function (PRF) as the impedence function of a resistively-terminated ladder network of m lossless two-ports connected in cascade. Each two-port is a single-variable lossless ladder with all of its transmission zeros either at the origin or at finity. Conditions are also obtained when each of the two-ports is a Fujisawa-type lowpass ladder.     

Polynomial Root Clustering

A sequence of tests on derived polynomials to be strictly Hurwitz polynomials is shown to be equivalent to a given (typically real) polynomial having all its zeros in an open sector, symmetric with respect to the real axis, in the left half-plane. The number of tests needed is at most 1 + ?(ln k)/(ln 3)?, where k is the integer associated with the central angle π/k of the sector. An extension of this result on the sector as a region of root clustering is given which shows that only a limited number of tests are needed to verify that the roots are clustered in a region composed as the intersection of a set of primative (sector-like) regions. The results reported evolve from application of a collection of mappings on the complex plane defined by a particular collection of Schwarz-Christoffel transformations.