Physical Sciences and Mathematics Commons^™

Convexity And Horizontal Second Fundamental Forms For Hypersurfaces In Carnot Groups, Luca Capogna, Scott D. Pauls, Jeremy T. Tyson

Mathematics Sciences: Faculty Publications

We use a Riemannian approximation scheme to give a characterization for smooth convex functions on a Carnot group (in the sense of Danielli-Garofalo- Nhieu or Lu-Manfredi-Stroffolini) in terms of the positive semidefiniteness of the horizontal second fundamental form of their graph.

Roger Temam On The Occasion Of His 70th Birthday, Claude Michel Brauner, Danielle Hilhorst, Alain Miranville, Shouhong Wang, Xiaoming Wang

Mathematics and Statistics Faculty Research & Creative Works

No abstract provided.

Arima Model For Forecasting Poisson Data: Application To Long-Term Earthquake Predictions, Wangdong Fu

UNLV Theses, Dissertations, Professional Papers, and Capstones

Earthquakes that occurred worldwide during the period of 1896 to 2009 with magnitude greater than or equal to 8.0 on the Richter scale are assumed to follow a Poisson process. Autoregressive Integrated Moving Average models are presented to fit the empirical recurrence rates, and to predict future large earthquakes. We show valuable modeling and computational techniques for the point processes and time series data. Specifically, for the proposed methodology, we address the following areas: data management and graphic presentation, model fitting and selection, model validation, model and data sensitivity analysis, and forecasting.

An F4-Style Involutive Basis Algorithm, Miao Yu

Master's Theses

How to solve a linear equation system? The echelon form of this system will be obtained by Gaussian elimination then give us the solution. Similarly, Gröbner Basis is the “nice form” of nonlinear equation systems that can span all the polynomials in the given ideal [4]. So we can use Gröbner Basis to analyze the solution of a nonlinear equation system.

But how to compute a Gröbner Basis? There exist several ways to do it. Buchberger’s algorithm is the original method [2]. Gebauer-Möller algorithm [6] is a refined Buchberger’s algorithm. The F4 algorithm [5] uses matrix reduction to compute efficiently. …

Applications Of Linear Programming To Coding Theory, Nathan Axvig

Department of Mathematics: Dissertations, Theses, and Student Research

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem.

In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such …

Local Radial Basis Function Methods For Solving Partial Differential Equations, Guangming Yao

Dissertations

Meshless methods are relatively new numerical methods which have gained popularity in computational and engineering sciences during the last two decades. This dissertation develops two new localized meshless methods for solving a variety partial differential equations.

Recently, some localized meshless methods have been introduced in order to handle large-scale problems, or to avoid ill-conditioned problems involving global radial basis function approximations. This dissertation explains two new localized meshelss methods, each derived from the global Method of Approximate Particular Solutions (MAPS). One method, the Localized Method of Approximate Particular Solutions (LMAPS), is used for elliptic and parabolic partial differential equations (PDEs) …

Studies Of Meson Mass Spectra In The Context Of Quark-Antiquark Bound States, Mallika Dhar

Dissertations

This dissertation deals with the computation of meson mass spectra in the context of quarkantiquark (q ¯ q) bound-state. Traditionally the q ¯ q bound-state problem is treated by solving the non-relativistic Schrödinger equation in position representation with a linear confining potential and a Coulomb-like attractive potential. For high energy, relativistic kinematics is necessary. It is well known that relativistic kinematics cannot be treated properly in position representation, but it can easily be handled in momentum representation. On the other hand, the linear potential and Coulomb-like potential have singularities in momentum-space and complicated subtraction procedure is necessary to treat the …

Simultaneous Seismic Imaging And Inversion Using An Inverse Scattering Algorithm For One Dimensional Media, Ashley Ciesla

Theses, Dissertations and Culminating Projects

The goal of this thesis is to test the capability and efficiency of an inverse scattering algorithm for imaging seismic data. The algorithm we are investigating simultaneously images and inverts one-dimensional, one-parameter (velocity), acoustic reflection data. The algorithm does not require a velocity model or any other a priori information about the medium under investigation, the only input being a reference velocity (the speed of sound in water) and the data collected in the experiment. We assume that the data contains no source wavelet and all other events except primary reflections have been removed in preprocessing. We simulate two types …

Dnagents: Genetically Engineered Intelligent Mobile Agents, Jeremy Otho Kackley

Dissertations

