Mathematics Commons^™

A Cautionary Note On Generalized Linear Models For Covariance Of Unbalanced Longitudinal Data, Jianhua Z. Huang, Min Chen, Mehdi Maadooliat, Mohsen Pourahmadi

Mathematics, Statistics and Computer Science Faculty Research and Publications

Missing data in longitudinal studies can create enormous challenges in data analysis when coupled with the positive-definiteness constraint on a covariance matrix. For complete balanced data, the Cholesky decomposition of a covariance matrix makes it possible to remove the positive-definiteness constraint and use a generalized linear model setup to jointly model the mean and covariance using covariates (Pourahmadi, 2000). However, this approach may not be directly applicable when the longitudinal data are unbalanced, as coherent regression models for the dependence across all times and subjects may not exist. Within the existing generalized linear model framework, we show how to overcome …

A Common Framework For Restriction Semigroups And Regular *-Semigroups, Peter R. Jones

Mathematics, Statistics and Computer Science Faculty Research and Publications

Left restriction semigroups have appeared at the convergence of several flows of research, including the theories of abstract semigroups, of partial mappings, of closure operations and even in logic. For instance, they model unary semigroups of partial mappings on a set, where the unary operation takes a map to the identity map on its domain. This perspective leads naturally to dual and two-sided versions of the restriction property. From a varietal perspective, these classes of semigroups–more generally, the corresponding classes of Ehresmann semigroups–derive from reducts of inverse semigroups, now taking a to a⁺=aa⁻¹ (or, dually, …

Physiologic Noise Regression, Motion Regression, And Toast Dynamic Field Correction In Complex-Valued Fmri Time Series, Andrew D. Hahn, Daniel B. Rowe

Mathematics, Statistics and Computer Science Faculty Research and Publications

As more evidence is presented suggesting that the phase, as well as the magnitude, of functional MRI (fMRI) time series may contain important information and that there are theoretical drawbacks to modeling functional response in the magnitude alone, removing noise in the phase is becoming more important. Previous studies have shown that retrospective correction of noise from physiologic sources can remove significant phase variance and that dynamic main magnetic field correction and regression of estimated motion parameters also remove significant phase fluctuations. In this work, we investigate the performance of physiologic noise regression in a framework along with correction for …

Coverings And Matchings In R-Partite Hypergraphs, Douglas S. Altner, J. Paul Brooks

Statistical Sciences and Operations Research Publications

Ryser's conjecture postulates that for r -partite hypergraphs, τ ≤ (r - 1)ν where τ is the covering number of the hypergraph and ν is the matching number. Although this conjecture has been open since the 1960s, researchers have resolved it for special cases such as for intersecting hypergraphs where r ≤ 5. In this article, we prove several results pertaining to matchings and coverings in r -partite intersecting hypergraphs. First, we prove that finding a minimum cardinality vertex cover for an r -partite intersecting hypergraph is NP-hard. Second, we note Ryser's conjecture for intersecting hypergraphs is easily resolved …

On The Hardness Of Counting And Sampling Center Strings, Christina Boucher, Mohamed Omar

All HMC Faculty Publications and Research

Given a set S of n strings, each of length ℓ, and a nonnegative value d, we define a center string as a string of length ` that has Hamming distance at most d from each string in S. The #CLOSEST STRING problem aims to determine the number of center strings for a given set of strings S and input parameters n, ℓ, and d. We show #CLOSEST STRING is impossible to solve exactly or even approximately in polynomial time, and that restricting #CLOSEST STRING so that any one of the parameters n, ℓ, or d is fixed leads to …

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 …

Applications Of Extenics To 2d-Space And 3d-Space, Florentin Smarandache, Victor Vladareanu

Branch Mathematics and Statistics Faculty and Staff Publications

In this article one proposes several numerical examples for applying the extension set to 2D- and 3D-spaces. While rectangular and prism geometrical figures can easily be decomposed from 2D and 3D into 1D linear problems, similarly for the circle and the sphere, it is not possible in general to do the same for other geometrical figures.

Various Characterizations Of Modified Weibull And Log Modified Distributions, Gholamhossein Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

Various characterizations of the well-known modified Weibull and log-modified Weibull distributions are presented. These characterizations are based on a simple relationship between two truncated moments; on the hazard function and on functions of the order statistics.

Π/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.

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.

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.

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 …

Generalizing Amdahl’S Law For Power And Energy, Rong Ge, Kirk W. Cameron

Mathematics, Statistics and Computer Science Faculty Research and Publications

Extending Amdahl's law to identify optimal power-performance configurations requires considering the interactive effects of power, performance, and parallel overhead.

Categoricity And Topological Graphs, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

Let X be a topological graph, with arcs joined only at end points. If Y is any locally connected metrizable compactum that is co-elementarily equivalent to X, then Y is homeomorphic to X. In particular, X and Y are homeomorphic if some lattice base for one is elementarily equivalent to some lattice base for the other.

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 …

Using Self Organizing Maps To Analyze Demographics And Swing State Voting In The 2008 U.S. Presidential Election, Paul T. Pearson, Cameron I. Cooper

Faculty Publications

Emergent self-organizing maps (ESOMs) and k-means clustering are used to cluster counties in each of the states of Florida, Pennsylvania, and Ohio by demographic data from the 2010 United States census. The counties in these clusters are then analyzed for how they voted in the 2008 U.S. Presidential election, and political strategies are discussed that target demographically similar geographical regions based on ESOM results. The ESOM and k-means clusterings are compared and found to be dissimilar by the variation of information distance function.

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. …

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.

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, …

Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický

Engineering Faculty Articles and Research

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under additional assumptions. We proceed in three parts.

Part I argues that sifted colimit preserving functors are those functors that preserve universal algebraic structure. Our main theorem here states that a functor preserves sifted colimits if and only if it has a finitary presentation by operations and equations. Moreover, the presentation of the …

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.