Computer Sciences Commons^™

Mathematics As Worship, David J. Stucki

ACMS Conference Proceedings 2001

In keeping with the mission of this organization to explore the relationship of faith to our discipline, I would like to take this opportunity to investigate the relationship, if any, between mathematics and worship. There have been throughout history, at least since Pythagoras, connections made between the mathematical and the theological. Many of these such efforts have followed the Pythagorean cult in deifying number, thus making mathematics the object of worship. Othes have effectively situated theology in subservience to mathematical reason. However, these are not the only alternatives.

Once we admit the possibility of a connection between mathematics and theology, …

Thml: Theological Markup Language For The Christian Classics Ethereal Library, Harry Plantinga

ACMS Conference Proceedings 2001

This document describes the Theological Markup Language (ThML), an XML markup language for theological texts. ThML was developed for use in the Christian Classics Ethereal Library (CCEL), but it is hoped that the language will serve as a royalty-free format for theological texts in other applications. Key design goals are that the language should be (1) rich enough to represent information needed for digital libraries and for theological study involving multiple, related texts, including cross-reference, synchronization, indexing, and scripture references, (2) based on XML and usable with World Wide Web tools, (3) automatically convertible to other common formats, and (4) …

Integration Of A Christian Perspective In The Mathematical Sciences, Johan De Klerk

ACMS Conference Proceedings 2001

No abstract provided.

Introduction (2001), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2001

Thirteenth ACMS Conference on Mathematics from a Christian Perspective

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

ACMS Conference Proceedings 2001

Thirteenth ACMS Conference on Mathematics from a Christian Perspective

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

ACMS Conference Proceedings 2001

Thirteenth ACMS Conference on Mathematics from a Christian Perspective

Computational Geometry Column 41, Joseph O'Rourke

Computer Science: Faculty Publications

The recent result that n congruent balls in R^d have at most 4 distinct geometric permutations is described.

Branching Exponent Heterogeneity And Wall Shear Stress Distribution In Vascular Trees, Kelly Lynn Karau, Gary S. Krenz, Christopher A. Dawson

Mathematics, Statistics and Computer Science Faculty Research and Publications

A bifurcating arterial system with Poiseuille flow can function at minimum cost and with uniform wall shear stress if the branching exponent (z) = 3 [where z is defined by (D ₁)^z = (D ₂)^z + (D ₃)^z; D ₁ is the parent vessel diameter and D ₂ and D ₃ are the two daughter vessel diameters at a bifurcation]. Because wall shear stress is a physiologically transducible force, shear stress-dependent control over vessel diameter would appear to provide a means for preserving this optimal structure through maintenance …

On The Nonembeddability And Crossing Numbers Of Some Toroidal Graphs On The Klein Bottle, Adrian Riskin

Mathematics

We show that toroidal polyhedral maps with four or more disjoint homotopic noncontractiblecircuits are not embeddable on the projective plane and that toroidal polyhedral maps with -veor more disjoint homotopic noncontractible circuits are not embeddable on the Klein bottle. Wealso show that the Klein bottle crossing numbers ofCm×Cn(m6n) form=3;4;5;6 are 1,2,4,and 6, respectively, and give upper bounds for all other values ofn. These crossing numbersdispla yat ypical behavior in that the value depends onl yonminstead of on bothmandnas isthe case for the plane and projective plane.

Jkarelrobot: A Case Study In Supporting Levels Of Cognitive Development In The Computer Science Curriculum, Duane Buck, David J. Stucki

Mathematics Faculty Scholarship

We introduce a new software tool, JKarelRobot, for supporting an Inside/Out pedagogy in introductory programming courses. Extending the original conception of "Karel the Robot", with Bloom's Taxonomy of Educational Objectives as a guiding principle, we have provided a mechanism for designing exercises that are cognitively appropriate to the developmental levels of our students. JKarelRobot is platform independent (written in Java) and language/paradigm independent, supporting Pascal, Java, and Lisp style environments.

No-Nonsense Guide To Csab/Csac Accreditation, Pete Sanderson

