Matching Items (475)
150301-Thumbnail Image.png
Description
This thesis focuses on the theoretical work done to determine thermodynamic properties of a chalcopyrite thin-film material for use as a photovoltaic material in a tandem device. The material of main focus here is ZnGeAs2, which was chosen for the relative abundance of constituents, favorable photovoltaic properties, and good lattice

This thesis focuses on the theoretical work done to determine thermodynamic properties of a chalcopyrite thin-film material for use as a photovoltaic material in a tandem device. The material of main focus here is ZnGeAs2, which was chosen for the relative abundance of constituents, favorable photovoltaic properties, and good lattice matching with ZnSnP2, the other component in this tandem device. This work is divided into two main chapters, which will cover: calculations and method to determine the formation energy and abundance of native point defects, and a model to calculate the vapor pressure over a ternary material from first-principles. The purpose of this work is to guide experimental work being done in tandem to synthesize ZnGeAs2 in thin-film form with high enough quality such that it can be used as a photovoltaic. Since properties of photovoltaic depend greatly on defect concentrations and film quality, a theoretical understanding of how laboratory conditions affect these properties is very valuable. The work done here is from first-principles and utilizes density functional theory using the local density approximation. Results from the native point defect study show that the zinc vacancy (VZn) and the germanium antisite (GeZn) are the more prominent defects; which most likely produce non-stoichiometric films. The vapor pressure model for a ternary system is validated using known vapor pressure for monatomic and binary test systems. With a valid ternary system vapor pressure model, results show there is a kinetic barrier to decomposition for ZnGeAs2.
ContributorsTucker, Jon R (Author) / Van Schilfgaarde, Mark (Thesis advisor) / Newman, Nathan (Committee member) / Adams, James (Committee member) / Arizona State University (Publisher)
Created2011
150111-Thumbnail Image.png
Description
Finding the optimal solution to a problem with an enormous search space can be challenging. Unless a combinatorial construction technique is found that also guarantees the optimality of the resulting solution, this could be an infeasible task. If such a technique is unavailable, different heuristic methods are generally used to

