This paper presents a methodology to generate maps of atmosphere's precipitable water vapor (PWV) over large areas with a length of hundreds of kilometers and a width of about 250 km, based on the use of interferometric Sentinel-1A/BC-band synthetic aperture radar (SAR) data with a high spatial resolution of 5 x 20 m(2) and the revisiting time of six days. An algorithm to calibrate and merge PWV maps from different swaths of Sentinel-1 acquired along the same track, using global navigation satellite system (GNSS) measurements, is described.

This paper has two main objectives: one is to describe some extensions of an adaptive Algebraic Multigrid (AMG) method of the form previously proposed by the first and third authors, and a second one is to present a new software framework, named BootCMatch, which implements all the components needed to build and apply the described adaptive AMG both as stand-alone solver and as preconditioner in a Krylov method.

The rapid development of cyber insurance market brings for- ward the question about the effect of cyber insurance on cyber security. Some researchers believe that the effect should be positive as organisa- tions will be forced to maintain a high level of security in order to pay lower premiums. On the other hand, other researchers conduct a theo- retical analysis and demonstrate that availability of cyber insurance may result in lower investments in security. In this paper we propose a mathematical analysis of a cyber-insurance model in a non-competitive market.

The numerical solution of reaction-diffusion systems modelling predator-prey dynamics using implicit-symplectic (IMSP) schemes is relatively new. When applied to problems with chaotic dynamics they perform well, both in terms of computational effort and accuracy. However, until the current paper, a rigorous numerical analysis was lacking. We analyse the semi-discrete in time approximations of a first-order IMSP scheme applied to spatially extended predator-prey systems.

Well-balanced schemes, nowadays mostly developed for both hyperbolic and kinetic equations, are extended in order to handle linear parabolic equations, too. By considering the variational solution of the resulting stationary boundary-value problem, a simple criterion of uniqueness is singled out: the C1 regularity at all knots of the computational grid. Being easy to convert into a finite-difference scheme, a well-balanced discretization is deduced by defining the discrete time-derivative as the defect of C1 regularity at each node.

Given a population of N elements with their geographical positions and the genetic (or lexical) distances between couples of elements (inferred, for example, from lexical differences between dialects which are spoken in different towns or from genetic differences between animal populations living in different faunal areas) a very interesting problem is to reconstruct the geographical positions of individuals using only genetic/lexical distances.