Integrated methodology for forensic oil spill identification

A new integrated methodology for forensic oil spill identification is presented. It consists of GC-MS analysis, chromatographic data processing, variable-outlier detection, multivariate data analysis, estimation of uncertainties, and statistical evaluation. The methodology was tested on four groups of diagnostic ratios composed of petroleum biomarkers and ratios within homologous PAH categories. Principal component analysis (PCA) was employed and enabled the simultaneous analysis of many diagnostic ratios. Weathering was taken into account by considering the sampling uncertainties estimated from replicate spill samples. Statistical evaluation ensured an objective matching of oil spill samples with suspected source oils as well as classification into positive match, probable match, and nonmatch. The data analysis is further refined if two or more source oils are classified as probable match by using weighted least squares fitting of the principal components, local PCA models, and additional information relevant to the spill case. The methodology correctly identified the source of two spill samples (i.e., crude oils from Oseberg East and Oseberg Field Centre) and distinguished them from closely related source oils.     

Constraint-Based Verification of Parameterized Cache Coherence Protocols

We propose a new method for the parameterized verification of formal specifications of cache coherence protocols. The goal of parameterized verification is to establish system properties for an arbitrary number of caches. In order to achieve this purpose we define abstractions that allow us to reduce the original parameterized verification problem to a control state reachability problem for a system with integer data variables. Specifically, the methodology we propose consists of the following steps. We first define an abstraction in which we only keep track of the number of caches in a given state during the execution of a protocol. Then, we use linear arithmetic constraints to symbolically represent infinite sets of global states of the resulting abstract protocol. For reasons of efficiency, we relax the constraint operations by interpreting constraints over real numbers. Finally, we check parameterized safety properties of abstract protocols using symbolic backward reachability, a strategy that allows us to obtain sufficient conditions for termination for an interesting class of protocols. The latter problem can be solved by using the infinite-state model checker HyTech: Henzinger, Ho, and Wong-Toi, A model checker for hybrid systems, Proc. of the 9th International Conference on Computer Aided Verification (CAV'97), Lecture Notes in Computer Science, Springer, Haifa, Israel, 1997, Vol. 1254, pp. 460–463. HyTech handles linear arithmetic constraints using the polyhedra library of Halbwachs and Proy, Verification of real-time systems using linear relation analysis, Formal Methods in System Design, Vol. 11, No. 2, pp. 157–185, 1997. By using this methodology, we have automatically validated parameterized versions of widely implemented write-invalidate and write-update cache coherence protocols like Synapse, MESI, MOESI, Berkeley, Illinois, Firefly and Dragon (Handy, The Cache Memory Book, Academic Press, 1993). With this application, we have shown that symbolic model checking tools like HyTech, originally designed for the verification of hybrid systems, can be applied successfully to new classes of infinite-state systems of practical interest.     

Variable-gradient generator for micro- and nano-HPLC

A new, simple device generates accurate nano- and microflow rate gradients from any conventional HPLC system. The core of the new device is represented by an electric-actuated, computer-controlled, multiposition HPLC valve. The valve hosts six reservoirs for as many different mobile-phase compositions of increasing strength. A low flow rate stream pushes the weakest solvent through the column as long as required and at the desired flow rate, until the chromatographic run is started. From this time on, the electric actuation allows one to select which reservoir will be on-line with the column and for how long, thus generating a specific solvent gradient, through a sequence of controlled segments of precise mobile-phase composition. This permits one not only to exactly reproduce the programmed slope but also to achieve different gradient shapes (i.e., linear, convex, concave) for different separation needs. The new device has proven to be reliable and reproducible even at the lowest flow rate tested (250 nL x min(-1)) and in different chromatographic conditions.     

Design of efficient, broadband single-element (20-80 MHz) ultrasonic transducers for medical imaging applications

This paper discusses the design, fabrication, and testing of sensitive broadband lithium niobate (LiNbO/sub 3/) single-element ultrasonic transducers in the 20-80 MHz frequency range. Transducers of varying dimensions were built for an f# range of 2.0-3.1. The desired focal depths were achieved by either casting an acoustic lens on the transducer face or press-focusing the piezoelectric into a spherical curvature. For designs that required electrical impedance matching, a low impedance transmission line coaxial cable was used. All transducers were tested in a pulse-echo arrangement, whereby the center frequency, bandwidth, insertion loss, and focal depth were measured. Several transducers were fabricated with center frequencies in the 20-80 MHz range with the measured -6 dB bandwidths and two-way insertion loss values ranging from 57 to 74% and 9.6 to 21.3 dB, respectively. Both transducer focusing techniques proved successful in producing highly sensitive, high-frequency, single-element, ultrasonic-imaging transducers. In vivo and in vitro ultrasonic backscatter microscope (UBM) images of human eyes were obtained with the 50 MHz transducers. The high sensitivity of these devices could possibly allow for an increase in depth of penetration, higher image signal-to-noise ratio (SNR), and improved image contrast at high frequencies when compared to previously reported results.     

A Technique for Extracting Sub-source Similarities from Information Sources Having Different Formats

In this paper we propose a semi-automatic technique for deriving the similarity degree between two portions of heterogeneous information sources (hereafter, sub-sources). The proposed technique consists in two phases: the first one selects the most promising pairs of sub-sources, whereas the second one computes the similarity degree relative to each promising pair. We show that the detection of sub-source similarities is a special case (and a very interesting one, for semi-structured information sources) of the more general problem of Scheme Match. In addition, we present a real example case to clarify the proposed technique, a set of experiments we have conducted to verify the quality of its results, a discussion about its computational complexity and its classification in the context of related literature. Finally, we discuss some possible applications which can benefit by derived similarities.     

Optimisation of a vehicle energy absorbing steel component with experimental validation

The paper deals with the optimisation of a tapered tubular steel component to be used as an energy-absorbing device in the front structure of a vehicle body. Aim of the optimisation problem is the minimisation of a load uniformity parameter evaluated as the ratio between the maximum and the average crushing loads. The optimisation problem takes into account two design variables describing a tapered geometrical configuration, the diameter of the component at one of its bounds and the tapering length. Two improved geometrical configurations have been found and have been experimentally tested to verify the numerical results with impact velocities up to 10 m/s.     

On‐Chip Magnetic Platform for Single‐Particle Manipulation with Integrated Electrical Feedback

Methods for the manipulation of single magnetic particles have become very interesting, in particular for in vitro biological studies. Most of these studies require an external microscope to provide the operator with feedback for controlling the particle motion, thus preventing the use of magnetic particles in high‐throughput experiments. In this paper, a simple and compact system with integrated electrical feedback is presented, implementing in the very same device both the manipulation and detection of the transit of single particles. The proposed platform is based on zig‐zag shaped magnetic nanostructures, where transverse magnetic domain walls are pinned at the corners and attract magnetic particles in suspension. By applying suitable external magnetic fields, the domain walls move to the nearest corner, thus causing the step by step displacement of the particles along the nanostructure. The very same structure is also employed for detecting the bead transit. Indeed, the presence of the magnetic particle in suspension over the domain wall affects the depinning field required for its displacement. This characteristic field can be monitored through anisotropic magnetoresistance measurements, thus implementing an integrated electrical feedback of the bead transit. In particular, the individual manipulation and detection of single 1‐μm sized beads is demonstrated.     

Almost sure exponential convergence to consensus of random gossip algorithms

In this paper, we provide a proof of almost sure exponential convergence to consensus for a general class of ergodic edge selection processes. The proof is based on the multiplicative ergodic theorem of Oseledec and also applies to continuous time gossip algorithms. An example of exponential convergence in a non ergodic case is also discussed. Copyright © 2012 John Wiley & Sons, Ltd.     

The online Prize-Collecting Traveling Salesman Problem

We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to visit a set of cities while minimizing the length of the overall tour. In the PCTSP, each city has a given weight and penalty, and the goal is to collect a given quota of the weights of the cities while minimizing the length of the tour plus the penalties of the cities not in the tour. In the online version, cities are disclosed over time. We give a 7/3-competitive algorithm for the problem, which compares with a lower bound of 2 on the competitive ratio of any deterministic algorithm. We also show how our approach can be combined with an approximation algorithm in order to obtain an O(1)-competitive algorithm that runs in polynomial time.