Rigorous bounds on the nonlinear saturation of instabilities to parallel shear flows

A novel method is presented for obtaining rigorous upper bounds on the finite-amplitude growth of instabilities to parallel shear flows on the beta-plane. The method relies on the existence of finite-amplitude Liapunov (normed) stability theorems, due to Arnol'd, which are nonlinear generalizations of the classical stability theorems of Rayleigh and Fjørtoft. Briefly, the idea is to use the finite-amplitude stability theorems to constrain the evolution of unstable flows in terms of their proximity to a stable flow. Two classes of general bounds are derived, and various examples are considered. It is also shown that, for a certain kind of forced-dissipative problem with dissipation proportional to vorticity, the finite-amplitude stability theorems (which were originally derived for inviscid, unforced flow) remain valid (though they are no longer strictly Liapunov); the saturation bounds therefore continue to hold under these conditions.

DK-1D: a drift-kinetic simulation tool for modelling the shear Alfvén wave and its interaction with collisionless plasma

We present a highly accurate tool for the simulation of shear Alfven waves (SAW) in collisionless plasma. SAW are important in space plasma environments because for small perpendicular scale lengths they can support an electric field parallel to the ambient magnetic field. Electrons can be accelerated by the parallel electric field and these waves have been implicated as the source of vibrant auroral displays. However, the parallel electric field carried by SAW is small in comparison to the perpendicular electric field of the wave, making it difficult to measure directly in the laboratory, or by satellites in the near-Earth plasma environment. In this paper, we present a simulation code that provides a means to study in detail the SAW-particle interaction in both space and laboratory plasma. Using idealised, small-amplitude propagating waves with a single perpendicular wavenumber, the simulation code accurately reproduces the damping rates and parallel electric field amplitudes predicted by linear theory for varying temperatures and perpendicular scale lengths. We present a rigorous kinetic derivation of the parallel electric field strength for small-amplitude SAW and show that commonly-used inertial and kinetic approximations are valid except for where the ratio of thermal to Alfv\'{e}n speed is between 0.7 and 1.0. We also present nonlinear simulations of large-amplitude waves and show that in cases of strong damping, the damping rates and parallel electric field strength deviate from linear predictions when wave energies are greater than only a few percent of the plasma kinetic energy, a situation which is often observed in the magnetosphere. The drift-kinetic code provides reliable, testable predictions of the parallel electric field strength which can be investigated directly in the laboratory, and will help to bridge the gap between studies of SAW in man-made and naturally occuring plasma.

An exact local conservation theorem for finite-amplitude disturbances to non-parallel shear flows, with remarks on Hamiltonian structure and on Arnol'd's stability theorems

Disturbances of arbitrary amplitude are superposed on a basic flow which is assumed to be steady and either (a) two-dimensional, homogeneous, and incompressible (rotating or non-rotating) or (b) stably stratified and quasi-geostrophic. Flow over shallow topography is allowed in either case. The basic flow, as well as the disturbance, is assumed to be subject neither to external forcing nor to dissipative processes like viscosity. An exact, local ‘wave-activity conservation theorem’ is derived in which the density A and flux F are second-order ‘wave properties’ or ‘disturbance properties’, meaning that they are O(a2) in magnitude as disturbance amplitude a [rightward arrow] 0, and that they are evaluable correct to O(a2) from linear theory, to O(a3) from second-order theory, and so on to higher orders in a. For a disturbance in the form of a single, slowly varying, non-stationary Rossby wavetrain, $\overline{F}/\overline{A}$ reduces approximately to the Rossby-wave group velocity, where (${}^{-}$) is an appropriate averaging operator. F and A have the formal appearance of Eulerian quantities, but generally involve a multivalued function the correct branch of which requires a certain amount of Lagrangian information for its determination. It is shown that, in a certain sense, the construction of conservable, quasi-Eulerian wave properties like A is unique and that the multivaluedness is inescapable in general. The connection with the concepts of pseudoenergy (quasi-energy), pseudomomentum (quasi-momentum), and ‘Eliassen-Palm wave activity’ is noted. The relationship of this and similar conservation theorems to dynamical fundamentals and to Arnol'd's nonlinear stability theorems is discussed in the light of recent advances in Hamiltonian dynamics. These show where such conservation theorems come from and how to construct them in other cases. An elementary proof of the Hamiltonian structure of two-dimensional Eulerian vortex dynamics is put on record, with explicit attention to the boundary conditions. The connection between Arnol'd's second stability theorem and the suppression of shear and self-tuning resonant instabilities by boundary constraints is discussed, and a finite-amplitude counterpart to Rayleigh's inflection-point theorem noted

C-slow retimed parallel histogram architectures for consumer imaging devices

