Digital Commons Network^™

Foundational Studies And Mathematics Teaching, Allan Muir

Humanistic Mathematics Network Journal

No abstract provided.

Excerpts From And Inserts Into My January 23 Talk At The Mathematics As A Humanistic Discipline Session, Anneli Lax

Humanistic Mathematics Network Journal

No abstract provided.

Cognitive Science Studies Of Mathematical Thought, Robert B. Davis

Humanistic Mathematics Network Journal

No abstract provided.

Letter From The Editor, Issue 2, 1988, Alvin White

Humanistic Mathematics Network Journal

No abstract provided.

Please Carry Your Coals To Where They Are Needed, Professor Stein, Melvin Henriksen

Humanistic Mathematics Network Journal

No abstract provided.

Mathematics And Philosophy*, D. Bushaw

Humanistic Mathematics Network Journal

No abstract provided.

The Basis For The Success Of The Potsdam Program, Rick Luttmann

Humanistic Mathematics Network Journal

No abstract provided.

Two Poems, Miroslav Holub

Humanistic Mathematics Network Journal

No abstract provided.

A Reply To The Question "Why Math?", Louis A. Talman

Humanistic Mathematics Network Journal

No abstract provided.

Stability Of Steady Cross-Waves: Theory And Experiment, Seth Lichter, Andrew J. Bernoff

All HMC Faculty Publications and Research

A bifurcation analysis is performed in the neighborhood of neutral stability for cross waves as a function of forcing, detuning, and viscous damping. A transition is seen from a subcritical to a supercritical bifurcation at a critical value of the detuning. The predicted hysteretic behavior is observed experimentally. A similarity scaling in the inviscid limit is also predicted. The experimentally observed bifurcation curves agree with this scaling.

Study On Mappings And Maniforlds Of Fueter Hypercomplex And Almost Complex Types., Basudeb Dutta Dr.

Doctoral Theses

This thesis ie concerned chiefly with oertain families of smooth ... mappinga from domains in IRn to IRn which arise as natural generali- setione of complex anelytio mappinge. Thess Fueter families heve important hypercomplex aubfamilies defined via convergent Laurent series in one queternionio or actonionio veriable (with central coeffi- ofents). The various families and subfamdlies are olosed under compositior and inversion (when defined) of, meppinge consequently they form pseudo- groups on which one can model manifolds. The geometry of manifolde which oerry such ;Fueter or hypercomplex structure turna out to be qui ta %3D rich. In particular, they heve oanonioal …

On A Class Of Stochastic Approximation -Type Parameter-Learning Algorithms For Pattern Recognition., Amita Pal Dr.

Doctoral Theses

The first tank can involve one or more subtasks. For instance, it may require the design of a classifier on the basis of whatever prior knowledge there is of the feature space, or given the design, to estimate efficiently the parameters of the classifier. The latter might involve the estimation of the density function itself if very little is known about the class-conditional fenture distribution, or it may necessitate the entimation of the parameters of the fenture distribution, if one can assume it to have some known form. It may also involve estimating the boundaries of the classes, if even …

Economics Of Recardo: A Re-Warking., Periaswamy Gajapathi Dr.

Doctoral Theses

No abstract provided.

Recruiting More Computer Science Students - What To Do After The "Glamour" Has Gone Away?, William E. Mcbride, James Calhoun, James Richards, Harriet Taylor, Frank Garnett Walters

Mathematics and Statistics Faculty Research & Creative Works

The moderator will first focus on the question: "Are enrollments actually declining in computer science programs across this country?" He will report the results of his surveys which indicate there has been a definite downturn in enrollment over the past two years. The panelists will then discuss what is being done at their schools to recruit students and to meet this new challenge of declining enrollments.

Recruiting More Computer Science Students—What To Do After The “Glamour” Has Gone Away?, William E. Mcbride, James Calhoun, James L. Richards, Harriet G. Taylor, Frank Garnett Walters

Mathematics and Statistics Faculty Research & Creative Works

The moderator will first focus on the question: "Are enrollments actually declining in computer science programs across this country?" He will report the results of his surveys which indicate there has been a definite downturn in enrollment over the past two years. The panelists will then discuss what is being done at their schools to recruit students and to meet this new challenge of declining enrollments. © 1988, ACM. All rights reserved.

A Semilinear Wave Equation With Nonmonotone Nonlinearity, Alfonso Castro, Sumalee Unsurangsie

All HMC Faculty Publications and Research

We prove that a semilinear wave equation in which the range of the derivative of the nonlinearity includes an eigenvalue of infinite multiplicity has a solution. The solution is obtained through an iteration scheme which provides a priori estimates.

Structure Of Fourier And Fourier-Stieltjes Coefficients Of Series With Slowly Varying Convergence Moduli, Časlav V. Stanojević

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

A Fixed Point Theorem Revisited, Alberta Bollenbacher, Troy L. Hicks

Mathematics and Statistics Faculty Research & Creative Works

A version of a theorem commonly referred to as Caristi's Theorem is given. It has an elementary constructive proof, and it includes many generalizations of Banach's fixed point theorem. Several examples illustrate the diversity that can occur. © 1988 American Mathematical Society.

Generalized Homogeneity Of Finite And Of Countable Topological Spaces, J. J. Charatonik, W. J. Charatonik

Mathematics and Statistics Faculty Research & Creative Works

