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 264
Filtering by
- All Subjects: Mathematics
- All Subjects: Economics
Description
The objective of this dissertation is to empirically analyze the results of the retail location decision making process and how chain networks evolve given their value platform. It employs one of the largest cross-sectional databases of retailers ever assembled, including 50 US retail chains and over 70,000 store locations. Three closely related articles, which develop new theory explaining location deployment and behaviors of retailers, are presented. The first article, "Regionalism in US Retailing," presents a comprehensive spatial analysis of the domestic patterns of retailers. Geographic Information Systems (GIS) and statistics examine the degree to which the chains are deployed regionally versus nationally. Regional bias is found to be associated with store counts, small market deployment, and the location of the founding store, but not the age of the chain. Chains that started in smaller markets deploy more stores in other small markets and vice versa for chains that started in larger markets. The second article, "The Location Types of US Retailers," is an inductive analysis of the types of locations chosen by the retailers. Retail locations are classified into types using cluster analysis on situational and trade area data at the geographical scale of the individual stores. A total of twelve distinct location types were identified. A second cluster analysis groups together the chains with the most similar location profiles. Retailers within the same retail business often chose similar types of locations and were placed in the same clusters. Retailers generally restrict their deployment to one of three overall strategies including metropolitan, large retail areas, or market size variety. The third article, "Modeling Retail Chain Expansion and Maturity through Wave Analysis: Theory and Application to Walmart and Target," presents a theory of retail chain expansion and maturity whereby retailers expand in waves with alternating periods of faster and slower growth. Walmart diffused gradually from Arkansas and Target grew from the coasts inward. They were similar, however, in that after expanding into an area they reached a point of saturation and opened fewer stores, then moved on to other areas, only to revisit the earlier areas for new stores.
ContributorsJoseph, Lawrence (Author) / Kuby, Michael (Thesis advisor) / Matthews, Richard (Committee member) / Ó Huallacháin, Breandán (Committee member) / Kumar, Ajith (Committee member) / Arizona State University (Publisher)
Created2013
Description
In this mixed-methods study, I examined the relationship between professional development based on the Common Core State Standards for Mathematics and teacher knowledge, classroom practice, and student learning. Participants were randomly assigned to experimental and control groups. The 50-hour professional development treatment was administered to the treatment group during one semester, and then a follow-up replication treatment was administered to the control group during the subsequent semester. Results revealed significant differences in teacher knowledge as a result of the treatment using two instruments. The Learning Mathematics for Teaching scales were used to detect changes in mathematical knowledge for teaching, and an online sorting task was used to detect changes in teachers' knowledge of their standards. Results also indicated differences in classroom practice between pairs of matched teachers selected to participate in classroom observations and interviews. No statistical difference was detected between the groups' student assessment scores using the district's benchmark assessment system. This efficacy study contributes to the literature in two ways. First, it provides an evidence base for a professional development model designed to promote effective implementation of the Common Core State Standards for Mathematics. Second, it addresses ways to impact and measure teachers' knowledge of curriculum in addition to their mathematical content knowledge. The treatment was designed to focus on knowledge of curriculum, but it also successfully impacted teachers' specialized content knowledge, knowledge of content and students, and knowledge of content and teaching.
ContributorsRimbey, Kimberly A (Author) / Middleton, James A. (Thesis advisor) / Sloane, Finbarr (Committee member) / Atkinson, Robert K (Committee member) / Arizona State University (Publisher)
Created2013
Description
A tiling is a collection of vertex disjoint subgraphs called tiles. If the tiles are all isomorphic to a graph $H$ then the tiling is an $H$-tiling. If a graph $G$ has an $H$-tiling which covers all of the vertices of $G$ then the $H$-tiling is a perfect $H$-tiling or an $H$-factor. A goal of this study is to extend theorems on sufficient minimum degree conditions for perfect tilings in graphs to directed graphs. Corrádi and Hajnal proved that every graph $G$ on $3k$ vertices with minimum degree $delta(G)ge2k$ has a $K_3$-factor, where $K_s$ is the complete graph on $s$ vertices. The following theorem extends this result to directed graphs: If $D$ is a directed graph on $3k$ vertices with minimum total degree $delta(D)ge4k-1$ then $D$ can be partitioned into $k$ parts each of size $3$ so that all of parts contain a transitive triangle and $k-1$ of the parts also contain a cyclic triangle. The total degree of a vertex $v$ is the sum of $d^-(v)$ the in-degree and $d^+(v)$ the out-degree of $v$. Note that both orientations of $C_3$ are considered: the transitive triangle and the cyclic triangle. The theorem is best possible in that there are digraphs that meet the minimum degree requirement but have no cyclic triangle factor. The possibility of added a connectivity requirement to ensure a cycle triangle factor is also explored. Hajnal and Szemerédi proved that if $G$ is a graph on $sk$ vertices and $delta(G)ge(s-1)k$ then $G$ contains a $K_s$-factor. As a possible extension of this celebrated theorem to directed graphs it is proved that if $D$ is a directed graph on $sk$ vertices with $delta(D)ge2(s-1)k-1$ then $D$ contains $k$ disjoint transitive tournaments on $s$ vertices. We also discuss tiling directed graph with other tournaments. This study also explores minimum total degree conditions for perfect directed cycle tilings and sufficient semi-degree conditions for a directed graph to contain an anti-directed Hamilton cycle. The semi-degree of a vertex $v$ is $min{d^+(v), d^-(v)}$ and an anti-directed Hamilton cycle is a spanning cycle in which no pair of consecutive edges form a directed path.
ContributorsMolla, Theodore (Author) / Kierstead, Henry A (Thesis advisor) / Czygrinow, Andrzej (Committee member) / Fishel, Susanna (Committee member) / Hurlbert, Glenn (Committee member) / Spielberg, Jack (Committee member) / Arizona State University (Publisher)
Created2013
Description
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 with a powerful connection between algebraic and analytic techniques; however, as of yet, this isomorphism is unestablished in general. I consider the existence and the properties of an exact sequence $$0\longrightarrow\ker{\longrightarrow}CG_m^i{\longrightarrow}IACG_m^i{\longrightarrow}\textrm{coker}\longrightarrow0.$$ In the case of a $\mathbb{Z}_p$-extension where the Main Conjecture is established, there exists a pseudo-isomorphism between the respective inverse limits of $CG_m^i$ and $IACG_m^i$. I consider conditions for when such a pseudo-isomorphism immediately gives the existence of the desired exact sequence, and I also consider work-around methods that preserve cardinality for otherwise. However, I primarily focus on constructing conditions to verify if a given $m$ is sufficiently large that the kernel and cokernel of the above exact sequence have become well-behaved, providing similarity of growth both in the size and in the structure of $CG_m^i$ and $IACG_m^i$; as well as conditions to determine if any such $m$ exists. The primary motivating idea is that if $IACG_m^i$ is relatively easy to work with, and if the relationship between $CG_m^i$ and $IACG_m^i$ is understood; then $CG_m^i$ becomes easier to work with. Moreover, while the motivating framework is stated concretely in terms of the cyclotomic $\mathbb{Z}_p$-extension of $p$-power roots of unity, all results are generally applicable to arbitrary $\mathbb{Z}_p$-extensions as they are developed in terms of Iwasawa-Theory-inspired, yet abstracted, algebraic results on maps between inverse limits.
ContributorsElledge, Shawn Michael (Author) / Childress, Nancy (Thesis advisor) / Bremner, Andrew (Committee member) / Fishel, Susanna (Committee member) / Jones, John (Committee member) / Paupert, Julien (Committee member) / Arizona State University (Publisher)
Created2013
Description
Schennach (2007) has shown that the Empirical Likelihood (EL) estimator may not be asymptotically normal when a misspecified model is estimated. This problem occurs because the empirical probabilities of individual observations are restricted to be positive. I find that even the EL estimator computed without the restriction can fail to be asymptotically normal for misspecified models if the sample moments weighted by unrestricted empirical probabilities do not have finite population moments. As a remedy for this problem, I propose a group of alternative estimators which I refer to as modified EL (MEL) estimators. For correctly specified models, these estimators have the same higher order asymptotic properties as the EL estimator. The MEL estimators are obtained by the Generalized Method of Moments (GMM) applied to an exactly identified model. The simulation results provide promising evidence for these estimators. In the second chapter, I introduce an alternative group of estimators to the Generalized Empirical Likelihood (GEL) family. The new group is constructed by employing demeaned moment functions in the objective function while using the original moment functions in the constraints. This designation modifies the higher-order properties of estimators. I refer to these new estimators as Demeaned Generalized Empirical Likelihood (DGEL) estimators. Although Newey and Smith (2004) show that the EL estimator in the GEL family has fewer sources of bias and is higher-order efficient after bias-correction, the demeaned exponential tilting (DET) estimator in the DGEL group has those superior properties. In addition, if data are symmetrically distributed, every estimator in the DGEL family shares the same higher-order properties as the best member.
ContributorsXiang, Jin (Author) / Ahn, Seung (Thesis advisor) / Wahal, Sunil (Thesis advisor) / Bharath, Sreedhar (Committee member) / Mehra, Rajnish (Committee member) / Tserlukevich, Yuri (Committee member) / Arizona State University (Publisher)
Created2013
Description
Researchers have postulated that math academic achievement increases student success in college (Lee, 2012; Silverman & Seidman, 2011; Vigdor, 2013), yet 80% of universities and 98% of community colleges require many of their first-year students to be placed in remedial courses (Bettinger & Long, 2009). Many high school graduates are entering college ill prepared for the rigors of higher education, lacking understanding of basic and important principles (ACT, 2012). The desire to increase academic achievement is a wide held aspiration in education and the idea of adapting instruction to individuals is one approach to accomplish this goal (Lalley & Gentile, 2009a). Frequently, adaptive learning environments rely on a mastery learning approach, it is thought that when students are afforded the opportunity to master the material, deeper and more meaningful learning is likely to occur. Researchers generally agree that the learning environment, the teaching approach, and the students' attributes are all important to understanding the conditions that promote academic achievement (Bandura, 1977; Bloom, 1968; Guskey, 2010; Cassen, Feinstein & Graham, 2008; Changeiywo, Wambugu & Wachanga, 2011; Lee, 2012; Schunk, 1991; Van Dinther, Dochy & Segers, 2011). The present study investigated the role of college students' affective attributes and skills, such as academic competence and academic resilience, in an adaptive mastery-based learning environment on their academic performance, while enrolled in a remedial mathematics course. The results showed that the combined influence of students' affective attributes and academic resilience had a statistically significant effect on students' academic performance. Further, the mastery-based learning environment also had a significant effect on their academic competence and academic performance.
ContributorsFoshee, Cecile Mary (Author) / Atkinson, Robert K (Thesis advisor) / Elliott, Stephen N. (Committee member) / Horan, John (Committee member) / Arizona State University (Publisher)
Created2013
Description
The lack of food safety in a grower's produce presents the grower with two risks; (1) that an item will need to be recalled from the market, incurring substantial costs and damaging brand equity and (2) that the entire market for the commodity becomes impaired as consumers associate all produce as being risky to eat. Nowhere is this more prevalent than in the leafy green industry, where recalls are relatively frequent and there has been one massive E. coli outbreak that rocked the industry in 2006. The purpose of this thesis is to examine insurance policies that protect growers from these risks. In doing this, a discussion of current recall insurance policies is presented. Further, actuarially fair premiums for catastrophic revenue insurance policies are priced through a contingent claims framework. The results suggest that spinach industry revenue can be insured for $0.02 per carton. Given the current costs of leafy green industry food safety initiatives, growers may be willing to pay for such an insurance policy.
ContributorsPagaran, Jeremy (Author) / Manfredo, Mark R. (Thesis advisor) / Richards, Timothy J. (Thesis advisor) / Nganje, William (Committee member) / Arizona State University (Publisher)
Created2013
Description
Research on combinatorics education is sparse when compared with other fields in mathematics education. This research attempted to contribute to the dearth of literature by examining students' reasoning about enumerative combinatorics problems and how students conceptualize the set of elements being counted in such problems, called the solution set. In particular, the focus was on the stable patterns of reasoning, known as ways of thinking, which students applied in a variety of combinatorial situations and tasks. This study catalogued students' ways of thinking about solution sets as they progressed through an instructional sequence. In addition, the relationships between the catalogued ways of thinking were explored. Further, the study investigated the challenges students experienced as they interacted with the tasks and instructional interventions, and how students' ways of thinking evolved as these challenges were overcome. Finally, it examined the role of instruction in guiding students to develop and extend their ways of thinking. Two pairs of undergraduate students with no formal experience with combinatorics participated in one of the two consecutive teaching experiments conducted in Spring 2012. Many ways of thinking emerged through the grounded theory analysis of the data, but only eight were identified as robust. These robust ways of thinking were classified into three categories: Subsets, Odometer, and Problem Posing. The Subsets category encompasses two ways of thinking, both of which ultimately involve envisioning the solution set as the union of subsets. The three ways of thinking in Odometer category involve holding an item or a set of items constant and systematically varying the other items involved in the counting process. The ways of thinking belonging to Problem Posing category involve spontaneously posing new, related combinatorics problems and finding relationships between the solution sets of the original and the new problem. The evolution of students' ways of thinking in the Problem Posing category was analyzed. This entailed examining the perturbation experienced by students and the resulting accommodation of their thinking. It was found that such perturbation and its resolution was often the result of an instructional intervention. Implications for teaching practice are discussed.
ContributorsHalani, Aviva (Author) / Roh, Kyeong Hah (Thesis advisor) / Fishel, Susanna (Committee member) / Saldanha, Luis (Committee member) / Thompson, Patrick (Committee member) / Zandieh, Michelle (Committee member) / Arizona State University (Publisher)
Created2013
Description
I show that firms' ability to adjust variable capital in response to productivity shocks has important implications for the interpretation of the widely documented investment-cash flow sensitivities. The variable capital adjustment is sufficient for firms to capture small variations in profitability, but when the revision in profitability is relatively large, limited substitutability between the factors of production may call for fixed capital investment. Hence, firms with lower substitutability are more likely to invest in both factors together and have larger sensitivities of fixed capital investment to cash flow. By building a frictionless capital markets model that allows firms to optimize over fixed capital and inventories as substitutable factors, I establish the significance of the substitutability channel in explaining cross-sectional differences in cash flow sensitivities. Moreover, incorporating variable capital into firms' investment decisions helps explain the sharp decrease in cash flow sensitivities over the past decades. Empirical evidence confirms the model's predictions.
ContributorsKim, Kirak (Author) / Bates, Thomas (Thesis advisor) / Babenko, Ilona (Thesis advisor) / Hertzel, Michael (Committee member) / Tserlukevich, Yuri (Committee member) / Arizona State University (Publisher)
Created2013
Description
Parallel Monte Carlo applications require the pseudorandom numbers used on each processor to be independent in a probabilistic sense. The TestU01 software package is the standard testing suite for detecting stream dependence and other properties that make certain pseudorandom generators ineffective in parallel (as well as serial) settings. TestU01 employs two basic schemes for testing parallel generated streams. The first applies serial tests to the individual streams and then tests the resulting P-values for uniformity. The second turns all the parallel generated streams into one long vector and then applies serial tests to the resulting concatenated stream. Various forms of stream dependence can be missed by each approach because neither one fully addresses the multivariate nature of the accumulated data when generators are run in parallel. This dissertation identifies these potential faults in the parallel testing methodologies of TestU01 and investigates two different methods to better detect inter-stream dependencies: correlation motivated multivariate tests and vector time series based tests. These methods have been implemented in an extension to TestU01 built in C++ and the unique aspects of this extension are discussed. A variety of different generation scenarios are then examined using the TestU01 suite in concert with the extension. This enhanced software package is found to better detect certain forms of inter-stream dependencies than the original TestU01 suites of tests.
ContributorsIsmay, Chester (Author) / Eubank, Randall (Thesis advisor) / Young, Dennis (Committee member) / Kao, Ming-Hung (Committee member) / Lanchier, Nicolas (Committee member) / Reiser, Mark R. (Committee member) / Arizona State University (Publisher)
Created2013