Digital Commons Network^™

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

ACMS Conference Proceedings 1991

An Eighth Conference on Mathematics from a Christian Perspective

Give Saxon The Ax!, Calvin Jongsma

Faculty Work Comprehensive List

No abstract provided.

The Theorms Of The Alternative, Kathryn L. Balsman '91

Honors Projects

In layman's terms, a Theorem of the Alternative is a theorem which states that given two conditions, one of the two conditions is true. It further states that if one of those conditions fails to be true, then the other condition must be true. Mathematically, this does not give a very clear picture of this group of theorems, however. Katta Murty defines a typical Theorem of the Alternative as one which shows that corresponding to any given system of linear constraints, system I, there is another associated system of linear constraints, system II, based on the same data, satisfying the …

On The Computation Of Bang-Bang Controls, Carol San Soucie

Honors Capstones

No abstract provided.

An Upper Bound For 3-Rewriteability In Finite Groups, Jordan Ellenberg

Mathematical Sciences Technical Reports (MSTR)

An ordered triple of group elements (x,y,z) is said to be rewriteable if the product xyz is equal to one of the products xzy, yxz, yzx, zxy, zyx. In the present paper, we shall ask the following question: how rewriteable can a finite group be if its derived group has order greater than 2?

Σary, Moorhead State University, Mathematics Department

Math Department Newsletters

No abstract provided.

The Calculus Virgin, Louis Leithold

Humanistic Mathematics Network Journal

No abstract provided.

Leibniz — Beyond The Calculus, Hardy Grant

Humanistic Mathematics Network Journal

No abstract provided.

Student Seminars On "Famous Equations", Richard G. Montgomery

Humanistic Mathematics Network Journal

No abstract provided.

The Human/Computer Interface: Their Side Or Ours?, R. S.D. Thomas

Humanistic Mathematics Network Journal

No abstract provided.

An Historical Approach To Precalculus And Calculus, Victor J. Katz

Humanistic Mathematics Network Journal

No abstract provided.

Ethics In Mathematics: A Request For Information, Robert P. Webber

Humanistic Mathematics Network Journal

No abstract provided.

An Alternative Approach To The History Of Mathematics, Claudia Henrion

Humanistic Mathematics Network Journal

No abstract provided.

Mathematics And Philosophy: The Story Of A Misunderstanding, Gian-Carlo Rota

Humanistic Mathematics Network Journal

No abstract provided.

Ultimately, Mathematics Is Poetry, Alfred Warrinnier

Humanistic Mathematics Network Journal

No abstract provided.

Mathematics, Truth And Integrity, Peter Hilton, Jean Pedersen

Humanistic Mathematics Network Journal

No abstract provided.

Mathematics: Contributions By Women, Jacqueline M. Dewar

Humanistic Mathematics Network Journal

No abstract provided.

Augsburg's Humanistic Curriculum Project, Larry Copes, Beverly Stratton

Humanistic Mathematics Network Journal

No abstract provided.

How Mathematics Teachers Use "Writing To Learn", Susan Hunter

Humanistic Mathematics Network Journal

No abstract provided.

Mathematics And Poetry : Isolated Or Integrated?, Joanne S. Growney

Humanistic Mathematics Network Journal

No abstract provided.

On Teaching In The Mathematical Sciences, James M. Cargal

Humanistic Mathematics Network Journal

No abstract provided.

On A Class Of Bargaining Schemes For Points In The Core Of A Cooperative N-Person Game, Yair Censor, Dan Butnariu

Mathematics Technical Papers - Archive

Projection methods of solving convex feasibility problems lead naturally to a class of bargaining scheme's for points in the core of cooperative n-person games. Each such bargaining scheme is by itself a mathematical model of "rational behavior" describing a specific way of achieving "equilibrated" payoff vectors. We show that many of these bargaining schemes are "stable"' and have meaningful heuristic interpretations.

Incremental Learning Of Numeric Clusters In Classifier Systems, K. R. Hacke, D. C. St. Clair

Computer Science Technical Reports

Classifier systems are knowledge-based learning algorithms which take training instances as input and produce a set of rules as output Many classifier systems represent the knowledge they learn in the form of one or more decision trees. Accurate knowledgebase systems for a variety of domains have been constructed by generating decision trees using J. R. Quinlan's (1986) inductive algorithm ID3 and P. E. Utgoffs (1988) IDS. IDS is an incremental version of ID3.

Unfortunately, all these algorithms suffer from the inability to easily and effectively handle domains with numeric-valued attributes. Numeric attributes are those whose values are taken from a …

Modeling The Software Design Project, C. C. Dziedzic, D. C. St. Clair

Computer Science Technical Reports

The information content of the software design product as needed by various user communities is identified. Definitions of design in classical engineering disciplines are investigated and then applied specifically to the area of software design. The Entity-Relationship model is used to describe the information content of the software design product. All the relationship types and entity types that compose the design product are described in detail. The Military Standard: Defense System Software Development, DOD-STD-2167A, is analyzed to determine how it meets the relationship type requirements.

Incremental Learning Of Numeric Clusters In Classifier Systems, K. R. Hacke, D. C. St. Clair

Computer Science Technical Reports

Classifier systems are knowledge-based learning algorithms which take training instances as input and produce a set of rules as output Many classifier systems represent the knowledge they learn in the form of one or more decision trees. Accurate knowledgebase systems for a variety of domains have been constructed by generating decision trees using J. R. Quinlan's (1986) inductive algorithm ID3 and P. E. Utgoffs (1988) IDS. IDS is an incremental version of ID3.

Unfortunately, all these algorithms suffer from the inability to easily and effectively handle domains with numeric-valued attributes. Numeric attributes are those whose values are taken from a …

Modeling The Software Design Project, C. C. Dziedzic, D. C. St. Clair

Computer Science Technical Reports

The information content of the software design product as needed by various user communities is identified. Definitions of design in classical engineering disciplines are investigated and then applied specifically to the area of software design. The Entity-Relationship model is used to describe the information content of the software design product. All the relationship types and entity types that compose the design product are described in detail. The Military Standard: Defense System Software Development, DOD-STD-2167A, is analyzed to determine how it meets the relationship type requirements.

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.

Mathematical Programming Applications In Agroforestry Planning, Laurence H. Reeves

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Agroforestry as a sustainable production system has been recognized as a land use system with the potential to slow encroachment of agriculture onto forested lands in developing countries. However, the acceptance of nontraditional agroforestry systems has been hampered in some areas due to the risk-averse nature of rural agriculturalists. By explicitly recognizing risk in agroforestry planning, a wider acceptance of agroforestry is possible. This thesis consists of a collection of three papers that explore the potential of modern stock portfolio theory to reduce financial risk in agroforestry planning.

The first paper presents a theoretical framework that incorporates modern stock portfolio …

Linear Operators Strongly Preserving Polynomial Equations Over Antinegative Semirings, Sang-Gu Lee

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

We characterized the group of linear operators that strongly preserve r-potent matrices over the binary Boolean semiring, nonbinary Boolean semirings, and zero-divisor free antinegative semirings. We extended these results to show that linear operators that strongly preserve r-potent matrices are equivalent to those linear operators that strongly preserve the matrix polynomial equation p(X) = X. where p(X) = X^r₁ + X^r₂ + ... + X^r_t and r₁>r₂>...>r_t≥2.

In addition, we characterized the group of linear operators that strongly preserve r-cyclic matrices over the same semirings. We …