Mathematics Commons^™

Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.

On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz

Engineering Faculty Articles and Research

We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.

Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari

Engineering Faculty Articles and Research

Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …

On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan

Engineering Faculty Articles and Research

We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.

Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz

Engineering Faculty Articles and Research

We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …

Development And Implementation Of High-Throughput Snpgenotyping In Barley, Serdar Bozdag, Timothy J. Close, Prasanna R. Bhat, Stefano Lonardi, Yonghui Wu, Nils Rostoks, Luke Ramsay, Arnis Druka, Nils Stein, Jan T. Svensson, Steve Wanamaker, Mikeal L. Roose, Matthew J. Moscou, Shiaoman Chao, Rajeev K. Varshney, Peter Szucs, Kazuhiro Sato, Patrick M. Hayes, David E. Matthews, Andris Kleinhofs, Gary J. Muehlbauer, Joseph Deyoung, David F. Marshall, Kavitha Madishetty, Raymond D. Fenton, Pascal Condamine, Andreas Graner, Robbie Waugh

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background

High density genetic maps of plants have, nearly without exception, made use of marker datasets containing missing or questionable genotype calls derived from a variety of genic and non-genic or anonymous markers, and been presented as a single linear order of genetic loci for each linkage group. The consequences of missing or erroneous data include falsely separated markers, expansion of cM distances and incorrect marker order. These imperfections are amplified in consensus maps and problematic when fine resolution is critical including comparative genome analyses and map-based cloning. Here we provide a new paradigm, a high-density consensus genetic map of …

Reinforcing The Number Of Disjoint Spanning Trees, Damin Liu, Hong-Jian Lai, Zhi-Hong Chen

Scholarship and Professional Work - LAS

The spanning tree packing number of a connected graph G, denoted by _T(G), is the maximum number of edge-disjoint spanning trees of G. In this paper, we determine the minimum number of edges that must be added to G so that the resulting graph has spanning tree packing number at least k, for a given value of k.

Design And Implementation Of S-Marks: A Secure Middleware For Pervasive Computing Applications, Sheikh Iqbal Ahamed, Haifeng Li, Nilothpal Talukder, Mehrab Monjur, Chowdhury Sharif Hasan

Mathematics, Statistics and Computer Science Faculty Research and Publications

As portable devices have become a part of our everyday life, more people are unknowingly participating in a pervasive computing environment. People engage with not a single device for a specific purpose but many devices interacting with each other in the course of ordinary activity. With such prevalence of pervasive technology, the interaction between portable devices needs to be continuous and imperceptible to device users. Pervasive computing requires a small, scalable and robust network which relies heavily on the middleware to resolve communication and security issues. In this paper, we present the design and implementation of S-MARKS which incorporates device …

Application Of Dual-Tree Complex Wavelet Transforms To Burst Detection And Rf Fingerprint Classification, Randall W. Klein

Theses and Dissertations

This work addresses various Open Systems Interconnection (OSI) Physical (PHY) layer mechanisms to extract and exploit RF waveform features (”fingerprints”) that are inherently unique to specific devices and that may be used to provide hardware specific identification (manufacturer, model, and/or serial number). This is addressed by applying a Dual-Tree Complex Wavelet Transform (DT-CWT) to improve burst detection and RF fingerprint classification. A ”Denoised VT” technique is introduced to improve performance at lower SNRs, with denoising implemented using a DT-CWT decomposition prior to Traditional VT processing. A newly developed Wavelet Domain (WD) fingerprinting technique is presented using statistical WD fingerprints with …

Statistical Investigation Of Structure In The Discrete Logarithm, Andrew Hoffman

Mathematical Sciences Technical Reports (MSTR)

The absence of an efficient algorithm to solve the Discrete Logarithm Problem is often exploited in cryptography. While exponentiation with a modulus is extremely fast with a modern computer, the inverse is decidedly not. At the present time, the best algorithms assume that the inverse mapping is completely random. Yet there is at least some structure, and to uncover additional structure that may be useful in constructing or refining algorithms, statistical methods are employed to compare modular exponential mappings to random mappings. More concretely, structure will be defined by representing the mappings as functional graphs and using parameters from graph …

Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang

Applications and Applied Mathematics: An International Journal (AAM)

Two new families of nonlinear 3-point subdivision schemes for curve design are introduced. The first family is ternary interpolatory and the second family is binary approximation. All these new schemes are circular-invariant, meaning that new vertices are generated from local circles formed by three consecutive old vertices. As consequences of the nonlinear schemes, two new families of linear subdivision schemes for curve design are established. The 3-point linear binary schemes, which are corner-cutting depending on the choices of the tension parameter, are natural extensions of the Lane-Riesenfeld schemes. The four families of both nonlinear and linear subdivision schemes are implemented …

