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.
Displaying 1 - 10 of 473
Filtering by
- All Subjects: Computer Engineering
- All Subjects: Mathematics
- All Subjects: public policy
Description
Reliable extraction of human pose features that are invariant to view angle and body shape changes is critical for advancing human movement analysis. In this dissertation, the multifactor analysis techniques, including the multilinear analysis and the multifactor Gaussian process methods, have been exploited to extract such invariant pose features from video data by decomposing various key contributing factors, such as pose, view angle, and body shape, in the generation of the image observations. Experimental results have shown that the resulting pose features extracted using the proposed methods exhibit excellent invariance properties to changes in view angles and body shapes. Furthermore, using the proposed invariant multifactor pose features, a suite of simple while effective algorithms have been developed to solve the movement recognition and pose estimation problems. Using these proposed algorithms, excellent human movement analysis results have been obtained, and most of them are superior to those obtained from state-of-the-art algorithms on the same testing datasets. Moreover, a number of key movement analysis challenges, including robust online gesture spotting and multi-camera gesture recognition, have also been addressed in this research. To this end, an online gesture spotting framework has been developed to automatically detect and learn non-gesture movement patterns to improve gesture localization and recognition from continuous data streams using a hidden Markov network. In addition, the optimal data fusion scheme has been investigated for multicamera gesture recognition, and the decision-level camera fusion scheme using the product rule has been found to be optimal for gesture recognition using multiple uncalibrated cameras. Furthermore, the challenge of optimal camera selection in multi-camera gesture recognition has also been tackled. A measure to quantify the complementary strength across cameras has been proposed. Experimental results obtained from a real-life gesture recognition dataset have shown that the optimal camera combinations identified according to the proposed complementary measure always lead to the best gesture recognition results.
ContributorsPeng, Bo (Author) / Qian, Gang (Thesis advisor) / Ye, Jieping (Committee member) / Li, Baoxin (Committee member) / Spanias, Andreas (Committee member) / Arizona State University (Publisher)
Created2011
Description
In a large network (graph) it would be desirable to guarantee the existence of some local property based only on global knowledge of the network. Consider the following classical example: how many connections are necessary to guarantee that the network contains three nodes which are pairwise adjacent? It turns out that more than n^2/4 connections are needed, and no smaller number will suffice in general. Problems of this type fall into the category of ``extremal graph theory.'' Generally speaking, extremal graph theory is the study of how global parameters of a graph are related to local properties. This dissertation deals with the relationship between minimum degree conditions of a host graph G and the property that G contains a specified spanning subgraph (or class of subgraphs). The goal is to find the optimal minimum degree which guarantees the existence of a desired spanning subgraph. This goal is achieved in four different settings, with the main tools being Szemeredi's Regularity Lemma; the Blow-up Lemma of Komlos, Sarkozy, and Szemeredi; and some basic probabilistic techniques.
ContributorsDeBiasio, Louis (Author) / Kierstead, Henry A (Thesis advisor) / Czygrinow, Andrzej (Thesis advisor) / Hurlbert, Glenn (Committee member) / Kadell, Kevin (Committee member) / Fishel, Susanna (Committee member) / Arizona State University (Publisher)
Created2011
Description
Nonlinear dispersive equations model nonlinear waves in a wide range of physical and mathematics contexts. They reinforce or dissipate effects of linear dispersion and nonlinear interactions, and thus, may be of a focusing or defocusing nature. The nonlinear Schrödinger equation or NLS is an example of such equations. It appears as a model in hydrodynamics, nonlinear optics, quantum condensates, heat pulses in solids and various other nonlinear instability phenomena. In mathematics, one of the interests is to look at the wave interaction: waves propagation with different speeds and/or different directions produces either small perturbations comparable with linear behavior, or creates solitary waves, or even leads to singular solutions. This dissertation studies the global behavior of finite energy solutions to the $d$-dimensional focusing NLS equation, $i partial _t u+Delta u+ |u|^{p-1}u=0, $ with initial data $u_0in H^1,; x in Rn$; the nonlinearity power $p$ and the dimension $d$ are chosen so that the scaling index $s=frac{d}{2}-frac{2}{p-1}$ is between 0 and 1, thus, the NLS is mass-supercritical $(s>0)$ and energy-subcritical $(s<1).$ For solutions with $ME[u_0]<1$ ($ME[u_0]$ stands for an invariant and conserved quantity in terms of the mass and energy of $u_0$), a sharp threshold for scattering and blowup is given. Namely, if the renormalized gradient $g_u$ of a solution $u$ to NLS is initially less than 1, i.e., $g_u(0)<1,$ then the solution exists globally in time and scatters in $H^1$ (approaches some linear Schr"odinger evolution as $ttopminfty$); if the renormalized gradient $g_u(0)>1,$ then the solution exhibits a blowup behavior, that is, either a finite time blowup occurs, or there is a divergence of $H^1$ norm in infinite time. This work generalizes the results for the 3d cubic NLS obtained in a series of papers by Holmer-Roudenko and Duyckaerts-Holmer-Roudenko with the key ingredients, the concentration compactness and localized variance, developed in the context of the energy-critical NLS and Nonlinear Wave equations by Kenig and Merle. One of the difficulties is fractional powers of nonlinearities which are overcome by considering Besov-Strichartz estimates and various fractional differentiation rules.
ContributorsGuevara, Cristi Darley (Author) / Roudenko, Svetlana (Thesis advisor) / Castillo_Chavez, Carlos (Committee member) / Jones, Donald (Committee member) / Mahalov, Alex (Committee member) / Suslov, Sergei (Committee member) / Arizona State University (Publisher)
Created2011
Description
More than 30% of college entrants are placed in remedial mathematics (RM). Given that an explicit relationship exists between students' high school mathematics and college success in science, technology, engineering, and mathematical (STEM) fields, it is important to understand RM students' characteristics in high school. Using the Education Longitudinal Survey 2002/2006 data, this study evaluated more than 130 variables for statistical and practical significance. The variables included standard demographic data, prior achievement and transcript data, family and teacher perceptions, school characteristics, and student attitudinal variables, all of which are identified as influential in mathematical success. These variables were analyzed using logistic regression models to estimate the likelihood that a student would be placed into RM. As might be expected, student test scores, highest mathematics course taken, and high school grade point average were the strongest predictors of success in college mathematics courses. Attitude variables had a marginal effect on the most advantaged students, but their effect cannot be evaluated for disadvantaged students, due to a non-random pattern of missing data. Further research should concentrate on obtaining answers to the attitudinal questions and investigating their influence and interaction with academic indicators.
ContributorsBarber, Rebecca (Author) / Garcia, David R. (Thesis advisor) / Powers, Jeanne (Committee member) / Rodrigue Mcintyre, Lisa (Committee member) / Arizona State University (Publisher)
Created2011
Description
The uncertainty of change inherent in issues such as climate change and regional growth has created a significant challenge for public decision makers trying to decide what adaptation actions are needed to respond to these possible changes. This challenge threatens the resiliency and thus the long term sustainability of our social-ecological systems. Using an empirical embedded case study approach to explore the application of advanced scenario analysis methods to regional growth visioning projects in two regions, this dissertation provides empirical evidence that for issues with high uncertainty, advanced scenario planning (ASP) methods are effective tools for helping decision makers to anticipate and prepare to adapt to change.
ContributorsQuay, Ray (Author) / Pijawka, David (Thesis advisor) / Shangraw, Ralph (Committee member) / Holway, James (Committee member) / Arizona State University (Publisher)
Created2011
Description
In this thesis, I investigate the C*-algebras and related constructions that arise from combinatorial structures such as directed graphs and their generalizations. I give a complete characterization of the C*-correspondences associated to directed graphs as well as results about obstructions to a similar characterization of these objects for generalizations of directed graphs. Viewing the higher-dimensional analogues of directed graphs through the lens of product systems, I give a rigorous proof that topological k-graphs are essentially product systems over N^k of topological graphs. I introduce a "compactly aligned" condition for such product systems of graphs and show that this coincides with the similarly-named conditions for topological k-graphs and for the associated product systems over N^k of C*-correspondences. Finally I consider the constructions arising from topological dynamical systems consisting of a locally compact Hausdorff space and k commuting local homeomorphisms. I show that in this case, the associated topological k-graph correspondence is isomorphic to the product system over N^k of C*-correspondences arising from a related Exel-Larsen system. Moreover, I show that the topological k-graph C*-algebra has a crossed product structure in the sense of Larsen.
ContributorsPatani, Nura (Author) / Kaliszewski, Steven (Thesis advisor) / Quigg, John (Thesis advisor) / Bremner, Andrew (Committee member) / Kawski, Matthias (Committee member) / Spielberg, John (Committee member) / Arizona State University (Publisher)
Created2011
Description
The theme for this work is the development of fast numerical algorithms for sparse optimization as well as their applications in medical imaging and source localization using sensor array processing. Due to the recently proposed theory of Compressive Sensing (CS), the $\ell_1$ minimization problem attracts more attention for its ability to exploit sparsity. Traditional interior point methods encounter difficulties in computation for solving the CS applications. In the first part of this work, a fast algorithm based on the augmented Lagrangian method for solving the large-scale TV-$\ell_1$ regularized inverse problem is proposed. Specifically, by taking advantage of the separable structure, the original problem can be approximated via the sum of a series of simple functions with closed form solutions. A preconditioner for solving the block Toeplitz with Toeplitz block (BTTB) linear system is proposed to accelerate the computation. An in-depth discussion on the rate of convergence and the optimal parameter selection criteria is given. Numerical experiments are used to test the performance and the robustness of the proposed algorithm to a wide range of parameter values. Applications of the algorithm in magnetic resonance (MR) imaging and a comparison with other existing methods are included. The second part of this work is the application of the TV-$\ell_1$ model in source localization using sensor arrays. The array output is reformulated into a sparse waveform via an over-complete basis and study the $\ell_p$-norm properties in detecting the sparsity. An algorithm is proposed for minimizing a non-convex problem. According to the results of numerical experiments, the proposed algorithm with the aid of the $\ell_p$-norm can resolve closely distributed sources with higher accuracy than other existing methods.
ContributorsShen, Wei (Author) / Mittlemann, Hans D (Thesis advisor) / Renaut, Rosemary A. (Committee member) / Jackiewicz, Zdzislaw (Committee member) / Gelb, Anne (Committee member) / Ringhofer, Christian (Committee member) / Arizona State University (Publisher)
Created2011
Description
By the von Neumann min-max theorem, a two person zero sum game with finitely many pure strategies has a unique value for each player (summing to zero) and each player has a non-empty set of optimal mixed strategies. If the payoffs are independent, identically distributed (iid) uniform (0,1) random variables, then with probability one, both players have unique optimal mixed strategies utilizing the same number of pure strategies with positive probability (Jonasson 2004). The pure strategies with positive probability in the unique optimal mixed strategies are called saddle squares. In 1957, Goldman evaluated the probability of a saddle point (a 1 by 1 saddle square), which was rediscovered by many authors including Thorp (1979). Thorp gave two proofs of the probability of a saddle point, one using combinatorics and one using a beta integral. In 1965, Falk and Thrall investigated the integrals required for the probabilities of a 2 by 2 saddle square for 2 × n and m × 2 games with iid uniform (0,1) payoffs, but they were not able to evaluate the integrals. This dissertation generalizes Thorp's beta integral proof of Goldman's probability of a saddle point, establishing an integral formula for the probability that a m × n game with iid uniform (0,1) payoffs has a k by k saddle square (k ≤ m,n). Additionally, the probabilities of a 2 by 2 and a 3 by 3 saddle square for a 3 × 3 game with iid uniform(0,1) payoffs are found. For these, the 14 integrals observed by Falk and Thrall are dissected into 38 disjoint domains, and the integrals are evaluated using the basic properties of the dilogarithm function. The final results for the probabilities of a 2 by 2 and a 3 by 3 saddle square in a 3 × 3 game are linear combinations of 1, π2, and ln(2) with rational coefficients.
ContributorsManley, Michael (Author) / Kadell, Kevin W. J. (Thesis advisor) / Kao, Ming-Hung (Committee member) / Lanchier, Nicolas (Committee member) / Lohr, Sharon (Committee member) / Reiser, Mark R. (Committee member) / Arizona State University (Publisher)
Created2011
Description
This study contributes to the ongoing discussion of Mathematical Knowledge for Teaching (MKT). It investigates the case of Rico, a high school mathematics teacher who had become known to his colleagues and his students as a superbly effective mathematics teacher. His students not only developed excellent mathematical skills, they also developed deep understanding of the mathematics they learned. Moreover, Rico redesigned his curricula and instruction completely so that they provided a means of support for his students to learn mathematics the way he intended. The purpose of this study was to understand the sources of Rico's effectiveness. The data for this study was generated in three phases. Phase I included videos of Rico's lessons during one semester of an Algebra II course, post-lesson reflections, and Rico's self-constructed instructional materials. An analysis of Phase I data led to Phase II, which consisted of eight extensive stimulated-reflection interviews with Rico. Phase III consisted of a conceptual analysis of the prior phases with the aim of creating models of Rico's mathematical conceptions, his conceptions of his students' mathematical understandings, and his images of instruction and instructional design. Findings revealed that Rico had developed profound personal understandings, grounded in quantitative reasoning, of the mathematics that he taught, and profound pedagogical understandings that supported these very same ways of thinking in his students. Rico's redesign was driven by three factors: (1) the particular way in which Rico himself understood the mathematics he taught, (2) his reflective awareness of those ways of thinking, and (3) his ability to envision what students might learn from different instructional approaches. Rico always considered what someone might already need to understand in order to understand "this" in the way he was thinking of it, and how understanding "this" might help students understand related ideas or methods. Rico's continual reflection on the mathematics he knew so as to make it more coherent, and his continual orientation to imagining how these meanings might work for students' learning, made Rico's mathematics become a mathematics of students--impacting how he assessed his practice and engaging him in a continual process of developing MKT.
ContributorsLage Ramírez, Ana Elisa (Author) / Thompson, Patrick W. (Thesis advisor) / Carlson, Marilyn P. (Committee member) / Castillo-Chavez, Carlos (Committee member) / Saldanha, Luis (Committee member) / Middleton, James A. (Committee member) / Arizona State University (Publisher)
Created2011
Description
The purpose of this study was to examine the impact of individualized afterschool tutoring, under federal Supplemental Educational Services (SES), on mathematical and general academic intrinsic motivation and mathematical achievement of at-risk students. The population of this study consisted of two third graders and five fourth graders from an elementary school in the Reynolds School District in Portland, Oregon. One participant was male. The other six were female. Six of the students were Hispanic, and one student was multiethnic. Students' parents enrolled their children in free afterschool tutoring with Mobile Minds Tutoring, an SES provider in the state of Oregon. The participants were given pre- and post-assessments to measure their intrinsic motivation and achievement. The third graders took the Young Children's Academic Intrinsic Motivation Inventory (Y-CAIMI) and the fourth graders took the Children's Academic Intrinsic Motivation Inventory (CAIMI). All students took the Group Mathematics Assessment and Diagnostic Evaluation (GMADE) according to their grade level. The findings from this study are consistent with the literature review, in that individualized tutoring can help increase student motivation and achievement. Six out of the seven students who participated in this study showed an increase in mathematical achievement, and four out of the seven showed an increase in intrinsic motivation.
ContributorsBallou, Cherise (Author) / Middleton, James (Thesis advisor) / Kinach, Barbara (Committee member) / Bitter, Gary (Committee member) / Arizona State University (Publisher)
Created2011