Not available / text

Thesis (M.S. in biochemistry)--Washington State University, May 2006. / Includes bibliographical references (p. 81-86).

Thesis (Ph. D.)--University of Texas at Austin, 2005. / Vita. Includes bibliographical references.

Thesis (M.S. in biochemistry)--Washington State University, May 2006. / Includes bibliographical references (leaves 81-86).

Computational analysis and design has become a fundamental part of product research, development, and manufacture in aerospace, automotive, and other industries. In general the success of the specific application depends heavily on the accuracy and consistency of the computational model used. The aim of this work is to reduce the time needed to prepare geometry for mesh generation. This will be accomplished by developing tools that semi-automatically repair discrete data. Providing a level of automation to the process of repairing large, complex problems in discrete data will significantly accelerate the grid generation process. The developed algorithms are meant to offer semi-automated solutions to complicated geometrical problems—specifically discrete mesh intersections and isolated boundaries. The intersection-repair strategy presented here focuses on repairing the intersection in-place as opposed to re-discretizing the intersecting geometries. Combining robust, efficient methods of detecting intersections and then repairing intersecting geometries in-place produces a significant improvement over techniques used in current literature. The result of this intersection process is a non-manifold, non-intersecting geometry that is free of duplicate and degenerate geometry. Results are presented showing the accuracy and consistency of the intersection repair tool. Isolated boundaries are a type of gap that current research does not address directly. They are defined by discrete boundary edges that are unable to be paired with nearby discrete boundary edges in order to fill the existing gap. In this research the method of repair seeks to fill the gap by extruding the isolated boundary along a defined vector so that it is topologically adjacent to a nearby surface. The outcome of the repair process is that the isolated boundaries no longer exist because the gap has been filled. Results are presented showing the precision of the edge projection and the advantage of edge splitting in the repair of isolated boundaries.

Currently, in Texas, there is a need for different repairs on pavements and bridge decks; rapid repair materials designed for these repairs are available but the service life and durability of these products are often inadequate. Thus, the goal for the Texas Department of Transportation (TxDOT) is to implement repairs with an extended service life in a timely manner, in order to cause minimal disruption. Research performed under TxDOT Project 6723 (Development of Rapid, Cement-based Repair Materials for Transportation Structures) evaluated a wide range of rapid repair materials, including calcium aluminate cement (CAC), calcium sulfoaluminate cement (CSA), fly ash alkali activated blends, and ordinary portland cement. Some of the properties which contribute to a long-term service life are: mechanical properties, early-age volume change, and the heat evolution; often, the early-age development of these repair materials can cause later durability issues. These properties were examined through a variety of experiments and test in the laboratory, as well as, in the field. / text

Typescript, etc. / Digitized by Kansas State University Libraries

Bugs in code continue to pose a fundamental problem for software reliability and cause expensive failures. The process of removing known bugs is termed debugging, which is a classic methodology commonly performed before code is deployed. Traditionally, debugging is tedious, often requiring much manual effort. A more recent technique that complements debugging is data structure repair, which handles bugs that make it to deployed systems and lead to erroneous behavior at runtime by modifying erroneous program states to recover from errors. While data structure repair presents a promising basis for dealing with bugs at runtime, it remains computationally expensive. Our thesis is that debugging and data structure repair can be integrated to provide the basis of an effective approach for removing bugs before code is deployed and handling them after it is deployed. We present a bi-directional integration where ideas at the basis of data structure repair assist in automating debugging and vice versa. Our key insight is two-fold: (1)a repair action performed to mutate an erroneous object field value to repair it can be abstracted into a program statement that performs that update correctly; and (2)repair actions that are performed repeatedly to fix the same error can be memoized and re-used. We design, develop, and evaluate two techniques that embody our insight. One, we present an automated debugging technique that leverages a systematic constraint-based data structure repair technique developed in previous work and provides suggestions on how to fix a faulty program. Two, we present repair abstractions that are based on the same central ideas as in our automated debugging technique and memoize how an erroneous state was repaired, which enables prioritizing and re-using repair actions when the same error occurs again. The focus of our work is programs that operate on structurally complex data, e.g., heap-allocated data structures that have complex structural integrity constraints, such as acyclicity. Checking such constraints plays a central role in the techniques that lay at the foundation of our work. These techniques require the user to provide the constraints, which poses a burden on the user. To facilitate the use of constraint-based techniques, we present a third technique to check constraint violations at runtime using graph spectra, which have been studied extensively by mathematicians to capture properties of graphs. We view the heap of an object-oriented program as an edge-labeled graph, which allows us to apply results from graph spectra theory. Experimental results show the effectiveness of using graph spectra as a basis of capturing structural properties of a class of commonly used data structures. / text

