Physical Sciences and Mathematics Commons^™

Exponentiated Kumaraswamy-Dagum Distribution With Applications To Income And Lifetime Data, Shujiao Huang, Broderick O. Oluyede

Department of Mathematical Sciences Faculty Publications

A new family of distributions called exponentiated Kumaraswamy-Dagum (EKD) distribution is proposed and studied. This family includes several well known sub-models, such as Dagum (D), Burr III (BIII), Fisk or Log-logistic (F or LLog), and new sub-models, namely, Kumaraswamy-Dagum (KD), Kumaraswamy-Burr III (KBIII), Kumaraswamy-Fisk or Kumaraswamy-Log-logistic (KF or KLLog), exponentiated Kumaraswamy-Burr III (EKBIII), and exponentiated Kumaraswamy-Fisk or exponentiated Kumaraswamy-Log-logistic (EKF or EKLLog) distributions. Statistical properties including series representation of the probability density function, hazard and reverse hazard functions, moments, mean and median deviations, reliability, Bonferroni and Lorenz curves, as well as entropy measures for this class of distributions and the …

Local Rings Of Embedding Codepth At Most 3 Have Only Trivial Semidualizing Complexes, Saeed Nasseh, Sean Sather-Wagstaff

Department of Mathematical Sciences Faculty Publications

We prove that a local ring R of embedding codepth at most 3 has at most two semidualizing complexes up to shift-isomorphism, namely, R itself and a dualizing R-complex if one exists.

Frameworks With Crystallographic Symmetry, Ciprian Borcea, Ileana Streinu

Computer Science: Faculty Publications

Periodic frameworks with crystallographic symmetry are investigated from the perspective of a general deformation theory of periodic bar-and-joint structures in R^d. It is shown that natural parametrizations provide affine section descriptions for families of frameworks with a specified graph and symmetry. A simple geometric setting for diaplacive phase transitions is obtained. Upper bounds are derived for the number of realizations of minimally rigid periodic graphs.

Efficient And Long-Time Accurate Second-Order Methods For The Stokes-Darcy System, Wenbin Chen, Max Gunzburger, Dong Sun, Xiaoming Wan

Mathematics and Statistics Faculty Research & Creative Works

We propose and study two second order in time implicit-explicit methods for the coupled Stokes-Darcy system that governs flows in karst aquifers and other subsurface flow systems. the first method is a combination of a second-order backward differentiation formula and the second order Gear's extrapolation approach. the second is a combination of the second-order Adams-Moulton and second-order Adams-Bashforth methods. Both algorithms only require the solution of decoupled Stokes and Darcy problems at each time-step. Hence, these schemes are very efficient and can be easily implemented using legacy codes. We establish the unconditional and uniform in time stability for both schemes. …

Students' Perceived Utility Of Precision Taught Calculus, Rebecca-Anne Dibbs, David Glassmeyer, Wafa Yacoub

Faculty and Research Publications

The last decade of calculus research has showed students learn best when lecture is supplemented with thoughtful use of technology and group work; however, educators are given little direction of how they are to balance the already full first semester calculus class. Precision teaching is an instructional model that employs formative assessment to provide information on what topics are understood by students as well as indicate troublesome concepts. With this information, the instructor can adjust class time accordingly by incorporating supplemental activities most beneficial to students. The purpose of this interview study was to explore the perceived utility of precision …

Social Aggregation In Pea Aphids: Experiment And Random Walk Modeling, Christa Nilsen, John Paige, Olivia Warner, Benjamin Mayhew, Ryan Sutley, Mathew Lam, Andrew J. Bernoff, Chad M. Topaz

Chad M. Topaz

No abstract provided.

The Apostles And Brothers Of Jesus, Andrew Sills

Department of Mathematical Sciences Faculty Publications

Excerpt: The Talpiot tomb, a tomb excavated outside Jerusalem in 1980 and brought to worldwide public attention in 2007, contained ten ossuaries, six of which were inscribed with names. The English equivalents of the names are Jesus son of Joseph, two Marys, a rare diminutive form of Joseph, a diminutive of Matthew, and a Judah son of Jesus. Because of the similarities between this collection of names and certain names appearing in the Christian New Testament, some are curious as to whether the Talpiot tomb may have once interred the remains of Jesus of Nazareth and some of his relatives. …

