Error sensitive historical GIS: Identifying areal interpolation errors in time series data

Historical GIS has the potential to re-invigorate our use of statistics from historical censuses and related sources. In particular, areal interpolation can be used to create long-run time-series of spatially detailed data that will enable us to enhance significantly our understanding of geographical change over periods of a century or more. The difficulty with areal interpolation, however, is that the data that it generates are estimates which will inevitably contain some error. This paper describes a technique that allows the automated identification of possible errors at the level of the individual data values.

Video anomaly detection in real-time on a Power-Aware Heterogeneous Platform

FPGAs and GPUs are often used when real-time performance in video processing is required. An accelerated processor is chosen based on task-specific priorities (power consumption, processing time and detection accuracy), and this decision is normally made once at design time. All three characteristics are important, particularly in battery-powered systems. Here we propose a method for moving selection of processing platform from a single design-time choice to a continuous run time one.We implement Histogram of Oriented Gradients (HOG) detectors for cars and people and Mixture of Gaussians (MoG) motion detectors running across FPGA, GPU and CPU in a heterogeneous system. We use this to detect illegally parked vehicles in urban scenes. Power, time and accuracy information for each detector is characterised. An anomaly measure is assigned to each detected object based on its trajectory and location, when compared to learned contextual movement patterns. This drives processor and implementation selection, so that scenes with high behavioural anomalies are processed with faster but more power hungry implementations, but routine or static time periods are processed with power-optimised, less accurate, slower versions. Real-time performance is evaluated on video datasets including i-LIDS. Compared to power-optimised static selection, automatic dynamic implementation mapping is 10% more accurate but draws 12W extra power in our testbed desktop system.

Breaking the boundaries: Geographical approaches to integrating 200 years of the Census

The census and similar sources of data have been published for two centuries so the information that they contain should provide an unparalleled insight into the changing population of Britain over this time period. To date, however, the seemingly trivial problem of changes in boundaries has seriously hampered the use of these sources as they make it impossible to create long run time series of spatially detailed data. The paper reviews methodologies that attempt to resolve this problem by using geographical information systems and areal inter-polation to allow the reallocation of data from one set of administrative units onto another. This makes it possible to examine change over time for a standard geography and thus it becomes possible to unlock the spatial detail and the temporal depth that are held in the census and in related sources.

Probabilistic program analysis for parallelizing compilers

Parallelizing compilers have difficulty analysing and optimising complex code. To address this, some analysis may be delayed until run-time, and techniques such as speculative execution used. Furthermore, to enhance performance, a feedback loop may be setup between the compile time and run-time analysis systems, as in iterative compilation. To extend this, it is proposed that the run-time analysis collects information about the values of variables not already determined, and estimates a probability measure for the sampled values. These measures may be used to guide optimisations in further analyses of the program. To address the problem of variables with measures as values, this paper also presents an outline of a novel combination of previous probabilistic denotational semantics models, applied to a simple imperative language.

Design flow for efficient FPGA reconfiguration

In Run Time Reconfiguration (RTR) systems, the amount of reconfiguration is considerable when compared to the circuit changes implemented. This is because reconfiguration is not considered as part of the design flow. This paper presents a method for reconfigurable circuit design by modeling the underlying FPGA reconfigurable circuitry and taking it into consideration in the system design. This is demonstrated for an image processing example on the Xilinx Virtex FPGA.

Convergence acceleration of the doubly periodic Green's function for the analysis of thin wire arrays

A method is proposed to accelerate the evaluation of the Green's function of an infinite double periodic array of thin wire antennas. The method is based on the expansion of the Green's function into series corresponding to the propagating and evanescent waves and the use of Poisson and Kummer transformations enhanced with the analytic summation of the slowly convergent asymptotic terms. Unlike existing techniques the procedure reported here provides uniform convergence regardless of the geometrical parameters of the problem or plane wave excitation wavelength. In addition, it is numerically stable and does not require numerical integration or internal tuning parameters, since all necessary series are directly calculated in terms of analytical functions. This means that for nonlinear problem scenarios that the algorithm can be deployed without run time intervention or recursive adjustment within a harmonic balance engine. Numerical examples are provided to illustrate the efficiency and accuracy of the developed approach as compared with the Ewald method for which these classes of problems requires run time splitting parameter adaptation.

Rapid confirmatory method for the determination of sixteen synthetic growth promoters and bisphenol A in bovine milk using dispersive solid-phase extraction and liquid chromatography-tandem mass spectrometry

