Matching Items (544)
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 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
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 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
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 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
Description
Like individual organisms, complex social groups are able to maintain predictable trajectories of growth, from initial colony foundation to mature reproductively capable units. They do so while simultaneously responding flexibly to variation in nutrient availability and intake. Leafcutter ant colonies function as tri-trophic systems, in which the ants harvest vegetation to grow a fungus that, in turn, serves as food for the colony. Fungal growth rates and colony worker production are interdependent, regulated by nutritional and behavioral feedbacks. Fungal growth and quality are directly affected by worker foraging decisions, while worker production is, in turn, dependent on the amount and condition of the fungus. In this dissertation, I first characterized the growth relationship between the workers and the fungus of the desert leafcutter ant Acromyrmex versicolor during early stages of colony development, from colony foundation by groups of queens through the beginnings of exponential growth. I found that this relationship undergoes a period of slow growth and instability when workers first emerge, and then becomes allometrically positive. I then evaluated how mass and element ratios of resources collected by the ants are translated into fungus and worker population growth, and refuse, finding that colony digestive efficiency is comparable to digestive efficiencies of other herbivorous insects and ruminants. To test how colonies behaviorally respond to perturbations of the fungus garden, I quantified activity levels and task performance of workers in colonies with either supplemented or diminished fungus gardens, and found that colonies adjusted activity and task allocation in response to the fungus garden size. Finally, to identify possible forms of nutrient limitation, I measured how colony performance was affected by changes in the relative amounts of carbohydrates, protein, and phosphorus available in the resources used to grow the fungus garden. From this experiment, I concluded that colony growth is primarily carbohydrate-limited.
ContributorsClark, Rebecca, 1981- (Author) / Fewell, Jennifer H (Thesis advisor) / Mueller, Ulrich (Committee member) / Liebig, Juergen (Committee member) / Elser, James (Committee member) / Harrison, Jon (Committee member) / Arizona State University (Publisher)
Created2011
Description
The repression of reproductive competition and the enforcement of altruism are key components to the success of animal societies. Eusocial insects are defined by having a reproductive division of labor, in which reproduction is relegated to one or few individuals while the rest of the group members maintain the colony and help raise offspring. However, workers have retained the ability to reproduce in most insect societies. In the social Hymenoptera, due to haplodiploidy, workers can lay unfertilized male destined eggs without mating. Potential conflict between workers and queens can arise over male production, and policing behaviors performed by nestmate workers and queens are a means of repressing worker reproduction. This work describes the means and results of the regulation of worker reproduction in the ant species Aphaenogaster cockerelli. Through manipulative laboratory studies on mature colonies, the lack of egg policing and the presence of physical policing by both workers and queens of this species are described. Through chemical analysis and artificial chemical treatments, the role of cuticular hydrocarbons as indicators of fertility status and the informational basis of policing in this species is demonstrated. An additional queen-specific chemical signal in the Dufour's gland is discovered to be used to direct nestmate aggression towards reproductive competitors. Finally, the level of actual worker-derived males in field colonies is measured. Together, these studies demonstrate the effectiveness of policing behaviors on the suppression of worker reproduction in a social insect species, and provide an example of how punishment and the threat of punishment is a powerful force in maintaining cooperative societies.
ContributorsSmith, Adrian A. (Author) / Liebig, Juergen (Thesis advisor) / Hoelldobler, Bert (Thesis advisor) / Gadau, Juergen (Committee member) / Johnson, Robert A. (Committee member) / Pratt, Stephen (Committee member) / Arizona State University (Publisher)
Created2011
Description
Nowadays product reliability becomes the top concern of the manufacturers and customers always prefer the products with good performances under long period. In order to estimate the lifetime of the product, accelerated life testing (ALT) is introduced because most of the products can last years even decades. Much research has been done in the ALT area and optimal design for ALT is a major topic. This dissertation consists of three main studies. First, a methodology of finding optimal design for ALT with right censoring and interval censoring have been developed and it employs the proportional hazard (PH) model and generalized linear model (GLM) to simplify the computational process. A sensitivity study is also given to show the effects brought by parameters to the designs. Second, an extended version of I-optimal design for ALT is discussed and then a dual-objective design criterion is defined and showed with several examples. Also in order to evaluate different candidate designs, several graphical tools are developed. Finally, when there are more than one models available, different model checking designs are discussed.
ContributorsYang, Tao (Author) / Pan, Rong (Thesis advisor) / Montgomery, Douglas C. (Committee member) / Borror, Connie (Committee member) / Rigdon, Steve (Committee member) / Arizona State University (Publisher)
Created2013
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 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
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 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
Description
Of all the signals and cues that orchestrate the activities of a social insect colony, the reproductives' fertility pheromones are perhaps the most fundamental. These pheromones regulate reproductive division of labor, a defining characteristic of eusociality. Despite their critical role, reproductive fertility pheromones are not evenly expressed across the development of a social insect colony and may even be absent in the earliest colony stages. In the ant Camponotus floridanus, queens of incipient colonies do not produce the cuticular hydrocarbons that serve as fertility and egg-marking signals in this species. My dissertation investigates the consequences of the dramatic change in the quantity of these pheromones that occurs as the colony grows. C. floridanus workers from large, established colonies use egg surface hydrocarbons to discriminate among eggs. Eggs with surface hydrocarbons typical of eggs laid by established queens are nurtured, whereas eggs lacking these signals (i.e., eggs laid by workers and incipient queens) are destroyed. I characterized how workers from incipient colonies responded to eggs lacking queen fertility hydrocarbons. I found that established-queen-laid eggs, incipient-queen-laid eggs, and worker-laid eggs were not destroyed by workers at this colony stage. Destruction of worker-laid eggs is a form of policing, and theoretical models predict that policing should be strongest in incipient colonies. Since there was no evidence of policing by egg-eating in incipient C. floridanus colonies, I searched for evidence of another policing mechanism at this colony stage. Finding none, I discuss reasons why policing behavior may not be expressed in incipient colonies. I then considered the mechanism that accounts for the change in workers' response to eggs. By manipulating ants' egg experience and testing their egg-policing decisions, I found that ants use a combination of learned and innate criteria to discriminate between targets of care and destruction. Finally, I investigated how the increasing strength of queen-fertility hydrocarbons affects nestmate recognition, which also relies on cuticular hydrocarbons. I found that queens with strong fertility hydrocarbons can be transferred between established colonies without aggression, but they cannot be introduced into incipient colonies. Queens from incipient colonies cannot be transferred into incipient or established colonies.
ContributorsMoore, Dani (Author) / Liebig, Juergen (Thesis advisor) / Gadau, Juergen (Committee member) / Pratt, Stephen (Committee member) / Smith, Brian (Committee member) / Rutowski, Ronald (Committee member) / Arizona State University (Publisher)
Created2012
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 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