Model Spaces: A Survey, William T. Ross, Stephan Ramon Garcia

Department of Math & Statistics Faculty Publications

This is a brief and gentle introduction, aimed at graduate students, to the subject of model subspaces of the Hardy space.

Counting Threshold Graphs And Finding Inertia Sets, Christopher Abraham Guzman

Theses and Dissertations

This thesis is separated into two parts: threshold graphs and inertia sets. First we present an algorithmic approach to finding the minimum rank of threshold graphs and then progress to counting the number of threshold graphs with a specific minimum rank. Second, we find an algorithmic and more automated way of determining the inertia set of graphs with seven or fewer vertices using theorems and lemmata found in previous papers. Inertia sets are a relaxation of the inverse eigenvalue problem. Instead of determining all the possible eigenvalues that can be obtained by matrices with a specific zero/nonzero pattern we restrict …

Common Fundamental Domains For Lattices Of The Same Volume, Ashley Erwin

Honors Program Theses and Projects

No abstract provided.

Variational Methods And Critical Point Theory 2013, Victoria Otero-Espinar, Juan J. Nieto, Donal O'Regan, Kanishka Perera

Mathematics and System Engineering Faculty Publications

[No abstract provided]

Record Linkage, Stasha Ann Bown Larsen

Theses and Dissertations

This document explains the use of different metrics involved with record linkage. There are two forms of record linkage: deterministic and probabilistic. We will focus on probabilistic record linkage used in merging and updating two databases. Record pairs will be compared using character-based and phonetic-based similarity metrics to determine at what level they match. Performance measures are then calculated and Receiver Operating Characteristic (ROC) curves are formed. Finally, an economic model is applied that returns the optimal tolerance level two databases should use to determine a record pair match in order to maximize profit.

Mathematical Model Of Dynamic Protein Interactions Regulating P53 Protein Stability For Tumor Suppression, Hua Wang, Guang Peng

Department of Mathematical Sciences Faculty Publications

In the field of cancer biology, numerous genes or proteins form extremely complex regulatory network, which determines cancer cell fate and cancer cell survival. p53 is a major tumor suppressor that is lost in more than 50% of human cancers. It has been well known that a variety of proteins regulate its protein stability, which is essential for its tumor suppressive function. It remains elusive how we could understand and target p53 stabilization process through network analysis. In this paper we discuss the use of random walk and stationary distribution to measure the compound effect of a network of genes …

Using Intelligent Prefetching To Reduce The Energy Consumption Of A Large-Scale Storage System, Brian Romoser, Ziliang Zong, Ribel Fares, Joal Wood, Rong Ge

Mathematics, Statistics and Computer Science Faculty Research and Publications

Many high performance large-scale storage systems will experience significant workload increases as their user base and content availability grow over time. The U.S. Geological Survey (USGS) Earth Resources Observation and Science (EROS) center hosts one such system that has recently undergone a period of rapid growth as its user population grew nearly 400% in just about three years. When administrators of these massive storage systems face the challenge of meeting the demands of an ever increasing number of requests, the easiest solution is to integrate more advanced hardware to existing systems. However, additional investment in hardware may significantly increase the …

Ancestor Worship In The Logic Of Games. How Foundational Were Aristotle's Contributions?, John Woods

Baltic International Yearbook of Cognition, Logic and Communication

Notwithstanding their technical virtuosity and growing presence in mainstream thinking, game theoretic logics have attracted a sceptical question: "Granted that logic can be done game theoretically, but what would justify the idea that this is the preferred way to do it?'' A recent suggestion is that at least part of the desired support might be found in the Greek dialectical writings. If so, perhaps we could say that those works possess a kind of foundational significance. The relation of being foundational for is interesting in its own right. In this paper, I explore its ancient applicability to relevant, paraconsistent and …

Games And Logic, Gabriel Sandu

Baltic International Yearbook of Cognition, Logic and Communication

