Sub-wavelength resolution in air-coupled ultrasound images of spot welds

Resistance spot welds joining steel sheets were examined using air-coupled ultrasound at 1 MHz. Transmission C-scan images were obtained using two axially aligned transducers, with each focused on its adjacent surface of the specimen. Because of the enormous impedance mismatch between air and steel, the transmitted signal was exceedingly weak, requiring several hours to collect an image. Although the air-coupled images resembled the weld shapes as determined by an independent technique, surface topography introduced considerable image distortion. The smearing of the images was substantially less than the 5.9-mm wavelength in steel, with the steepness of the transition between welded and unwelded areas indicating a transverse resolution about 1 mm. Similarities to near-field imaging are mentioned as a possible explanation for the observed sub-wavelength resolution.     

Monitoring delamination of plasma-sprayed thermal barrier coatings by reflectance-enhanced luminescence

Plasma-sprayed thermal barrier coatings (TBCs) present a challenge for optical diagnostic methods to monitor TBC delamination, because the strong scattering exhibited by plasma-sprayed TBCs severely attenuates light transmitted through the TBC. This paper presents a new approach that indicates delamination in plasma-sprayed TBCs by utilizing a luminescent sublayer that produces significantly greater luminescence intensity from delaminated regions of the TBC. Freestanding coatings were produced with either a Eu-doped or Er-doped yttria-stabilized zirconia (YSZ) luminescent layer below a plasma-sprayed undoped YSZ layer. A NiCr backing layer was added to represent an attached substrate in some sections. For specimens with a Eu-doped YSZ luminescent sublayer, luminescence intensity maps showed excellent contrast between unbacked and NiCr-backed sections. Discernable contrast between unbacked and NiCr-backed sections was not observed for specimens with a Er-doped YSZ luminescent sublayer, because luminescence from Er impurities in the undoped YSZ layer overwhelmed luminescence originating from the Er-doped YSZ sublayer.     

Spacebased estimation of moisture transport in marine atmosphere using support vector regression

An improved algorithm is developed based on support vector regression (SVR) to estimate horizonal water vapor transport integrated through the depth of the atmosphere (Θ) over the global ocean from observations of surface wind-stress vector by QuikSCAT, cloud drift wind vector derived from the Multi-angle Imaging SpectroRadiometer (MISR) and geostationary satellites, and precipitable water from the Special Sensor Microwave/Imager (SSM/I). The statistical relation is established between the input parameters (the surface wind stress, the 850 mb wind, the precipitable water, time and location) and the target data (Θ calculated from rawinsondes and reanalysis of numerical weather prediction model). The results are validated with independent daily rawinsonde observations, monthly mean reanalysis data, and through regional water balance. This study clearly demonstrates the improvement of Θ derived from satellite data using SVR over previous data sets based on linear regression and neural network. The SVR methodology reduces both mean bias and standard deviation compared with rawinsonde observations. It agrees better with observations from synoptic to seasonal time scales, and compare more favorably with the reanalysis data on seasonal variations. Only the SVR result can achieve the water balance over South America. The rationale of the advantage by SVR method and the impact of adding the upper level wind will also be discussed.     

Column and batch reactive transport experiment parameter estimation using a genetic algorithm

This paper focuses on the application of a genetic algorithm (GA) in estimating the fate and transport parameters of a reacting solute from the column and batch experiments involving a saturated porous medium. A program is developed using C++ to model the column and batch data using kinetically controlled one- or two-site sorption models including linear and/or nonlinear forms. The objective of the algorithm is to minimize the sum of squared differences between the measured and modeled solute concentration data associated with column effluent (i.e., “breakthrough curves”). The GA is capable of estimating transport and reactions parameters such as forward and reverse reaction rates and parameters of the nonlinear reaction models, from a given set of measured data. Further simulations have been performed to estimate the appropriate configurations of the GA, which assist the method in estimating the fate and transport parameters more efficiently. It is shown that a wide range of the GA parameters can lead to convergence to appropriate estimations. The results obtained from this study show that the capability of GAs to fit the column and batch experiment data is promising.     

SellTrend: Inter-Attribute Visual Analysis of Temporal Transaction Data

We present a case study of our experience designing SellTrend, a visualization system for analyzing airline travel purchase requests. The relevant transaction data can be characterized as multi-variate temporal and categorical event sequences, and the chief problem addressed is how to help company analysts identify complex combinations of transaction attributes that contribute to failed purchase requests. SellTrend combines a diverse set of techniques ranging from time series visualization to faceted browsing and historical trend analysis in order to help analysts make sense of the data. We believe that the combination of views and interaction capabilities in SellTrend provides an innovative approach to this problem and to other similar types of multivariate, temporally driven transaction data analysis. Initial feedback from company analysts confirms the utility and benefits of the system.     

Parallelisation of storage cell flood models using OpenMP

This paper describes the implementation and benchmarking of a parallel version of the LISFLOOD-FP hydraulic model based on the OpenMP Application Programming Interface. The motivation behind the study was that reducing model run time through parallelisation would increase the utility of such models by expanding the domains over which they can be practically implemented, allowing previously inaccessible scientific questions to be addressed. Parallel speedup was calculated for 13 models distributed over seven study sites and implemented on one, two, four and in selected cases eight processor cores. The models represent a range of previous applications from large area, coarse resolution models of the Amazon, to fine resolution models of urban areas, to orders of magnitude smaller models of rural floodplains. Parallel speedups were greater for larger model domains, especially for models with over 0.2–0.4 million cells where parallel efficiencies of up to 0.75 on four and eight cores were achieved. A key advantage of using OpenMP and an explicit rather than implicit model was the ease of implementation and minimal code changes required to run simulations in parallel.     

Finding the number of clusters in ordered dissimilarities

As humans, we have innate faculties that allow us to efficiently segment groups of objects. Computers, to some degree, can be programmed with similar categorical capabilities, which stem from exploratory data analysis. Out of the various subsets of data reasoning, clustering provides insight into the structure and relationships of input samples situated in a number of distributions. To determine these relationships, many clustering methods rely on one or more human inputs; the most important being the number of distributions, c, to seek. This work investigates a technique for estimating the number of clusters from a general type of data called relational data. Several numerical examples are presented to illustrate the effectiveness of the proposed method.     

A Randomized Algorithm for Online Unit Clustering

In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used. In the one-dimensional case, we show that surprisingly the naïve upper bound of 2 on the competitive ratio can be beaten: we present a new randomized 15/8-competitive online algorithm. We also provide some lower bounds and an extension to higher dimensions.