Discussing Vocation As A Part Of A Senior Capstone Class, Maria Zack

ACMS Conference Proceedings 2009

Many of us in Christian higher education are seeking ways to help our students discern their own sense of call. At the 2007 ACMS meeting Greg Crow and I participated in a panel on vocation and published a related paper in the Journal of the ACMS. This current paper discusses what has been learned from incorporating some of our ideas into our department's senior capstone course. This has been very meaningful for both the students and the faculty involved.

Fire! Lessons Learned And Applied To Computer Systems, Kim P. Kihlstrom

ACMS Conference Proceedings 2009

A wildfire swept through Santa Barbara on November 13, 2008, burning 1940 acres and destroying 230 homes. Nine structures on the Westmont College campus were destroyed as well as fifteen faculty homes near campus. What insights can be drawn from this experience? We will examine some of the lessons that can be applied to the design of intrusion-tolerant computer systems.

Are Mathematical Entities Real?, Phillip E. Lestmann

ACMS Conference Proceedings 2009

This talk will introduce ontological questions related to mathematics. After surveying the views of Plato and Artistotle, other possible philosophical perspectives will be considered including realism, nominalism, conceptualism, and empiricism with their relative strengths and weaknesses. The discussion will conclude with a possible biblical foundation for mathematical ontology.

A Career Preparation Course For Students In Mathematics And Computer Science, Donna Pierce, Peter A. Tucker

ACMS Conference Proceedings 2009

As professors, we all want our students to succeed, and to be motivated to study. We all get questions from students that can be boiled down to, "What can I do with X degree?" Certainly, a quick answer is to point students to career websites, or to send them to the career services department on campus. However, we want to do better than that. We want students to learn how to investigate these future directions, and to have them think about their future more holistically--not just an effort to find a job. To that end, we have developed a course …

History Of Mathematics In The Service Of School Mathematics Education, Calvin Jongsma

ACMS Conference Proceedings 2009

This slide presentation outlines the author's use of history of mathematics in teaching a mathematics-content course to prospective middle school mathematics teachers. A pedagogical rationale for using history of mathematics is given, along with a case study illustrating its use for teaching the topic of ratio and proportion drawing upon the numerical and geometrical theories of such found in Euclid's Elements.

Galileo's Solution To Dante's Riddle, Andrew Simoson

ACMS Conference Proceedings 2009

In Dante’s Inferno, several riddles are posed regarding the relative sizes of ordinary men versus giants versus Lucifer—all of which Galileo solves in his first public lecture—which we review herein.

Sage: Math In Your Dorm Room, From Calculus To Research, Karl-Dieter Crisman

ACMS Conference Proceedings 2009

As computers have revolutionized math research in disciplines as disparate as number theory and bioinformatics, it is natural for us to introduce our students to technology in ways beyond mere homework-checking. However, most familiar programs are either not comprehensive enough to encompass all the math in our curriculum, or are very expensive and accessible only in a lab or with a student license. The open source software package Sage addresses all of these issues.

Sage is suitable for discovery and computation in introductory courses such as calculus or linear algebra, while also being ideal for use in upper-level courses or …

Can Critical Thinking Be Redeemed?, Jeremy Case

ACMS Conference Proceedings 2009

We often claim that mathematics develops critical thinking skills. Critical thinking has many different definitions, but problem solving, deduction, analyzing arguments, and identifying assumptions are all certainly a part of critical thinking. As the trend in higher education moves away from focusing exclusively on content towards assessment and learning outcomes, we can justify our endeavors since mathematics and critical thinking align themselves well.

However, when examining the ultimate purpose of critical thinking in higher education, we must take care. If there is no agreed upon content knowledge in our postmodern age, the focus of education falls elsewhere. How one thinks …

Exploring The Limits Of Computing Through Exhaustive Search, Jeffrey L. Lehman

ACMS Conference Proceedings 2009

Many computing problems can be solved by identifying all possible moves or combinations of events and then picking the best solution. Problems in this domain provide fertile ground for exploring problem representation, storage requirements, and computational complexity. The problems and solution approaches are easy to understand, yet quickly push the memory and storage limits of a personal computer. This paper describes insights from a preliminary investigating of two exhaustive search problems, the 15-puzzle and Rubik’s cube. The insights gained by looking at exhaustive search problems can be integrated into classroom discussions and projects.

Monoids For Math Majors, Brian D. Beasley

ACMS Conference Proceedings 2009

Inspired by an MAA PREP workshop on “The Art of Factorization in Multiplicative Structures”, this paper will treat the basics of congruence monoids and arithmetical congruence monoids with their potential for a Modern Algebra or capstone course.

