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.
Nighttime visibility of pavement markings is provided by glass beads embedded into the striping surface. The glass beads take light from the vehicle headlamps and reflect it back to the driver. This phenomenon is known as retroreflection. Literature suggests that the amount of the bead embedded into the striping surface has a profound impact on the intensity of the retroreflected light. In order to gain insight into how the glass beads provide retroreflection, an experiment was carried out to produce paint stripes with glass beads and measure the retroreflection. Samples were created at various application rates and embedment depths, in an attempt to verify the optimal embedment and observe the effect of application rate on retroreflection. The experiment was conducted using large, airport quality beads and small, road quality beads. Image analysis was used to calculate the degree to which beads were embedded and in an attempt to quantify bead distribution on the stripe surface. The results from the large beads showed that retroreflection was maximized when the beads were embedded approximately seventy percent by bead volume. The results also showed that as the application rate increased, the retroreflection increased, up to a point and then decreased. A model was developed to estimate the retroreflectivity given the amount of beads, bead spacing, and distribution of bead embedment. Results from the small beads were less conclusive, but did demonstrate that the larger beads are better at providing retroreflection. Avenues for future work in this area were identified as the experiment was conducted.
The activity-based approach to travel demand analysis and modeling, which has been developed over the past 30 years, has received tremendous success in transportation planning and policy analysis issues, capturing the multi-way joint relationships among socio-demographic, economic, land use characteristics, activity participation, and travel behavior. The development of synthesizing population with an array of socio-demographic and socio-economic attributes has drawn remarkable attention due to privacy and cost constraints in collecting and disclosing full scale data. Although, there has been enormous progress in producing synthetic population, there has been less progress in the development of population evolution modeling arena to forecast future year population. The objective of this dissertation is to develop a well-structured full-fledged demographic evolution modeling system, capturing migration dynamics and evolution of person level attributes, introducing the concept of new household formations and apprehending the dynamics of household level long-term choices over time. A comprehensive study has been conducted on demography, sociology, anthropology, economics and transportation engineering area to better understand the dynamics of evolutionary activities over time and their impacts in travel behavior. This dissertation describes the methodology and the conceptual framework, and the development of model components. Demographic, socio-economic, and land use data from American Community Survey, National Household Travel Survey, Census PUMS, United States Time Series Economic Dynamic data and United States Center for Disease Control and Prevention have been used in this research. The entire modeling system has been implemented and coded using programming language to develop the population evolution module named `PopEvol' into a computer simulation environment. The module then has been demonstrated for a portion of Maricopa County area in Arizona to predict the milestone year population to check the accuracy of forecasting. The module has also been used to evolve the base year population for next 15 years and the evolutionary trend has been investigated.
This study investigates the mastic level structure of asphalt concrete containing RAP materials. Locally sourced RAP material was screened and sieved to separate the coated fines (passing #200) from the remaining sizes. These binder coated fines were mixed with virgin filler at proportions commensurate with 0%, 10%, 30%, 50% and 100% RAP dosage levels. Mastics were prepared with these blended fillers and a PG 64-22 binder at a filler content of 27% by volume. Rheological experiments were conducted on the resulting composites as well as the constituents, virgin binder, solvent extracted RAP binder. The results from the dynamic modulus experiments showed an expected increase in stiffness with increase in dosage levels. These results were used to model the hypothesized structure of the composite. The study presented discusses the different micromechanical models employed, their applicability and suitability to correctly predict the blended mastic composite. The percentage of blending between virgin and RAP binder estimated using Herve and Zaoui model decreased with increase in RAP content.
The first topic studied in this thesis is resource allocation in cloud networks. Cloud computing heralded an era where resources (such as computation and storage) can be scaled up and down elastically and on demand. This flexibility is attractive for its cost effectiveness: the cloud resource price depends on the actual utilization over time. This thesis studies two critical problems in cloud networks, focusing on the economical aspects of the resource allocation in the cloud/virtual networks, and proposes six algorithms to address the resource allocation problems for different discount models. The first problem attends a scenario where the virtual network provider offers different contracts to the service provider. Four algorithms for resource contract migration are proposed under two pricing models: Pay-as-You-Come and Pay-as-You-Go. The second problem explores a scenario where a cloud provider offers k contracts each with a duration and a rate respectively and a customer buys these contracts in order to satisfy its resource demand. This work shows that this problem can be seen as a 2-dimensional generalization of the classic online parking permit problem, and present a k-competitive online algorithm and an optimal online algorithm.
The second topic studied in this thesis is to explore how resource allocation and purchasing strategies work in our daily life. For example, is it worth buying a Yoga pass which costs USD 100 for ten entries, although it will expire at the end of this year? Decisions like these are part of our daily life, yet, not much is known today about good online strategies to buy discount vouchers with expiration dates. This work hence introduces a Discount Voucher Purchase Problem (DVPP). It aims to optimize the strategies for buying discount vouchers, i.e., coupons, vouchers, groupons which are valid only during a certain time period. The DVPP comes in three flavors: (1) Once Expire Lose Everything (OELE): Vouchers lose their entire value after expiration. (2) Once Expire Lose Discount (OELD): Vouchers lose their discount value after expiration. (3) Limited Purchasing Window (LPW): Vouchers have the property of OELE and can only be bought during a certain time window.
This work explores online algorithms with a provable competitive ratio against a clairvoyant offline algorithm, even in the worst case. In particular, this work makes the following contributions: we present a 4-competitive algorithm for OELE, an 8-competitive algorithm for OELD, and a lower bound for LPW. We also present an optimal offline algorithm for OELE and LPW, and show it is a 2-approximation solution for OELD.
In this research, given a mixed set of senators/blogs debating on a set of political issues from opposing camps, I use signed bipartite graphs for modeling debates, and I propose an algorithm for partitioning both the opinion holders (senators or blogs) and the issues (bills or topics) comprising the debate into binary opposing camps. Simultaneously, my algorithm scales the entities on a univariate scale. Using this scale, a researcher can identify moderate and extreme senators/blogs within each camp, and polarizing versus unifying issues. Through performance evaluations I show that my proposed algorithm provides an effective solution to the problem, and performs much better than existing baseline algorithms adapted to solve this new problem. In my experiments, I used both real data from political blogosphere and US Congress records, as well as synthetic data which were obtained by varying polarization and degree distribution of the vertices of the graph to show the robustness of my algorithm.
I also applied my algorithm on all the terms of the US Senate to the date for longitudinal analysis and developed a web based interactive user interface www.PartisanScale.com to visualize the analysis.
US politics is most often polarized with respect to the left/right alignment of the entities. However, certain issues do not reflect the polarization due to political parties, but observe a split correlating to the demographics of the senators, or simply receive consensus. I propose a hierarchical clustering algorithm that identifies groups of bills that share the same polarization characteristics. I developed a web based interactive user interface www.ControversyAnalysis.com to visualize the clusters while providing a synopsis through distribution charts, word clouds, and heat maps.