Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Physical Sciences and Mathematics
Data Flow Program Graphs, Alan L. Davis, Robert M. Keller
Data Flow Program Graphs, Alan L. Davis, Robert M. Keller
All HMC Faculty Publications and Research
Data flow languages form a subclass of the languages which are based primarily upon function application (i.e., applicative languages). By data flow language we mean any applicative language based entirely upon the notion of data flowing from one function entity to another or any language that directly supports such flowing. This flow concept gives data flow languages the advantage of allowing program definitions to be represented exclusively by graphs. Graphical representations and their applications are the subject of this article.
Sums Of Z-Ideals And Semiprime Ideals, Melvin Henriksen, Frank A. Smith
Sums Of Z-Ideals And Semiprime Ideals, Melvin Henriksen, Frank A. Smith
All HMC Faculty Publications and Research
If B is a ring (or module), and K is an ideal (or submodule) of B, let B(K) = {(a,b) є B x B:a-b є K}. The relationship between ideals (or submodules) of B and those of B(K) is examined carefully, and this construction is used to find a lattice-ordered subring of the ring C(R) of all continuous real-valued functions on the real line R with two z-ideals whose sum is not even semiprime.
Probabilistic Simulations, Nicholas J. Pippenger
Probabilistic Simulations, Nicholas J. Pippenger
All HMC Faculty Publications and Research
The results of this paper concern the question of how fast machines with one type of storage media can simulate machines with a different type of storage media. Most work on this question has focused on the question of how fast one deterministic machine can simulate another. In this paper we shall look at the question of how fast a probabilistic machine can simulate another. This approach should be of interest in its own right, in view of the great attention that probabilistic algorithms have recently attracted.
Results On Periodic Solutions Of Parabolic Equations Suggested By Elliptic Theory, Alfonso Castro, A. C. Lazer
Results On Periodic Solutions Of Parabolic Equations Suggested By Elliptic Theory, Alfonso Castro, A. C. Lazer
All HMC Faculty Publications and Research
No abstract provided.
Reduction Methods Via Minimax, Alfonso Castro
Reduction Methods Via Minimax, Alfonso Castro
All HMC Faculty Publications and Research
Lecture notes in mathematics originally published in Differential Equations book series.
On Multiple Solutions Of Nonlinear Elliptic Equations With Odd Nonlinearities, Alfonso Castro, J. V. A. Gonçalves
On Multiple Solutions Of Nonlinear Elliptic Equations With Odd Nonlinearities, Alfonso Castro, J. V. A. Gonçalves
All HMC Faculty Publications and Research
In this paper we stablish results on multiplicity of solutions for the boundary value problem where a e IR and f: R - IR is an odd continuous function.
Rearrangeable Networks With Limited Depth, Nicholas Pippenger, Andrew C.-C. Yao
Rearrangeable Networks With Limited Depth, Nicholas Pippenger, Andrew C.-C. Yao
All HMC Faculty Publications and Research
Rearrangeable networks are switching systems capable of establishing simultaneous independent communication paths in accordance with any one-to-one correspondence between their n inputs and n outputs. Classical results show that Ω( n log n ) switches are necessary and that O( n log n ) switches are sufficient for such networks. We are interested in the minimum possible number of switches in rearrangeable networks in which the depth (the length of the longest path from an input to an output) is at most k, where k is fixed as n increases. We show that Ω( n1 + 1/k ) switches …
Some Properties Of Positive Derivations On F-Rings, Melvin Henriksen, Frank A. Smith
Some Properties Of Positive Derivations On F-Rings, Melvin Henriksen, Frank A. Smith
All HMC Faculty Publications and Research
Throughout A denotes an f-ring; that is, a lattice-ordered ring that is a subdirect union of totally ordered rings. We let D(A) denote the set of derivations D: A --> A such that a ≥ 0 implies Da ≥ 0, and we call such derivations positive. In [CDK], P. Coleville, G. Davis, and K. Keimel initiated a study of positive derivations on f-rings. Their main results are (i) D ε D(A) and A archimedean imply D = 0, and (ii) if A has an identity element 1 and a is the supremum of a set …