Computer Sciences Commons^™

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.

Using Data To Develop Mathematical Methods, Philip R. Carlson

ACMS Conference Proceedings 1995

An analysis of ordered pairs and their scatter plots leads to interesting questions related to mathematical modeling. Some statistical methods suggest ways to approach this analysis of the ordered pairs. Both high school and college methods are illustrated in this paper.

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.

What Does A Computer Program Mean? An Introduction To Denotational Semantics, Gene B. Chase

ACMS Conference Proceedings 1995

This paper is for mathematicians who are curious about how topology is being used to prove computer programs correct. Those advanced parts have been limited to Sections III, V, and VI, and they are marked by a [clock symbol]. By contrast, sections II, IV, and VII are suitable as a companion to existing textbooks in a Computer Science course such as Organization of Programming Languages, the course CS 8 as described in Curriculum [1979]. Perhaps in a first reading you might read just those sections.

Among many books and articles on the semantics, or meaning, of computer languages, …

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 …

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

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.

Experimenting With The Calculus Laboratory Setting, Glen Van Brummelen

ACMS Conference Proceedings 1995

Reform of post-secondary mathematics education, particularly introductory calculus, is becoming commonplace across North America. Although there are many varieties of reform, most can be placed within the philosophical camp of social constructivism. According to this movement, mathematical knowledge is constructed in an interactive way through instructor-student and inter-student dialogue, rather than built in an axiomatic sense such as the "new math" of 20 years ago, or in the reductionistic, algorithmic sense dominant in secondary and introductory college mathematics. While I hold serious concerns about the relativizing of mathematical knowledge that occurs when social constructivism is adopted as a philosophy of …

Improving The Teaching Of Mathematics, David S. Moore

ACMS Conference Proceedings 1995

No one concerned about the teaching of college mathematics--and few mathematicians who are not concerned--can have missed the movement to reform teaching in the mathematical sciences at all levels. The teaching of any active branch of knowledge, like the church, is of course "reforming and ever to be reformed." Calls to modernize what we offer students are always with us. What is striking about the current reform movement is not only its momentum but the fact that it centers on pedagogy rather than on content. We ought, say the reformers, to radically alter our style of teaching. My purpose in …

Introduction (1995), David L. Neuhouser

ACMS Conference Proceedings 1995

Tenth ACMS Conference on Mathematics from a Christian Perspective

The Mathematics Of Measuring Capabilities Of Artificial Neural Networks, Martha A. Carter

Theses and Dissertations

Researchers rely on the mathematics of Vapnik and Chervonenkis to capture quantitatively the capabilities of specific artificial neural network (ANN) architectures. The quantifier is known as the V-C dimension, and is defined on functions or sets. Its value is the largest cardinality 1 of a set of vectors in Rd such that there is at least one set of vectors of cardinality 1 such that all dichotomies of that set into two sets can be implemented by the function or set. Stated another way, the V-C dimension of a set of functions is the largest cardinality of a set, such …

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

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

Nonlinear Time Series Analysis, James A. Stewart

Theses and Dissertations

This thesis applies neural network feature selection techniques to multivariate time series data to improve prediction of a target time series. Two approaches to feature selection are used. First, a subset enumeration method is used to determine which financial indicators are most useful for aiding in prediction of the S&P 500 futures daily price. The candidate indicators evaluated include RSI, Stochastics and several moving averages. Results indicate that the Stochastics and RSI indicators result in better prediction results than the moving averages. The second approach to feature selection is calculation of individual saliency metrics. A new decision boundary-based individual saliency …

Error Estimates And Lipschitz Constants For Best Approximation In Continuous Function Spaces, M. Bartelt, W. Li

Mathematics & Statistics Faculty Publications

We use a structural characterization of the metric projection PG(f), from the continuous function space to its one-dimensional subspace G, to derive a lower bound of the Hausdorff strong unicity constant (or weak sharp minimum constant) for PG and then show this lower bound can be attained. Then the exact value of Lipschitz constant for PG is computed. The process is a quantitative analysis based on the Gâteaux derivative of PG, a representation of local Lipschitz constants, the equivalence of local and global Lipschitz constants for lower semicontinuous mappings, and construction …

An Optimal Path Cover Algorithm For Cographs, R. Lin, S. Olariu

Computer Science Faculty Publications

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well.

Linear Time Optimization Algorithms For P4-Sparse Graphs, Beverly Jamison, Stephan Olariu

Computer Science Faculty Publications

Quite often, real-life applications suggest the study of graphs that feature some local density properties. In particular, graphs that are unlikely to have more than a few chordless paths of length three appear in a number of contexts. A graph G is P₄-sparse if no set of five vertices in G induces more than one chordless path of length three. P₄-sparse graphs generalize both the class of cographs and the class of P₄-reducible graphs. It has been shown that P₄-sparse graphs can be recognized in time linear in the size of the …