Computer Sciences Commons^™

Π/2-Angle Yao Graphs Are Spanners, Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, Stefanie Wuhrer

Computer Science: Faculty Publications

We show that the Yao graph Y₄ in the L₂ metric is a spanner with stretch factor 8(29+23√ 2). Enroute to this, we also show that the Yao graph Y^∞₄ in the L_∞ metric is a planar spanner with stretch factor 8.

Protection By 20-5,14-Hedge Against Surgically-Induced Ischemia Reperfusion Lung Injury In Rats, Irshad Ali, Stephanie Gruenloh, Ying Gao, Anne V. Clough, John R. Falck, Meetha Medhora, Elizabeth R. Jacobs

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background

We previously reported that the cytochrome P450 product 20-hydroxyeicosatetraenoic acid has prosurvival effects in pulmonary artery endothelial cells and ex vivo pulmonary arteries. We tested the potential of a 20-hydroxyeicosatetraenoic acid analog N-[20-hydroxyeicosa-5(Z),14(Z)-dienoyl]glycine (20-5,14-HEDGE) to protect against lung ischemic reperfusion injury in rats. Furthermore, we examined activation of innate immune system components, high mobility group box 1 (HMGB1) and toll-like receptor 4 (TLR4), in this model as well as the effect of 20-5,14-HEDGE on this signaling pathway.

Methods

Sprague-Dawley rats treated with 20-5,14-HEDGE or vehicle were subjected to surgically induced, unilateral lung ischemia for 60 minutes followed by reperfusion …

A Direct D-Bar Reconstruction Algorithm For Recovering A Complex Conductivity In 2d, Sarah J. Hamilton, C. N. L. Herrera, J. L. Mueller, A. Von Herrmann

Mathematics, Statistics and Computer Science Faculty Research and Publications

A direct reconstruction algorithm for complex conductivities in W^{2, ∞}(Ω), where Ω is a bounded, simply connected Lipschitz domain in R² , is presented. The framework is based on the uniqueness proof by Francini (2000 Inverse Problems 6 107–19), but equations relating the Dirichlet-to-Neumann to the scattering transform and the exponentially growing solutions are not present in that work, and are derived here. The algorithm constitutes the first D-bar method for the reconstruction of conductivities and permittivities in two dimensions. Reconstructions of numerically simulated chest phantoms with discontinuities at the organ boundaries are included.

Modeling Temporal Pattern And Event Detection Using Hidden Markov Model With Application To A Sludge Bulking Data, Naveen K. Bansal, Xin Feng, Wenjing Zhang, Wutao Wi, Yuanhao Zhao

Mathematics, Statistics and Computer Science Faculty Research and Publications

This paper discusses a method of modeling temporal pattern and event detection based on Hidden Markov Model (HMM) for a continuous time series data. We also provide methods for checking model adequacy and predicting future events. These methods are applied to a real example of sludge bulking data for detecting sludge bulking for a water plant in Chicago.

Characterizations Of Certain Continuous Univariate Distributions Based On The Conditional Distribution Of Generalized Order Statistics, M. Ahsanullah, Gholamhossein Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

The problem of characterizing probability distributions is an interesting problem which has recently attracted the attention of many researchers. Various characterization results have been established in different directions as reported in the literature. We present here, various characterizations of certain univariate continuous distributions based on the conditional distribution of generalized order statistics.

Partial Orders For Representing Uncertainty, Causality And Decision Making: General Properties, Operations, And Algorithms, Francisco Adolfo Zapata

Open Access Theses & Dissertations

One of the main objectives of science and engineering is to help people select the most beneficial decisions. To make these decisions, we must know people's preferences, we must have the information about different possible consequences of different decisions. Since information is never absolutely accurate and precise, we must also have information about the degree of certainty of different parts on information. All these types of information naturally lead to partial orders:

- For preferences, a <= b means that b is preferable to a. This relation is used in decision theory.

- For events, a <= b means that a can influence b. This causality relation is one of the fundamental notions of physics, especially of physics of space-time.

* For uncertain statements, a <= b means that a is less certain than b. This relation is used in logics describing uncertainty, such as fuzzy logic.

In each of these areas, there is abundant research about studying the corresponding partial orders. …

Characterizing Conflict In Wikipedia, Nathaniel Miller

Mathematics, Statistics, and Computer Science Honors Projects

