Physical Sciences and Mathematics Commons^™

Undergraduates, The Right Questions, And Cayley Produce Results, Gary J. Sherman

Mathematical Sciences Technical Reports (MSTR)

During the summers of 1989, 1990, and 1991, eighteen undergraduates participated in a National Science Foundation Research Experiences for Undergraduates program at Rose-Hulman for which the author was the principal investigator. This paper provides some examples of the mathematics discovered during these three summers and discusses the philosophy, environment and process which made these discoveries possible.

Stochastic Demand, Inventory Management, And Chamberlinian Excess Capacity, Hans Haller, Daniel Orr

About Harlan D. Mills

No abstract provided.

Boundary C1, Α Regularity For Variational Inequalities, Fang-Hua Lin, Yi Li

Yi Li

No abstract provided.

Boundary C1, Α Regularity For Variational Inequalities, Fang-Hua Lin, Yi Li

Mathematics and Statistics Faculty Publications

No abstract provided.

Analysis And Finite-Element Approximation Of Optimal-Control Problems For The Stationary Navier-Stokes Equations With Distributed And Neumann Controls, Max D. Gunzburger, L. Hou, Tom Svobodny

Mathematics and Statistics Faculty Publications

We examine certain analytic and numerical aspects of optimal control problems for the stationary Navier-Stokes equations. The controls considered may be of either the distributed or Neumann type; the functionals minimized are either the viscous dissipation or the L⁴-distance of candidate flows to some desired flow. We show the existence of optimal solutions and justify the use of Lagrange multiplier techniques to derive a system of partial differential equations from which optimal solutions may be deduced. We study the regularity of solutions of this system. Then, we consider the approximation, by finite element methods, of solutions of the …

An Introduction To The Research Queueing Package For Modeling Computer Systems And Communication Networks, Robert F. Gordon Ph.D., Edward A. Macnair

Faculty Works: MCS (1984-2023)

A queueing network is an important tool for modeling systems where performance is principally affected by contention for resources. Such systems include computer systems, communication networks and manufacturing lines. In order to effectively use queuing networks as performance models, appropriate software is necessary for definition ofthe networks to be solved, for solution ofthe networks and for examination of the performance measures obtained. The RESearch Queueing Package (RESQ) and the RESearch Queueing Package Modeling Environment (RESQME) form a system for constructing, solving and analyzing extended queueing network models. We refer to the class of RESQ networks as "extended" because of characteristics …

Transformations Of Graphs And Digraphs, Elzbieta B. Jarrett

Dissertations

Some distances defined on graphs depend on transforming one graph into another. Two of these transformations are edge rotation and edge slide. In this dissertation, extensions and generalizations of these transformations are investigated.

Chapter I begins with some preliminary definitions and known results. Then two types of digraph transformations are introduced and their properties are studied.

Some measures of distance between graphs and distance between digraphs are defined in Chapter II. Also distance graphs and digraphs associated with these measures are introduced. Several known results concerning this topic are generalized and new results are presented.

Chapter III is devoted to …

A Representation Of Chemical Reactions By Labeled Graphs, Héctor Hevia

Dissertations

Graphs can be used to represent the atomic structure of chemical compounds where the vertices of the graph represent the individual atoms and the edges of the graph represent the valence bonds between a pair of atoms. M. A. Johnson (1991) introduced a graph-theoretic way to represent structural changes in chemical compounds. Thus, certain labelings of graphs called transitional labelings can be thought as representing chemical equations. Associated with these labelings, we introduce a new invariant of a graph G called the transitional value of G. The transitional value of a graph G gives an indication of how dramatic a …

Surgical Techniques For Constructing Minimal Orientable Imbeddings Of Joins And Compositions Of Graphs, David L. Craft

Dissertations

The various cases within the proof of the Heawood Map-Coloring Theorem, which established the genus of the complete graphs, utilized various techniques--some for the first time. This activity spurred interest in determining the genus of various other classes of graphs. However, very few generally applicable techniques have been developed, beyond those used in the proof of this famous theorem. Finding genera of arbitrary graphs remains a very difficult problem.

In this dissertation, we describe two surgical techniques for imbedding graphs. The first construction, called a graphical surface,views an orientable surface as a fattened graph, i.e., vertices become spheres and edges …

C. S. Lewis, George Macdonald, And Mathematics, David L. Neuhouser

