This collection includes both ASU Theses and Dissertations, submitted by graduate students, and the Barrett, Honors College theses submitted by undergraduate students. 

Displaying 1 - 10 of 140
149754-Thumbnail Image.png
Description
A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. Compared to the front-end process that is dominated by re-entrant product flows, the back-end process is linear and therefore more suitable for scheduling. However, the production scheduling of the back-end process

A good production schedule in a semiconductor back-end facility is critical for the on time delivery of customer orders. Compared to the front-end process that is dominated by re-entrant product flows, the back-end process is linear and therefore more suitable for scheduling. However, the production scheduling of the back-end process is still very difficult due to the wide product mix, large number of parallel machines, product family related setups, machine-product qualification, and weekly demand consisting of thousands of lots. In this research, a novel mixed-integer-linear-programming (MILP) model is proposed for the batch production scheduling of a semiconductor back-end facility. In the MILP formulation, the manufacturing process is modeled as a flexible flow line with bottleneck stages, unrelated parallel machines, product family related sequence-independent setups, and product-machine qualification considerations. However, this MILP formulation is difficult to solve for real size problem instances. In a semiconductor back-end facility, production scheduling usually needs to be done every day while considering updated demand forecast for a medium term planning horizon. Due to the limitation on the solvable size of the MILP model, a deterministic scheduling system (DSS), consisting of an optimizer and a scheduler, is proposed to provide sub-optimal solutions in a short time for real size problem instances. The optimizer generates a tentative production plan. Then the scheduler sequences each lot on each individual machine according to the tentative production plan and scheduling rules. Customized factory rules and additional resource constraints are included in the DSS, such as preventive maintenance schedule, setup crew availability, and carrier limitations. Small problem instances are randomly generated to compare the performances of the MILP model and the deterministic scheduling system. Then experimental design is applied to understand the behavior of the DSS and identify the best configuration of the DSS under different demand scenarios. Product-machine qualification decisions have long-term and significant impact on production scheduling. A robust product-machine qualification matrix is critical for meeting demand when demand quantity or mix varies. In the second part of this research, a stochastic mixed integer programming model is proposed to balance the tradeoff between current machine qualification costs and future backorder costs with uncertain demand. The L-shaped method and acceleration techniques are proposed to solve the stochastic model. Computational results are provided to compare the performance of different solution methods.
ContributorsFu, Mengying (Author) / Askin, Ronald G. (Thesis advisor) / Zhang, Muhong (Thesis advisor) / Fowler, John W (Committee member) / Pan, Rong (Committee member) / Sen, Arunabha (Committee member) / Arizona State University (Publisher)
Created2011
149723-Thumbnail Image.png
Description
This dissertation transforms a set of system complexity reduction problems to feature selection problems. Three systems are considered: classification based on association rules, network structure learning, and time series classification. Furthermore, two variable importance measures are proposed to reduce the feature selection bias in tree models. Associative classifiers can achieve

This dissertation transforms a set of system complexity reduction problems to feature selection problems. Three systems are considered: classification based on association rules, network structure learning, and time series classification. Furthermore, two variable importance measures are proposed to reduce the feature selection bias in tree models. Associative classifiers can achieve high accuracy, but the combination of many rules is difficult to interpret. Rule condition subset selection (RCSS) methods for associative classification are considered. RCSS aims to prune the rule conditions into a subset via feature selection. The subset then can be summarized into rule-based classifiers. Experiments show that classifiers after RCSS can substantially improve the classification interpretability without loss of accuracy. An ensemble feature selection method is proposed to learn Markov blankets for either discrete or continuous networks (without linear, Gaussian assumptions). The method is compared to a Bayesian local structure learning algorithm and to alternative feature selection methods in the causal structure learning problem. Feature selection is also used to enhance the interpretability of time series classification. Existing time series classification algorithms (such as nearest-neighbor with dynamic time warping measures) are accurate but difficult to interpret. This research leverages the time-ordering of the data to extract features, and generates an effective and efficient classifier referred to as a time series forest (TSF). The computational complexity of TSF is only linear in the length of time series, and interpretable features can be extracted. These features can be further reduced, and summarized for even better interpretability. Lastly, two variable importance measures are proposed to reduce the feature selection bias in tree-based ensemble models. It is well known that bias can occur when predictor attributes have different numbers of values. Two methods are proposed to solve the bias problem. One uses an out-of-bag sampling method called OOBForest, and the other, based on the new concept of a partial permutation test, is called a pForest. Experimental results show the existing methods are not always reliable for multi-valued predictors, while the proposed methods have advantages.
ContributorsDeng, Houtao (Author) / Runger, George C. (Thesis advisor) / Lohr, Sharon L (Committee member) / Pan, Rong (Committee member) / Zhang, Muhong (Committee member) / Arizona State University (Publisher)
Created2011
149658-Thumbnail Image.png
Description
Hydropower generation is one of the clean renewable energies which has received great attention in the power industry. Hydropower has been the leading source of renewable energy. It provides more than 86% of all electricity generated by renewable sources worldwide. Generally, the life span of a hydropower plant is considered

