Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Graph theory (3)
- Combinatorics (2)
- Mathematics (2)
- Algorithms (1)
- Archaeoastronomy (1)
-
- Boyne Valley (1)
- Classifier (1)
- Climate history (1)
- Comparator (1)
- Data processing (1)
- Data structures (1)
- Estimation (1)
- Expanding Graph (1)
- Graph partitioning (1)
- Heuristic algorithm (1)
- Megalithic art (1)
- Nayak's model (1)
- Newgrange (1)
- Parallel genetic algorithm (1)
- Passage tomb (1)
- Poisson error (1)
- Random Walk (1)
- Shadow casting (1)
- Software reliability (1)
- Stone circle (1)
- Winter solstice (1)
- Publication
- Publication Type
Articles 1 - 20 of 20
Full-Text Articles in Computer Sciences
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Nonsupereulerian Graphs With Large Size, Paul A. Catlin, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.
The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen
The Arboricity Of The Random Graph, Paul A. Catlin, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.
Corrigendum To "Taxonomies Of Model-Theoretically Defined Topological Properties", Paul Bankston
Corrigendum To "Taxonomies Of Model-Theoretically Defined Topological Properties", Paul Bankston
Mathematics, Statistics and Computer Science Faculty Research and Publications
An error has been found in the cited paper; namely, Theorem 3.1 is false.
C. S. Lewis, George Macdonald, And Mathematics, David L. Neuhouser
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
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
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
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
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
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
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
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
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
Schedule (1991), Association Of Christians In The Mathematical Sciences
ACMS Conference Proceedings 1991
An Eighth Conference on Mathematics from a Christian Perspective
Indifference Graphs And The Single Row Routing Problem, Peter J. Looges
Indifference Graphs And The Single Row Routing Problem, Peter J. Looges
Computer Science Theses & Dissertations
This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal algorithms for recognition, center, diameter, maximum matching, Hamiltonian path and domination in indifference graphs are presented. The recognition algorithm produces a linear order with properties which allow the solution of the other problems in linear time. Indifference graphs are further applied to the single row routing problem which results in both sequential,. and parallel routing algorithms.
Supereuleriaun Graphs And The Petersen Graph, Zhi-Hong Chen
Supereuleriaun Graphs And The Petersen Graph, Zhi-Hong Chen
Scholarship and Professional Work - LAS
Using a contraction method, we find some best-possible sufficient conditions for 3-edge-connected simple graphs such that either the graphs have spanning eulerian subgraphs or the graphs are contractible to the Petersen graph.
Shadow Casting Phenomena At Newgrange, Frank Prendergast
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 …
Type 3 Diminimal Maps On The Torus, Adrian Riskin
Type 3 Diminimal Maps On The Torus, Adrian Riskin
Mathematics
A polyhedral map on the torus is diminimal if either shrinking or removing an edge yields a nonpolyhedral map. We show that all such maps on the torus fall into one of two classes, type 2 and type 3, and show that there are exactly two type 3 ones, which are given explicitly.
Intelligent Structural Operators For The K-Way Graph Partitioning Problem, Gregor Von Laszewski
Intelligent Structural Operators For The K-Way Graph Partitioning Problem, Gregor Von Laszewski
Northeast Parallel Architecture Center
A parallel genetic algorithm for the graph partitioning problem is presented, which combines general heuristic algorithms with techniques that are described in evolution theory. In the parallel genetic algorithm the selection of a mate is restricted to a local neighborhood. In addition, the parallel genetic algorithm executes an adaptation step after an individual is generated, with the genetic operators crossover and mutation. During the adaptation step the solution is improved by a common algorithm. Another selection step decides if the adapted descendant should replace the parent individual. Instead of using a uniform crossover operator a more intelligent crossover operator, which …
Selection Networks, Nicholas Pippenger
Selection Networks, Nicholas Pippenger
All HMC Faculty Publications and Research
An upper bound asymptotic to $2n\log _e n$ is established for the number of comparators required in a network that classifies $n$ values into two classes, each containing $n / 2$ values, with each value in one class less than or equal to each value in the other. (The best lower bound known for this problem is asymptotic to $(n / 2)\log _2 n$.)
Estimation In A Marked Poisson Error Recapture Model Of Software Reliability, Rajan Gupta
Estimation In A Marked Poisson Error Recapture Model Of Software Reliability, Rajan Gupta
Mathematics & Statistics Theses & Dissertations
Nayak's (1988) model for the detection, removal, and recapture of the errors in a computer program is extended to a larger family of models in which the probabilities that the successive programs produce errors are described by the tail probabilities of discrete distribution on the positive integers. Confidence limits are derived for the probability that the final program produces errors. A comparison of the asymptotic variances of parameter estimates given by the error recapture and by the repetitive-run procedure of Nagel, Scholz, and Skrivan (1982) is made to determine which of these procedures efficiently uses the test time.