Digital Commons Network^™

Convex Relaxations Of A Continuum Aggregation Model, And Their Efficient Numerical Solution, Mahdi Bandegi

Dissertations

In this dissertation, the global minimization of a large deviations rate function (the Helmholtz free energy functional) for the Boltzmann distribution is discussed. The Helmholtz functional arises in large systems of interacting particles — which are widely used as models in computational chemistry and molecular dynamics. Global minimizers of the rate function (Helmholtz functional) characterize the asymptotics of the partition function and thereby determine many important physical properties such as self-assembly, or phase transitions. Finding and verifying local minima to the Helmholtz free energy functional is relatively straightforward. However, finding and verifying global minima is much more difficult since the …

Dimension Reduction Techniques For High Dimensional And Ultra-High Dimensional Data, Subha Datta

Dissertations

This dissertation introduces two statistical techniques to tackle high-dimensional data, which is very commonplace nowadays. It consists of two topics which are inter-related by a common link, dimension reduction.

The first topic is a recently introduced classification technique, the weighted principal support vector machine (WPSVM), which is incorporated into a spatial point process framework. The WPSVM possesses an additional parameter, a weight parameter, besides the regularization parameter. Most statistical techniques, including WPSVM, have an inherent assumption of independence, which means the data points are not connected with each other in any manner. But spatial data violates this assumption. Correlation between …

Scalable Time-Stepping For Navier-Stokes Through High-Frequency Analysis Of Block Arnoldi Iteration, Brianna Bingham

Dissertations

Existing time-stepping methods for PDEs such as Navier-Stokes equations are not as efficient or scalable as they need to be for high-resolution simulation due to stiffness. The failure of existing time-stepping methods to adapt to changes in technology presents a dilemma that is becoming even more problematic over time. By rethinking approaches to time-stepping, dramatic gains in efficiency of simulation methods can be achieved. Krylov subspace spectral (KSS) methods have proven to be effective for solving time-dependent, variable-coefficient PDEs. The objective of this research is to continue the development of KSS methods to provide numerical solution methods that are far …

Variations In Ramsey Theory, Drake Olejniczak

Dissertations

The Ramsey number R(F,H) of two graphs F and H is the smallest positive integer n for which every red-blue coloring of the (edges of a) complete graph of order n results in a graph isomorphic to F all of whose edges are colored red (a red F) or a blue H. Beineke and Schwenk extended this concept to a bipartite version of Ramsey numbers, namely the bipartite Ramsey number BR(F,H) of two bipartite graphs F and H is the smallest positive integer rsuch that every red-blue coloring of the r-regular complete bipartite graph results in either …

The Role Of Sampling Variability In Developing K-8 Preservice Teachers’ Informal Inferential Reasoning, Omar Abu-Ghalyoun

Dissertations

Recent influential policy reports, such as the Common Core State Standards (CCSS-M, 2010) and Guidelines for Assessment and Instruction in Statistics Education Report, (GAISE, 2007), have called for dramatic changes in the statistics content included in the K-8 curriculum. In particular, students in these grades are now expected to develop Informal Inferential Reasoning (IIR) as a way of preparing them for formal concepts of inferential statistics such as confidence intervals and testing hypotheses. Ben-Zvi, Gil, & Apel, (2007) describe IIR as the cognitive activities involved in informally making statistical inferences. Over this path from informal to formal inference, many important …

Uniformly Connected Graphs, Nasreen Almohanna

Dissertations

Perhaps the most fundamental property that a graph can possess is that of being connected. Two vertices u and v of a graph G are connected if G contains a u-v path. The graph G itself is connected if every two vertices of G are connected. The well-studied concept of connectivity provides a measure on how strongly connected a graph may be. There are many other degrees of connectedness for a graph. A Hamiltonian path in a graph G is a path containing every vertex of G. Among the best-known classes of highly connected graph are the Hamiltonian-connected graphs, …