Mathematics Faculty Scholarship

CSAB/CSAC provides professional accreditation of computer science bachelor's degree programs in the United States. As of October 2000, 159 institutions held this accreditation. By our count, over 80% of the accredited programs were offered by departments which also offer graduate programs in computer science. This means that few small colleges are represented. Our intent in this work is to give the small college audience an up-to-date guide to the recently-revised CSAB/CSAC accreditation standards. The guide is not comprehensive; we emphasize those issues we believe to be of greatest interest to small colleges and address them from the perspective we have …

Optimal Token Allocations In Solitaire Knock 'M Down, Arthur Benjamin, Matthew T. Fluet, Mark L. Huber

All HMC Faculty Publications and Research

In the game Knock ’m Down, tokens are placed in N bins. At each step of the game, a bin is chosen at random according to a fixed probability distribution. If a token remains in that bin, it is removed. When all the tokens have been removed, the player is done. In the solitaire version of this game, the goal is to minimize the expected number of moves needed to remove all the tokens. Here we present necessary conditions on the number of tokens needed for each bin in an optimal solution, leading to an asymptotic solution. MR Subject Classifications: …

Theism And Mathematical Realism, John Byl

ACMS Journal 2004

This paper examines connections between theism and mathematical realism. Mathematical realism, which offers the best account of mathematics, strongly supports theism. Theism, in turn, supports mathematical realism. Theism readily explains the intricate relations between mathematics, matter, and mind. The attributes of the biblical God provide a justification for classical mathematics.

Mathematics As Worship, David J. Stucki

ACMS Journal 2004

This paper treats worship in a broad, inclusive sense as the primary and necessary response of human beings to their creator. It provides a brief overview of the relationship between mathematics and theology from the Pythagoreans to the present. It argues that all knowledge is contingent upon faith and thus that contemplation of mathematical insights can lead to worship of God.

Wholes And Parts In General Systems Methodology, Martin Zwick

Complex Systems Faculty Publications and Presentations

Reconstructability analysis (RA) decomposes wholes, namely data in the form either of set-theoretic relations or multivariate probability distributions, into parts, namely relations or distributions involving subsets of variables. Data is modeled and compressed by variablebased decomposition, by more general state-based decomposition, or by the use of latent variables. Models, which specify the interdependencies among the variables, are selected to minimize error and complexity.

[Introduction To] Basic Java Programming: A Laboratory Approach, Lewis Barnett

Bookshelf

For first- and second-year undergraduates, an introduction to programming with Java, an object-oriented programming language that is a popular choice for Web applications. Kent and Barnett (U. of Richmond) introduce algorithms and problem-solving approaches that are important to programming general.

Cubic Hamiltonian Graphs And Generalized Knight's Tours, Siew Hui Ong

Student Works (2000-2009)

This thesis is divided into two parts, both related to hamiltonian graphs. The first part deals with 3-connected cubic bipartite planar graphs. By assuming that all 3-connected cubic bipartite planar graphs are hamiltonian, lower bounds for the number of Hamilton cycles in cubic bipartite planar graphs with given cyclic connectivity are obtained in Chapter 2. In Chapter 3, we show that Barnette's Conjecture is equivalent to the conjecture which states that for any two edges x and y on the same face of a 3-connected cubic bipartite planar hamiltonian graph, there is a Hamilton cycle passing through x and y1 …

Modal Rules Are Co-Implications, Alexander Kurz

Engineering Faculty Articles and Research

In [13], it was shown that modal logic for coalgebras dualises—concerning definability— equational logic for algebras. This paper establishes that, similarly, modal rules dualise implications:It is shown that a class of coalgebras is definable by modal rules iff it is closed under H (images) and Σ (disjoint unions). As a corollary the expressive power of rules of infinitary modal logic on Kripke frames is characterised.

Rush Hour® And Dijkstra’S Algorithm, Mark Stamp, Brad Engel, Mcintosh Ewell, Victor Morrow

Faculty Publications, Computer Science