A parallel pipelined array of cells suitable for real-time computation of histograms is proposed. The cell architecture builds on previous work obtained via C-slow retiming techniques and can be clocked at 65 percent faster frequency than previous arrays. The new arrays can be exploited for higher throughput particularly when dual data rate sampling techniques are used to operate on single streams of data from image sensors. In this way, the new cell operates on a p-bit data bus which is more convenient for interfacing to camera sensors or to microprocessors in consumer digital cameras.

Sustainable urban metabolism as a link between bio-physical sciences and urban planning: the BRIDGE project

Urban metabolism considers a city as a system with flows of energy and material between it and the environment. Recent advances in bio-physical sciences provide methods and models to estimate local scale energy, water, carbon and pollutant fluxes. However, good communication is required to provide this new knowledge and its implications to endusers (such as urban planners, architects and engineers). The FP7 project BRIDGE (sustainaBle uRban plannIng Decision support accountinG for urban mEtabolism) aimed to address this gap by illustrating the advantages of considering these issues in urban planning. The BRIDGE Decision Support System (DSS) aids the evaluation of the sustainability of urban planning interventions. The Multi Criteria Analysis approach adopted provides a method to cope with the complexity of urban metabolism. In consultation with targeted end-users, objectives were defined in relation to the interactions between the environmental elements (fluxes of energy, water, carbon and pollutants) and socioeconomic components (investment costs, housing, employment, etc.) of urban sustainability. The tool was tested in five case study cities: Helsinki, Athens, London, Florence and Gliwice; and sub-models were evaluated using flux data selected. This overview of the BRIDGE project covers the methods and tools used to measure and model the physical flows, the selected set of sustainability indicators, the methodological framework for evaluating urban planning alternatives and the resulting DSS prototype.

FAMOUS, faster: using parallel computing techniques to accelerate the FAMOUS/HadCM3 climate model with a focus on the radiative transfer algorithm

We have optimised the atmospheric radiation algorithm of the FAMOUS climate model on several hardware platforms. The optimisation involved translating the Fortran code to C and restructuring the algorithm around the computation of a single air column. Instead of the existing MPI-based domain decomposition, we used a task queue and a thread pool to schedule the computation of individual columns on the available processors. Finally, four air columns are packed together in a single data structure and computed simultaneously using Single Instruction Multiple Data operations. The modified algorithm runs more than 50 times faster on the CELL’s Synergistic Processing Elements than on its main PowerPC processing element. On Intel-compatible processors, the new radiation code runs 4 times faster. On the tested graphics processor, using OpenCL, we find a speed-up of more than 2.5 times as compared to the original code on the main CPU. Because the radiation code takes more than 60% of the total CPU time, FAMOUS executes more than twice as fast. Our version of the algorithm returns bit-wise identical results, which demonstrates the robustness of our approach. We estimate that this project required around two and a half man-years of work.

Implementation rules to bridge the theory/practice divide in market segmentation

Despite an extensive market segmentation literature, applied academic studies which bridge segmentation theory and practice remain a priority for researchers. The need for studies which examine the segmentation implementation barriers faced by organisations is particularly acute. We explore segmentation implementation through the eyes of a European utilities business, by following its progress through a major segmentation project. The study reveals the character and impact of implementation barriers occurring at different stages in the segmentation process. By classifying the barriers, we develop implementation "rules" for practitioners which are designed to minimise their occurrence and impact. We further contribute to the literature by developing a deeper understanding of the mechanisms through which these implementation rules can be applied.

Parallel editing, multi-positionality and maximalism: cosmopolitan effects as explored in some art works by Melanie Jackson and Vivienne Dick

Garfield produces a critique of neo-minimalist art practice by demonstrating how the artist Melanie Jackson’s Some things you are not allowed to send around the world (2003 and 2006) and the experimental film-maker Vivienne Dick’s Liberty’s booty (1980) – neither of which can be said to be about feeling ‘at home’ in the world, be it as a resident or as a nomad – examine global humanity through multi-positionality, excess and contingency, and thereby begin to articulate a new cosmopolitan relationship with the local – or, rather, with many different localities – in one and the same maximalist sweep of the work. ‘Maximalism’ in Garfield’s coinage signifies an excessive overloading (through editing, collage, and the sheer density of the range of the material) that enables the viewer to insert themselves into the narrative of the work. In the art of both Jackson and Dick Garfield detects a refusal to know or to judge the world; instead, there is an attempt to incorporate the complexities of its full range into the singular vision of the work, challenging the viewer to identify what is at stake.

Dynamic group communication for large-scale parallel data mining

Exascale systems are the next frontier in high-performance computing and are expected to deliver a performance of the order of 10^18 operations per second using massive multicore processors. Very large- and extreme-scale parallel systems pose critical algorithmic challenges, especially related to concurrency, locality and the need to avoid global communication patterns. This work investigates a novel protocol for dynamic group communication that can be used to remove the global communication requirement and to reduce the communication cost in parallel formulations of iterative data mining algorithms. The protocol is used to provide a communication-efficient parallel formulation of the k-means algorithm for cluster analysis. The approach is based on a collective communication operation for dynamic groups of processes and exploits non-uniform data distributions. Non-uniform data distributions can be either found in real-world distributed applications or induced by means of multidimensional binary search trees. The analysis of the proposed dynamic group communication protocol has shown that it does not introduce significant communication overhead. The parallel clustering algorithm has also been extended to accommodate an approximation error, which allows a further reduction of the communication costs. The effectiveness of the exact and approximate methods has been tested in a parallel computing system with 64 processors and in simulations with 1024 processing elements.

