Scaling the iHMM: Parallelization versus Hadoop

This paper compares parallel and distributed implementations of an iterative, Gibbs sampling, machine learning algorithm. Distributed implementations run under Hadoop on facility computing clouds. The probabilistic model under study is the infinite HMM [1], in which parameters are learnt using an instance blocked Gibbs sampling, with a step consisting of a dynamic program. We apply this model to learn part-of-speech tags from newswire text in an unsupervised fashion. However our focus here is on runtime performance, as opposed to NLP-relevant scores, embodied by iteration duration, ease of development, deployment and debugging. © 2010 IEEE.

Infrared Magnitude-Redshift Relations for Luminous Radio Galaxies

Infrared magnitude-redshift relations for the 3CR and 6C samples of radio galaxies are presented for a wide range of plausible cosmological models, including those with non-zero cosmological constant OmegaLambda. Variations in the galaxy formation redshift, metallicity and star formation history are also considered. The results of the modelling are displayed in terms of magnitude differences between the models and no-evolution tracks, illustrating the amount of K-band evolution necessary to account for the observational data. Given a number of plausible assumptions, the results of these analyses suggest that: (i) cosmologies which predict T_0xH_0>1 (where T_0 denotes the current age of the universe) can be excluded; (ii) the star formation redshift should lie in the redshift interval 5massive) than those nearby in models with finite OmegaLambda, including the favoured model with Omega=0.3, OmegaLambda=0.7. For cosmological models with larger values of T_0xH_0, the conclusions are the same regardless of whether any adjustments are made or not. The implications of these results for cosmology and models of galaxy formation are discussed.

Adaptive BDDC in Three Dimensions

The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism provided by a multifrontal solver. Constraints are implemented by a projection and sparsity of the projected operator is preserved by a generalized change of variables. The effectiveness of the method is illustrated on several engineering problems.

BarraCUDA - a fast short read sequence aligner using graphics processing units.

BACKGROUND: With the maturation of next-generation DNA sequencing (NGS) technologies, the throughput of DNA sequencing reads has soared to over 600 gigabases from a single instrument run. General purpose computing on graphics processing units (GPGPU), extracts the computing power from hundreds of parallel stream processors within graphics processing cores and provides a cost-effective and energy efficient alternative to traditional high-performance computing (HPC) clusters. In this article, we describe the implementation of BarraCUDA, a GPGPU sequence alignment software that is based on BWA, to accelerate the alignment of sequencing reads generated by these instruments to a reference DNA sequence. FINDINGS: Using the NVIDIA Compute Unified Device Architecture (CUDA) software development environment, we ported the most computational-intensive alignment component of BWA to GPU to take advantage of the massive parallelism. As a result, BarraCUDA offers a magnitude of performance boost in alignment throughput when compared to a CPU core while delivering the same level of alignment fidelity. The software is also capable of supporting multiple CUDA devices in parallel to further accelerate the alignment throughput. CONCLUSIONS: BarraCUDA is designed to take advantage of the parallelism of GPU to accelerate the alignment of millions of sequencing reads generated by NGS instruments. By doing this, we could, at least in part streamline the current bioinformatics pipeline such that the wider scientific community could benefit from the sequencing technology.BarraCUDA is currently available from http://seqbarracuda.sf.net.

Extending noise robust structured support vector machines to larger vocabulary tasks

This paper describes a structured SVM framework suitable for noise-robust medium/large vocabulary speech recognition. Several theoretical and practical extensions to previous work on small vocabulary tasks are detailed. The joint feature space based on word models is extended to allow context-dependent triphone models to be used. By interpreting the structured SVM as a large margin log-linear model, illustrates that there is an implicit assumption that the prior of the discriminative parameter is a zero mean Gaussian. However, depending on the definition of likelihood feature space, a non-zero prior may be more appropriate. A general Gaussian prior is incorporated into the large margin training criterion in a form that allows the cutting plan algorithm to be directly applied. To further speed up the training process, 1-slack algorithm, caching competing hypothesis and parallelization strategies are also proposed. The performance of structured SVMs is evaluated on noise corrupted medium vocabulary speech recognition task: AURORA 4. © 2011 IEEE.

Controlling Sub-nm Gaps in Plasmonic Dimers using Graphene

Graphene is used as the thinnest possible spacer between gold nanoparticles and a gold substrate. This creates a robust, repeatable, and stable sub-nanometre gap for massive plasmonic field enhancements. White light spectroscopy of single 80 nm gold nanoparticles reveals plasmonic coupling between the particle and its image within the gold substrate. While for a single graphene layer, spectral doublets from coupled dimer modes are observed shifted into the near infra-red, these disappear for increasing numbers of layers. These doublets arise from plasmonic charge transfer, allowing the direct optical measurement of out-of-plane conductivity in such layered systems. Gating the graphene can thus directly produce plasmon tuning.

Vortex migration caused by travelling magnetic wave in a 2 in. diameter YBa2Cu3O7-δ thin film

We provide experimental evidence for a vortex migration phenomenon in YBa2Cu3O7-δ (YBCO) thin film caused by travelling magnetic wave. The experiment is carried out on a 2 in. diameter YBCO thin film with a circular-type magnetic flux pump. We found that the travelling wave helps the vortices migrate into the centre of the sample: after the zero-field cooling process, the increase of the flux density in the centre is four times larger than the amplitude of the travelling wave. The reason for this massive vortex migration is probably due to the magnetic stress variation caused by the travelling wave: the magnetic stress increases locally in the crest region while decreases locally in the trough region, which could help the vortices to move locally. A comparison shows that the magnetization by standing wave can be easily predicted by Bean's model while travelling wave causes vortex migration generally much larger than the prediction of Bean's model. It is possible that travelling magnetic wave can be an effective way to magnetize a type II superconductor in considering this unusual vortex dynamics. © 2013 AIP Publishing LLC.

Control of aircraft in the terminal manoeuvring area using parallelised sequential Monte Carlo

This paper reports on the use of a parallelised Model Predictive Control, Sequential Monte Carlo algorithm for solving the problem of conflict resolution and aircraft trajectory control in air traffic management specifically around the terminal manoeuvring area of an airport. The target problem is nonlinear, highly constrained, non-convex and uses a single decision-maker with multiple aircraft. The implementation includes a spatio-temporal wind model and rolling window simulations for realistic ongoing scenarios. The method is capable of handling arriving and departing aircraft simultaneously including some with very low fuel remaining. A novel flow field is proposed to smooth the approach trajectories for arriving aircraft and all trajectories are planned in three dimensions. Massive parallelisation of the algorithm allows solution speeds to approach those required for real-time use.