Mobile agents are a useful paradigm for network coding providing many advantages and disadvantages. Unfortunately, widespread adoption of mobile agents has been hampered by the disadvantages, which could be said to outweigh the advantages. There is a variety of ongoing work to address these issues, and this is discussed. Ultimately, genetic algorithms are selected as the most interesting potential avenue. Genetic algorithms have many potential benefits for mobile agents. The primary benefit is the potential for agents to become even more adaptive to situational changes in the environment and/or emergent security risks. There are secondary benefits such as the natural …

Noise Assumptions In Complex-Valued Sense Mr Image Reconstruction, Daniel B. Rowe, Iain P. Bruce

Mathematics, Statistics and Computer Science Faculty Research and Publications

In fMRI, brain images are not measured instantaneously and a volume of images can take two seconds to acquire at a low 64x64 resolution. Significant effort has been put forth on many fronts to decrease image acquisition time including parallel imaging. In parallel imaging, sub-sampled spatial frequency points are measured in parallel and combined to form a single image. Measurement time is decreased at the expense of increased image reconstruction difficulty and time. One significant parallel imaging technique known as SENSE utilizes a complex-valued regression coefficient estimation process with transposes replaced by conjugate transposes. However, in SENSE the noise structure …

Identification Of Parameters And The Distribution Of The Maximum And The Minimum, Lijuan Bi

Theses and Dissertations - UTB/UTPA

In problems of competing risks, where an individual may be subject to m causes of death and X(i) is the lifetime of an individual exposed to the ith cause, the X(i)s are not observable but only is their minimum, and inference is needed on the X(i) based on their minimum. The same is the case with a m-component system, where the components are connected in series, and we are interested in inference on the lifetimes of the individual components. These examples motivate problems on parameter identification by the distribution of the minimum. Similarly, the example of a m-component system where …

Multi-Soliton Solutions To A Model Equation For Shallow Water Waves, Zhijiang Qiao

Theses and Dissertations - UTB/UTPA

In Soliton theory, Hirota direct method is most efficient tool for seeking one soliton solutions or multi-soliton solutions of integrable nonlinear partial differential equations. The key step of the Hirota direct method is to transform the given equation into its Hirota bilinear form. Once the bilinear form of the given equation is found, we can construct the soliton and multi-soliton solutions of that model. Many interesting characteristics of Pfaffians were discovered through studies of soliton equations. In this thesis, a shallow water wave model and its bilinear equation are investigated. Using Hirota direct method, we obtain the multi-soliton solutions and …

Supplementary Balance Laws And The Entropy Principle, Serge Preston

Mathematics and Statistics Faculty Publications and Presentations

In this work we study the mathematical aspects of the development in the continuum thermodynamics known as the “Entropy Principle”. It started with the pioneering works of B.Coleman, W.Noll and I. Muller in 60th of XX cent. and got its further development mostly in the works of G. Boillat, I-Shis Liu and T.Ruggeri. “Entropy Principle” combines in itself the structural requirement on the form of balance laws of the thermodynamical system (denote such system (C)) and on the entropy balance law with the convexity condition of the entropy density. First of these requirements has pure mathematical form defining so called …

Acm/Springer Mobile Networks And Applications (Monet) Special Issue On “Advanced Mobile Applications And Intelligent Multimedia Systems For Ubi-Com”, Jong Hyuk Park, Shu-Ching Chen, Mieso Denko, Sheikh Iqbal Ahamed

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

A Formal Context Specific Trust Model (Ftm) For Multimedia And Ubiquitous Computing Environment, Sheikh Iqbal Ahamed, Munirul M. Haque, Nilothpal Talukder

Mathematics, Statistics and Computer Science Faculty Research and Publications

In order to ensure secure sharing of resources in an ad-hoc network of handheld devices in a multimedia and ubiquitous computing environment, mutual collaboration is essential. However, the limitations, such as poor storage and computational capability of these multimedia and ubiquitous devices stand as the bottleneck for effective sharing of resources. As a result of this drawback, the adversaries are obtaining access to the new doors for security breaches. Mutual Trust is the weapon used to combat security violations by restricting malicious devices from participating in any interaction in such an open and dynamic environment. In this paper, we present …

On Conjectures Concerning Nonassociate Factorizations, Jason A Laska

Doctoral Dissertations

