
Inverting the Fundamental Diagram and Forecasting Boundary Conditions: How Machine Learning Can Improve Macroscopic Models for Traffic Flow
In this paper, we aim at developing new methods to join machine learning techniques and macroscopic
differential models for vehicular traffic estimation and forecast. It is well known that data-driven and model-
driven approaches have (sometimes complementary) advantages and drawbacks. We consider here a dataset
with flux and velocity data of vehicles moving on a highway, collected by fixed sensors and classified by
lane and by class of vehicle.
A hybrid modified-NSGA-II VNS algorithm for the Multi-Objective Critical Disruption Path Problem
This paper considers a Multiple Objective variant of the Critical Disruption Path problem to extend its
suitability in a range of security operations relying on path-based network interdiction, including flight pattern
optimisation for surveillance.
Simultaneous non-parametric regression in RADWT dictionaries
A new technique for nonparametric regression of multichannel signals is presented. The technique is based on the use of the Rational-Dilation Wavelet Transform (RADWT), equipped with a tunable Q-factor able to provide sparse representations of functions with different oscillations persistence. In particular, two different frames are obtained by two RADWT with different Q-factors that give sparse representations of functions with low and high resonance.
Segment Routing v6 - Security Issues and Experimental Results
SRv6 can provide hybrid cooperation between a centralized network controller and network nodes. IPv6 routers maintain
multi-hop ECMP-aware segments, whereas the controller establishes a source-routed path through the network. Since the
state of the flow is defined at the ingress to the network and then is contained in a specific packet header, called Segment
Routing Header (SRH), the importance of such a header itself is vital. Motivated by the need to study and investigate this
technology, this paper discusses some security-related issues of Segment Routing.
A network-constrain Weibull AFT model based on proximal gradient descent method
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 Abstract Calculus Pattern for the Integration of Ordinary Differential Equations for Dynamics Systems: An Object-Oriented Programming Approach in Modern Fortran
This manuscript relates to the exploiting of the abstract calculus pattern (ACP) for the (numerical) solution of ordinary differential equation (ODEs) systems, which are ubiquitous mathematical formulations of many physical (dynamical) phenomena. We present FOODIE, a software suite aimed to numerically solve ODE problems by means of a clear, concise, and efficient abstract interface.
On the hydrostatic limit of stably stratified fluids with isopycnal diffusivity.
This article is concerned with the rigorous justification of the hydrostatic limit for continuously
stratified incompressible fluids under the influence of gravity.
The main peculiarity of this work with respect to previous studies is that no (regularizing) viscosity contribution
is added to the fluid-dynamics equations and only diffusivity effects are included.
Solution of the EEG inverse problem by random dipole sampling
Abstract. Electroencephalography (EEG) source imaging aims to reconstruct brain
activity maps from the neuroelectric potential difference measured on the skull. To
obtain the brain activity map, we need to solve an ill-posed and ill-conditioned
inverse problem that requires regularization techniques to make the solution viable.
When dealing with real-time applications, dimensionality reduction techniques can be
used to reduce the computational load required to evaluate the numerical solution
of the EEG inverse problem.





