Skip to main content

ASU Electronic Theses and Dissertations


This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.

In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.

Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.


Subject
Date Range
2010 2019


Gray codes are perhaps the best known structures for listing sequences of combinatorial objects, such as binary strings. Simply defined as a minimal change listing, Gray codes vary greatly both in structure and in the types of objects that they list. More specific types of Gray codes are universal cycles and overlap sequences. Universal cycles are Gray codes on a set of strings of length n in which the first n-1 letters of one object are the same as the last n-1 letters of its predecessor in the listing. Overlap sequences allow this overlap to vary between 1 and n-1. ...

Contributors
Horan, Victoria E., Hurlbert, Glenn H, Czygrinow, Andrzej, et al.
Created Date
2012

Earth-system models describe the interacting components of the climate system and technological systems that affect society, such as communication infrastructures. Data assimilation addresses the challenge of state specification by incorporating system observations into the model estimates. In this research, a particular data assimilation technique called the Local Ensemble Transform Kalman Filter (LETKF) is applied to the ionosphere, which is a domain of practical interest due to its effects on infrastructures that depend on satellite communication and remote sensing. This dissertation consists of three main studies that propose strategies to improve space- weather specification during ionospheric extreme events, but are generally ...

Contributors
Durazo, Juan Alberto, Kostelich, Eric J., Mahalov, Alex, et al.
Created Date
2018

The need for improved mathematics education in many of America's schools that serve students from low income households has been extensively documented. This practical action research study, set in a suburban Title I school with a primarily Hispanic, non-native English speaking population, is designed to explore the effects of the progression through a set of problem solving solution strategies on the mathematics problem solving abilities of 2nd grade students. Students worked in class with partners to complete a Cognitively Guided Instruction-style (CGI) mathematics word problem using a dictated solution strategy five days a week for twelve weeks, three or four ...

Contributors
Spilde, Amy, Zambo, Ronald, Heck, Thomas, et al.
Created Date
2013

Described is a study investigating the feasibility and predictive value of the Teacher Feedback Coding System, a novel observational measure of teachers’ feedback provided to students in third grade classrooms. This measure assessed individual feedback events across three domains: feedback type, level of specificity and affect of the teacher. Exploratory and confirmatory factor analysis revealed five factors indicating separate types of feedback: positive and negative academic-informative feedback, positive and negative behavioral-informative feedback, and an overall factor representing supportive feedback. Multilevel models revealed direct relations between teachers’ negative academic-informative feedback and students’ spring math achievement, as well as between teachers’ negative ...

Contributors
McLean, Leigh, Connor, Carol M., Lemery, Kathryn, et al.
Created Date
2015

Borda's social choice method and Condorcet's social choice method are shown to satisfy different monotonicities and it is shown that it is impossible for any social choice method to satisfy them both. Results of a Monte Carlo simulation are presented which estimate the probability of each of the following social choice methods being manipulable: plurality (first past the post), Borda count, instant runoff, Kemeny-Young, Schulze, and majority Borda. The Kemeny-Young and Schulze methods exhibit the strongest resistance to random manipulability. Two variations of the majority judgment method, with different tie-breaking rules, are compared for continuity. A new variation is proposed ...

Contributors
Jennings, Andrew Blake, Hurlbert, Glenn, Barcelo, Helene, et al.
Created Date
2010

Controlled release formulations for local, in vivo drug delivery are of growing interest to device manufacturers, research scientists, and clinicians; however, most research characterizing controlled release formulations occurs in vitro because the spatial and temporal distribution of drug delivery is difficult to measure in vivo. In this work, in vivo magnetic resonance imaging (MRI) of local drug delivery is performed to visualize and quantify the time resolved distribution of MRI contrast agents. I find it is possible to visualize contrast agent distributions in near real time from local delivery vehicles using MRI. Three dimensional T1 maps are processed to produce ...

Contributors
Giers, Morgan Boresi, Caplan, Michael R, Massia, Stephen P, et al.
Created Date
2013

The Tamari lattice T(n) was originally defined on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Since then it has been studied in various areas of mathematics including cluster algebras, discrete geometry, algebraic combinatorics, and Catalan theory. Although in several related lattices the number of maximal chains is known, the enumeration of these chains in Tamari lattices is still an open problem. This dissertation defines a partially-ordered set on equivalence classes of certain saturated chains of T(n) called the Tamari Block poset, TB(lambda). It further proves TB(lambda) is a ...

Contributors
Treat, Kevin, Fishel, Susanna, Czygrinow, Andrzej, et al.
Created Date
2016

This dissertation will cover two topics. For the first, let $K$ be a number field. A $K$-derived polynomial $f(x) \in K[x]$ is a polynomial that factors into linear factors over $K$, as do all of its derivatives. Such a polynomial is said to be {\it proper} if its roots are distinct. An unresolved question in the literature is whether or not there exists a proper $\Q$-derived polynomial of degree 4. Some examples are known of proper $K$-derived quartics for a quadratic number field $K$, although other than $\Q(\sqrt{3})$, these fields have quite large discriminant. (The second known field is $\Q(\sqrt{3441})$.) ...

Contributors
Carrillo, Benjamin, Jones, John, Bremner, Andrew, et al.
Created Date
2019

In 1959, Iwasawa proved that the size of the $p$-part of the class groups of a $\mathbb{Z}_p$-extension grows as a power of $p$ with exponent ${\mu}p^m+{\lambda}\,m+\nu$ for $m$ sufficiently large. Broadly, I construct conditions to verify if a given $m$ is indeed sufficiently large. More precisely, let $CG_m^i$ (class group) be the $\epsilon_i$-eigenspace component of the $p$-Sylow subgroup of the class group of the field at the $m$-th level in a $\mathbb{Z}_p$-extension; and let $IACG^i_m$ (Iwasawa analytic class group) be ${\mathbb{Z}_p[[T]]/((1+T)^{p^m}-1,f(T,\omega^{1-i}))}$, where $f$ is the associated Iwasawa power series. It is expected that $CG_m^i$ and $IACG^i_m$ be isomorphic, providing us ...

Contributors
Elledge, Shawn Michael, Childress, Nancy, Bremner, Andrew, et al.
Created Date
2013

Extremal graph theory results often provide minimum degree conditions which guarantee a copy of one graph exists within another. A perfect $F$-tiling of a graph $G$ is a collection $\mathcal{F}$ of subgraphs of $G$ such that every element of $\mathcal{F}$ is isomorphic to $F$ and such that every vertex in $G$ is in exactly one element of $\mathcal{F}$. Let $C^{3}_{t}$ denote the loose cycle on $t = 2s$ vertices, the $3$-uniform hypergraph obtained by replacing the edges $e = \{u, v\}$ of a graph cycle $C$ on $s$ vertices with edge triples $\{u, x_e, v\}$, where $x_e$ is uniquely assigned ...

Contributors
Oursler, Roy, Czygrinow, Andrzej, Kierstead, Hal A, et al.
Created Date
2019