We consider and solve some open conjectures on the asymptotic behavior of the number of different numbers of the nonassociate factorizations of prescribed minimal length for specific finite factorization domains. The asymptotic behavior will be classified for Cohen-Kaplansky domains in Chapter 1 and for domains of the form R=K+XF[X] for finite fields K and F in Chapter 2. A corollary of the main result in Chapter 3 will determine the asymptotic behavior for Krull domains with finite divisor class group.

Elasticity Of Krull Domains With Infinite Divisor Class Group, Benjamin Ryan Lynch

Doctoral Dissertations

The elasticity of a Krull domain R is equivalent to the elasticity of the block monoid B(G,S), where G is the divisor class group of R and S is the set of elements of G containing a height-one prime ideal of R. Therefore the elasticity of R can by studied using the divisor class group. In this dissertation, we will study infinite divisor class groups to determine the elasticity of the associated Krull domain. The results will focus on the divisor class groups Z, Z(p infinity), Q, and general infinite groups. For the groups Z and Z(p infinity), it has …

Optimal Control Of Species Augmentation Conservation Strategies, Erin Nicole Bodine

Doctoral Dissertations

Species augmentation is a method of reducing species loss via augmenting declining or threatened populations with individuals from captive-bred or stable, wild populations. In this dissertation, species augmentation is analyzed in an optimal control setting to determine the optimal augmentation strategies given various constraints and settings. In each setting, we consider the effects on both the target/endangered population and a reserve population from which the individuals translocated in the augmentation are harvested. Four different optimal control formulations are explored. The first two optimal control formulations model the underlying population dynamics with a system of ordinary differential equations. Each of these …

Trees In Connected Graphs, Ashish Gupta

Theses, Dissertations and Culminating Projects

The focus of the Master’s Thesis will be the investigation of current research involving trees that cover subsets of the vertex set of a connected graph. The primary goal is the extension of some recent results and a conjecture of Horak and McAvaney. Given certain conditions, we will reformulate their conjecture that states that if a graph can be spanned by a number of edge-disjoint trees, we can provide a bound on the maximum degree of this collection of edge-disjoint trees. We are able to show that this conjecture is true if the number of trees used to span the …

Accuracy, Resolution And Stability Properties Of A Modified Chebyshev Method, Jodi Mead, Rosemary A. Renaut

Jodi Mead

While the Chebyshev pseudospectral method provides a spectrally accurate method, integration of partial differential equations with spatial derivatives of order M requires time steps of approximately O(N−2M) for stable explicit solvers. Theoretically, time steps may be increased to O(N−M) with the use of a parameter, α-dependent mapped method introduced by Kosloff and Tal-Ezer [ J. Comput. Phys., 104 (1993), pp. 457–469]. Our analysis focuses on the utilization of this method for reasonable practical choices for N, namely N ≲ 30, as may be needed for two- or three dimensional modeling. Results presented confirm that spectral accuracy with increasing N is …

On Folding A Polygon To A Polyhedron, Joseph O'Rourke

Computer Science: Faculty Publications

We show that the open problem presented in "Geometric Folding Algorithms: Linkages, Origami, Polyhedra" [DO07] is solved by a theorem of Burago and Zalgaller [BZ96] from more than a decade earlier.

Poset Pinball, Gkm-Compatible Subspaces, And Hessenberg Varieties, Megumi Harada, Julianna Tymoczko

Mathematics Sciences: Faculty Publications

This paper has three main goals. First, we set up a general framework to address the problem of constructing module bases for the equivariant cohomology of certain subspaces of GKM spaces. To this end we introduce the notion of a GKM-compatible subspace of an ambient GKM space. We also discuss poset-upper-triangularity, a key combinatorial notion in both GKM theory and more generally in localization theory in equivariant cohomology. With a view toward other applications, we present parts of our setup in a general algebraic and combinatorial framework. Second, motivated by our central problem of building module bases, we introduce a …

Fastmedusa: A Parallelized Tool To Infer Gene Regulatory Networks, Serdar Bozdag, Aiguo Li, Stefan Wuchty, Howard A. Fine

Mathematics, Statistics and Computer Science Faculty Research and Publications

Motivation: In order to construct gene regulatory networks of higher organisms from gene expression and promoter sequence data efficiently, we developed FastMEDUSA. In this parallelized version of the regulatory network-modeling tool MEDUSA, expression and sequence data are shared among a user-defined number of processors on a single multi-core machine or cluster. Our results show that FastMEDUSA allows a more efficient utilization of computational resources. While the determination of a regulatory network of brain tumor in Homo sapiens takes 12 days with MEDUSA, FastMEDUSA obtained the same results in 6 h by utilizing 100 processors. Availability: Source code and documentation of …

