Air-coupled ultrasonic tomographic imaging of concrete elements

Ultrasonic tomography is a powerful tool for identifying defects within an object or structure. This method can be applied on structures where x-ray tomography is impractical due to size, low contrast, or safety concerns. By taking many ultrasonic pulse velocity (UPV) readings through the object, an image of the internal velocity variations can be constructed. Air-coupled UPV can allow for more automated and rapid collection of data for tomography of concrete. This research aims to integrate recent developments in air-coupled ultrasonic measurements with advanced tomography technology and apply them to concrete structures. First, non-contact and semi-contact sensor systems are developed for making rapid and accurate UPV measurements through PVC and concrete test samples. A customized tomographic reconstruction program is developed to provide full control over the imaging process including full and reduced spectrum tomographs with percent error and ray density calculations. Finite element models are also used to determine optimal measurement configurations and analysis procedures for efficient data collection and processing. Non-contact UPV is then implemented to image various inclusions within 6 inch (152 mm) PVC and concrete cylinders. Although there is some difficulty in identifying high velocity inclusions, reconstruction error values were in the range of 1.1-1.7% for PVC and 3.6% for concrete. Based upon the success of those tests, further data are collected using non-contact, semi-contact, and full contact measurements to image 12 inch (305 mm) square concrete cross-sections with 1 inch (25 mm) reinforcing bars and 2 inch (51 mm) square embedded damage regions. Due to higher noise levels in collected signals, tomographs of these larger specimens show reconstruction error values in the range of 10-18%. Finally, issues related to the application of these techniques to full-scale concrete structures are discussed.

A path-based framework for analyzing large markov models

Reliability and dependability modeling can be employed during many stages of analysis of a computing system to gain insights into its critical behaviors. To provide useful results, realistic models of systems are often necessarily large and complex. Numerical analysis of these models presents a formidable challenge because the sizes of their state-space descriptions grow exponentially in proportion to the sizes of the models. On the other hand, simulation of the models requires analysis of many trajectories in order to compute statistically correct solutions. This dissertation presents a novel framework for performing both numerical analysis and simulation. The new numerical approach computes bounds on the solutions of transient measures in large continuous-time Markov chains (CTMCs). It extends existing path-based and uniformization-based methods by identifying sets of paths that are equivalent with respect to a reward measure and related to one another via a simple structural relationship. This relationship makes it possible for the approach to explore multiple paths at the same time,· thus significantly increasing the number of paths that can be explored in a given amount of time. Furthermore, the use of a structured representation for the state space and the direct computation of the desired reward measure (without ever storing the solution vector) allow it to analyze very large models using a very small amount of storage. Often, path-based techniques must compute many paths to obtain tight bounds. In addition to presenting the basic path-based approach, we also present algorithms for computing more paths and tighter bounds quickly. One resulting approach is based on the concept of path composition whereby precomputed subpaths are composed to compute the whole paths efficiently. Another approach is based on selecting important paths (among a set of many paths) for evaluation. Many path-based techniques suffer from having to evaluate many (unimportant) paths. Evaluating the important ones helps to compute tight bounds efficiently and quickly.