A new, highly parallelized, adaptive mesh refinement (AMR) library, equipped with an accurate immersed boundary (IB) method for solving the compressible Navier-Stokes system is presented. The library, named ADAM, is designed to efficiently exploit modern exascale GPU-accelerated supercomputers and it is implemented with a highly modular structure in order to make easy to leverage it for a wide range of CFD applications.

In this work, we propose and explore a novel network-constraint survival methodology considering the Weibull accelerated failure time (AFT) model combined with a penalized likelihood approach for variable selection and estimation [2]. Our estimator explicitly incorporates the correlation patterns among predictors using a double penalty that promotes both sparsity and the grouping effect. In or- der to solve the structured sparse regression problems we present an efficient iterative computational algorithm based on proximal gradient descent method [1].

Exploiting the Infrared Atmospheric Sounder Interferometer (IASI) profiling capability for surface parameters, atmospheric temperature, and water vapour we have designed a new Water Deficit Index (wdi) to monitor drought and heatwaves. Because of climate change at a global level, drought is becoming a strong emergency also in countries which never experienced it, such as the Mediterranean mid-latitude area and, in particular, Italy. The last two years strongly affected the northern part of Italy, i.e. the Po Valley, causing high vegetation and soil water stress.

Overcomplete representations such as wavelets and windowed Fourier expansions have become mainstays of modern statistical data analysis. Here we derive expressions for the mean quadratic risk of shrinkage estimators in the context of general finite frames, which include any fullrank linear expansion of vector data in a finite-dimensional setting. We provide several new results and practical estimation procedures that take into account the geometric correlation structure of frame elements.

Machine learning (ML) is increasingly used in cognitive, computational and clinical neuroscience. The reliable and efficient application of ML requires a sound understanding of its subtleties and limitations. Training ML models on datasets with imbalanced classes is a particularly common problem, and it can have severe consequences if not adequately addressed.

The aim of this work was to characterize the palette and painting technique used for the realization of three late sixteenth century paintings from "Galleria dell'Accademia Nazionale di San Luca" in Rome attributed to Cavalier d'Arpino (Giuseppe Cesari), namely "Cattura di Cristo" (Inv. 158), "Autoritratto" (Inv. 546) and "Perseo e Andromeda" (Inv. 221).

Magnetoencephalography and electroencephalography (M/EEG) seed-based connectivity analysis typically requires regions of interest (ROI)-based extraction of measures. M/EEG ROI-derived source activity can be treated in different ways. For instance, it is possible to average each ROI's time series prior to calculating connectivity measures. Alternatively one can compute connectivity maps for each element of the ROI, prior to dimensionality reduction to obtain a single map. The impact of these different strategies on connectivity estimation is still unclear.

The IMAGO project aims to develop an innovative system that utilizes Multispectral Imaging and Augmented Reality (AR) techniques for studying and preserving cultural heritage.

Computer Vision and 3D printing have rapidly evolved in the last 10 years but interactions among them have been very limited so far, despite the fact that they share several mathematical techniques. We try to fill the gap presenting an overview of some techniques for Shape-from-Shading problems as well as for 3D printing with an emphasis on the approaches based on nonlinear partial differential equations and optimization. We also sketch possible couplings to complete the process of object manufacturing starting from one or more images of the object and ending with its final 3D print.