The game of Rush Hour® includes a 6 × 6 grid and game pieces representing cars and trucks. The object of the puzzle is to move a special car out of a gridlocked “traffic jam.” In this note we apply Dijkstra’s algorithm and a breadth-first search to solve any Rush Hour configuration.

Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu

Computer Science Faculty Publications

We show that a large variety of NP-complete problems can be solved efficiently for graphs with 'few' P₄'s. We consider domination problems (domination, total domination, independent domination. connected domination and dominating clique), the Steiner tree problem, the vertex ranking problem, the pathwidth problem, the path cover number problem, the hamiltonian circuit problem, the list coloring problem and the precoloring extension problem. We show that all these problems can be solved in linear time for the class of (q,q - 4)-graphs, for every fixed q. These are graphs for which no set of at most q. vertices induces more …

Computational Geometry Column 40, Joseph O'Rourke

Computer Science: Faculty Publications

It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.

On Reconfiguring Tree Linkages: Trees Can Lock, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides

Computer Science: Faculty Publications

It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree linkages: we show that there are trees with two simple configurations that are not connected by a motion that preserves simplicity throughout the motion. Indeed, we prove that an N-link tree can have 2^Ω(N) equivalence classes of configurations.

Pushpush And Push-1 Are Np-Hard In 2d, Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke

Computer Science: Faculty Publications

We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an earlier result that established intractability in 3D [OS99] for a puzzle inspired by the game PushPush. The second construction answers a question we raised in [DDO00] for a variant we call Push-1. Both puzzles consist of unit square blocks on an integer lattice; all blocks are movable. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover when a …

Computational Geometry Column 39, Joseph O'Rourke

Computer Science: Faculty Publications

The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane.

Examples, Counterexamples, And Enumeration Results For Foldings And Unfoldings Between Polygons And Polytopes, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke

Computer Science: Faculty Publications

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration questions in both directions: Given a polygon, how many foldings are there? Given a polytope, how many unfoldings are there to simple polygons? Throughout we give special attention to convex polygons, and to regular polygons. We show that every convex polygon folds to an infinite number of distinct polytopes, but that their number of combinatorially distinct gluings is …

Some Applications Of The Ultrapower Theorem To The Theory Of Compacta, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

The ultrapower theorem of Keisler and Shelah allows such model-theoretic notions as elementary equivalence, elementary embedding and existential embedding to be couched in the language of categories (limits, morphism diagrams). This in turn allows analogs of these (and related) notions to be transported into unusual settings, chiefly those of Banach spaces and of compacta. Our interest here is the enrichment of the theory of compacta, especially the theory of continua, brought about by the importation of model-theoretic ideas and techniques.

An Object-Oriented Algorithmic Laboratory For Ordering Sparse Matrices, Gary Karl Kumfert

Computer Science Theses & Dissertations

We focus on two known NP-hard problems that have applications in sparse matrix computations: the envelope/wavefront reduction problem and the fill reduction problem. Envelope/wavefront reducing orderings have a wide range of applications including profile and frontal solvers, incomplete factorization preconditioning, graph reordering for cache performance, gene sequencing, and spatial databases. Fill reducing orderings are generally limited to—but an inextricable part of—sparse matrix factorization.

Our major contribution to this field is the design of new and improved heuristics for these NP-hard problems and their efficient implementation in a robust, cross-platform, object-oriented software package. In this body of research, we (1) examine …

Computational Geometry Column 38, Joseph O'Rourke

Computer Science: Faculty Publications

Recent results on curve reconstruction are described.

Computational Geometry Column 37, Erik D. Demaine, Joseph O'Rourke

Computer Science: Faculty Publications

Open problems from the 15th Annual ACM Symposium on Computational Geometry.

Pushpush Is Np-Hard In 2d, Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke

Computer Science: Faculty Publications

We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result that established intractability in 3D [OS99]. The puzzle, inspired by the game *PushPush*, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover, each block, when pushed, slides the maximal extent of its free range. We prove this version is NP-hard in 2D by reduction from SAT.