Hydropower generation is one of the clean renewable energies which has received great attention in the power industry. Hydropower has been the leading source of renewable energy. It provides more than 86% of all electricity generated by renewable sources worldwide. Generally, the life span of a hydropower plant is considered as 30 to 50 years. Power plants over 30 years old usually conduct a feasibility study of rehabilitation on their entire facilities including infrastructure. By age 35, the forced outage rate increases by 10 percentage points compared to the previous year. Much longer outages occur in power plants older than 20 years. Consequently, the forced outage rate increases exponentially due to these longer outages. Although these long forced outages are not frequent, their impact is immense. If reasonable timing of rehabilitation is missed, an abrupt long-term outage could occur and additional unnecessary repairs and inefficiencies would follow. On the contrary, too early replacement might cause the waste of revenue. The hydropower plants of Korea Water Resources Corporation (hereafter K-water) are utilized for this study. Twenty-four K-water generators comprise the population for quantifying the reliability of each equipment. A facility in a hydropower plant is a repairable system because most failures can be fixed without replacing the entire facility. The fault data of each power plant are collected, within which only forced outage faults are considered as raw data for reliability analyses. The mean cumulative repair functions (MCF) of each facility are determined with the failure data tables, using Nelson's graph method. The power law model, a popular model for a repairable system, can also be obtained to represent representative equipment and system availability. The criterion-based analysis of HydroAmp is used to provide more accurate reliability of each power plant. Two case studies are presented to enhance the understanding of the availability of each power plant and represent economic evaluations for modernization. Also, equipment in a hydropower plant is categorized into two groups based on their reliability for determining modernization timing and their suitable replacement periods are obtained using simulation.
ContributorsKwon, Ogeuk (Author) / Holbert, Keith E. (Thesis advisor) / Heydt, Gerald T (Committee member) / Pan, Rong (Committee member) / Arizona State University (Publisher)
Created2011
150207-Thumbnail Image.png
Description
Fibromyalgia (FM) is a chronic musculoskeletal disorder characterized by widespread pain, fatigue, and a variety of other comorbid physiological and psychological characteristics, including a deficit of positive affect. Recently, the focus of research on the pathophysiology of FM has considered the role of a number of genomic variants. In the

Fibromyalgia (FM) is a chronic musculoskeletal disorder characterized by widespread pain, fatigue, and a variety of other comorbid physiological and psychological characteristics, including a deficit of positive affect. Recently, the focus of research on the pathophysiology of FM has considered the role of a number of genomic variants. In the current manuscript, case-control analyses did not support the hypothesis that FM patients would differ from other chronic pain groups in catechol-O-methyltransferase (COMT) and mu-opioid receptor (OPRM1) genotype. However, evidence is provided in support of the hypothesis that functional single nucleotide polymorphisms on the COMT and OPRM1 genes would be associated with risk and resilience, respectively, in a dual processing model of pain-related positive affective regulation in FM. Forty-six female patients with a physician-confirmed diagnosis of FM completed an electronic diary that included once-daily assessments of positive affect and soft tissue pain. Multilevel modeling yielded a significant gene X environment interaction, such that individuals with met/met genotype on COMT experienced a greater decline in positive affect as daily pain increased than did either val/met or val/val individuals. A gene X environment interaction for OPRM1 also emerged, indicating that individuals with at least one asp allele were more resilient to elevations in daily pain than those homozygous for the asn allele. In sum, the findings offer researchers ample reason to further investigate the contribution of the catecholamine and opioid systems, and their associated genomic variants, to the still poorly understood experience of FM.
ContributorsFinan, Patrick Hamilton (Author) / Zautra, Alex (Thesis advisor) / Davis, Mary (Committee member) / Lemery-Chalfant, Kathryn (Committee member) / Presson, Clark (Committee member) / Arizona State University (Publisher)
Created2011
150265-Thumbnail Image.png
Description
I examined the role of children's or teacher's effortful control (EC) in children's academic functioning in early elementary school in two separate studies. In Study 1, I tested longitudinal relations between parents' reactions to children's displays of negative emotions in kindergarten, children's EC in first grade, and children's reading or

