Physics, Astrophysics and Cosmology with Gravitational Waves

Gravitational wave detectors are already operating at interesting sensitivity levels, and they have an upgrade path that should result in secure detections by 2014. We review the physics of gravitational waves, how they interact with detectors (bars and interferometers), and how these detectors operate. We study the most likely sources of gravitational waves and review the data analysis methods that are used to extract their signals from detector noise. Then we consider the consequences of gravitational wave detections and observations for physics, astrophysics, and cosmology.Comment: 137 pages, 16 figures, Published version <http://www.livingreviews.org/lrr-2009-2

Canagliflozin and Renal Outcomes in Type 2 Diabetes and Nephropathy

BACKGROUND Type 2 diabetes mellitus is the leading cause of kidney failure worldwide, but few effective long-term treatments are available. In cardiovascular trials of inhibitors of sodium–glucose cotransporter 2 (SGLT2), exploratory results have suggested that such drugs may improve renal outcomes in patients with type 2 diabetes. METHODS In this double-blind, randomized trial, we assigned patients with type 2 diabetes and albuminuric chronic kidney disease to receive canagliflozin, an oral SGLT2 inhibitor, at a dose of 100 mg daily or placebo. All the patients had an estimated glomerular filtration rate (GFR) of 30 to 300 to 5000) and were treated with renin–angiotensin system blockade. The primary outcome was a composite of end-stage kidney disease (dialysis, transplantation, or a sustained estimated GFR of <15 ml per minute per 1.73 m 2), a doubling of the serum creatinine level, or death from renal or cardiovascular causes. Prespecified secondary outcomes were tested hierarchically. RESULTS The trial was stopped early after a planned interim analysis on the recommendation of the data and safety monitoring committee. At that time, 4401 patients had undergone randomization, with a median follow-up of 2.62 years. The relative risk of the primary outcome was 30% lower in the canagliflozin group than in the placebo group, with event rates of 43.2 and 61.2 per 1000 patient-years, respectively (hazard ratio, 0.70; 95% confidence interval [CI], 0.59 to 0.82; P=0.00001). The relative risk of the renal-specific composite of end-stage kidney disease, a doubling of the creatinine level, or death from renal causes was lower by 34% (hazard ratio, 0.66; 95% CI, 0.53 to 0.81; P<0.001), and the relative risk of end-stage kidney disease was lower by 32% (hazard ratio, 0.68; 95% CI, 0.54 to 0.86; P=0.002). The canagliflozin group also had a lower risk of cardiovascular death, myocardial infarction, or stroke (hazard ratio, 0.80; 95% CI, 0.67 to 0.95; P=0.01) and hospitalization for heart failure (hazard ratio, 0.61; 95% CI, 0.47 to 0.80; P<0.001). There were no significant differences in rates of amputation or fracture. CONCLUSIONS In patients with type 2 diabetes and kidney disease, the risk of kidney failure and cardiovascular events was lower in the canagliflozin group than in the placebo group at a median follow-up of 2.62 years

Beam-induced and cosmic-ray backgrounds observed in the ATLAS detector during the LHC 2012 proton-proton running period

This paper discusses various observations on beam-induced and cosmic-ray backgrounds in the ATLAS detector during the LHC 2012 proton-proton run. Building on published results based on 2011 data, the correlations between background and residual pressure of the beam vacuum are revisited. Ghost charge evolution over 2012 and its role for backgrounds are evaluated. New methods to monitor ghost charge with beam-gas rates are presented and observations of LHC abort gap population by ghost charge are discussed in detail. Fake jets from colliding bunches and from ghost charge are analysed with improved methods, showing that ghost charge in individual radio-frequency buckets of the LHC can be resolved. Some results of two short periods of dedicated cosmic-ray background data-taking are shown; in particular cosmic-ray muon induced fake jet rates are compared to Monte Carlo simulations and to the fake jet rates from beam background. A thorough analysis of a particular LHC fill, where abnormally high background was observed, is presented. Correlations between backgrounds and beam intensity losses in special fills with very high β* are studied

Beam-induced and cosmic-ray backgrounds observed in the ATLAS detector during the LHC 2012 proton-proton running period

This paper discusses various observations on beam-induced and cosmic-ray backgrounds in the ATLAS detector during the LHC 2012 proton-proton run. Building on published results based on 2011 data, the correlations between background and residual pressure of the beam vacuum are revisited. Ghost charge evolution over 2012 and its role for backgrounds are evaluated. New methods to monitor ghost charge with beam-gas rates are presented and observations of LHC abort gap population by ghost charge are discussed in detail. Fake jets from colliding bunches and from ghost charge are analysed with improved methods, showing that ghost charge in individual radio-frequency buckets of the LHC can be resolved. Some results of two short periods of dedicated cosmic-ray background data-taking are shown; in particular cosmic-ray muon induced fake jet rates are compared to Monte Carlo simulations and to the fake jet rates from beam background. A thorough analysis of a particular LHC fill, where abnormally high background was observed, is presented. Correlations between backgrounds and beam intensity losses in special fills with very high β∗ are studied

A new recursive incremental algorithm for building minimal acyclic deterministic finite automata

This chapter presents a new algorithm for incrementally building minimal acyclic deterministic finite automata. Such minimal automata are a compact representation of a finite set of words (e.g. in a spell checker). The incremental aspect of such algorithms (where the intermediate automaton is minimal) facilitates the construction of very large automata in limited computer memory where other (nonincremental) algorithms would fail with intermediate data structures too large to fit in memory

A framework for the dynamic implementation of finite automata for performance enhancement

The aim of this work is to provide a model for the dynamic implementation of finite automata for enhanced performance. Investigations have shown that hardcoded finite automata outperforms the traditional table-driven implementation up to some threshold. Moreover, the kind of string being recognized plays a major role in the overall processing speed of the string recognizer. Various experiments are depicted to show when the advantages of using hardcoding as basis for implementing finite automata (instead of using the classical table-driven approach) become manifest. The model, a dynamic algorithm that combines both hardcoding and table-driven is introduced

Workshop on advances in knowledge extraction and re-engineering of software (selected and extended papers from WAKERS 2017)

The Workshop on Advances in Knowledge Extraction and Re-engineering of Software (WAKERS) was held at the Stellenbosch Institute for Advanced Studies (STIAS) in Stellenbosch, South Africa from January 23rd until January 26th, 2017. The workshop was specifically designed to bring together researchers and practitioners from the software reengineering and knowledge extraction communities in order to foster collaboration between these research communities

Efficient representation of DNA data for pattern recognition using failure factor oracles

\u3cp\u3eIn indexing of and pattern matching on DNA sequences, representing all factors of a sequence is important. One efficient, compact representation is the factor oracle (FO). At the same time, any classical deterministic finite automata (DFA) can be transformed to a so-called failure one (FDFA), which may use failure transitions to replace multiple symbol transitions, potentially yielding a more compact representation. We combine the two ideas and directly construct a failure factor oracle (FFO) from a given sequence, in contrast to ex post facto transformation to an FDFA. The algorithm is suitable for long sequences. We empirically compared the resulting FFOs and FOs on number of transitions for many DNA sequences of lengths 4• 512, showing gains of up to 10%in total number of transitions, with failure transitions also taking up less space than symbol transitions. Preliminary results on sequence processing runtimes when using FFOs originally showed these to be multiples of those when using FOs, but partial memoization already leads to drastic improvements. Altogether the results are promising, particularly for the use of FFOs for (repeated) factor detection, where recognition speed may be less important than memory use.\u3c/p\u3