Wikipedia serves as the Internet's most widely viewed reference. In order to ensure its success, editors who create and maintain articles must resolve conflicts over appropriate article content. Previous research has measured Wikipedia conflict at two levels: single articles and categories of pages. I observe conflicts within small groups of articles, identifying their frequency, size, and intensity. Additionally, I identify individual conflicts spanning multiple articles and effects of conflict upon users' editing habits. I analyze cross-article conflict in three stages. First, I cluster a group of 1.4 million Wikipedia articles. Next, I find individual user conflicts within each article cluster …

Volume 04, Matt Szemborski, Phillip Van Ness, Sarah Croughwell, Sarah Mayfield, Alyssa Strackbein, Marley Kimmel, Stephanie Skipp, Jamie Yurasits, Katherine Taggart, Alex Leonhart, Kristen Rawls, Andrew Armes, Amanda Haymens, Allison Paqlowski, Erica May, Stephanie Lane, Luke Acree, Cassandra L. Wilson, Stephanie Pishock, Erica Hopson, K. Juston Osborne, Katheryn Grayson, Kyle Fowlkes, Jessica Cox, Kaity Byrum, John-Harwood Scott, Ashley Johnson, Samantha Hockman, Emily Staskiel, Nancy Macdonald, R. Kruger Bressin, Benjamin P. Bilodeau, Andrea Irby, Kristin Macquarrie, Sarah Bietsch, Elizabeth Bednar

Incite: The Journal of Undergraduate Scholarship

Please note that part of pages 92-95 are redacted, in the digital copy, due to a misprint of the original printed article.

Introduction from Dean Dr. Charles Ross

The Internal Other: Transculturation and Postcolonial Magical Realism in Rushdie’s Midnight’s Children by Matt Szemborski

Photography by Phillip Van Ness

Photography “Waterfall” by Sarah Croughwell

Romancing the Bite: Statistical Analysis of Young Adult Vampire Novels by Sarah Mayfield

Photography by Alyssa Strackbein

Photography by Marley Kimmel

Wine and Society in the Viceroyalty of Peru by Stephanie Skipp

Analysis of Claud Monet’s Impression, Sunrise by Jamie Yurasits

Exploring Meaning: The Lindisfarne Gospels by …

Completeness For The Coalgebraic Cover Modality, Clemens Kupke, Alexander Kurz, Yde Venema

Engineering Faculty Articles and Research

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional logic with a so-called coalgebraic cover modality depending on the type functor. Its semantics is defined in terms of a categorically defined relation lifting operation.

As the main contributions of our paper we introduce a derivation system, and prove that it provides a sound and complete axiomatization for the collection of coalgebraically valid inequalities. Our soundness and completeness proof is algebraic, …

Coalgebraic Logics (Dagstuhl Seminar 12411), Ernst-Erich Doberkat, Alexander Kurz

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 12411 “Coalgebraic Logics”. The seminar deals with recent developments in the area of coalgebraic logic, a branch of logics which combines modal logics with coalgebraic semantics. Modal logic finds its uses when reasoning about behavioural and temporal properties of computation and communication, coalgebras have evolved into a general theory of systems. Consequently, it is natural to combine both areas for a mathematical description of system specification. Coalgebraic logics are closely related to the broader categories semantics/formal methods and verification/logic.

Design And Implementation Of An Open Framework For Ubiquitous Carbon Footprint Calculator Applications, Farzana Rahman, Casey O'Brien, Sheikh Iqbal Ahamed, He Zhang, Lin Liu

Mathematics, Statistics and Computer Science Faculty Research and Publications

As climate change is becoming an important global issue, more and more people are beginning to pay attention to reducing greenhouse gas emissions. To measure personal or household carbon dioxide emission, there are already plenty of carbon footprint calculators available on the web. Most of these calculators use quantitative models to estimate carbon emission caused by a user's activities. Although these calculators can promote public awareness regarding carbon emission due to an individual's behavior, there are concerns about the consistency and transparency of these existing CO₂ calculators. Apart from a small group of smart phone based carbon footprint calculator …

Interactive Real-Time Embedded Systems Education Infused With Applied Internet Telephony, Kyle Persohn, Dennis Brylow

Mathematics, Statistics and Computer Science Faculty Research and Publications

The transition from traditional circuit-switched phone systems to modern packet-based Internet telephony networks demands tools to support Voice over Internet Protocol (VoIP) development. In this paper, we introduce the XinuPhone, an integrated hardware/software approach for educating users about VoIP technology on a real-time embedded platform. We propose modular course topics for design-oriented, hands-on laboratory exercises: filter design, timing, serial communications, interrupts and resource budgeting, network transmission, and system benchmarking. Our open-source software platform encourages development and testing of new CODECs alongside existing standards, unlike similar commercial solutions. Furthermore, the supporting hardware features inexpensive, readily available components designed specifically for educational …