I examined the role of children's or teacher's effortful control (EC) in children's academic functioning in early elementary school in two separate studies. In Study 1, I tested longitudinal relations between parents' reactions to children's displays of negative emotions in kindergarten, children's EC in first grade, and children's reading or math achievement in second grade (N = 291). In the fall of each school year, parents reported their positive or negative reactions and parents and teachers reported on children's EC. Standardized achievement tests assessed achievement each spring. Results from autoregressive panel mediation models demonstrated that constructs exhibited consistency across study years. In addition, first-grade EC mediated relations between parents' reactions (i.e., a difference composite of positive minus negative reactions) at kindergarten and second-grade math, but not reading, achievement. Findings suggest that one method of promoting math achievement in early school is through the socialization of children's EC. In Study 2, I examined relations between teachers' EC, teachers' reactions to children's negative emotions, the student-teacher relationship (STR), and children's externalizing behaviors or achievement among 289 second-graders and their 116 teachers. Results from mixed-model regressions showed that negative reactions and teacher-reported STR mediated relations between teachers' EC and math achievement. In addition, teacher-reported STR mediated links between teachers' EC and externalizing problems across reporters and between teachers' EC and reading achievement. Tests of moderated mediation indicated that a high-quality STR was negatively associated with externalizing problems and high levels of teachers' negative reactions were negatively related to math achievement only for students low in EC. In tests of moderation by social competence, teachers' reports of high-quality STRs tended to be negatively associated with externalizing problems, but relations were strongest for students not high in social competence. For students low in social competence only, children's reports of a high-quality STR was related to lower reading achievement. These results highlight the utility of considering whether and how teachers' own intrinsic characteristics influence classroom dynamics and students' academic functioning outcomes.
ContributorsSwanson, Jodi Michelle (Author) / Valiente, Carlos (Thesis advisor) / Bradley, Robert H (Thesis advisor) / Kochenderfer-Ladd, Becky (Committee member) / Lemery-Chalfant, Kathryn (Committee member) / Arizona State University (Publisher)
Created2011
152332-Thumbnail Image.png
Description
Using data from an eight-year longitudinal study of 214 children's social and emotional development, I conducted three studies to (1) examine patterns of agreement for internalizing (INT) and externalizing (EXT) symptomatology among different informants (mothers, fathers, teachers, and adolescents) using a recently developed structural equation modeling approach for multi-trait, multi-method

Using data from an eight-year longitudinal study of 214 children's social and emotional development, I conducted three studies to (1) examine patterns of agreement for internalizing (INT) and externalizing (EXT) symptomatology among different informants (mothers, fathers, teachers, and adolescents) using a recently developed structural equation modeling approach for multi-trait, multi-method data; (2) examine the developmental trajectories for INT and EXT and predict individual differences in symptom development using temperament and parenting variables; and (3) describe patterns of INT and EXT co-occurrence and predict these patterns from temperament and parenting. In Study 1, longitudinal invariance was established for mothers', fathers' and teachers' reports over a six-year period. Sex, age, and SES did not substantially moderate agreement among informants, although both sex and age were differentially related to symptomatology depending on the informant. Agreement among teachers and mothers, but not among mothers and fathers, differed by domain of symptomatology, and was greater for EXT than for INT. In Study 2, latent profile analysis, a person-centered analytic approach, did not provide easily interpretable patterns of symptom development, a failure that is likely the result of the relatively modest sample size. Latent growth curve models, an alternative analytic approach, did provide good fit to the data. Temperament and parenting variables were examined as predictors of the latent growth parameters in these models. Although there was little prediction of the slope, effortful control was negatively related to overall levels of EXT, whereas impulsivity and anger were positively related. Mutually responsive orientation, a measure of the parent-child relationship, was a more consistent predictor of EXT than was parental warmth. Furthermore, the relation between mutually responsive orientation and EXT was partially mediated by inhibitory control. Across informants, there were few consistent predictors of INT. In Study 3, latent profile analysis was used to classify individuals into different patterns of INT and EXT co-occurrence. In these models, a similar class structure was identified for mothers and for teachers. When temperament and parenting were examined as predictors of co-occurring symptomatology, few significant interactions were found and results largely replicated prior findings from this data set using arbitrary symptom groups.
ContributorsSulik, Michael John (Author) / Eisenberg, Nancy (Thesis advisor) / Spinrad, Tracy L (Thesis advisor) / Lemery-Chalfant, Kathryn (Committee member) / Wolchik, Sharlene A (Committee member) / Arizona State University (Publisher)
Created2013
152198-Thumbnail Image.png
Description
The processing power and storage capacity of portable devices have improved considerably over the past decade. This has motivated the implementation of sophisticated audio and other signal processing algorithms on such mobile devices. Of particular interest in this thesis is audio/speech processing based on perceptual criteria. Specifically, estimation of parameters

