Computer Sciences Commons^™

The 25 Greatest Mathematicians, Robert Brabenec

ACMS Conference Proceedings 1995

Many have tried to determine the greatest mathematicians in history. The purpose of this paper is to consider making such a list, along with some criteria to consider in making a rank order of these mathematicians.

Mathematical And Theological Beliefs: A Cognitive Science Perspective, Ron Benbow

ACMS Conference Proceedings 1995

In recent years, research studies have shown that control decisions and processes, beliefs about the nature of mathematics, attitudes, and other affective variables have enormous impact on the mathematical performance of students. This paper gives an overview of the research on mathematical beliefs and reviews some work done in Christian education relating to theological beliefs. It then compares the two.

Parallel Processing In The Undergraduate Curriculum, William E. Toll

ACMS Conference Proceedings 1995

No abstract provided.

Drawing The Boundaries: Mathematical Statistics In Twentieth-Century America, Patti W. Hunter

ACMS Conference Proceedings 1995

No abstract provided.

A Course In Mathematical Recreations, Richard Laatsch

ACMS Conference Proceedings 1995

No abstract provided.

The Intermediate Value Theorem, Dale Varberg

ACMS Conference Proceedings 1995

The Intermediate Value Theorem (a continuous function on an interval assumes all values between any two of its values) is one of the big theorems of calculus. Yet the theorem is absent or briefly mentioned in most calculus textbooks. The theorem deserves better as we intend to show by listing ten picturesque consequences that we think could enliven any calculus course.

Constructivism, Mathematics Education And Christianity, Ted Watanabe

ACMS Conference Proceedings 1995

In this paper, I briefly describe what constructivism is and its implications in the field of mathematics education. I will then discuss what this epistemology may mean to Christians who are in the field of mathematics education

Statistics, Mathematics, And Teaching, David S. Moore

ACMS Conference Proceedings 1995

In discussing our teaching, we may focus on content, what we want our students to learn, or on pedagogy, what we do to help them learn. These two topics are of course related. In particular, changes in pedagogy are often driven in part by changing priorities for what kinds of things we want students to learn. It is nonetheless convenient to address content and pedagogy separately. Pedagogy, certainly the less specific of the two, is the topic of my second paper. This paper concerns content, and in particular contains one side of a conversation between a statistician and mathematicians …

The 25 Greatest Mathematicians, Robert L. Brabenec

ACMS Conference Proceedings 1995

No abstract provided.

Introduction (1995), David L. Neuhouser

ACMS Conference Proceedings 1995

Tenth ACMS Conference on Mathematics from a Christian Perspective

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

ACMS Conference Proceedings 1995

Tenth ACMS Conference on Mathematics from a Christian Perspective

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

ACMS Conference Proceedings 1995

Tenth ACMS Conference on Mathematics from a Christian Perspective

Transitions In Masculinity And Hemingway's Developed "Code", Daniel Polk

Honors Theses

The "Hemingway Code" is much more than two words that fit nicely together for a scholar's usage; the words signify a much deeper championing of masculinity, almost a haunting presence. For Ernest Hemingway living life every day, every moment with its fullest masculine fervor, became an obsession, a never-ending quest to be at one with the attitude of never complaining, never crying out, panicking, thinking too much, or regretting. To live a manly life in a series of tactical victories, performed with steadfast ritualistic mannerisms, is to embody masculinity, and therefore the "Hemingway Code."

Discovery Of Integrity Relationships In Relational Databases, D. Harrier, D. C. St. Clair

Computer Science Technical Reports

The use of database management system integrity constraints has been a powerful tool in raising the quality of data within an application subject database. Unfortunately, the successful use of integrity constraints requires that the database administrator has implemented the constraint before data are inserted into the database.

The results of this research provide a methodology for discovering previously unknown integrity relationships in a relational database. The methodology uses the principles of knowledge discovery from the artificial intelligence community, and Quinlan's ID3 machine learning algorithm as the discovery tool. Experimental results are provided that demonstrate how the methodology can be applied.

Supereulerian Graphs And The Petersen Graph, Ii, Zhi-Hong Chen, Hong-Jian Lai