Finite and countable topological spaces are investigated which are homogeneous, homogeneous with respect to open mappings or with respect to continuous ones. It is shown that for finite spaces all three concepts of homogeneity coincide, while for countable or for uncountable ones they are distinct. Some characterization of countable spaces that are homogeneous in either sense are found for the metric setting.

Dredging Management: A Comparative Analysis Of Mid-Sized U.S. North Atlantic Ports, Matthew H. Masters

Marine Affairs Theses and Major Papers

Dredging management within the states of Rhode Island, Maine and Connecticut is examined through an analysis of the ports of Providence, Portland, and New Haven. These ports were selected from a field of 30 Atlantic Coast ports through a multivariate statistical analysis, based on similarities in size, function and geography. Each port's dredging history was compiled to illustrate the frequency and magnitude of dredging activity among the three states. Pertinent state laws, regulations and policies regarding dredging and dredged material disposal were reviewed in an attempt to identify similarities and differences. It was believed that differences among each state's regulatory …

The Relationship Between Perceptions Of Gentrification And Waterfront Revitalization Policies, Noreen Merainer

Marine Affairs Theses and Major Papers

This thesis examines the waterfront revitalization experience in Jersey City, N.J. In particular, the issue of gentrification, as perceived by the city administration, was examined to determine its impact on current city policies. A direct relationship between perceptions of gentrification and waterfront revitalization policies is suggested based on data obtained from detailed interviews and city documents.

Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal

All HMC Faculty Publications and Research

Achieving processor cooperation in the presence of faults is a major problem in distributed systems. Popular paradigms such as Byzantine agreement have been studied principally in the context of a complete network. Indeed, Dolev [J. Algorithms, 3 (1982), pp. 14–30] and Hadzilacos [Issues of Fault Tolerance in Concurrent Computations, Ph.D. thesis, Harvard University, Cambridge, MA, 1984] have shown that Ω(t) connectivity is necessary if the requirement is that all nonfaulty processors decide unanimously, where t is the number of faults to be tolerated. We believe that in forseeable technologies the number of faults will grow with the size of the …

Wide-Sense Nonblocking Networks, Paul Feldman, Joel Friedman, Nicholas Pippenger

All HMC Faculty Publications and Research

A new method for constructing wide-sense nonblocking networks is presented. Application of this method yields (among other things) wide-sense nonblocking generalized connectors with n inputs and outputs and size O( n log n ), and with depth k and size O( n^{1 + 1/k} ( log n )^{1 - 1/k} ).

Nonnegative Solutions For A Class Of Nonpositone Problems, Alfonso Castro, Ratnasingham Shivaji

All HMC Faculty Publications and Research

In the recent past many results have been established on non-negative solutions to boundary value problems of the form

-u''(x) = λf(u(x)); 0 < x < 1,

u(0) = 0 = u(1)

where λ>0, f(0)>0 (positone problems). In this paper we consider the impact on the non-negative solutions when f(0)<0. We find that we need f(u) to be convex to guarantee uniqueness of positive solutions, and f(u) to be appropriately concave for multiple positive solutions. This is in contrast to the case of positone problems, where the roles of convexity and concavity were interchanged to obtain similar results. We further establish the existence of non-negative solutions with interior zeros, which did not exist in positone problems.

Reliable Computation By Formulas In The Presence Of Noise, Nicholas Pippenger

All HMC Faculty Publications and Research

It is shown that if formulas are used to compute Boolean functions in the presence of randomly occurring failures then: (1) there is a limit strictly less than 1/2 to the failure probability per gate that can be tolerated, and (2) formulas that tolerate failures must be deeper (and, therefore, compute more slowly) than those that do not. The heart of the proof is an information-theoretic argument that deals with computation and errors in very general terms. The strength of this argument is that it applies with equal ease no matter what types of gate are available. Its weaknesses is …

On Conformal Scalar Curvature Equations In Rn, Yi Li, Wei-Ming Ni

Mathematics and Statistics Faculty Publications

No abstract provided.

Supercomputer, Simulation Of Liquid Drop Formation, Fall, And Collision, Donald Greenspan

Mathematics Technical Papers - Archive

A generic molecular type model of liquid drops is developed and studied. Drop formation, fall, and collision are simulated on a CRAY X-MP/24 and associated modes of oscillation are described. Methods for application to particular fluids with known Lennard-Jones parameters are given.

Particle Simulation Of Biological Sorting On A Supercomputer, Donald Greenspan

Mathematics Technical Papers - Archive

Cell sorting, or, self reorganization, is modelled by means of particles which obey classical molecular dynamical equations. A system of N second order, nonlinear, ordinary differential equations results when the number of particles is N. Applications and examples are described and discussed, with N > 1000, for both double layer and triple layer self reorganization.

Covariant Computation In Special Relativistic Dynamics, Donald Greenspan

Mathematics Technical Papers - Archive

The motion of a particle in a special relativistic framework is studied numerically. Difference equations which are covariant are developed first. It is then shown how computations can be done in both the lab and rocket frames so that the numerical results are related by the Lorentz transformation. Finally, assuming the usual force formula for harmonic oscillation, it is shown that the dynamical equation is necessarily nonlinear and trajectories are studied numerically for various initial data.

Conservative Difference Formulations Of Calogero And Toda Hamiltonian Systems, Donald Greenspan

Mathematics Technical Papers - Archive

Calogero and Toda Hamiltonian systems are reformulated using only differences. The formulations prove to have the same fundamental invariants as the continuous systems and, in addition, are readily implementable on modern digital computers.