Finding the optimal solution to a problem with an enormous search space can be challenging. Unless a combinatorial construction technique is found that also guarantees the optimality of the resulting solution, this could be an infeasible task. If such a technique is unavailable, different heuristic methods are generally used to improve the upper bound on the size of the optimal solution. This dissertation presents an alternative method which can be used to improve a solution to a problem rather than construct a solution from scratch. Necessity analysis, which is the key to this approach, is the process of analyzing the necessity of each element in a solution. The post-optimization algorithm presented here utilizes the result of the necessity analysis to improve the quality of the solution by eliminating unnecessary objects from the solution. While this technique could potentially be applied to different domains, this dissertation focuses on k-restriction problems, where a solution to the problem can be presented as an array. A scalable post-optimization algorithm for covering arrays is described, which starts from a valid solution and performs necessity analysis to iteratively improve the quality of the solution. It is shown that not only can this technique improve upon the previously best known results, it can also be added as a refinement step to any construction technique and in most cases further improvements are expected. The post-optimization algorithm is then modified to accommodate every k-restriction problem; and this generic algorithm can be used as a starting point to create a reasonable sized solution for any such problem. This generic algorithm is then further refined for hash family problems, by adding a conflict graph analysis to the necessity analysis phase. By recoloring the conflict graphs a new degree of flexibility is explored, which can further improve the quality of the solution.
ContributorsNayeri, Peyman (Author) / Colbourn, Charles (Thesis advisor) / Konjevod, Goran (Thesis advisor) / Sen, Arunabha (Committee member) / Stanzione Jr, Daniel (Committee member) / Arizona State University (Publisher)
Created2011
150114-Thumbnail Image.png
Description
Reverse engineering gene regulatory networks (GRNs) is an important problem in the domain of Systems Biology. Learning GRNs is challenging due to the inherent complexity of the real regulatory networks and the heterogeneity of samples in available biomedical data. Real world biological data are commonly collected from broad surveys (profiling

Reverse engineering gene regulatory networks (GRNs) is an important problem in the domain of Systems Biology. Learning GRNs is challenging due to the inherent complexity of the real regulatory networks and the heterogeneity of samples in available biomedical data. Real world biological data are commonly collected from broad surveys (profiling studies) and aggregate highly heterogeneous biological samples. Popular methods to learn GRNs simplistically assume a single universal regulatory network corresponding to available data. They neglect regulatory network adaptation due to change in underlying conditions and cellular phenotype or both. This dissertation presents a novel computational framework to learn common regulatory interactions and networks underlying the different sets of relatively homogeneous samples from real world biological data. The characteristic set of samples/conditions and corresponding regulatory interactions defines the cellular context (context). Context, in this dissertation, represents the deterministic transcriptional activity within the specific cellular regulatory mechanism. The major contributions of this framework include - modeling and learning context specific GRNs; associating enriched samples with contexts to interpret contextual interactions using biological knowledge; pruning extraneous edges from the context-specific GRN to improve the precision of the final GRNs; integrating multisource data to learn inter and intra domain interactions and increase confidence in obtained GRNs; and finally, learning combinatorial conditioning factors from the data to identify regulatory cofactors. The framework, Expattern, was applied to both real world and synthetic data. Interesting insights were obtained into mechanism of action of drugs on analysis of NCI60 drug activity and gene expression data. Application to refractory cancer data and Glioblastoma multiforme yield GRNs that were readily annotated with context-specific phenotypic information. Refractory cancer GRNs also displayed associations between distinct cancers, not observed through only clustering. Performance comparisons on multi-context synthetic data show the framework Expattern performs better than other comparable methods.
ContributorsSen, Ina (Author) / Kim, Seungchan (Thesis advisor) / Baral, Chitta (Committee member) / Bittner, Michael (Committee member) / Konjevod, Goran (Committee member) / Arizona State University (Publisher)
Created2011
149703-Thumbnail Image.png
Description
This dissertation studies routing in small-world networks such as grids plus long-range edges and real networks. Kleinberg showed that geography-based greedy routing in a grid-based network takes an expected number of steps polylogarithmic in the network size, thus justifying empirical efficiency observed beginning with Milgram. A counterpart for the grid-based

This dissertation studies routing in small-world networks such as grids plus long-range edges and real networks. Kleinberg showed that geography-based greedy routing in a grid-based network takes an expected number of steps polylogarithmic in the network size, thus justifying empirical efficiency observed beginning with Milgram. A counterpart for the grid-based model is provided; it creates all edges deterministically and shows an asymptotically matching upper bound on the route length. The main goal is to improve greedy routing through a decentralized machine learning process. Two considered methods are based on weighted majority and an algorithm of de Farias and Megiddo, both learning from feedback using ensembles of experts. Tests are run on both artificial and real networks, with decentralized spectral graph embedding supplying geometric information for real networks where it is not intrinsically available. An important measure analyzed in this work is overpayment, the difference between the cost of the method and that of the shortest path. Adaptive routing overtakes greedy after about a hundred or fewer searches per node, consistently across different network sizes and types. Learning stabilizes, typically at overpayment of a third to a half of that by greedy. The problem is made more difficult by eliminating the knowledge of neighbors' locations or by introducing uncooperative nodes. Even under these conditions, the learned routes are usually better than the greedy routes. The second part of the dissertation is related to the community structure of unannotated networks. A modularity-based algorithm of Newman is extended to work with overlapping communities (including considerably overlapping communities), where each node locally makes decisions to which potential communities it belongs. To measure quality of a cover of overlapping communities, a notion of a node contribution to modularity is introduced, and subsequently the notion of modularity is extended from partitions to covers. The final part considers a problem of network anonymization, mostly by the means of edge deletion. The point of interest is utility preservation. It is shown that a concentration on the preservation of routing abilities might damage the preservation of community structure, and vice versa.
ContributorsBakun, Oleg (Author) / Konjevod, Goran (Thesis advisor) / Richa, Andrea (Thesis advisor) / Syrotiuk, Violet R. (Committee member) / Czygrinow, Andrzej (Committee member) / Arizona State University (Publisher)
Created2011
152284-Thumbnail Image.png
Description
Electromigration in metal interconnects is the most pernicious failure mechanism in semiconductor integrated circuits (ICs). Early electromigration investigations were primarily focused on aluminum interconnects for silicon-based ICs. An alternative metallization compatible with gallium arsenide (GaAs) was required in the development of high-powered radio frequency (RF) compound semiconductor devices operating at

Electromigration in metal interconnects is the most pernicious failure mechanism in semiconductor integrated circuits (ICs). Early electromigration investigations were primarily focused on aluminum interconnects for silicon-based ICs. An alternative metallization compatible with gallium arsenide (GaAs) was required in the development of high-powered radio frequency (RF) compound semiconductor devices operating at higher current densities and elevated temperatures. Gold-based metallization was implemented on GaAs devices because it uniquely forms a very low resistance ohmic contact and gold interconnects have superior electrical and thermal conductivity properties. Gold (Au) was also believed to have improved resistance to electromigration due to its higher melting temperature, yet electromigration reliability data on passivated Au interconnects is scarce and inadequate in the literature. Therefore, the objective of this research was to characterize the electromigration lifetimes of passivated Au interconnects under precisely controlled stress conditions with statistically relevant quantities to obtain accurate model parameters essential for extrapolation to normal operational conditions. This research objective was accomplished through measurement of electromigration lifetimes of large quantities of passivated electroplated Au interconnects utilizing high-resolution in-situ resistance monitoring equipment. Application of moderate accelerated stress conditions with a current density limited to 2 MA/cm2 and oven temperatures in the range of 300°C to 375°C avoided electrical overstress and severe Joule-heated temperature gradients. Temperature coefficients of resistance (TCRs) were measured to determine accurate Joule-heated Au interconnect film temperatures. A failure criterion of 50% resistance degradation was selected to prevent thermal runaway and catastrophic metal ruptures that are problematic of open circuit failure tests. Test structure design was optimized to reduce resistance variation and facilitate failure analysis. Characterization of the Au microstructure yielded a median grain size of 0.91 ìm. All Au lifetime distributions followed log-normal distributions and Black's model was found to be applicable. An activation energy of 0.80 ± 0.05 eV was measured from constant current electromigration tests at multiple temperatures. A current density exponent of 1.91 was extracted from multiple current densities at a constant temperature. Electromigration-induced void morphology along with these model parameters indicated grain boundary diffusion is dominant and the void nucleation mechanism controlled the failure time.
ContributorsKilgore, Stephen (Author) / Adams, James (Thesis advisor) / Schroder, Dieter (Thesis advisor) / Krause, Stephen (Committee member) / Gaw, Craig (Committee member) / Arizona State University (Publisher)
Created2013
152172-Thumbnail Image.png
Description
The primary function of the medium access control (MAC) protocol is managing access to a shared communication channel. From the viewpoint of transmitters, the MAC protocol determines each transmitter's persistence, the fraction of time it is permitted to spend transmitting. Schedule-based schemes implement stable persistences, achieving low variation in delay

The primary function of the medium access control (MAC) protocol is managing access to a shared communication channel. From the viewpoint of transmitters, the MAC protocol determines each transmitter's persistence, the fraction of time it is permitted to spend transmitting. Schedule-based schemes implement stable persistences, achieving low variation in delay and throughput, and sometimes bounding maximum delay. However, they adapt slowly, if at all, to changes in the network. Contention-based schemes are agile, adapting quickly to changes in perceived contention, but suffer from short-term unfairness, large variations in packet delay, and poor performance at high load. The perfect MAC protocol, it seems, embodies the strengths of both contention- and schedule-based approaches while avoiding their weaknesses. This thesis culminates in the design of a Variable-Weight and Adaptive Topology Transparent (VWATT) MAC protocol. The design of VWATT first required answers for two questions: (1) If a node is equipped with schedules of different weights, which weight should it employ? (2) How is the node to compute the desired weight in a network lacking centralized control? The first question is answered by the Topology- and Load-Aware (TLA) allocation which defines target persistences that conform to both network topology and traffic load. Simulations show the TLA allocation to outperform IEEE 802.11, improving on the expectation and variation of delay, throughput, and drop rate. The second question is answered in the design of an Adaptive Topology- and Load-Aware Scheduled (ATLAS) MAC that computes the TLA allocation in a decentralized and adaptive manner. Simulation results show that ATLAS converges quickly on the TLA allocation, supporting highly dynamic networks. With these questions answered, a construction based on transversal designs is given for a variable-weight topology transparent schedule that allows nodes to dynamically and independently select weights to accommodate local topology and traffic load. The schedule maintains a guarantee on maximum delay when the maximum neighbourhood size is not too large. The schedule is integrated with the distributed computation of ATLAS to create VWATT. Simulations indicate that VWATT offers the stable performance characteristics of a scheduled MAC while adapting quickly to changes in topology and traffic load.
ContributorsLutz, Jonathan (Author) / Colbourn, Charles J (Thesis advisor) / Syrotiuk, Violet R. (Thesis advisor) / Konjevod, Goran (Committee member) / Lloyd, Errol L. (Committee member) / Arizona State University (Publisher)
Created2013
152101-Thumbnail Image.png
Description
This thesis is a qualitative research study that focuses on siblings of children with Autistic Spectrum Disorder (ASD). Even though it is expected that having a child with ASD in the family will influence the whole family including siblings of the child with ASD, the sibling population is rarely included

This thesis is a qualitative research study that focuses on siblings of children with Autistic Spectrum Disorder (ASD). Even though it is expected that having a child with ASD in the family will influence the whole family including siblings of the child with ASD, the sibling population is rarely included in research related to children with ASD, and there is only limited services available for them. This exploratory study (n=6) is aimed at better understanding the siblings' lives in their family settings in order to identify the siblings' unmet needs and determine how they have been influenced by the child with ASD. This study is also aimed at identifying the most appropriate support for the siblings to help them cope better. The study followed the Resiliency Model of Family Stress, Adjustment, and Adaptation and a narrative theory approach. An in-depth interview with the parents was conducted for the study, so the findings reflect the parents' perception of the siblings. All the themes emerged into two categories: life in the family setting and supports. The findings indicate that the families are striving for balance between the siblings and the children with ASD, but still tend to focus more on the children with ASD. Also, the families tend to have autonomous personal support systems. The parents tend to perceive that these personal support systems are good enough for the siblings; therefore, the parents do not feel that formal support for the siblings was necessary. As a result of the findings, recommendations are made for the organizations that work with individuals with ASD to provide more appropriate services for the families of children with ASD, including siblings. Also, recommendations are made for future studies to clarify more factors related to the siblings due to the limitation of this study; the siblings' lives were reflected vicariously via the parents.
ContributorsJeong, Seong Hae (Author) / Marsiglia, Flavio F (Thesis advisor) / Ayers, Stephanie (Committee member) / Adams, James (Committee member) / Arizona State University (Publisher)
Created2013
150660-Thumbnail Image.png
Description
Semiconductor scaling technology has led to a sharp growth in transistor counts. This has resulted in an exponential increase on both power dissipation and heat flux (or power density) in modern microprocessors. These microprocessors are integrated as the major components in many modern embedded devices, which offer richer features and

Semiconductor scaling technology has led to a sharp growth in transistor counts. This has resulted in an exponential increase on both power dissipation and heat flux (or power density) in modern microprocessors. These microprocessors are integrated as the major components in many modern embedded devices, which offer richer features and attain higher performance than ever before. Therefore, power and thermal management have become the significant design considerations for modern embedded devices. Dynamic voltage/frequency scaling (DVFS) and dynamic power management (DPM) are two well-known hardware capabilities offered by modern embedded processors. However, the power or thermal aware performance optimization is not fully explored for the mainstream embedded processors with discrete DVFS and DPM capabilities. Many key problems have not been answered yet. What is the maximum performance that an embedded processor can achieve under power or thermal constraint for a periodic application? Does there exist an efficient algorithm for the power or thermal management problems with guaranteed quality bound? These questions are hard to be answered because the discrete settings of DVFS and DPM enhance the complexity of many power and thermal management problems, which are generally NP-hard. The dissertation presents a comprehensive study on these NP-hard power and thermal management problems for embedded processors with discrete DVFS and DPM capabilities. In the domain of power management, the dissertation addresses the power minimization problem for real-time schedules, the energy-constrained make-span minimization problem on homogeneous and heterogeneous chip multiprocessors (CMP) architectures, and the battery aware energy management problem with nonlinear battery discharging model. In the domain of thermal management, the work addresses several thermal-constrained performance maximization problems for periodic embedded applications. All the addressed problems are proved to be NP-hard or strongly NP-hard in the study. Then the work focuses on the design of the off-line optimal or polynomial time approximation algorithms as solutions in the problem design space. Several addressed NP-hard problems are tackled by dynamic programming with optimal solutions and pseudo-polynomial run time complexity. Because the optimal algorithms are not efficient in worst case, the fully polynomial time approximation algorithms are provided as more efficient solutions. Some efficient heuristic algorithms are also presented as solutions to several addressed problems. The comprehensive study answers the key questions in order to fully explore the power and thermal management potentials on embedded processors with discrete DVFS and DPM capabilities. The provided solutions enable the theoretical analysis of the maximum performance for periodic embedded applications under power or thermal constraints.
ContributorsZhang, Sushu (Author) / Chatha, Karam S (Thesis advisor) / Cao, Yu (Committee member) / Konjevod, Goran (Committee member) / Vrudhula, Sarma (Committee member) / Xue, Guoliang (Committee member) / Arizona State University (Publisher)
Created2012
150754-Thumbnail Image.png
Description
This report will review the mechanical and microstructural properties of the refractory element rhenium (Re) deposited using Laser Additive Manufacturing (LAM). With useable structural strength over 2200 °C, existing applications up to 2760 °C, very high strength, ductility and chemical resistance, interest in Re is understandable. This study includes data

This report will review the mechanical and microstructural properties of the refractory element rhenium (Re) deposited using Laser Additive Manufacturing (LAM). With useable structural strength over 2200 °C, existing applications up to 2760 °C, very high strength, ductility and chemical resistance, interest in Re is understandable. This study includes data about tensile properties including tensile data up to 1925 °C, fracture modes, fatigue and microstructure including deformation systems and potential applications of that information. The bulk mechanical test data will be correlated with nanoindentation and crystallographic examination. LAM properties are compared to the existing properties found in the literature for other manufacturing processes. The literature indicates that Re has three significant slip systems but also twins as part of its deformation mechanisms. While it follows the hcp metal characteristics for deformation, it has interesting and valuable extremes such as high work hardening, potentially high strength, excellent wear resistance and superior elevated temperature strength. These characteristics are discussed in detail.
ContributorsAdams, Robbie (Author) / Chawla, Nikhilesh (Thesis advisor) / Adams, James (Committee member) / Krause, Stephen (Committee member) / Arizona State University (Publisher)
Created2012
150722-Thumbnail Image.png
Description
In 2022, integrated circuit interconnects will approach 10 nm and the diffusion barrier layers needed to ensure long lasting devices will be at 1 nm. This dimension means the interconnect will be dominated by the interface and it has been shown the interface is currently eroding device performance. The standard

In 2022, integrated circuit interconnects will approach 10 nm and the diffusion barrier layers needed to ensure long lasting devices will be at 1 nm. This dimension means the interconnect will be dominated by the interface and it has been shown the interface is currently eroding device performance. The standard interconnect system has three layers - a Copper metal core, a Tantalum Adhesion layer and a Tantalum Nitride Diffusion Barrier Layer. An alternate interconnect schema is a Tantalum Nitride barrier layer and Silver as a metal. The adhesion layer is removed from the system along with changing to an alternate, low resistivity metal. First principles are used to assess the interface of the Silver and Tantalum Nitride. Several stoichiometric 1:1 Tantalum Nitride polymorphs are assessed and it is found that the Fe2P crystal structure is actually the most stable crystal structure which is at odds with the published phase diagram for ambient crystal structure. The surface stability of Fe2P-TaN is assessed and the absorption enthalpy of Silver adatoms is calculated. Finally, the thermodynamic stability of the TaN-Ag interconnect system is assessed.
ContributorsGrumski, Michael (Author) / Adams, James (Thesis advisor) / Krause, Stephen (Committee member) / Alford, Terry (Committee member) / Arizona State University (Publisher)
Created2012