Establishing Lagrangian connections between observations within air masses crossing the Atlantic during the International Consortium for Atmospheric Research on Transport and Transformation experiment

The ITCT-Lagrangian-2K4 (Intercontinental Transport and Chemical Transformation) experiment was conceived with an aim to quantify the effects of photochemistry and mixing on the transformation of air masses in the free troposphere away from emissions. To this end, attempts were made to intercept and sample air masses several times during their journey across the North Atlantic using four aircraft based in New Hampshire (USA), Faial (Azores) and Creil (France). This article begins by describing forecasts from two Lagrangian models that were used to direct the aircraft into target air masses. A novel technique then identifies Lagrangian matches between flight segments. Two independent searches are conducted: for Lagrangian model matches and for pairs of whole air samples with matching hydrocarbon fingerprints. The information is filtered further by searching for matching hydrocarbon samples that are linked by matching trajectories. The quality of these "coincident matches'' is assessed using temperature, humidity and tracer observations. The technique pulls out five clear Lagrangian cases covering a variety of situations and these are examined in detail. The matching trajectories and hydrocarbon fingerprints are shown, and the downwind minus upwind differences in tracers are discussed.

A multiwave range test for obstacle reconstructions with unknown physical properties

We develop a new multiwave version of the range test for shape reconstruction in inverse scattering theory. The range test [R. Potthast, et al., A ‘range test’ for determining scatterers with unknown physical properties, Inverse Problems 19(3) (2003) 533–547] has originally been proposed to obtain knowledge about an unknown scatterer when the far field pattern for only one plane wave is given. Here, we extend the method to the case of multiple waves and show that the full shape of the unknown scatterer can be reconstructed. We further will clarify the relation between the range test methods, the potential method [A. Kirsch, R. Kress, On an integral equation of the first kind in inverse acoustic scattering, in: Inverse Problems (Oberwolfach, 1986), Internationale Schriftenreihe zur Numerischen Mathematik, vol. 77, Birkhäuser, Basel, 1986, pp. 93–102] and the singular sources method [R. Potthast, Point sources and multipoles in inverse scattering theory, Habilitation Thesis, Göttingen, 1999]. In particular, we propose a new version of the Kirsch–Kress method using the range test and a new approach to the singular sources method based on the range test and potential method. Numerical examples of reconstructions for all four methods are provided.

Synapsing variable length crossover: An algorithm for crossing and comparing variable length genomes

The Synapsing Variable Length Crossover (SVLC) algorithm provides a biologically inspired method for performing meaningful crossover between variable length genomes. In addition to providing a rationale for variable length crossover it also provides a genotypic similarity metric for variable length genomes enabling standard niche formation techniques to be used with variable length genomes. Unlike other variable length crossover techniques which consider genomes to be rigid inflexible arrays and where some or all of the crossover points are randomly selected, the SVLC algorithm considers genomes to be flexible and chooses non-random crossover points based on the common parental sequence similarity. The SVLC Algorithm recurrently "glues" or synapses homogenous genetic sub-sequences together. This is done in such a way that common parental sequences are automatically preserved in the offspring with only the genetic differences being exchanged or removed, independent of the length of such differences. In a variable length test problem the SVLC algorithm is shown to outperform current variable length crossover techniques. The SVLC algorithm is also shown to work in a more realistic robot neural network controller evolution application.

Joint modelling of obstacle induced and mesoscale changes: current limits and challenges

Obstacles considerably influence boundary layer processes. Their influences have been included in mesoscale models (MeM) for a long time. Methods used to parameterise obstacle effects in a MeM are summarised in this paper using results of the mesoscale model METRAS as examples. Besides the parameterisation of obstacle influences it is also possible to use a joint modelling approach to describe obstacle induced and mesoscale changes. Three different methods may be used for joint modelling approaches: The first method is a time-slice approach, where steady basic state profiles are used in an obstacle resolving microscale model (MiM, example model MITRAS) and diurnal cycles are derived by joining steady-state MITRAS results. The second joint modelling approach is one-way nesting, where the MeM results are used to initialise the MiM and to drive the boundary values of the MiM dependent on time. The third joint modelling approach is to apply multi-scale models or two-way nesting approaches, which include feedbacks from the MiM to the MeM. The advantages and disadvantages of the different approaches and remaining problems with joint Reynolds-averaged Navier–Stokes modelling approaches are summarised in the paper.

Virtual reshaping and invisibility in obstacle scattering

We consider reshaping an obstacle virtually by using transformation optics in acoustic and electromagnetic scattering. Among the general virtual reshaping results, the virtual minification and virtual magnification in particular are studied. Stability estimates are derived for scattering amplitude in terms of the diameter of a small obstacle, which implies that the limiting case for minification corresponds to a perfect cloaking, i.e., the obstacle is invisible to detection.

Curve crossing for the reflected Levy process at zero and infinity

Let $R_{t}=\sup_{0\leq s\leq t}X_{s}-X_{t}$ be a Levy process reflected in its maximum. We give necessary and sufficient conditions for finiteness of passage times above power law boundaries at infinity. Information as to when the expected passage time for $R_{t}$ is finite, is given. We also discuss the almost sure finiteness of $\limsup_{t\to 0}R_{t}/t^{\kappa}$, for each $\kappa\geq 0$.

The invisible hand guiding technology: crossing the boundary of technology

This paper examines attitudes towards Radio Frequency Identification (RFID) technology and explores the wider concerns of the ever increasing prospect of social tagging. Capturing vignettes and narratives from a sample of study participants, the paper highlights concerns about adopting RFID implements now and in the future. The views captured through qualitative methodology act as the platform for a wider argument concerning the human rights and privacy intrusion concerns over IT applications. Intended as an insight into the reality of technology impact, this paper lists a series of questions for leaders to consider over matters of human rights specifically concerning RFID adoption. The authors conclude that caution, naivety and fear are the underlying reasons for society accepting RFIDs without question and that RFIDs will be a part of everyday working and domestic life in the near future.

Obstacle avoidance routing scheme through optimal sink movement for home monitoring and mobile robotic consumer devices

In recent years, ZigBee has been proven to be an excellent solution to create scalable and flexible home automation networks. In a home automation network, consumer devices typically collect data from a home monitoring environment and then transmit the data to an end user through multi-hop communication without the need for any human intervention. However, due to the presence of typical obstacles in a home environment, error-free reception may not be possible, particularly for power constrained devices. A mobile sink based data transmission scheme can be one solution but obstacles create significant complexities for the sink movement path determination process. Therefore, an obstacle avoidance data routing scheme is of vital importance to the design of an efficient home automation system. This paper presents a mobile sink based obstacle avoidance routing scheme for a home monitoring system. The mobile sink collects data by traversing through the obstacle avoidance path. Through ZigBee based hardware implementation and verification, the proposed scheme successfully transmits data through the obstacle avoidance path to improve network performance in terms of life span, energy consumption and reliability. The application of this work can be applied to a wide range of intelligent pervasive consumer products and services including robotic vacuum cleaners and personal security robots1.