Mathematics Commons^™

Determining The Success Of Ncaa Basketball Teams Through Team Characteristics, Raymond Witkos

Honors Projects in Mathematics

Every year much of the nation becomes engulfed in the NCAA basketball postseason tournament more affectionately known as “March Madness.” The tournament has received the name because of the ability for any team to win a single game and advance to the next round. The purpose of this study is to determine whether concrete statistical measures can be used to predict the final outcome of the tournament. The data collected in the study include 13 independent variables ranging from the 2003-2004 season up until the current 2009-2010 season. Different tests were run in an attempt to achieve the most accurate …

On Construction Of The Smallest One-Sided Confidence Interval For The Difference Of Two Proportions, Weizhen Wang

Mathematics and Statistics Faculty Publications

For my class of one-sided 1 - α confidence intervals with a certain monotonicity ordering on the random confidence limit, the smallest interval, in the sense of the set inclusion for the difference of two proportions of two independent binomial random variables, is constructed based on a direct analysis of coverage probability function. A special ordering on the confidence limit is developed and the corresponding smallest confidence interval is derived. This interval is then applied to identify the minimum effective dose (MED) for binary data in dose-response studies, and a multiple test procedure that controls the familywise error rate at …

Importance Sampling For Dispersion-Managed Solitons, Elaine T. Spiller, Gino Biondini

Mathematics, Statistics and Computer Science Faculty Research and Publications

The dispersion-managed nonlinear Schrödinger (DMNLS) equation governs the long-term dynamics of systems which are subject to large and rapid dispersion variations. We present a method to study large, noise-induced amplitude and phase perturbations of dispersion-managed solitons. The method is based on the use of importance sampling to bias Monte Carlo simulations toward regions of state space where rare events of interest—large phase or amplitude variations—are most likely to occur. Implementing the method thus involves solving two separate problems: finding the most likely noise realizations that produce a small change in the soliton parameters, and finding the most likely way that …

Rao's Quadratic Entropy And Some New Applications, Yueqin Zhao

Mathematics & Statistics Theses & Dissertations

Many problems in statistical inference are formulated as testing the diversity of populations. The entropy functions measure the similarity of a distribution function to the uniform distribution and hence can be used as a measure of diversity. Rao (1982a) proposed the concept of quadratic entropy. Its concavity property makes the decomposition similar to ANOVA for categorical data feasible. In this thesis, after reviewing the properties and providing a modification to quadratic entropy, various applications of quadratic entropy are explored. First, analysis of quadratic entropy with the suggested modification to analyze the contingency table data is explored. Then its application to …

Statistical Learning And Behrens-Fisher Distribution Methods For Heteroscedastic Data In Microarray Analysis, Nabin K. Manandhr-Shrestha

USF Tampa Graduate Theses and Dissertations

The aim of the present study is to identify the di®erentially expressed genes be- tween two di®erent conditions and apply it in predicting the class of new samples using the microarray data. Microarray data analysis poses many challenges to the statis- ticians because of its high dimensionality and small sample size, dubbed as "small n large p problem". Microarray data has been extensively studied by many statisticians and geneticists. Generally, it is said to follow a normal distribution with equal vari- ances in two conditions, but it is not true in general. Since the number of replications is very small, …

Finite Element Approximations For Stokes-Darcy Flow With Beavers-Joseph Interface Conditions, Yanzhao Cao, Max Gunzburger, Xiaolong Hu, Fei Hua, Xiaoming Wang, Weidong Zhao

Mathematics and Statistics Faculty Research & Creative Works

Numerical solutions using finite element methods are considered for transient flow in a porous medium coupled to free flow in embedded conduits. Such situations arise, for example, for groundwater flows in karst aquifers. the coupled flow is modeled by the Darcy equation in a porous medium and the Stokes equations in the conduit domain. on the interface between the matrix and conduit, Beavers-Joseph interface conditions, instead of the simplified Beavers-Joseph-Saffman conditions, are imposed. Convergence and error estimates for finite element approximations are obtained. Numerical experiments illustrate the validity of the theoretical results. © 2010 Society for Industrial and Applied Mathematics.

Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ

Master's Theses

View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.

In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft Development Training, suggested …

Integer Functions On The Cycle Space And Edges Of A Graph, Dan Slilaty

Mathematics and Statistics Faculty Publications

A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the number of backward edges. Such a homomorphism preserves the parity of the length of a cycle and the image of a cycle is bounded by the length of that cycle. Pretzel and Youngs (SIAM J. Discrete Math. 3(4):544–553, 1990) showed that any Z-module homomorphism of a graph’s cycle space to Z that satisfies these two properties for all cycles must be such a map induced from an edge direction …