A rapid liquid chromatographic-tandem mass spectrometric (LC-MS/MS) multi-residue method for the simultaneous quantitation and identification of sixteen synthetic growth promoters and bisphenol A in bovine milk has been developed and validated. Sample preparation was straightforward, efficient and economically advantageous. Milk was extracted with acetonitrile followed by phase separation with NaCl. After centrifugation, the extract was purified by dispersive solid-phase extraction with C18 sorbent material. The compounds were analysed by reversed-phase LC-MS/MS using both positive and negative ionization and operated in multiple reaction monitoring (MRM) mode, acquiring two diagnostic product ions from each of the chosen precursor ions for unambiguous confirmation. Total chromatographic run time was less than 10 min for each sample. The method was validated at a level of 1 mu g L-1. A wide variety of deuterated internal standards were used to improve method performance. The accuracy and precision of the method were satisfactory for all analytes. The confirmative quantitative liquid chromatographic tandem mass spectrometric (LC-MS/MS) method was validated according to Commission Decision 2002/657/EC. The decision limit (CC alpha) and the detection capability (CC beta) were found to be below the chosen validation level of 1 mu g L-1 for all compounds. (C) 2010 Elsevier B.V. All rights reserved.

A Pipeline Interleaved Heterogeneous SIMD Soft Processor Array Architecture for MIMO-OFDM Detection

The most promising way to maintain reliable data transfer across the rapidly fluctuating channels used by next generation multiple-input multiple-output communications schemes is to exploit run-time variable modulation and antenna configurations. This demands that the baseband signal processing architectures employed in the communications terminals must provide low cost and high performance with runtime reconfigurability. We present a softcore-processor based solution to this issue, and show for the first time, that such programmable architectures can enable real-time data operation for cutting-edge standards
such as 802.11n; furthermore, by exploiting deep processing pipelines and interleaved task execution, the cost and performance of these architectures is shown to be on a par with traditional dedicated circuit based solutions. We believe this to be the first such programmable architecture to achieve this, and the combination of implementation efficiency and programmability makes this implementation style the most promising approach for hosting such dynamic architectures.

Characterisation of polyacetylenes isolated from carrot (Daucus carota) extracts by negative ion tandem mass spectrometry

The potential use of negative electrospray ionisation mass spectrometry (ESI-MS) in the characterisation of the three polyacetylenes common in carrots (Daucus carota) has been assessed. The MS scans have demonstrated that the polyacetylenes undergo a modest degree of in-source decomposition in the negative ionisation mode while the positive ionisation mode has shown predominantly sodiated ions and no [M+H](+) ions. Tandem mass spectrometric (MS/MS) studies have shown that the polyacetylenes follow two distinct fragmentation pathways: one that involves cleavage of the C3-C4 bond and the other with cleavage of the C7-C8 bond. The cleavage of the C7-C8 bond generated product ions m/z 105.0 for falcarinol, m/z 105/107.0 for falcarindiol, m/z 147.0/149.1 for falcarindiol-3-acetate. In addition to these product ions, the transitions m/z 243.2 -> 187.1 (falcarinol), m/z 259.2 -> 203.1 (falcarindiol), m/z 301.2 -> 255.2/203.1 (falcarindiol-3-acetate), mostly from the C3-C4 bond cleavage, can form the basis of multiple reaction monitoring (MRM)-quantitative methods which are poorly represented in the literature. The 'MS3' experimental data confirmed a less pronounced homolytic cleavage site between the C11-C12 bond in the falcarinol-type polacetylenes. The optimised liquid chromatography (LC)/MS conditions have achieved a baseline chromatographic separation of the three polyacetylenes investigated within 40 min total run-time. Copyright (C) 2011 John Wiley & Sons, Ltd.

Approximating the Set of Local Minima in Partial RNA Folding Landscapes

Motivation: We study a stochastic method for approximating the set of local minima in partial RNA folding landscapes associated with a bounded-distance neighbourhood of folding conformations. The conformations are limited to RNA secondary structures without pseudoknots. The method aims at exploring partial energy landscapes pL induced by folding simulations and their underlying neighbourhood relations. It combines an approximation of the number of local optima devised by Garnier and Kallel (2002) with a run-time estimation for identifying sets of local optima established by Reeves and Eremeev (2004).

Results: The method is tested on nine sequences of length between 50 nt and 400 nt, which allows us to compare the results with data generated by RNAsubopt and subsequent barrier tree calculations. On the nine sequences, the method captures on average 92% of local minima with settings designed for a target of 95%. The run-time of the heuristic can be estimated by O(n2D?ln?), where n is the sequence length, ? is the number of local minima in the partial landscape pL under consideration and D is the maximum number of steepest descent steps in attraction basins associated with pL.

Targeting heterogeneous architectures via macro data flow

We propose a data flow based run time system as an efficient tool for supporting execution of parallel code on heterogeneous architectures hosting both multicore CPUs and GPUs. We discuss how the proposed run time system may be the target of both structured parallel applications developed using algorithmic skeletons/parallel design patterns and also more "domain specific" programming models. Experimental results demonstrating the feasibility of the approach are presented. © 2012 World Scientific Publishing Company.