An Algebraic Framework for the Real-Time Solution of Inverse Problems on Embedded Systems

This article presents a new approach to the real-time solution of inverse problems on embedded systems. The class of problems addressed corresponds to ordinary differential equations (ODEs) with generalized linear constraints, whereby the data from an array of sensors forms the forcing function. The solution of the equation is formulated as a least squares (LS) problem with linear constraints. The LS approach makes the method suitable for the explicit solution of inverse problems where the forcing function is perturbed by noise. The algebraic computation is partitioned into a initial preparatory step, which precomputes the matrices required for the run-time computation; and the cyclic run-time computation, which is repeated with each acquisition of sensor data. The cyclic computation consists of a single matrix-vector multiplication, in this manner computation complexity is known a-priori, fulfilling the definition of a real-time computation. Numerical testing of the new method is presented on perturbed as well as unperturbed problems; the results are compared with known analytic solutions and solutions acquired from state-of-the-art implicit solvers. The solution is implemented with model based design and uses only fundamental linear algebra; consequently, this approach supports automatic code generation for deployment on embedded systems. The targeting concept was tested via software- and processor-in-the-loop verification on two systems with different processor architectures. Finally, the method was tested on a laboratory prototype with real measurement data for the monitoring of flexible structures. The problem solved is: the real-time overconstrained reconstruction of a curve from measured gradients. Such systems are commonly encountered in the monitoring of structures and/or ground subsidence.Comment: 24 pages, journal articl

Reducing orbital eccentricity in binary black hole simulations

Binary black hole simulations starting from quasi-circular (i.e., zero radial velocity) initial data have orbits with small but non-zero orbital eccentricities. In this paper the quasi-equilibrium initial-data method is extended to allow non-zero radial velocities to be specified in binary black hole initial data. New low-eccentricity initial data are obtained by adjusting the orbital frequency and radial velocities to minimize the orbital eccentricity, and the resulting ($\sim 5$ orbit) evolutions are compared with those of quasi-circular initial data. Evolutions of the quasi-circular data clearly show eccentric orbits, with eccentricity that decays over time. The precise decay rate depends on the definition of eccentricity; if defined in terms of variations in the orbital frequency, the decay rate agrees well with the prediction of Peters (1964). The gravitational waveforms, which contain $\sim 8$ cycles in the dominant l=m=2 mode, are largely unaffected by the eccentricity of the quasi-circular initial data. The overlap between the dominant mode in the quasi-circular evolution and the same mode in the low-eccentricity evolution is about 0.99.Comment: 27 pages, 9 figures; various minor clarifications; accepted to the "New Frontiers" special issue of CQ

Numerical Relativity: A review

Computer simulations are enabling researchers to investigate systems which are extremely difficult to handle analytically. In the particular case of General Relativity, numerical models have proved extremely valuable for investigations of strong field scenarios and been crucial to reveal unexpected phenomena. Considerable efforts are being spent to simulate astrophysically relevant simulations, understand different aspects of the theory and even provide insights in the search for a quantum theory of gravity. In the present article I review the present status of the field of Numerical Relativity, describe the techniques most commonly used and discuss open problems and (some) future prospects.Comment: 2 References added; 1 corrected. 67 pages. To appear in Classical and Quantum Gravity. (uses iopart.cls

Characteristic Evolution and Matching

I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress in characteristic evolution is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to extend such simulations to null infinity where the waveform from the binary inspiral and merger can be unambiguously computed. This has now been accomplished by Cauchy-characteristic extraction, where data for the characteristic evolution is supplied by Cauchy data on an extraction worldtube inside the artificial outer boundary. The ultimate application of characteristic evolution is to eliminate the role of this outer boundary by constructing a global solution via Cauchy-characteristic matching. Progress in this direction is discussed.Comment: New version to appear in Living Reviews 2012. arXiv admin note: updated version of arXiv:gr-qc/050809

Online Tensor Methods for Learning Latent Variable Models

We introduce an online tensor decomposition based approach for two latent variable modeling problems namely, (1) community detection, in which we learn the latent communities that the social actors in social networks belong to, and (2) topic modeling, in which we infer hidden topics of text articles. We consider decomposition of moment tensors using stochastic gradient descent. We conduct optimization of multilinear operations in SGD and avoid directly forming the tensors, to save computational and storage costs. We present optimized algorithm in two platforms. Our GPU-based implementation exploits the parallelism of SIMD architectures to allow for maximum speed-up by a careful optimization of storage and data transfer, whereas our CPU-based implementation uses efficient sparse matrix computations and is suitable for large sparse datasets. For the community detection problem, we demonstrate accuracy and computational efficiency on Facebook, Yelp and DBLP datasets, and for the topic modeling problem, we also demonstrate good performance on the New York Times dataset. We compare our results to the state-of-the-art algorithms such as the variational method, and report a gain of accuracy and a gain of several orders of magnitude in the execution time.Comment: JMLR 201

A survey of digital television broadcast transmission techniques

This paper is a survey of the transmission techniques used in digital television (TV) standards worldwide. With the increase in the demand for High-Definition (HD) TV, video-on-demand and mobile TV services, there was a real need for more bandwidth-efficient, flawless and crisp video quality, which motivated the migration from analogue to digital broadcasting. In this paper we present a brief history of the development of TV and then we survey the transmission technology used in different digital terrestrial, satellite, cable and mobile TV standards in different parts of the world. First, we present the Digital Video Broadcasting standards developed in Europe for terrestrial (DVB-T/T2), for satellite (DVB-S/S2), for cable (DVB-C) and for hand-held transmission (DVB-H). We then describe the Advanced Television System Committee standards developed in the USA both for terrestrial (ATSC) and for hand-held transmission (ATSC-M/H). We continue by describing the Integrated Services Digital Broadcasting standards developed in Japan for Terrestrial (ISDB-T) and Satellite (ISDB-S) transmission and then present the International System for Digital Television (ISDTV), which was developed in Brazil by adopteding the ISDB-T physical layer architecture. Following the ISDTV, we describe the Digital Terrestrial television Multimedia Broadcast (DTMB) standard developed in China. Finally, as a design example, we highlight the physical layer implementation of the DVB-T2 standar

Revisiting Event Horizon Finders

Event horizons are the defining physical features of black hole spacetimes, and are of considerable interest in studying black hole dynamics. Here, we reconsider three techniques to localise event horizons in numerical spacetimes: integrating geodesics, integrating a surface, and integrating a level-set of surfaces over a volume. We implement the first two techniques and find that straightforward integration of geodesics backward in time to be most robust. We find that the exponential rate of approach of a null surface towards the event horizon of a spinning black hole equals the surface gravity of the black hole. In head-on mergers we are able to track quasi-normal ringing of the merged black hole through seven oscillations, covering a dynamic range of about 10^5. Both at late times (when the final black hole has settled down) and at early times (before the merger), the apparent horizon is found to be an excellent approximation of the event horizon. In the head-on binary black hole merger, only {\em some} of the future null generators of the horizon are found to start from past null infinity; the others approach the event horizons of the individual black holes at times far before merger.Comment: 30 pages, 15 figures, revision

Advanced engineering - Supporting research and technology

Telemetry simulations, radar equipment and experiments, and related supporting research for Deep Space Networ