Abstract
Machine Learning is a field in which significant steps forward have been taken in the last years, resulting in a wide variety of available algorithms, for many different problems. Nonetheless, most of these algorithms focus on the training of static models, in the sense that the model stops evolving after the training phase. This is increasingly becoming a limitation, especially in an era in which datasets are increasingly larger and may even arrive as sequential streams of data. Frequently retraining a model, in these scenarios, is not realistic. In this paper we propose evoRF: a combination of a Random Forest with an evolutionary approach. Its key innovative aspect is the evolution of the weights of the Random Forest over time, as new data arrives, thus making the forest's voting scheme adapt to the new data. Older trees can also be replaced by newly trained ones, according to their accuracy, ensuring that the ensemble remains up to date without requiring a whole retraining.

Abstract
Cardiovascular variability is the result of the activity of several physiological control mechanisms, which involve different variables and operate across multiple time scales encompassing short term dynamics and long range correlations. This study presents a new approach to assess the multiscale complexity of multivariate time series, based on linear parametric models incorporating autoregressive coefficients and fractional integration. The approach extends to the multivariate case recent works introducing a linear parametric representation of multiscale entropy, and is exploited to assess the complexity of cardiovascular and respiratory time series in healthy subjects studied during postural and mental stress.

Abstract
People that do not have access to the transport system and therefore, a facilitated access to goods and services essential to daily life, can be regarded as transport-related social excluded. This is a big issue, namely for groups of people that have physical, sensorial and/or cognitive limitations. This paper provides guidelines to design route planners for socially excluded groups, by promoting social inclusion in public transportation. For this purpose, a set of mock-up user-interfaces of an inclusive inter-modal route planning application were developed. These interfaces will deliver ready availability of information about infrastructures and other journey related data.

Abstract
Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recursive packing of rings into other rings. This problem is known as the Recursive Circle Packing Problem (RCPP). We present the first dedicated method for solving RCPP that provides strong dual bounds based on an exact Dantzig-Wolfe reformulation of a nonconvex mixed-integer nonlinear programming formulation. The key idea of this reformulation is to break symmetry on each recursion level by enumerating one-level packings, i.e., packings of circles into other circles, and by dynamically generating packings of circles into rectangles. We use column generation techniques to design a "price-and-verify" algorithm that solves this reformulation to global optimality. Extensive computational experiments on a large test set show that our method not only computes tight dual bounds, but often produces primal solutions better than those computed by heuristics from the literature.

Abstract

Abstract
This paper reports numerical experiments done on a two-parameter family of vector fields which unfold an attracting heteroclinic cycle linking two saddle-foci. We investigated both local and global bifurcations due to symmetry breaking in order to detect either hyperbolic or chaotic dynamics. Although a complete understanding of the corresponding bifurcation diagram and the mechanisms underlying the dynamical changes is still out of reach, using a combination of theoretical tools and computer simulations we have uncovered some complex patterns. We have selected suitable initial conditions to analyze the bifurcation diagrams, and regarding these solutions we have located: (a) an open domain of parameters with regular dynamics; (b) infinitely many parabolic-type curves associated to homoclinic Shilnikov cycles which act as organizing centers; (c) a crisis region related to the destruction or creation of chaotic attractors; (d) a large Lebesgue measure set of parameters where chaotic regimes are dominant, though sinks and chaotic attractors may coexist, and in whose complement we observe shrimps.