The idea behind these games is to obtain an alternative characterization of logical notions cherished by logicians such as truth in a model, or provability (in a formal system). We offer a quick survey of Hintikka's evaluation games, which offer an alternative notion of truth in a model for first-order langauges. These are win-lose, extensive games of perfect information. We then consider a variation of these games, IF games, which are win-lose extensive games of imperfect information. Both games presuppose that the meaning of the basic vocabulary of the language is given. To give an account of the linguistic conventions …

Constructive Type Theory And The Dialogical Approach To Meaning, Shahid Rahman, Nicolas Clerbout

Baltic International Yearbook of Cognition, Logic and Communication

In its origins Dialogical logic constituted one part of a new movement called the Erlangen School or Erlangen Constructivism. Its goal was to provide a new start to a general theory of language and of science. According to the Erlangen-School, language is not just a fact that we discover, but a human cultural accomplishment whose construction reason can and should control. The resulting project of intentionally constructing a scientific language was called the Orthosprache-project. Unfortunately, the Orthosprache-project was not further developed and seemed to fade away. It is possible that one of the reasons for this fading away is that …

Ludics, Dialogue And Inferentialism, Alain Lecomte

Baltic International Yearbook of Cognition, Logic and Communication

In this paper, we try to show that Ludics, a (pre-)logical framework invented by J-Y. Girard, enables us to rethink some of the relationships between Philosophy, Semantics and Pragmatics. In particular, Ludics helps to shed light on the nature of dialogue and to articulate features of Brandom's inferentialism.

Argumentation And Inference: A Unified Approach, Christophe Fouqueré, Myriam Quatrini

Baltic International Yearbook of Cognition, Logic and Communication

We propose in this paper to use Ludics as a unified framework for the analysis of dialogue and the reasoning system. Not only is Ludics a logical theory, but it may also be built by means of concepts of game theory. We first present the main concepts of Ludics. A design is an abstraction and a generalization of the concept of proof. Interaction between designs is equivalent to cut elimination or modus ponens in logical theories. It appears to be a natural means for representing dialogues and also for reasoning. A design is a set of sequences of alternate actions …

Antilogic, Benoît Castelnérac, Mathieu Marion

Baltic International Yearbook of Cognition, Logic and Communication

This paper is an interim report of joint work begun in (Castelnérac & Marion 2009) on dialectic from Parmenides to Aristotle. In the first part we present rules for dialectical games, understood as a specific form of antilogikê developed by philosophers, and explain some of the key concepts of these dialectical games in terms of ideas from game semantics. In the games we describe, for a thesis A asserted by the answerer, a questioner must elicit the answerer’s assent to further assertions B₁, B₂,…, B_n, which form a scoreboard from which the questioner seeks …

Trust And Risk In Games Of Partial Information, Robin Clark

Baltic International Yearbook of Cognition, Logic and Communication

Games of partial information have been used to explicate Gricean implicature; their solution concept has been murky, however. In this paper, I will develop a simple solution concept that can be used to solve games of partial information, depending on the players' mutual trust and tolerance for risk. In addition, I will develop an approach to non-conventional quantity implicatures that relies on "face" (Goffman (1967), Brown and Levinson (1987)).

Differentiation Of Solutions Of Second-Order Bvps With Integral Boundary Conditions, Alfredo Janson, Bibi Juman

Mathematics Colloquium Series

Janson’s and Juman’s research involves differentiating solutions of boundary value problems with integral conditions, as well as showing that the resulting functions solve an associated boundary value problem—called the variational equation—with new integral boundary values.

Minimum Rank Problems For Cographs, Nicole Andrea Malloy

Theses and Dissertations

Let G be a simple graph on n vertices, and let S(G) be the class of all real-valued symmetric nxn matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The smallest rank achieved by a matrix in S(G) is called the minimum rank of G, denoted mr(G). The maximum nullity achieved by a matrix in S(G) is denoted M(G). For each graph G, there is an associated minimum rank class, MR(G) consisting of all matrices A in S(G) with rank A = mr(G). Although no restrictions are applied to the diagonal entries of …

Localized Bases For Kernel Spaces On The Unit Sphere, E. Fuselier, T. Hangelbroek, F. J. Narcowich, J. D. Ward, G. B. Wright

Grady Wright