Quantification Of Artistic Style Through Sparse Coding Analysis In The Drawings Of Pieter Bruegel The Elder, James M. Hughes, Daniel J. Graham, Daniel N. Rockmore

Dartmouth Scholarship

Recently, statistical techniques have been used to assist art historians in the analysis of works of art. We present a novel technique for the quantification of artistic style that utilizes a sparse coding model. Originally developed in vision research, sparse coding models can be trained to represent any image space by maximizing the kurtosis of a representation of an arbitrarily selected image from that space. We apply such an analysis to successfully distinguish a set of authentic drawings by Pieter Bruegel the Elder from another set of well-known Bruegel imitations. We show that our approach, which involves a direct comparison …

Nonlinear Model Reduction Using Group Proper Orthogonal Decomposition, Benjamin T. Dickinson, John R. Singler

Mathematics and Statistics Faculty Research & Creative Works

We propose a new method to reduce the cost of computing nonlinear terms in projec- tion based reduced order models with global basis functions. We develop this method by extending ideas from the group nite element (GFE) method to proper orthogonal decomposition (POD) and call it the group POD method. Here, a scalar two-dimensional Burgers' equation is used as a model problem for the group POD method. Numerical results show that group POD models of Burgers' equation are as accurate and are computationally more e cient than standard POD models of Burgers' equation.

Optimality Of Balanced Proper Orthogonal Decomposition For Data Reconstruction, John R. Singler

Mathematics and Statistics Faculty Research & Creative Works

Proper orthogonal decomposition (POD) finds an orthonormal basis yielding an optimal reconstruction of a given dataset. We consider an optimal data reconstruction problem for two general datasets related to balanced POD, which is an algorithm for balanced truncation model reduction for linear systems. We consider balanced POD outside of the linear systems framework, and prove that it solves the optimal data reconstruction problem. the theoretical result is illustrated with an example.

Balanced Pod Algorithm For Robust Control Design For Linear Distributed Parameter Systems, John R. Singler, Belinda A. Batten

Mathematics and Statistics Faculty Research & Creative Works

A mathematical model of a physical system is never perfect; therefore, robust control laws are necessary for guaranteed stabilization of the nominal model and also "nearby" systems, including hopefully the actual physical system. We consider the computation of a robust control law for large-scale finite dimensional linear systems and a class of linear distributed parameter systems. The controller is robust with respect to left coprime factor perturbations of the nominal system. We present an algorithm based on balanced proper orthogonal decomposition to compute the nonstandard features of this robust control law. Numerical results are presented for a convection diffusion partial …

Computational Issues In Sensitivity Analysis For 1d Interface Problems, L. G. Davis, John R. Singler

Mathematics and Statistics Faculty Research & Creative Works

This paper is concerned with the construction of accurate and e cient computational algorithms for the numerical approximation of sensitivities with respect to a parameter dependent interface location. Motivated by sensitivity analysis with respect to piezoelectric actuator placement on an

Boundary Data Maps For Schrödinger Operators On A Compact Interval, Stephen L. Clark, Fritz Gesztesy, M. Mitrea

Mathematics and Statistics Faculty Research & Creative Works

We provide a systematic study of boundary data maps, that is, 2 x 2 matrix-valued Dirichlet-to-Neumann and more generally, Robin-to-Robin maps, associated with one-dimensional Schrödinger operators on a compact interval [0, R] with separated boundary conditions at 0 and R. Most of our results are formulated in the non-self-adjoint context. Our principal results include explicit representations of these boundary data maps in terms of the resolvent of the underlying Schrödinger operator and the associated boundary trace maps, Krein-type resolvent formulas relating Schrödinger operators corresponding to different (separated) boundary conditions, and a derivation of the Herglotz property of boundary data maps …

High Accuracy Combination Method For Solving The Systems Of Nonlinear Volterra Integral And Integro-Differential Equations With Weakly Singular Kernels Of The Second Kind, Xiaoming He, Lu Pan, Tao Lü

Mathematics and Statistics Faculty Research & Creative Works

This paper presents a high accuracy combination algorithm for solving the systems of nonlinear Volterra integral and integro-differential equations with weakly singular kernels of the second kind. Two quadrature algorithms for solving the systems are discussed, which possess high accuracy order and the asymptotic expansion of the errors. By means of combination algorithm, we may obtain a numerical solution with higher accuracy order than the original two quadrature algorithms. Moreover an a posteriori error estimation for the algorithm is derived. Both of the theory and the numerical examples show that the algorithm is effective and saves storage capacity and computational …