The processing power and storage capacity of portable devices have improved considerably over the past decade. This has motivated the implementation of sophisticated audio and other signal processing algorithms on such mobile devices. Of particular interest in this thesis is audio/speech processing based on perceptual criteria. Specifically, estimation of parameters from human auditory models, such as auditory patterns and loudness, involves computationally intensive operations which can strain device resources. Hence, strategies for implementing computationally efficient human auditory models for loudness estimation have been studied in this thesis. Existing algorithms for reducing computations in auditory pattern and loudness estimation have been examined and improved algorithms have been proposed to overcome limitations of these methods. In addition, real-time applications such as perceptual loudness estimation and loudness equalization using auditory models have also been implemented. A software implementation of loudness estimation on iOS devices is also reported in this thesis. In addition to the loudness estimation algorithms and software, in this thesis project we also created new illustrations of speech and audio processing concepts for research and education. As a result, a new suite of speech/audio DSP functions was developed and integrated as part of the award-winning educational iOS App 'iJDSP." These functions are described in detail in this thesis. Several enhancements in the architecture of the application have also been introduced for providing the supporting framework for speech/audio processing. Frame-by-frame processing and visualization functionalities have been developed to facilitate speech/audio processing. In addition, facilities for easy sound recording, processing and audio rendering have also been developed to provide students, practitioners and researchers with an enriched DSP simulation tool. Simulations and assessments have been also developed for use in classes and training of practitioners and students.
ContributorsKalyanasundaram, Girish (Author) / Spanias, Andreas S (Thesis advisor) / Tepedelenlioğlu, Cihan (Committee member) / Berisha, Visar (Committee member) / Arizona State University (Publisher)
Created2013
151511-Thumbnail Image.png
Description
With the increase in computing power and availability of data, there has never been a greater need to understand data and make decisions from it. Traditional statistical techniques may not be adequate to handle the size of today's data or the complexities of the information hidden within the data. Thus

With the increase in computing power and availability of data, there has never been a greater need to understand data and make decisions from it. Traditional statistical techniques may not be adequate to handle the size of today's data or the complexities of the information hidden within the data. Thus knowledge discovery by machine learning techniques is necessary if we want to better understand information from data. In this dissertation, we explore the topics of asymmetric loss and asymmetric data in machine learning and propose new algorithms as solutions to some of the problems in these topics. We also studied variable selection of matched data sets and proposed a solution when there is non-linearity in the matched data. The research is divided into three parts. The first part addresses the problem of asymmetric loss. A proposed asymmetric support vector machine (aSVM) is used to predict specific classes with high accuracy. aSVM was shown to produce higher precision than a regular SVM. The second part addresses asymmetric data sets where variables are only predictive for a subset of the predictor classes. Asymmetric Random Forest (ARF) was proposed to detect these kinds of variables. The third part explores variable selection for matched data sets. Matched Random Forest (MRF) was proposed to find variables that are able to distinguish case and control without the restrictions that exists in linear models. MRF detects variables that are able to distinguish case and control even in the presence of interaction and qualitative variables.
ContributorsKoh, Derek (Author) / Runger, George C. (Thesis advisor) / Wu, Tong (Committee member) / Pan, Rong (Committee member) / Cesta, John (Committee member) / Arizona State University (Publisher)
Created2013
151341-Thumbnail Image.png
Description
With the rapid development of mobile sensing technologies like GPS, RFID, sensors in smartphones, etc., capturing position data in the form of trajectories has become easy. Moving object trajectory analysis is a growing area of interest these days owing to its applications in various domains such as marketing, security, traffic