Electron acceleration and parallel electric fields due to kinetic Alfvén waves in plasma with similar thermal and Alfvén speeds

We investigate electron acceleration due to shear Alfven waves in a collissionless plasma for plasma parameters typical of 4–5RE radial distance from the Earth along auroral field lines. Recent observational work has motivated this study, which explores the plasma regime where the thermal velocity of the electrons is similar to the Alfven speed of the plasma, encouraging Landau resonance for electrons in the wave fields. We use a self-consistent kinetic simulation model to follow the evolution of the electrons as they interact with a short-duration wave pulse, which allows us to determine the parallel electric field of the shear Alfven wave due to both electron inertia and electron pressure effects. The simulation demonstrates that electrons can be accelerated to keV energies in a modest amplitude sub-second period wave. We compare the parallel electric field obtained from the simulation with those provided by fluid approximations.

Efficient group communication for large-scale parallel clustering

Global communication requirements and load imbalance of some parallel data mining algorithms are the major obstacles to exploit the computational power of large-scale systems. This work investigates how non-uniform data distributions can be exploited to remove the global communication requirement and to reduce the communication cost in iterative parallel data mining algorithms. In particular, the analysis focuses on one of the most influential and popular data mining methods, the k-means algorithm for cluster analysis. The straightforward parallel formulation of the k-means algorithm requires a global reduction operation at each iteration step, which hinders its scalability. This work studies a different parallel formulation of the algorithm where the requirement of global communication can be relaxed while still providing the exact solution of the centralised k-means algorithm. The proposed approach exploits a non-uniform data distribution which can be either found in real world distributed applications or can be induced by means of multi-dimensional binary search trees. The approach can also be extended to accommodate an approximation error which allows a further reduction of the communication costs.

An enhanced model for small-signal analysis of the phase-shifted full-bridge converter

This paper presents an in-depth critical discussion and derivation of a detailed small-signal analysis of the Phase-Shifted Full-Bridge (PSFB) converter. Circuit parasitics, resonant inductance and transformer turns ratio have all been taken into account in the evaluation of this topology’s open-loop control-to-output, line-to-output and load-to-output transfer functions. Accordingly, the significant impact of losses and resonant inductance on the converter’s transfer functions is highlighted. The enhanced dynamic model proposed in this paper enables the correct design of the converter compensator, including the effect of parasitics on the dynamic behavior of the PSFB converter. Detailed experimental results for a real-life 36V-to-14V/10A PSFB industrial application show excellent agreement with the predictions from the model proposed herein.1

Median architecture by accumulative parallel counters

The time to process each of W/B processing blocks of a median calculation method on a set of N W-bit integers is improved here by a factor of three compared to the literature. Parallelism uncovered in blocks containing B-bit slices are exploited by independent accumulative parallel counters so that the median is calculated faster than any known previous method for any N, W values. The improvements to the method are discussed in the context of calculating the median for a moving set of N integers for which a pipelined architecture is developed. An extra benefit of smaller area for the architecture is also reported.

Bridge-localized HOMO-binding character of divinylanthracene-bridged dinuclear ruthenium carbonyl complexes: spectroscopic, spectroelectrochemical, and computational studies

The electronic properties of four divinylanthracene-bridged diruthenium carbonyl complexes [{RuCl(CO)(PMe3)3}2(μ[BOND]CH[DOUBLE BOND]CHArCH[DOUBLE BOND]CH)] (Ar=9,10-anthracene (1), 1,5-anthracene (2), 2,6-anthracene (3), 1,8-anthracene (4)) obtained by molecular spectroscopic methods (IR, UV/Vis/near-IR, and EPR spectroscopy) and DFT calculations are reported. IR spectroelectrochemical studies have revealed that these complexes are first oxidized at the noninnocent bridging ligand, which is in line with the very small ν(C[TRIPLE BOND]O) wavenumber shift that accompanies this process and also supported by DFT calculations. Because of poor conjugation in complex 1, except oxidized 1+, the electronic absorption spectra of complexes 2+, 3+, and 4+ all display the characteristic near-IR band envelopes that have been deconvoluted into three Gaussian sub-bands. Two of the sub-bands belong mainly to metal-to-ligand charge-transfer (MLCT) transitions according to results from time-dependent DFT calculations. EPR spectroscopy of chemically generated 1+–4+ proves largely ligand-centered spin density, again in accordance with IR spectra and DFT calculations results.