An Experimental Nexos Laboratory Using Virtual Xinu, Paul Ruth, Dennis Brylow

Mathematics, Statistics and Computer Science Faculty Research and Publications

The Nexos Project is a joint effort between Marquette University, the University of Buffalo, and the University of Mississippi to build curriculum materials and a supporting experimental laboratory for hands-on projects in computer systems courses. The approach focuses on inexpensive, flexible, commodity embedded hardware, freely available development and debugging tools, and a fresh implementation of a classic operating system, Embedded Xinu, that is ideal for student exploration. This paper describes an extension to the Nexos laboratory that includes a new target platform composed of Qemu virtual machines. Virtual Xinu addresses two challenges that limit the effectiveness of Nexos. First, potential …

Isomorph-Free Generation Of 2-Connected Graphs With Applications, Derrick Stolee

School of Computing: Technical Reports

Many interesting graph families contain only 2-connected graphs, which have ear decompositions. We develop a technique to generate families of unlabeled 2-connected graphs using ear augmentations and apply this technique to two problems. In the first application, we search for uniquely Kr-saturated graphs and find the list of uniquely K4-saturated graphs on at most 12 vertices, supporting current conjectures for this problem. In the second application, we verify the Edge Reconstruction Conjecture for all 2-connected graphs on at most 12 vertices. This technique can be easily extended to more problems concerning 2-connected graphs.

Improved Algorithms For Ear-Clipping Triangulation, Bartosz Kajak

UNLV Theses, Dissertations, Professional Papers, and Capstones

We consider the problem of improving ear-slicing algorithm for triangulating a simple polygon. We propose two variations of ear-slicing technique for generating “good-quality” triangulation. The first approach is based on searching for the best triangle along the boundary. The second approach considers polygon partitioning on a pre-process before applying the ear-slicing. Experimental investigation reveals that both approaches yield better quality triangulation than the standard ear-slicing method.

Structure And Randomness Of The Discrete Lambert Map, Jingjing Chen, Mark Lotts

Mathematical Sciences Technical Reports (MSTR)

We investigate the structure and cryptographic applications of the Discrete Lambert Map (DLM). The mapping is closely related to the Discrete Log Problem, but has received far less attention since it is considered to be a more complicated map that is likely even harder to invert. However, this mapping is quite important because it underlies the security of the ElGamal Digital Signature Scheme. Using functional graphs induced by this mapping, we were able to find non-random properties that could potentially be used to exploit the ElGamal DSS.

The Square Discrete Exponentiation Map, A Wood

Mathematical Sciences Technical Reports (MSTR)

We will examine the square discrete exponentiation map and its properties. The square discrete exponentiation map is a variation on a commonly seen problem in cryptographic algorithms. This paper focuses on understanding the underlying structure of the functional graphs generated by this map. Specifically, this paper focuses on explaining the in-degree of graphs of safe primes, which are primes of the form p = 2q + 1, where q is also prime.

Symmetric Conditions For A Weighted Fourier Transform Inequality, Ryan Berndt

Mathematics Faculty Scholarship

We discuss conditions on weight functions, necessary or sufficient, so that the Fourier transform is bounded from one weighted Lebesgue space to another. The sufficient condition and the primary necessary condition presented are similar, one being phrased is terms of arbitrary measurable sets and the other in terms of cubes. We believe that the symmetry amongst the two conditions helps frame how a single condition, necessary and sufficient, might appear.

Common Edge-Unzippings For Tetrahedra, Joseph O'Rourke

Computer Science: Faculty Publications

It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.

Lesson’S Learned: A Journey In Computational Science, Ryan Botts, Lori Carter

ACMS Conference Proceedings 2011

Inspired by work on building a computational science program and student questions about modeling, we aim to discuss some of our experiences with computational science. We will first clarify what computational science is, why it is a legitimate science, why it is worth our students’ time and what makes it a challenging field. We will also discuss how computer scientists, mathematicians and laboratory scientists each have something different to contribute to the field.

A Bayesian Secondary Analysis In An Asthma Study, Samuel P. Wilcock, Vernon M. Chinchilli, Stephen P. Peters

ACMS Conference Proceedings 2011

A recent study published in the New England Journal of Medicine by the Asthma Clinical Research Network (ACRN) compared three different treatments for their effectiveness in treating adults with uncontrolled asthma. This paper will describe the study design and its results, then detail the beginnings of a secondary analysis using Bayesian methods to estimate the parameters of interest. The methods will be explained, and the preliminary estimates given and contextualized. The paper will conclude with a discussion of the next steps and the goals for further analysis of the data in this study.

