Advantages and limits in the adoption of reproducible research and R-tools for the analysis of omic data

Reproducible (computational) Research is crucial to produce transparent and high quality scientific papers. First, we illustrate the benefits that scientific community can receive from the adoption of Reproducible Research standards in the analysis of high-throughput omic data. Then, we describe several tools useful to researchers to increase the reproducibility of their works. Moreover, we face the advantages and limits of reproducible research and how they could be addressed and solved.

Topological Singularities in Periodic Media: Ginzburg-Landau and Core-Radius Approaches

We describe the emergence of topological singularities in periodic media within the Ginzburg-Landau model and the core-radius approach. The energy functionals of both models are denoted by E, where ? represent the coherence length (in the Ginzburg-Landau model) or the core-radius size (in the core-radius approach) and ? denotes the periodicity scale. We carry out the ? -convergence analysis of E as ?-> 0 and ?= ?-> 0 in the | log ?| scaling regime, showing that the ? -limit consists in the energy cost of finitely many vortex-like point singularities of integer degree.

Mathematical formulations and metaheuristics comparison for the Push-Tree Problem

The Push-Tree Problem is a recently addressed optimization problem, with the aim to minimize the total amount of traffic generated on information broadcasting networks by a compromise between the use of "push" and "pull" mechanisms. That is, the push-tree problem can be seen as a mixture of building multicast trees with respect to nodes receiving pieces of information while further nodes may obtain information from the closest node within the tree by means of shortest paths. In this sense we are accounting for tradeoffs of push and pull mechanisms in information distribution.

Asymptotic analysis of Poisson shot noise processes, and applications

Poisson shot noise processes are natural generalizations of compound Poisson processes that have been widely applied in insurance, neuroscience, seismology, computer science and epidemiology. In this paper we study sharp deviations, fluctuations and the stable probability approximation of Poisson shot noise processes. Our achievements extend, improve and complement existing results in the literature. We apply the theoretical results to Poisson cluster point processes, including generalized linear Hawkes processes, and risk processes with delayed claims. Many examples are discussed in detail.

Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem

Given a graph G with a label (color) assigned to each edge (not necessarily properly) we look for an hamiltonian cycle of G with the minimum number of different colors. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity or other properties by means of limited number of different connections. We analyze the complexity of the problem on special graph classes and propose, for the general case, heuristic resolution algorithms.

EULER EQUATIONS AND TRACE PROPERTIES OF MINIMIZERS OF A FUNCTIONAL FOR MOTION COMPENSATED INPAINTING

We compute the Euler equations of a functional useful for simultaneous video inpainting and motion estimation, which was obtained in [17] as the relaxation of a modified version of the functional proposed in [16]. The functional is defined on vectorial functions of bounded variations, therefore we also get the Euler equations holding on the singular sets of minimizers, highlighting in particular the conditions on the jump sets.

Towards EXtreme scale technologies and accelerators for euROhpc hw/Sw supercomputing applications for exascale: The TEXTAROSSA approach

In the near future, Exascale systems will need to bridge three technology gaps to achieve high performance while remaining under tight power constraints: energy efficiency and thermal control; extreme computation efficiency via HW acceleration and new arithmetic; methods and tools for seamless integration of reconfigurable accelerators in heterogeneous HPC multi-node platforms. TEXTAROSSA addresses these gaps through a co-design approach to heterogeneous HPC solutions, supported by the integration and extension of HW and SW IPs, programming models, and tools derived from European research.