The Hodrick-Prescott Filter: A Special Case Of Penalized Spline Smoothing, Robert Paige L., A. A. Trindade

Mathematics and Statistics Faculty Research & Creative Works

We prove that the Hodrick-Prescott Filter (HPF), a commonly used method for smoothing econometric time series, is a special case of a linear penalized spline model with knots placed at all observed time points (except the first and last) and uncorrelated residuals. This equivalence then furnishes a rich variety of existing data-driven parameter estimation methods, particularly restricted maximum likelihood (REML) and generalized cross-validation (GCV). This has profound implications for users of HPF who have hitherto typically relied on subjective choice, rather than estimation, for the smoothing parameter. By viewing estimates as roots of an appropriate quadratic estimating equation, we also …

Incorporating Genome Annotation In The Statistical Analysis Of Genomic And Epigenomic Tiling Array Data, Gayla R. Olbricht

Mathematics and Statistics Faculty Research & Creative Works

"A wealth of information and technologies are currently available for the genomewide investigation of many types of biological phenomena. Genomic annotation databases provide information about the DNA sequence of a particular organism and give locations of different types of genomic elements, such as the exons and introns of genes. Microarrays are a powerful type of technology that make use of DNA sequence information to investigate different types of biological phenomena on a genome-wide level. Tiling arrays are a unique type of microarray that provide unbiased, highdensity coverage of a genomic region, making them well suited for many applications, such as …

Periodic Solutions Of Neutral Delay Integral Equations Of Advanced Type, Muhammad Islam, Nasrin Sultana, James Booth

Mathematics Faculty Publications

We study the existence of continuous periodic solutions of a neutral delay integral equation of advanced type. In the analysis we employ three fixed point theorems: Banach, Krasnosel'skii, and Krasnosel'skii-Schaefer. Krasnosel'skii-Schaefer fixed point theorem requires an a priori bound on all solutions. We employ a Liapunov type method to obtain such bound.

Gronwall-Ouiang-Type Integral Inequalities On Time Scales, Ailian Liu, Martin Bohner

Mathematics and Statistics Faculty Research & Creative Works

We present several Gronwall-OuIang-type integral inequalities on time scales. Firstly, an OuIang inequality on time scales is discussed. Then we extend the Gronwall-type inequalities to multiple integrals. Some special cases of our results contain continuous Gronwall-type inequalities and their discrete analogues. Several examples are included to illustrate our results at the end.

Weyl-Titchmarsh Theory For Hamiltonian Dynamic Systems, Shurong Sun, Shaozhu Chen, Martin Bohner

Mathematics and Statistics Faculty Research & Creative Works

We establish the Weyl-Titchmarsh theory for singular linear Hamiltonian dynamic systems on a time scale T , which allows one to treat both continuous and discrete linear Hamiltonian systems as special cases for T= ℝ and T= ℤ within one theory and to explain the discrepancies between these two theories. This paper extends the Weyl-Titchmarsh theory and provides a foundation for studying spectral theory of Hamiltonian dynamic systems. These investigations are part of a larger program which includes the following: (i) M(λ) theory for singular Hamiltonian systems, (ii) on the spectrum of Hamiltonian systems, (iii) on boundary value problems for …

Traveling Wave Solutions For A Nonlocal Reaction-Diffusion Model Of Influenza A Drift, Joaquin Riviera, Yi Li

Mathematics and Statistics Faculty Publications

In this paper we discuss the existence of traveling wave solutions for a nonlocal reaction-diffusion model of Influenza A proposed in Lin et. al. (2003). The proof for the existence of the traveling wave takes advantage of the different time scales between the evolution of the disease and the progress of the disease in the population. Under this framework we are able to use the techniques from geometric singular perturbation theory to prove the existence of the traveling wave.

Simulating Power For One-Way Anova By Using Non-Normal Error Distributions, Caixia Xu

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Usually we assume that the distribution of the additive errors in a one-way ANOVA linear model is normal. However, exceptions to this assumption about the error distribution may exist. In such cases, we might consider non-normal error distributions, but proceed with the "usual" ANOVA F-test analyses. This study focuses on simulating power for one-way ANOVA when using non-normal error distributions.

Digraphs With Isomorphic Underlying And Domination Graphs: 4-Cycles And Pairs Of Paths, Kim A. S. Factor, Larry J. Langley

Mathematics, Statistics and Computer Science Faculty Research and Publications