Approximation/interpolation from spaces of positive definite or conditionally positive definite kernels is an increasingly popular tool for the analysis and synthesis of scattered data and is central to many meshless methods. For a set of N scattered sites, the standard basis for such a space utilizes N globally supported kernels; computing with it is prohibitively expensive for large N. Easily computable, well-localized bases with “small-footprint” basis elements—i.e., elements using only a small number of kernels—have been unavailable. Working on S2, with focus on the restricted surface spline kernels (e.g., the thin-plate splines restricted to the sphere), we construct easily computable, …

Peakon, Pseudo-Peakon, And Cuspon Solutions For Two Generalized Camassa- Holm Equations, Jibin Li, Zhijun Qiao

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

In this paper, we study peakon, cuspon, and pseudo-peakon solutions for two generalized Camassa-Holm equations. Based on the method of dynamical systems, the two generalized Camassa-Holm equations are shown to have the parametric representations of the solitary wave solutions such as peakon, cuspon, pseudo-peakons, and periodic cusp solutions. In particular, the pseudo-peakon solution is for the first time proposed in our paper. Moreover, when a traveling system has a singular straight line and a heteroclinic loop, under some parameter conditions, there must be peaked solitary wave solutions appearing.

Numerical Studies Of The Generalized L1 Greedy Algorithm For Sparse Signals, Fangjun Arroyo, Edward Arroyo, Xiezhang Li, Jiehua Zhu

Xiezhang Li

The generalized l1 greedy algorithm was recently introduced and used to reconstruct medical images in computerized tomography in the compressed sensing framework via total variation minimization. Experimental results showed that this algorithm is superior to the reweighted l1-minimization and l1 greedy algorithms in reconstructing these medical images. In this paper the effectiveness of the generalized l1 greedy algorithm in finding random sparse signals from underdetermined linear systems is investigated. A series of numerical experiments demonstrate that the generalized l1 greedy algorithm is superior to the reweighted l1-minimization and l1 greedy algorithms in the successful recovery of randomly generated Gaussian sparse …

Estimating Norms Of Commutators, Terry A. Loring, Freddy Vides

Branch Mathematics and Statistics Faculty and Staff Publications

We find estimates on the norm of a commutator of the form $[f(x),y]$ in terms of the norm of $[x,y]$, assuming that $x$ and $y$ are bounded linear operators on Hilbert space, with $x$ normal and with spectrum within the domain of $f$. In particular we discuss $\|[x^2,y]\|$ and $\|[x^{1/2},y]\|$ for $0\leq x \leq 1$. For larger values of $\delta = \|[x,y]\|$ we can rigorous calculate the best possible upper bound $\|[f(x),y]\| \leq \eta_f(\delta)$ for many $f$. In other cases we have conducted numerical experiments that strongly suggest that we have in many cases found the correct formula for the …

Deformations Associated With Rigid Algebras, M Gerstenhaber, Anthony Giaquinto

Mathematics and Statistics: Faculty Publications and Other Works

The deformations of an infinite dimensional algebra may be controlled not just by its own cohomology but by that of an associated diagram of algebras, since an infinite dimensional algebra may be absolutely rigid in the classical deformation theory for single algebras while depending essentially on some parameters. Two examples studied here, the function field of a sphere with four marked points and the first Weyl algebra, show, however, that the existence of these parameters may be made evident by the cohomology of a diagram (presheaf) of algebras constructed from the original. The Cohomology Comparison Theorem asserts, on the other …

Introduction To Real Analysis, William F. Trench

Faculty Authored and Edited Books & CDs

Using a clear and informal approach, this book introduces readers to a rigorous understanding of mathematical analysis and presents challenging math concepts as clearly as possible. This book is intended for those who want to gain an understanding of mathematical analysis and challenging mathematical concepts.

Elementary Differential Equations, William F. Trench

Textbooks Collection

Elementary Differential Equations with Boundary Value Problems is written for students in science, engineering, and mathematics who have completed calculus through partial differentiation. If your syllabus includes Chapter 10 (Linear Systems of Differential Equations), your students should have some preparation in linear algebra.

In writing this book I have been guided by the these principles:

An elementary text should be written so the student can read it with comprehension without too much pain. I have tried to put myself in the student’s place, and have chosen to err on the side of too much detail rather than not enough.

An …