Constraining Horava-Lifshitz gravity from neutrino speed experiments

We constrain Horava-Lifshitz gravity using the results of OPERA and ICARUS neutrino speed experiments, which show that neutrinos are luminal particles, examining the fermion propagation in the earth's gravitational field. In particular, investigating the Dirac equation in the spherical solutions of the theory, we find that the neutrinos feel an effective metric with respect to which they might propagate superluminally. Therefore, demanding not to have superluminal or subluminal motion we constrain the parameters of the theory. Although the excluded parameter regions are very narrow, we find that the detailed balance case lies in the excluded region.Comment: 5 pages, no figure, version published at Gen.Rel.Gra

Gravity's Rainbow: a bridge towards Horava-Lifshitz gravity

We investigate the connection between Gravity's Rainbow and Horava-Lifshitz gravity, since both theories incorporate a modification in the UltraViolet regime which improves their quantum behavior at the cost of the Lorentz invariance loss. In particular, extracting the Wheeler-De Witt equations of the two theories in the case of Friedmann-Lemaitre-Robertson-Walker and spherically symmetric geometries, we establish a correspondence that bridges them.Comment: 20 page

Phantom without ghost

The Nine-Year WMAP results combined with other cosmological data seem to indicate an enhanced favor for the phantom regime, comparing to previous analyses. This behavior, unless reversed by future observational data, suggests to consider the phantom regime more thoroughly. In this work we provide three modified gravitational scenarios in which we obtain the phantom realization without the appearance of ghosts degrees of freedom, which plague the naive approaches on the subject, namely the Brans-Dicke type gravity, the scalar-Einstein-Gauss-Bonnet gravity, and the $F(R)$ gravity, which are moreover free of perturbative instabilities. The phantom regime seems to favor the gravitational modification instead of the universe-content alteration.Comment: LaTeX 7 pages, version published in Astrophys.Space Sc

Dynamics of the anisotropic Kantowsky-Sachs geometries in RnR^n gravity

We construct general anisotropic cosmological scenarios governed by an $f(R)$ gravitational sector. Focusing then on Kantowski-Sachs geometries in the case of $R^n$-gravity, and modelling the matter content as a perfect fluid, we perform a detailed phase-space analysis. We find that at late times the universe can result to a state of accelerating expansion, and additionally, for a particular $n$-range ($2<n<3$) it exhibits phantom behavior. Furthermore, isotropization has been achieved independently of the initial anisotropy degree, showing in a natural way why the observable universe is so homogeneous and isotropic, without relying on a cosmic no-hair theorem. Moreover, contracting solutions have also a large probability to be the late-time states of the universe. Finally, we can also obtain the realization of the cosmological bounce and turnaround, as well as of cyclic cosmology. These features indicate that anisotropic geometries in modified gravitational frameworks present radically different cosmological behaviors comparing to the simple isotropic scenarios.Comment: 18 pages, 3 figures. Revised and updated versio

A Pattern Language for High-Performance Computing Resilience

High-performance computing systems (HPC) provide powerful capabilities for modeling, simulation, and data analytics for a broad class of computational problems. They enable extreme performance of the order of quadrillion floating-point arithmetic calculations per second by aggregating the power of millions of compute, memory, networking and storage components. With the rapidly growing scale and complexity of HPC systems for achieving even greater performance, ensuring their reliable operation in the face of system degradations and failures is a critical challenge. System fault events often lead the scientific applications to produce incorrect results, or may even cause their untimely termination. The sheer number of components in modern extreme-scale HPC systems and the complex interactions and dependencies among the hardware and software components, the applications, and the physical environment makes the design of practical solutions that support fault resilience a complex undertaking. To manage this complexity, we developed a methodology for designing HPC resilience solutions using design patterns. We codified the well-known techniques for handling faults, errors and failures that have been devised, applied and improved upon over the past three decades in the form of design patterns. In this paper, we present a pattern language to enable a structured approach to the development of HPC resilience solutions. The pattern language reveals the relations among the resilience patterns and provides the means to explore alternative techniques for handling a specific fault model that may have different efficiency and complexity characteristics. Using the pattern language enables the design and implementation of comprehensive resilience solutions as a set of interconnected resilience patterns that can be instantiated across layers of the system stack.Comment: Proceedings of the 22nd European Conference on Pattern Languages of Program