What We Can Learn From Process Theology: Integrating Faith And Mathematics, Josh Wilkerson

ACMS Conference Proceedings 2011

In the inaugural issue of The Journal of the Association of Christians in the Mathematical Sciences, James Bradley, the founding editor, suggests fourteen areas that need to be addressed by Christian mathematicians who are series about integrating their faith and their work. One of those areas is the topic of this paper. Bradly frames the question: “Some thinkers (perhaps influenced by process theology) have asserted the idea that God’s creation is not a finished work but that he creates new mathematical objects through mathematicians. Is this idea theologically sound? Is it helpful for our understanding of mathematics?” I copy …

Google And The Mathematics Of Web Search, Michael Rempe

ACMS Conference Proceedings 2011

This article examines the algorithms used by Google to rank search engine results, called PageRank.

Calculus Communication Circle, Judith Palagallo

ACMS Conference Proceedings 2011

Calculus Communication Circle is a network for the professional development of Advanced Placement Calculus teachers. In Northeast Ohio the Circle provides a forum where teachers meet to share ideas about mathematics and the teaching of calculus. This article describes the creation of the Circle and the progress it has made over its three year existence.

Using Original Historical Mathematics Texts In The Classroom, Maria Zack

ACMS Conference Proceedings 2011

Incorporating information from the history of mathematics into undergraduate mathematics courses is an effective way to help students make connections between the mathematics they are learning and their general education courses. It also helps students to see mathematics as living subject that has changed over time. One way to introduce historical topics into a variety of classes is through the use of original mathematical texts. This paper describes how non-experts can make use of original texts and provides sources for identifying candidate texts.

The Mathematics Of Cubic Sudoku, Nicholas Zoller

ACMS Conference Proceedings 2011

In the last decade the Sudoku puzzle has fixed itself in America’s puzzle consciousness. Sudoku puzzles share space with crossword puzzles and word finds in newspaper puzzle sections, and several books have been written for the Sudoku playing community. Mathematicians are among the most dedicated Sudoku players. Although some are content with simply solving puzzle after puzzle, others have used tools from combinatorics and algebra to study its important properties.

We investigate a variant of Sudoku called Cubic Sudoku, as well as Cubic Sudoku’s simpler relative, Cubic Shidoku. We successfully count the number of Cubic Shidoku puzzles in two different …

Math History Study Abroad Program: Learning Math History In A Cultural Context, Donna Pierce

ACMS Conference Proceedings 2011

In January 2011 fifteen Whitworth University mathematics students and I, their professor, traveled through Europe to study the history of mathematics. The goal was to gain an understanding of how mathematical ideas have developed over time; how social, cultural and historical factors have influenced the development of mathematics and conversely, how mathematics contributed to society and human culture. Over a course of three weeks we traveled to three countries and over a half dozen cities, viewing the tools, papers and workbooks or these mathematicians, seeing their engineering and artistic creations, and learning from local experts as they guided us through …

Thinking Philosophically About Mathematics, Robert L. Brabenec

ACMS Conference Proceedings 2011

In my early years as a teacher of mathematics, the history of mathematics was seldom mentioned in the classroom. It was viewed as an unworthy topic that would detract from the presentation of mathematics itself. This opinion has dramatically changed over the years, and the history of mathematics is now embraced and used by many mathematicians in their teaching and even research. We might choose to ask a related question. How much philosophy is necessary or helpful for a mathematics teacher to know, and to use in his or her teaching? We see a growing interest in the philosophy of …

The Need For A Graphics Programming Course, Nathan Gossett

ACMS Conference Proceedings 2011

A discussion of the benefits of offering a course on programming Computer Graphics in an undergraduate Computer Science curriculum. A sample course outline is provided, as well as a discussion of ways to conduct lectures, labs and a list of suggested assignments. A discussion of “dos and don’t s will also be presented, including a list of required prerequisite courses and skills that students would need in order for the course to be a success.

Bringing Undergraduate Research Into The Classroom, Stephen Lovett

ACMS Conference Proceedings 2011

Mathematics graduate programs and companies that employ math majors often want to ascertain an applicant’s potential for research. However, in many undergraduate courses, assessments consist only of regular exercise sets, quizzes, and in-class tests. Without doing a senior research thesis or landing an official REUs, students do not regularly gain experience in or an appreciation for research. Courses in the humanities regularly require students to write in the discipline, progressively preparing them methodologically for “writing in the field.” This begs the question: could math departments do a little more to prepare our students to use mathematics beyond college?

In this …