Scholarship and Professional Work - LAS

In this note, we verify two conjectures of Catlin in [J. Graph Theory 13 (1989) 465 - 483] for graphs with at most 11 vertices. These are used to prove the following theorem which improves prior results in [10] and [13]:

Let G be a 3-edge-connected simple graph with order n. If n is large and if for every edge 11.v E E(G), d(u) + d(v) 2 % - 2, then either G has a spanning eulerian subgraph or G can be contracted to the Petersen graph.

The Genus 22 Crossing Number Of K9, Adrian Riskin

Mathematics

Our main result is that a 1971 conjecture due to Paul Kainen is false. Kainen's conjecture implies that the genus 2 crossing number of K 9 is 3. We disprove the conjecture by showing that the actual value is 4. The method used is a new one in the study of crossing numbers, involving proof of the impossibility of certain genus 2 embeddings of Ks.

Mathematical And Theological Beliefs: A Cognitive Science Perspective, Ron Benbow

ACMS Journal 2004

In recent years, research studies have shown that control decisions and processes, beliefs about the nature of mathematics, attitudes, and other affective variables have enormous impact on the mathematical performance of students. This paper gives an overview of the research on mathematical beliefs and reviews some work done in Christian education relating to theological beliefs. It then compares the two.

Mathematics From The Viewpoint Of Science In Context, Johan Deklerk

ACMS Journal 2004

This is the first of a series of papers presented over several years by deKlerk exploring the notion of how mathematics might be taught from a Christian perspective. In this paper, he introduces the notion of context as the basis for such an approach. He then discusses seven contexts a teacher can employ.

Ensuring The Satisfaction Of A Temporal Specification At Run-Time, Grace Tsai, Matt Insall, Bruce M. Mcmillin

Mathematics and Statistics Faculty Research & Creative Works

A responsive computing system is a hybrid of real-time, distributed and fault-tolerant systems. In such a system, severe consequences can occur if the run-time behavior does not conform to the expected behavior or specifications. In this paper, we present a formal approach to ensure satisfaction of the specifications in the operational environment as follows. First we specify behavior of the systems using Interval Temporal Logic (ITL). Next we give algorithms for trace checking of programs in such systems. Finally, we present a fully distributed run-time evaluation system which causally orders the events of the system during its execution and checks …

A Mathematical Model Of Cycle Chemotherapy, J. C. Panetta, J. Adam

Mathematics & Statistics Faculty Publications

A mathematical model is used to discuss the effects of cycle-specific chemotherapy. The model includes a constraint equation which describes the effects of the drugs on sensitive normal tissue such as bone marrow. This model investigates both pulsed and piecewise-continuous chemotherapeutic effects and calculates the parameter regions of acceptable dose and period. It also identifies the optimal period needed for maximal tumor reduction. Examples are included concerning the use of growth factors and how they can enhance the cell kill of the chemotherapeutic drugs.

Computing Χ² Values, John F. Dooley, Daniel C. St Clair, William E. Bond

Mathematics and Statistics Faculty Research & Creative Works

Textbooks and courses on numerical algorithms contain numerous examples which lead students to believe that the algorithm of choice for computing the zeros of a function f1994 is Newton's algorithm. In many of these courses little or no time is spent in providing students with "real world" experiences where Newton's method fails. The work presented in this paper describes a slow convergence problem encountered while trying to use Newton to estimate values for the 2 distributions. The problem occurred while the authors were trying to implement a well-known machine learning algorithm from the field of artificial intelligence. The function being …

A New Approach To Automatic Target Recognition Using Wavelet Transforms, Anitha Panapakkam, S. N. Balakrishnan, Daniel St. Clair

Computer Science Technical Reports

Automatic Target Recognition (ATR) systems have significant impact in defense applications. There is a continuing need to develop new and robust techniques to handle the increasingly complex ATR problem. The objectives of this thesis are two-fold. First a new technique to be used for ATR is developed and secondly an integrated ATR system to investigate and combine all subsystems is developed. In this thesis, we have developed a new technique for the feature extraction stage of ATR problem using wavelet transforms. Wavelet transforms have been one of the widely investigated areas of research in the past few years. The promising …