On Flat Polyhedra Deriving From Alexandrov's Theorem, Joseph O'Rourke

Computer Science: Faculty Publications

We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in O(n³) time for polygons whose gluings are specified by n labels.

A Toolkit For The Construction And Understanding Of 3-Manifolds, Lee R. Lambert

Theses and Dissertations

Since our world is experienced locally in three-dimensional space, students of mathematics struggle to visualize and understand objects which do not fit into three-dimensional space. 3-manifolds are locally three-dimensional, but do not fit into 3-dimensional space and can be very complicated. Twist and bitwist are simple constructions that provide an easy path to both creating and understanding closed, orientable 3-manifolds. By starting with simple face pairings on a 3-ball, a myriad of 3-manifolds can be easily constructed. In fact, all closed, connected, orientable 3-manifolds can be developed in this manner. We call this work a tool kit to emphasize the …

Vanishing Of Ext And Tor Over Complete Intersections, Olgur Celikbas

Department of Mathematics: Dissertations, Theses, and Student Research

Let (R,m) be a local complete intersection, that is, a local ring whose m-adic completion is the quotient of a complete regular local ring by a regular sequence. Let M and N be finitely generated R-modules. This dissertation concerns the vanishing of Tor(M, N) and Ext(M, N). In this context, M satisfies Serre's condition (S_{n}) if and only if M is an nth syzygy. The complexity of M is the least nonnegative integer r such that the nth Betti number of M is bounded by a polynomial of degree r-1 for all sufficiently large n. We use this notion of …

A Hybrid Radial Basis Function-Pseudospectral Method For Thermal Convection In A 3-D Spherical Shell, Grady Wright, Natasha Flyer, David A. Yuen

Mathematics Faculty Publications and Presentations

A novel hybrid spectral method that combines radial basis function (RBF) and Chebyshev pseudospectral methods in a “2 + 1” approach is presented for numerically simulating thermal convection in a 3‐D spherical shell. This is the first study to apply RBFs to a full 3‐D physical model in spherical geometry. In addition to being spectrally accurate, RBFs are not defined in terms of any surface‐based coordinate system such as spherical coordinates. As a result, when used in the lateral directions, as in this study, they completely circumvent the pole issue with the further advantage that nodes can be “scattered” over …

Comprehensive Peroxidase-Based Hematologic Profiling For The Prediction Of 1-Year Myocardial Infarction And Death, Marie Luise Brennan, Anupama Reddy, W.H. Wilson Tang, Yuping Wu, Danielle M. Brennan, Amy Hsu, Shirley A. Mann, Peter L. Hammer, Stanley L. Hazen

Mathematics and Statistics Faculty Publications

Background— Recognition of biological patterns holds promise for improved identification of patients at risk for myocardial infarction (MI) and death. We hypothesized that identifying high- and low-risk patterns from a broad spectrum of hematologic phenotypic data related to leukocyte peroxidase-, erythrocyte- and platelet-related parameters may better predict future cardiovascular risk in stable cardiac patients than traditional risk factors alone. Methods and Results— Stable patients (n=7369) undergoing elective cardiac evaluation at a tertiary care center were enrolled. A model (PEROX) that predicts incident 1-year death and MI was derived from standard clinical data combined with information captured by a high-throughput peroxidase-based …

Creating A Masters In Numeracy Program, Eric Gaze

Numeracy

The Master of Science in Numeracy program at Alfred University received full approval from the New York State Education Department (NYSED) in May of 2007. This first-of-its-kind program seeks to provide teachers at all levels, from across the curriculum, the skills, and more importantly the confidence, to introduce relevant quantitative concepts in their own disciplines. Created to be a complement of the MS Ed. in Literacy, the 30-hour MS in Numeracy program consists of four required core courses (Teaching Numeracy, Teaching with Data, Assessment and Learning Theories in Numeracy, and Doing Science and Numeracy), five electives from a list of …

Parts Of The Whole: Thinking About Variance: Standards, Targets, Tracking, And Other Thoughts, Dorothy Wallace

Numeracy

Variation is a natural result of any process, including education. Understanding how variation propagates and increases is necessary for designing educational interventions that work for the intended population. We show how common strategies such as setting standards and tracking can accidentally produce unintended and undesirable results due to the way variation moves through a system.