Effects Of Advective-Diffusive Transport Of Multiple Chemoattractants On Motility Of Engineered Chemosensory Particles In Fluidic Environments,
2019
Trinity University
Effects Of Advective-Diffusive Transport Of Multiple Chemoattractants On Motility Of Engineered Chemosensory Particles In Fluidic Environments, D. King, H. Başağaoğlu, Hoa Nguyen, Frank G. Healy, Melissa Whitman, Sauro Succi
Mathematics Faculty Research
Motility behavior of an engineered chemosensory particle (ECP) in fluidic environments is driven by its responses to chemical stimuli. One of the challenges to understanding such behaviors lies in tracking changes in chemical signal gradients of chemoattractants and ECP-fluid dynamics as the fluid is continuously disturbed by ECP motion. To address this challenge, we introduce a new multiscale numerical model to simulate chemotactic swimming of an ECP in confined fluidic environments by accounting for motility-induced disturbances in spatiotemporal chemoattractant distributions. The model accommodates advective-diffusive transport of unmixed chemoattractants, ECP-fluid hydrodynamics at the ECP-fluid interface, and spatiotemporal disturbances in the chemoattractant …
Universal Quantum Computation,
2019
Marshall University
Universal Quantum Computation, Junya Kasahara
Theses, Dissertations and Capstones
We study quantum computers and their impact on computability. First, we summarize the history of computer science. Only a few articles have determined the direction of computer science and industry despite the fact that many works have been dedicated to the present success. We choose articles by A. M. Turing and D. Deutsch, because A. M. Turing proposed the basic architecture of modern computers while D. Deutsch proposed an architecture for the next generation of computers called quantum computers. Second, we study the architecture of modern computers using Turing machines. The Turing machine has the basic design of modern computers …
On Monochromatic Sets With Nondecreasing Diameter,
2019
Marshall University
On Monochromatic Sets With Nondecreasing Diameter, Adam O’Neal
Theses, Dissertations and Capstones
Our problem comes from the field of combinatorics known as Ramsey theory. Ramsey theory, in a general sense, is about identifying the threshold for which a family of objects, associated with a particular parameter, goes from never or sometimes satisfying a certain property to always satisfying that property. Research in Ramsey theory has applications in design theory and coding theory. For integers m, r, and t, we say that a set of n integers colored with r colors is (m, r, t)-permissible if there exist t monochromatic subsets B1, B2, . . . , Bt …
Exploring The Variance Of The Sample Variance Through Estimation And Simulation,
2019
Marshall University
Exploring The Variance Of The Sample Variance Through Estimation And Simulation, Christina Stradwick
Theses, Dissertations and Capstones
In this thesis, we examine properties of the variance of the sample variance, which we will denote V (S 2 ). We derive a formula for this variance and show that it only depends on the sample size, variance, and kurtosis of the underlying distribution. We also derive the maximum likelihood estimators for this parameter, Vˆ (S 2 ), under the normal, exponential, Bernoulli, and Poisson distributions and end the thesis with simulations demonstrating the distributions of these estimators.
An Inference-Driven Branch And Bound Optimization Strategy For Planning Ambulance Services,
2019
Marshall University
An Inference-Driven Branch And Bound Optimization Strategy For Planning Ambulance Services, Kevin Mcdaniel
Theses, Dissertations and Capstones
Strategic placement of ambulances is important to the efficient functioning of emergency services. As part of an ongoing collaboration with Wayne County 911, we developed a strategy to optimize the placement of ambulances throughout Wayne County based on de-identified call and response data from 2016 and 2017. The primary goals of the optimization were minimizing annual operating cost and mean response time, as well as providing a constructive solution that could naturally evolve from the existing plan. This thesis details the derivation and implementation of one of the optimization strategies used in this project. It is based on parametric statistical …
Statistical Analysis Of Tandem Queues With Markovian Passages In Porous Mediums,
2019
Marshall University
Statistical Analysis Of Tandem Queues With Markovian Passages In Porous Mediums, Gboyega David Adepoju
Theses, Dissertations and Capstones
Queuing theory is the mathematical study of queues or waiting lines. A queue is formed whenever the demand for service exceeds the capacity to provide service at that point in time. In this thesis, the birth-and-death process is used to model the movement of customers or units into and out of a network of queues in tandem. We start with the theoretical analysis of M/M/1 queues with Poisson arrival and exponential service time with first-come first-served (FCFS) discipline and one service station. We derive the global balance equation for each network. Using both the iterative and the probability generating function, …
L(2, 1)-Labeling Of Circulant Graphs,
2019
Fort Hays State University
L(2, 1)-Labeling Of Circulant Graphs, Sarbari Mitra, Soumya Bhoumik
Mathematics Faculty Publications
An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one. Let λ12(Γ) denote the least λ such that Γ admits an L(2, 1)-labeling using labels from {0, 1, . . ., λ}. A Cayley graph of group G is called a circulant graph of order n, if G = Zn. In this paper initially we investigate the upper bound for the span of the L(2, 1)-labeling for …
Graceful Labeling Of Triangular Extension Of Complete Bipartite Graph,
2019
Fort Hays State University
Graceful Labeling Of Triangular Extension Of Complete Bipartite Graph, Sarbari Mitra, Soumya Bhoumik
Mathematics Faculty Publications
For positive integers m, n, K m,n represents the complete bipartite graph. We name the graph G = K m,n ⊙ K2 as triangular extension of complete bipartite graph K m,n , since there is a triangle hanging from every vertex of K m,n . In this paper we show that G is graceful when m = n = 2ℓ, for any integer ℓ.
Utilizing Multi-Level Classification Techniques To Predict Adverse Drug Effects And Reactions,
2019
Butler University
Utilizing Multi-Level Classification Techniques To Predict Adverse Drug Effects And Reactions, Victoria Puhl
Undergraduate Honors Thesis Collection
Multi-class classification models are used to predict categorical response variables with more than two possible outcomes. A collection of multi-class classification techniques such as Multinomial Logistic Regression, Na\"{i}ve Bayes, and Support Vector Machine is used in predicting patients’ drug reactions and adverse drug effects based on patients’ demographic and drug administration. The newly released 2018 data on drug reactions and adverse drug effects from U.S. Food and Drug Administration are tested with the models. The applicability of model evaluation measures such as sensitivity, specificity and prediction accuracy in multi-class settings, are also discussed.
A Bayesian Nonparametric Multiple Testing Procedure For Comparing Several Treatments Against A Control,
2019
Pontificia Universidad Catolica de Chile
A Bayesian Nonparametric Multiple Testing Procedure For Comparing Several Treatments Against A Control, Luis Gutiérrez, Andrés Barrientos, Jorge González, Daniel Taylor-Rodríguez
Mathematics and Statistics Faculty Publications and Presentations
We propose a Bayesian nonparametric strategy to test for differences between a control group and several treatment regimes. Most of the existing tests for this type of comparison are based on the differences between location parameters. In contrast, our approach identifies differences across the entire distribution, avoids strong modeling assumptions over the distributions for each treatment, and accounts for multiple testing through the prior distribution on the space of hypotheses. The proposal is compared to other commonly used hypothesis testing procedures under simulated scenarios. Two real applications are also analyzed with the proposed methodology.
Local Lagged Adapted Generalized Method Of Moments: An Innovative Estimation And Forecasting Approach And Its Applications.,
2019
Marshall University
Local Lagged Adapted Generalized Method Of Moments: An Innovative Estimation And Forecasting Approach And Its Applications., Olusegun Michael Otunuga, Gandaram S. Ladde, Nathan G. Ladde
Mathematics Faculty Research
In this work, an attempt is made to apply the Local Lagged Adapted Generalized Method of Moments (LLGMM) to estimate state and parameters in stochastic differential dynamic models. The development of LLGMM is motivated by parameter and state estimation problems in continuous-time nonlinear and non-stationary stochastic dynamic model validation problems in biological, chemical, engineering, energy commodity markets, financial, medical, military, physical sciences and social sciences. The byproducts of this innovative approach (LLGMM) are the balance between model specification and model prescription of continuous-time dynamic process and the development of discrete-time interconnected dynamic model of local sample mean and variance statistic …
On The Existence Of Partitioned Incomplete Latin Squares With Five Parts,
2019
Marshall University
On The Existence Of Partitioned Incomplete Latin Squares With Five Parts, Jaromy Kuhl, Donald Mcginn, Michael W. Schroeder
Mathematics Faculty Research
Let a, b, c, d, e be positive integers such that a ≤ b ≤ c ≤ d ≤ e. Heinrich showed the existence of a partitioned incomplete Latin square (PILS) of type (a, b, c) and (a, b, c, d) if and only if a = b = c and 2a ≥ d. For PILS of type (a,b,c,d,e), it is necessary that a + b + c ≥ e, but not sufficient, and no characterization is currently known. In this talk we provide an additional …
Cronbach’S Alpha Under Insufficient Effort Responding: An Analytic Approach,
2019
Georgia Southern University
Cronbach’S Alpha Under Insufficient Effort Responding: An Analytic Approach, Stephen W. Carden, Trevor R. Camper, Nicholas S. Holtzman
Department of Psychology Faculty Publications
Surveys commonly suffer from insufficient effort responding (IER). If not accounted for, IER can cause biases and lead to false conclusions. In particular, Cronbach’s alpha has been empirically observed to either deflate or inflate due to IER. This paper will elucidate how IER impacts Cronbach’s alpha in a variety of situations. Previous results concerning internal consistency under mixture models are extended to obtain a characterization of Cronbach’s alpha in terms of item validities, average variances, and average covariances. The characterization is then applied to contaminating distributions representing various types of IER. The discussion will provide commentary on previous simulation-based investigations, …
Mean Value Theorems For Riemannian Manifolds Via The Obstacle Problem,
2019
University of Richmond
Mean Value Theorems For Riemannian Manifolds Via The Obstacle Problem, Brian Benson, Ivan Blank, Jeremy Lecrone
Department of Math & Statistics Faculty Publications
We develop some of the basic theory for the obstacle problem on Riemannian manifolds, and we use it to establish a mean value theorem. Our mean value theorem works for a very wide class of Riemannian manifolds and has no weights at all within the integral.
Perturbed Obstacle Problems In Lipschitz Domains: Linear Stability And Nondegeneracy In Measure,
2019
University of Richmond
Perturbed Obstacle Problems In Lipschitz Domains: Linear Stability And Nondegeneracy In Measure, Ivan Blank, Jeremy Lecrone
Department of Math & Statistics Faculty Publications
We consider the classical obstacle problem on bounded, connected Lipschitz domains D⊂Rn. We derive quantitative bounds on the changes to contact sets under general perturbations to both the right-hand side and the boundary data for obstacle problems. In particular, we show that the Lebesgue measure of the symmetric difference between two contact sets is linearly comparable to the L1-norm of perturbations in the data.
Hadwiger Numbers And Gallai-Ramsey Numbers Of Special Graphs,
2019
University of Central Florida
Hadwiger Numbers And Gallai-Ramsey Numbers Of Special Graphs, Christian Bosse
Electronic Theses and Dissertations
This dissertation explores two separate topics on graphs. We first study a far-reaching generalization of the Four Color Theorem. Given a graph G, we use chi(G) to denote the chromatic number; alpha(G) the independence number; and h(G) the Hadwiger number, which is the largest integer t such that the complete graph K_t can be obtained from a subgraph of G by contracting edges. Hadwiger's conjecture from 1943 states that for every graph G, h(G) is greater than or equal to chi(G). This is perhaps the most famous conjecture in Graph Theory and remains open even for graphs G with alpha(G) …
Two Ramsey-Related Problems,
2019
University of Central Florida
Two Ramsey-Related Problems, Jingmei Zhang
Electronic Theses and Dissertations
Extremal combinatorics is one of the central branches of discrete mathematics and has experienced an impressive growth during the last few decades. It deals with the problem of determining or estimating the maximum or minimum possible size of a combinatorial structure which satisfies certain requirements. In this dissertation, we focus on studying the minimum number of edges of certain co-critical graphs. Given an integer r ≥ 1 and graphs G; H1; : : : ;Hr, we write → G (H1; : : : ;Hr) if every r-coloring of the edges of G contains a monochromatic copy of Hi in color …
Estimation And Clustering In Statistical Ill-Posed Linear Inverse Problems,
2019
University of Central Florida
Estimation And Clustering In Statistical Ill-Posed Linear Inverse Problems, Rasika Rajapakshage
Electronic Theses and Dissertations
The main focus of the dissertation is estimation and clustering in statistical ill-posed linear inverse problems. The dissertation deals with a problem of simultaneously estimating a collection of solutions of ill-posed linear inverse problems from their noisy images under an operator that does not have a bounded inverse, when the solutions are related in a certain way. The dissertation defense consists of three parts. In the first part, the collection consists of measurements of temporal functions at various spatial locations. In particular, we study the problem of estimating a three-dimensional function based on observations of its noisy Laplace convolution. In …
Spatial Models With Specific Error Structures,
2019
University of Central Florida
Spatial Models With Specific Error Structures, Nathaniel Adu
Electronic Theses and Dissertations
The purpose of this dissertation is to study the first order autoregressive model in the spatial context with specific error structures. We begin by supposing that the error structure has a long memory in both the i and the j components. Whenever the model parameters alpha and beta equal one, the limiting distribution of the sequence of normalized Fourier coefficients of the spatial process is shown to be a function of a two parameter fractional Brownian sheet. This result is used to find the limiting distribution of the periodogram ordinate of the spatial process under the null hypothesis that alpha …
Modeling Stochastically Intransitive Relationships In Paired Comparison Data,
2019
Southern Methodist University
Modeling Stochastically Intransitive Relationships In Paired Comparison Data, Ryan Patrick Alexander Mcshane
Statistical Science Theses and Dissertations
If the Warriors beat the Rockets and the Rockets beat the Spurs, does that mean that the Warriors are better than the Spurs? Sophisticated fans would argue that the Warriors are better by the transitive property, but could Spurs fans make a legitimate argument that their team is better despite this chain of evidence?
We first explore the nature of intransitive (rock-scissors-paper) relationships with a graph theoretic approach to the method of paired comparisons framework popularized by Kendall and Smith (1940). Then, we focus on the setting where all pairs of items, teams, players, or objects have been compared to …