Topologies Invariant Under A Group Action, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

We study links between faithful group actions on a set and topologies on that set. In one direction, a group action has its invariant topologies (so we may regard members of the action to be homeomorphisms relative to those topologies); in the other direction, a topology has its preserving group actions (i.e., the subgroups of the homeomorphism group of the topology). This two-way passage allows us to discuss topological features of group actions as well as symmetry features of topologies.

Creation And Simulation Of A Model For A Discrete Time Buffer System With Interrupted Poisson Arrivals And Uncorrelated Server Interruptions, Susanne Naegele-Jackson

Masters Theses & Specialist Projects

A mathematical model for a discrete-time buffer system with both arrival and server interruptions is developed. In this model fixed-size packets arrive at the buffer according to a Poisson distribution and are stored there until they can be transmitted over the output channel. Service times are constant and the buffer is assumed to be of infinite size. Both arrival stream as well as the service of the packets are subjected to random interruptions described by Bernoulli processes, where the interruption process of the Poisson input stream is uncorrelated to the interruptions of the output line. Expressions are derived for the …

Classification Characteristics Of Som And Art2, J. Aleshunas, D. St. Clair, W. Bond

Computer Science Technical Reports

Artificial neural network algorithms were originally designed to model human neural activities. They attempt to recreate the processes involved in such activities as learning, short term memory, and long term memory. Two widely used artificial neural network algorithms are the Self-Organizing Map (SOM) and the Adaptive Resonance Theory (ART2). Each was designed to simulate a particular biological neural activity. Both can be used as unsupervised data classifiers.

This paper compares performance characteristics of two unsupervised artificial neural network architectures; the SOM and the ART2 networks. The primary factors analyzed were classification accuracy, sensitivity to data noise, and sensitivity to the …

Classification Characteristics Of Som And Art2, J. J. Aleshunas, Daniel C. St. Clair, William E. Bond

Mathematics and Statistics Faculty Research & Creative Works

Artificial neural network algorithms were originally designed to model human neural activities. They attempt to recreate the processes involved in such activities as learning, short term memory, and long-term memory. Two widely used unsupervised artificial neural network algorithms are the Self-Organizing Map (SOM) and Adaptive Resonance Theory (ART2). Each was designed to simulate a particular biological neural activity. Both can be used as unsupervised data classifiers. This paper compares performance characteristics of two unsupervised artificial neural network architectures; the SOM and the ART2 networks. The primary factors analyzed were classification accuracy, sensitivity to data noise, and sensitivity of the algorithm …

Generating Indexing Functions Of Regularly Sparse Arrays For Array Compilers, Scott Thibault, Lenore Mullin, Matt Insall

Computer Science Technical Reports

There are many applications involving arrays that contain non-zero components in regular geometric partitions. These include triangular, diagonal, tridiagonal, banded, etc. When computing with this type of arrays, they are usually stored in a packed form and computations are performed with only the non-zero components. This packed form requires an indexing function that maps an index of the array to an index of the packed lexico-graphically stored array. This paper presents a method of describing regular partitions and of automatically generating an indexing function from that description. These methods enable an array compiler to compile array operations on these type …

Conjugating Polynomials On Finite Rings, M. Insall, L. Mullin, R. Wilkerson

Computer Science Technical Reports

No abstract provided.

Projective Plane Embeddings Of Polyhedral Pinched Maps, Adrian Riskin

Mathematics

We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to be embeddable in the projective plane. Our other main result is that even if the graph of a polyhedral map in the pinched torus is embeddable in a projective plane, the map induced by the embedding cannot be polyhedral, but must have all faces bounded by cycles. Finally, we give a class of examples of graphs which have polyhedral embeddings on the pinched torus and also on orientable surfaces of arbitrary high genus.

The Complexity Of Local Stratification, Peter Cholak, Howard A. Blair

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

The class of locally stratified logic programs is shown to be Π 1 1-complete by the construction of a reducibility of the class of infinitely branching nondeterministic finite register machines.