With the rapid development of mobile sensing technologies like GPS, RFID, sensors in smartphones, etc., capturing position data in the form of trajectories has become easy. Moving object trajectory analysis is a growing area of interest these days owing to its applications in various domains such as marketing, security, traffic monitoring and management, etc. To better understand movement behaviors from the raw mobility data, this doctoral work provides analytic models for analyzing trajectory data. As a first contribution, a model is developed to detect changes in trajectories with time. If the taxis moving in a city are viewed as sensors that provide real time information of the traffic in the city, a change in these trajectories with time can reveal that the road network has changed. To detect changes, trajectories are modeled with a Hidden Markov Model (HMM). A modified training algorithm, for parameter estimation in HMM, called m-BaumWelch, is used to develop likelihood estimates under assumed changes and used to detect changes in trajectory data with time. Data from vehicles are used to test the method for change detection. Secondly, sequential pattern mining is used to develop a model to detect changes in frequent patterns occurring in trajectory data. The aim is to answer two questions: Are the frequent patterns still frequent in the new data? If they are frequent, has the time interval distribution in the pattern changed? Two different approaches are considered for change detection, frequency-based approach and distribution-based approach. The methods are illustrated with vehicle trajectory data. Finally, a model is developed for clustering and outlier detection in semantic trajectories. A challenge with clustering semantic trajectories is that both numeric and categorical attributes are present. Another problem to be addressed while clustering is that trajectories can be of different lengths and also have missing values. A tree-based ensemble is used to address these problems. The approach is extended to outlier detection in semantic trajectories.
ContributorsKondaveeti, Anirudh (Author) / Runger, George C. (Thesis advisor) / Mirchandani, Pitu (Committee member) / Pan, Rong (Committee member) / Maciejewski, Ross (Committee member) / Arizona State University (Publisher)
Created2012
152398-Thumbnail Image.png
Description
Identifying important variation patterns is a key step to identifying root causes of process variability. This gives rise to a number of challenges. First, the variation patterns might be non-linear in the measured variables, while the existing research literature has focused on linear relationships. Second, it is important to remove

Identifying important variation patterns is a key step to identifying root causes of process variability. This gives rise to a number of challenges. First, the variation patterns might be non-linear in the measured variables, while the existing research literature has focused on linear relationships. Second, it is important to remove noise from the dataset in order to visualize the true nature of the underlying patterns. Third, in addition to visualizing the pattern (preimage), it is also essential to understand the relevant features that define the process variation pattern. This dissertation considers these variation challenges. A base kernel principal component analysis (KPCA) algorithm transforms the measurements to a high-dimensional feature space where non-linear patterns in the original measurement can be handled through linear methods. However, the principal component subspace in feature space might not be well estimated (especially from noisy training data). An ensemble procedure is constructed where the final preimage is estimated as the average from bagged samples drawn from the original dataset to attenuate noise in kernel subspace estimation. This improves the robustness of any base KPCA algorithm. In a second method, successive iterations of denoising a convex combination of the training data and the corresponding denoised preimage are used to produce a more accurate estimate of the actual denoised preimage for noisy training data. The number of primary eigenvectors chosen in each iteration is also decreased at a constant rate. An efficient stopping rule criterion is used to reduce the number of iterations. A feature selection procedure for KPCA is constructed to find the set of relevant features from noisy training data. Data points are projected onto sparse random vectors. Pairs of such projections are then matched, and the differences in variation patterns within pairs are used to identify the relevant features. This approach provides robustness to irrelevant features by calculating the final variation pattern from an ensemble of feature subsets. Experiments are conducted using several simulated as well as real-life data sets. The proposed methods show significant improvement over the competitive methods.
ContributorsSahu, Anshuman (Author) / Runger, George C. (Thesis advisor) / Wu, Teresa (Committee member) / Pan, Rong (Committee member) / Maciejewski, Ross (Committee member) / Arizona State University (Publisher)
Created2013