A domination graph of a digraph D, dom(D), is created using the vertex set of D, V(D). There is an edge uv in dom(D) whenever (u, z) or (v, z) is in the arc set of D, A(D), for every other vertex z ε V(D). For only some digraphs D has the structure of dom(D) been characterized. Examples of this are tournaments and regular digraphs. The authors have characterizations for the structure of digraphs D for …

A Mobile Intelligent Interruption Management System, Sina Zulkernain, Praveen Madiraju, Sheikh Iqbal Ahamed, Karl Stamm

Mathematics, Statistics and Computer Science Faculty Research and Publications

Mobile phones have become the most hated device that people cannot live without. For its primary usage as a communication device, it has surpassed any other medium. But it comes with a high price, interruption, anywhere anytime. These unwanted interruptions cause loss of productivity and also mostly not beneficial to the immediate task at hand, and moving them few minutes into the future can increase productivity. Considering receiver’s unavailability, it is possible to manage cell phone disruptions using advanced features like sensing capability, ubiquitous computing and context aware systems. This paper proposes the architecture of a system named Mobile Intelligent …

Local Out-Tournaments With Upset Tournament Strong Components I: Full And Equal {0,1}-Matrix Ranks, Kim A. S. Factor, Rebecca M. Kohler, Jason M. Derby

Mathematics, Statistics and Computer Science Faculty Research and Publications

A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the out-tournament whose adjacency matrix has boolean, nonnegative integer, term, and real rank all equal to the number of vertices, n. Corresponding results for biclique covers and partitions of the digraph are provided.

Digraphs With Isomorphic Underlying And Domination Graphs: Pairs Of Paths, Kim A. S. Factor, Larry J. Langley

Mathematics, Statistics and Computer Science Faculty Research and Publications

A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv ϵ E (dom (D)) whenever (u, z) ϵ A (D) or (v, z) ϵ A (D) for any other vertex z ϵ A (D). Here, we consider directed graphs whose underlying graphs are isomorphic to their domination graphs. Specifically, digraphs are completely characterized where UG^c (D) is the union of two disjoint paths.

Lower Semimodular Inverse Semigroups, Ii, Peter R. Jones, Kyeong Hee Cheong

Mathematics, Statistics and Computer Science Faculty Research and Publications

The authors’ description of the inverse semigroups S for which the lattice ℒℱ(S) of full inverse subsemigroups is lower semimodular is used to describe those for which (a) the lattice ℒ(S) of all inverse subsemigroups or (b) the lattice �o(S) of convex inverse subsemigroups has that property. In each case, we show that this occurs if and only if the entire lattice is a subdirect product of ℒℱ(S) with ℒ(E _S ), or �o(E _S ), respectively, where E _S is the semilattice of idempotents of …

Not Every Co-Existential Map Is Confluent, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A continuous surjection between compacta is co-existential if it is the second of two maps whose composition is a standard ultracopower projection. Co-existential maps are always weakly confluent, and are even monotone when the range space is locally connected; so it is a natural question to ask whether they are always confluent. Here we give a negative answer. This is an interesting question, mainly because of the fact that most theorems about confluent maps have parallel versions for co-existential maps---notably, both kinds of maps preserve hereditary indecomposability. Where the known parallels break down is in the question of chainability. It …

Automation Process For Morphometric Analysis Of Volumetric Ct Data From Pulmonary Vasculature In Rats, Rahul Shingrani, Gary S. Krenz, Robert Molthen

Mathematics, Statistics and Computer Science Faculty Research and Publications

With advances in medical imaging scanners, it has become commonplace to generate large multidimensional datasets. These datasets require tools for a rapid, thorough analysis. To address this need, we have developed an automated algorithm for morphometric analysis incorporating A Visualization Workshop computational and image processing libraries for three-dimensional segmentation, vascular tree generation and structural hierarchical ordering with a two-stage numeric optimization procedure for estimating vessel diameters. We combine this new technique with our mathematical models of pulmonary vascular morphology to quantify structural and functional attributes of lung arterial trees. Our physiological studies require repeated measurements of vascular structure to determine …

Improving Accuracy Of Large-Scale Prediction Of Forest Disease Incidence Through Bayesian Data Reconciliation, Ephraim M. Hanks

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Increasing the accuracy of predictions made from ecological data typically involves replacing or replicating the data, but the cost of updating large-scale data sets can be prohibitive. Focusing resources on a small sample of locations from a large, less accurate data set can result in more reliable observations, though on a smaller scale. We present an approach for increasing the accuracy of predictions made from a large-scale eco logical data set through reconciliation with a small, highly accurate data set within a Bayesian hierarchical modeling framework. This approach is illustrated through a study of incidence of eastern spruce dwarf mistletoe …