This study investigates the feasibility of strengthening reinforced concrete beams with epoxy-bonded Glass-Fiber-Reinforced-Plastic (GFRP) plates. The composite plate is epoxy-bonded to the tension flange of the beam to increase its stiffness and strength. Seven rectangular and one T-beam, retrofitted with composite plates, were tested to failure under symmetrical 4-point bending. The load versus deflection and the load versus strain in the composite plate, steel rebar and the extreme compression fiber of concrete were measured and plotted for the midspan section throughout the entire range of loading up to failure. Analytical models based on the equilibrium of forces and compatibility of deformations were developed to predict the stresses and deformations of the beam in the linear and nonlinear regions. The predicted and measured results correlated well. The analytical models were used in a parametric study to investigate the effects of design variables such as, plate area, plate strength and stiffness, reinforcement ratio, etc., on the moment-curvature relationships of typical rectangular and T cross sections.

<p>Both prokaryotic and eukaryotic cells are equipped with DNA repair mechanisms to protect the integrity of their genome in case of DNA damage. In the eukaryotic organism <i>Saccharomyces cerevisiae</i>, MMS2 encodes a ubiquitin-conjugating enzyme variant protein belonging to the RAD6 repair pathway; MMS2 functions in error-free postreplication repair (PRR), a subpathway parallel to REV3 mutagenesis. A mutation in MMS2 does not result in extreme sensitivity to DNA damaging agents; however, deletion of both subpathways of PRR results in a synergistic phenotype. By taking advantage of the synergism between error-free PRR and mutagenesis pathway mutations, a conditional synthetic lethal screen was used to identify novel genes genetically involved in PRR. A synthetic lethal screen was modified to use extremely low doses of MMS that would not affect the growth of single mutants, but would effectively kill the double mutants. Fifteen potential mutants were characterized, of which twelve were identified as known error-prone PRR genes. Characterization of mutations in strains SLM-9 and SLM-11, that are conditionally synthetically lethal with mms2Ä, revealed functions for both checkpoints and mating-type heterozygosity in regulating PRR. Cell cycle checkpoints monitor the integrity of the genome and ensure that cell cycle progression is deferred until chromosome damage is repaired. The checkpoint genes genetically interact with both the error-free and error-prone branches of PRR, potentially for delaying cell cycle progression to allow time for DNA repair, and for signaling the stage of the cell cycle and thus DNA content. Other potential monitors for DNA content are the a1 and á2 proteins encoded by the mating type genes MATa and MATá, respectively. Diploid cells heterozygous for mating type (a/á) show an increased resistance to UV damage and are more recombination-proficient than haploid cells. Haploid PRR mutants expressing both mating type genes show an increased resistance to DNA-damaging agents. This phenomenon is specific to PRR: it was not seen in excision repair-deficient and recombination-deficient mutants tested. The rescuing effect seen in PRR mutants heterozygous for mating type is likely the result of channeling lesions into a recombination repair pathway and away from the non-operational PRR pathway. Both checkpoint and mating type genes play a role in regulating PRR. Almost certainly these genes are required to monitor the cell cycle stage and DNA content to determine the best mechanism to repair the damaged DNA thus preventing genomic instability.</p>