In a typical secure communication system, messages undergo two different encodings: an error-correcting code is applied at the physical layer to ensure correct reception by the addressee (integrity), while at an upper protocol layer cryptography is leveraged to enforce secrecy with respect to eavesdroppers (confidentiality).

Out-of-equilibrium relaxation processes show aging if they become slower as time passes. Aging processes are ubiquitous and play a fundamental role in the physics of glasses and spin glasses and in other applications (e.g., in algorithms minimizing complex cost/loss functions). The theory of aging in the out-of-equilibrium dynamics of mean-field spin glass models has achieved a fundamental role, thanks to the asymptotic analytic solution found by Cugliandolo and Kurchan.

A major neglected weakness of many ecological models is the numerical method used to solve the governing systems of differential equations. Indeed, the discrete dynamics described by numerical integrators can provide spurious solution of the corresponding continuous model. The approach represented by the geometric numerical integration, by preserving qualitative properties of the solution, leads to improved numerical behaviour expecially in the long-time integration.

This work presents a methodology for the short-term forecast of intense rainfall based on a neural network and the integration of Global Navigation and Positioning System (GNSS) and meteorological data. Precipitable water vapor (PWV) derived from GNSS is combined with surface pressure, surface temperature and relative humidity obtained continuously from a ground-based meteorological station. Five years of GNSS data from one station in Lisbon, Portugal, are processed. Data for precipitation forecast are also collected from the meteorological station.

Bandelt and Mulder's structural characterization of bipartite distance hereditary graphs 16 asserts that such graphs can be built inductively starting from a single vertex and by re- 17 peatedly adding either pendant vertices or twins (i.e., vertices with the same neighborhood 18 as an existing one). Dirac and Duffin's structural characterization of 2-connected series- 19 parallel graphs asserts that such graphs can be built inductively starting from a single edge 20 by adding either edges in series or in parallel.