ACMS Conference Proceedings 1991

This paper examines the influence and role of mathematics and mathematicians in the stories of George MacDonald and C. S. Lewis.

Using Mathematics To Teach Calculus, Russell W. Howell

ACMS Conference Proceedings 1991

For the past two years Westmont College has been one of the beta test sites for the calculus reform experiment being conducted at the University of Illinois under the direction of Jerry Uhl. Brown, Porta, and Uhl have created text which is integrated with Mathematica, a very powerful symbol manipulation, graphics, and number crunching software package produced by Wolfram Research, Inc. A preliminary version of this text has just been released [2]. We have used the Illinois materials for an honors course of incoming Freshmen with prior calculus experience. The purpose of this paper is to evaluate the curriculum and …

Cantor's Concept Of Infinity: Implications Of Infinity For Contingence, Bruce A. Hedman

ACMS Conference Proceedings 1991

Georg Cantor (1845-1918) was a devout Lutheran whose explicit Christian beliefs shaped his philosophy of science. Joseph Dauben has traced the impact Cantor's Christian convictions had on the development of transfinite set theory. In this paper I propose to examine how Cantor's transfinite set theory has contributed to an increasingly contingent world view in modern science. The contingence of scientific theories is not just a cautious tentativeness, but arises out of the actual state of the universe itself. The mathematical entities Cantor studied, transfinite numbers, he admitted were fraught with paradoxes. But he believed that they were grounded in a …

Can Mathematical Methods Yield Theological Truth?, Jan De Koning

ACMS Conference Proceedings 1991

This paper discusses the negative impact mathematical methods in theology can have on the church by looking specifically at Arminius and Voetius, Dutch theologians living in the late sixteenth and early seventeenth century. Both Arminius and Voetius used mathematical methodology, although they came to different conclusions. I think their differences were due to their different worldviews, which in turn were fundamentally influenced by their upbringing. Both theologians, however, made the same mistake with their methodology and the church split because of that mistake.

A Tale Of Two Mathematicians, Robert Brabenec

ACMS Conference Proceedings 1991

The goal of this paper is to identify some of the discoveries in mathematics during the period from 1820 to 1875 that have profoundly changed the nature of mathematics. To provide a context for this, the author compares some results of mathematics before the year 1820 with those present after 1875. And to humanize this, the author discusses the details of the life and times of two mathematicians, one who was active before 1820 and one who was active after 1875.

How Has Christian Theology Furthered Mathematics?, Gene B. Chase

ACMS Conference Proceedings 1991

In revising my Bibliography of Christianity and Mathematics to include material prior to the 20th century, it is difficult to know what to include and what to exclude, since Christian presuppositions informed much scholarship in a vague, cultural sort of way. This paper is a first cut at attempting to narrow down candidates for that Bibliography by looking for specific ways in which Christian theology has furthered mathematics.

Reviving The Argument From Design: Detecting Design Through Small Probabilities, William A. Dembski

ACMS Conference Proceedings 1991

How small do probabilities of events have to get before we refuse to attribute those events to chance? Smallness of probability is itself not enough since events with extremely small probability occur all the time. But when such events are also prespecified, it becomes difficult to attribute their occurrence to chance. Typically we search for a causal account of how chance was offset. Lacking such a causal story, however, are we still justified in asserting that an extremely improbable prespecified event was not the result of chance? This question is relevant to such diverse areas as prophecy, miracles, parapsychology, gambling, …

Introduction (1991), Robert Brabenec

ACMS Conference Proceedings 1991

An Eighth Conference on Mathematics from a Christian Perspective

Table Of Contents (1991), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1991

An Eighth Conference on Mathematics from a Christian Perspective

Schedule (1991), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1991

An Eighth Conference on Mathematics from a Christian Perspective

The Hermeneutics Of Mathematical Modeling, David Tudor

Humanistic Mathematics Network Journal

No abstract provided.

Mathematics For Life And Society, Miriam Lipschutz-Yevick

Humanistic Mathematics Network Journal

No abstract provided.

The Interaction Between Dislocations And Intergranular Cracks, H. Zhang, Alexander H. King, R. Thomson

Alexander H. King

