Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Compact spaces (2)
- Bifurcation (1)
- Boolean functions (1)
- Boundary value problem (1)
- Bounded-degree Network (1)
-
- Communication (1)
- Concentrator (1)
- Connection Network (1)
- Cross waves (1)
- Detuning (1)
- Dirichlet problem (1)
- Eigenvalue (1)
- Expander Graph (1)
- Failure probability per gate (1)
- Fault Tolerance (1)
- Finite fields (Algebra) (1)
- Forcing (1)
- Generalizer (1)
- Infinite multiplicity (1)
- Information-theoretic argument (1)
- Iteration scheme (1)
- Jumping nonlinearity (1)
- Neutral stability (1)
- Noise (1)
- Non-negative solution (1)
- Non-positone problem (1)
- Nonblocking Network (1)
- Phase-plane analysis (1)
- Randomly occuring failures (1)
- Rings (Algebra) (1)
Articles 1 - 9 of 9
Full-Text Articles in Mathematics
The Space Of Minimal Prime Ideals Of C(X) Need Not Be Basically Disconnected, Alan Dow, Melvin Henriksen, Ralph Kopperman, J. Vermeer
The Space Of Minimal Prime Ideals Of C(X) Need Not Be Basically Disconnected, Alan Dow, Melvin Henriksen, Ralph Kopperman, J. Vermeer
All HMC Faculty Publications and Research
Problems posed twenty and twenty-five years ago by M. Henriksen and M. Jerison are solved by showing that the space of minimal prime ideals of the ring C(X) of continuous real-valued functions on a compact (Hausdorff) space need not be basically disconnected-or even an F-space.
Multiple Solutions For A Dirichlet Problem With Jumping Nonlinearities Ii, Alfonso Castro, Ratnasingham Shivaji
Multiple Solutions For A Dirichlet Problem With Jumping Nonlinearities Ii, Alfonso Castro, Ratnasingham Shivaji
All HMC Faculty Publications and Research
No abstract provided for this article.
Locally Finite Families, Completely Separated Sets And Remote Points, Melvin Henriksen, Thomas J. Peters
Locally Finite Families, Completely Separated Sets And Remote Points, Melvin Henriksen, Thomas J. Peters
All HMC Faculty Publications and Research
It is shown that if X is a nonpseudocompact space with a σ-locally finite π-base, then X has remote points. Within the class of spaces possessing a σ-locally finite π-base, this result extends the work of Chae and Smith, because their work utilized normality to achieve complete separation. It provides spaces which have remote points, where the spaces do not satisfy the conditions required in the previous works by Dow, by van Douwen, by van Mill, or by Peters.
The lemma: "Let X be a space and let {Cε: € < α} be a locally finite family of cozero sets of X. Let {Zε: € < α } be a family of zero sets of X such that for each € < α, Zε с Cε. Then ∪ε<α Zε is completely separated from X/∪εCε", is a fundamental …α
Stability Of Steady Cross-Waves: Theory And Experiment, Seth Lichter, Andrew J. Bernoff
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.
A Semilinear Wave Equation With Nonmonotone Nonlinearity, Alfonso Castro, Sumalee Unsurangsie
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.
Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
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 …
Nonnegative Solutions For A Class Of Nonpositone Problems, Alfonso Castro, Ratnasingham Shivaji
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.
Wide-Sense Nonblocking Networks, Paul Feldman, Joel Friedman, Nicholas Pippenger
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( n1 + 1/k ( log n )1 - 1/k ).
Reliable Computation By Formulas In The Presence Of Noise, Nicholas Pippenger
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 …