Supplemental Vocabulary Acquisition In The Desymbol Logic Translator, Darren F. Provine, Nancy Lynn Tinkham

ACMS Conference Proceedings 2009

DeSymbol is a program that translates first-order predicate logic expressions into English. It is designed to help students practice when learning or reviewing symbolic logic: students begin by translating English sentences into symbolic logic notation, and then they can use DeSymbol to translate the logic back into English to check their work.

The newest version of DeSymbol adds the ability for the user to expand the system’s vocabulary, using a web interface. The user can enter new nouns, verbs, or adjectives, specifying each word’s part of speech, its singular and plural forms, and (for verbs) whether the verb takes an …

Professor Peacock's Symbolical Algebra: Glimpses Into The Life And Work Of A Mathematical Reformer, Richard Stout

ACMS Conference Proceedings 2009

In his 1859 obituary of George Peacock (Royal Society of London, 1859),the nineteenth century mathematician and Dean of Ely Cathedral, his friend and long-time colleague J. F. W. Herschel not only lists Peacock's accomplishments as an educator, a churchman, and a mathematician, but also describes a man who embodies warmth and wisdom, the kind of person you would enjoy knowing and having as a colleague. Writing about Peacock in the Memoirs of the Royal Astronomical Society, Augustus DeMorgan echoes these sentiments when he says that "Whenever a man of safe judgment was wanted, who united kindness and courtesy to a …

The Development Of Mathematical And Spiritual Maturity In The Undergraduate Mathematics Curriculum, Angela Hare

ACMS Conference Proceedings 2009

Colleges and universities that teach mathematics have a responsibility to develop in students an appreciation of the powerful tools they are studying in the mathematics curriculum. Beyond this fundamental responsibility, the Christian college or university has the richer task of equipping mathematics graduates to use their mathematical knowledge and skills to sharpen their spiritual insight, to serve others, and to promote justice and freedom in society. The growth in mathematical maturity that occurs during the undergraduate years is an asset that enables Christian students of mathematics to participate in the redemptive work of Jesus Christ through their discipline of study. …

Approximating Sums Of Infinite Series, Kara Garrison, Thomas E. Price

ACMS Conference Proceedings 2009

The Euler-Maclaurin summation formula is frequently used to efficiently estimate sums of infinite series of the form $\sum_{j=1}^{\infty}f(j)$. The purpose of this article is to describe a modification of this numerical technique designed to simplify and reduce the computational effort required to obtain an acceptable estimate of the sum. The modified formula is obtained by replacing $f\left( x\right) $ with an easily constructed polynomial like interpolating function $a\left( x\right) $ designed to simplify the calculation of the integral and derivatives associated with Euler-Maclaurin. This approach provides a more tractable algorithm which can be written as a matrix equation. Examples are …

Integrating Dynamic Software Into Geometry Courses At Middle School, High School, And College Levels: Ten Lesson Plan And Instruction Material Units Incorporating Geometer's Sketchpad Version 4.07, Jamie Blauw, Lauren Zylstra, Dave Klanderman

ACMS Conference Proceedings 2009

This paper explores the use of dynamic geometry software (Geometer's Sketchpad) in the teaching and learning of Geometry at the high school and college level. As part of an honors project, two of the authors created a series of lesson activities to address specific geometric concepts. Each lesson implements Geometer's Sketchpad to create an engaging student-centered learning environment.

A Vision For Acms, James Bradley

ACMS Conference Proceedings 2009

This paper applies McGrath's and Heller's approach to the consideration of mathematics. It assumes that mathematics is not self-interpreting, but that, looked at from a framework informed by the Christian scriptures, it can be seen as having significant meaning and value and a transcendent purpose. In particular, it presents a classical interpretation of mathematics broadly conceived, presents two approaches to providing warrant for such an interpretation, and explores some implications. It argues, by means of the example of the classical interpretation, that the relationship between mathematics and theology is a viable area of scholarly inquiry encompassing profound and fascinating questions. …

Arithmetic Sequences, Diophantine Equations And The Number Of The Beast, Bryan Dawson

ACMS Conference Proceedings 2009

Revelation 13:18 invites anyone with "understanding" to "calculate the number of the beast". This session reviews historical attempts using arithmetic sequences and gives conditions by which a name is "beastable" by those methods. Do these approaches make it reasonable to identify the beast based on such calculation alone?

A Quick Way To Find The Arc Length Between Between Two Points Of The Logarithmic Spiral, Peter Rothmaler

ACMS Conference Proceedings 2009

No abstract provided.

Algebra Investigator, Al Hibbard

ACMS Conference Proceedings 2009

No abstract provided.