The elastic interactions of dislocations and intergranular cracks in isotropic materials have been studied. In the first part of the paper, a model based on the Rice–Thomson theory is established under which the conditions for dislocation emission and crack propagation can be described in terms of an emission surface, cleavage surface, and loading line in the local k-space associated with a mixed mode intergranular crack. For a given crack, the local k-field changes with the emission of dislocations from the crack tip, which alters the balance of cleavage and emission. In the second part, we present experimental results of in …

Shadow Casting Phenomena At Newgrange, Frank Prendergast

Articles

A digital model of the Newgrange passage tomb and surrounding ring of monoliths known as the Great Circle is used to investigate sunrise shadow casting phenomena at the monument. Diurnal variation in shadow directions and lengths are analysed for their potential use in the Bronze Age to indicate the passage of seasonal time. Computer-aided simulations are developed from a photogrammetric survey to accurately show how three of the largest monoliths, located closest to the tomb entrance and archaeologically coded GC1, GC-1 and GC-2, cast their shadows onto the vertical face of the entrance kerbstone, coded K1. The phenomena occur at …

A Double Chain Of Coupled Circuits In Analogy With Mechanical Lattices, J. N. Boyd, P. N. Raychowdhury

Mathematics and Applied Mathematics Publications

A unitary transformation obtained from group theoretical considerations is applied to the problem of finding the resonant frequencies of a system of coupled LC-circuits. This transformation was previously derived to separate the equations of motion for one dimensional mechanical lattices. Computations are performed in matrix notation. The electrical system is an analog of a pair of coupled linear lattices. After the resonant frequencies have been found, comparisons between the electrical and mechanical systems are noted.

Cluster As Solitons On The Nuclear Surface, Andrei Ludu

Andrei Ludu

No abstract provided.

Unique Solution To Periodic Boundary Value Problems, Yong Sun

Mathematics and System Engineering Faculty Publications

Existence of unique solution to periodic boundary value problems of differential equations with continuous or discontinuous right-hand side is considered by utilizing the method of lower and upper solutions and the monotone properties of the operator. This is subject to discussion in the present paper.

Analysis And Finite Element Approximation Of Optimal Control Problems For The Stationary Navier-Stokes Equations With Dirichlet Controls, M. D. Gunzburger, L. S. Hou, Tom Svobodny

Mathematics and Statistics Faculty Publications

Optimal control problems for the stationary Navier-Stokes equations are examined from analytical and numerical points of view. The controls considered are of Dirichlet type, that is, control is effected through the velocity field on (or the mass flux through) the boundary; the functionals minimized are either the viscous dissipation or the L4-distance of candidate flows to some desired flow. We show that optimal solutions exist and justify the use of Lagrange multiplier techniques to derive a system of partial differential equations from which optimal solutions may be deduced. We study the regularity of solutions of this system. The n, finite …

On Modulated Random Measures, Jewgeni H. Dshalalow

Mathematics and System Engineering Faculty Publications

In this paper the author introduces the notion of a modulated marked random measure, Zξ on the class of locally compact and σ-compact spaces with countable bases. As special cases, are marked processes modulated by ξ are considered where ξ is a semi-Markov or semi-regenerative process. For either case, the intensities k=limt→∞1tE[Zξ([0,t])] are evaluated in terms of parameters of ξ. Examples and applications to inventories, queueing processes and economics are discussed.

On A Unique Tree Representation For P4-Extendible Graphs, B. Jamison, S. Olariu

Computer Science Faculty Publications

Several practical applications in computer science and computational linguistics suggest the study of graphs that are unlikely to have more than a few induced paths of length three. These applications have motivated the notion of a cograph, defined by the very strong restriction that no vertex may belong to an induced path of length three. The class of P₄-extendible graphs that we introduce in this paper relaxes this restriction, and in fact properly contains the class of cographs, while still featuring the remarkable property of admitting a unique tree representation. Just as in the case of cographs, the …

On A Lower Bound For The Redundancy Of Reliable Networks With Noisy Gates, Nicholas Pippenger

All HMC Faculty Publications and Research

A proof is provided that a logarithmic redundancy factor is necessary for the reliable computation of the parity function by means of a network with noisy gates. This result was first stated by R.L. Dobrushin and S.I. Ortyukov (1977). However, the authors believe that the analysis given by Dobrushin and Ortyukov is not entirely correct. The authors establish the result by following the same steps and by replacing the questionable part of their analysis with entirely new arguments.