Fingerprint Identification - New Directions

In most of the algorithms that have been suggested in this report, the fingerprint image is reduced to a relatively short sequence of integers. This reduces the memory size required by the database. Each algorithm is intended to exploit specific properties and features of the fingerprint that vary from finger to finger, and that can be localized relatively fast using digital techniques, thus also reducing the computational time requirements to a minimum. In each case, the sensitivity of the algorithm to small variations in the image was also discussed, with the aim of reducing the False Rejection Rate, and of increasing the general robustness of the algorithm

Parameter estimation for stochastic hybrid model applied to urban traffic flow estimation

This study proposes a novel data-based approach for estimating the parameters of a stochastic hybrid model describing the traffic flow in an urban traffic network with signalized intersections. The model represents the evolution of the traffic flow rate, measuring the number of vehicles passing a given location per time unit. This traffic flow rate is described using a mode-dependent first-order autoregressive (AR) stochastic process. The parameters of the AR process take different values depending on the mode of traffic operation – free flowing, congested or faulty – making this a hybrid stochastic process. Mode switching occurs according to a first-order Markov chain. This study proposes an expectation-maximization (EM) technique for estimating the transition matrix of this Markovian mode process and the parameters of the AR models for each mode. The technique is applied to actual traffic flow data from the city of Jakarta, Indonesia. The model thus obtained is validated by using the smoothed inference algorithms and an online particle filter. The authors also develop an EM parameter estimation that, in combination with a time-window shift technique, can be useful and practical for periodically updating the parameters of hybrid model leading to an adaptive traffic flow state estimator

ITERL: A Wireless Adaptive System for Efficient Road Lighting

This work presents the development and construction of an adaptive street lighting system that improves safety at intersections, which is the result of applying low-power Internet of Things (IoT) techniques to intelligent transportation systems. A set of wireless sensor nodes using the Institute of Electrical and Electronics Engineers (IEEE) 802.15.4 standard with additional internet protocol (IP) connectivity measures both ambient conditions and vehicle transit. These measurements are sent to a coordinator node that collects and passes them to a local controller, which then makes decisions leading to the streetlight being turned on and its illumination level controlled. Streetlights are autonomous, powered by photovoltaic energy, and wirelessly connected, achieving a high degree of energy efficiency. Relevant data are also sent to the highway conservation center, allowing it to maintain up-to-date information for the system, enabling preventive maintenance.Consejería de Fomento y Vivienda Junta de Andalucía G-GI3002 / IDIOFondo Europeo de Desarrollo Regional G-GI3002 / IDI

Time Quasilattices in Dissipative Dynamical Systems

We establish the existence of `time quasilattices' as stable trajectories in dissipative dynamical systems. These tilings of the time axis, with two unit cells of different durations, can be generated as cuts through a periodic lattice spanned by two orthogonal directions of time. We show that there are precisely two admissible time quasilattices, which we term the infinite Pell and Clapeyron words, reached by a generalization of the period-doubling cascade. Finite Pell and Clapeyron words of increasing length provide systematic periodic approximations to time quasilattices which can be verified experimentally. The results apply to all systems featuring the universal sequence of periodic windows. We provide examples of discrete-time maps, and periodically-driven continuous-time dynamical systems. We identify quantum many-body systems in which time quasilattices develop rigidity via the interaction of many degrees of freedom, thus constituting dissipative discrete `time quasicrystals'.Comment: 38 pages, 14 figures. This version incorporates "Pell and Clapeyron Words as Stable Trajectories in Dynamical Systems", arXiv:1707.09333. Submission to SciPos

Metric characterization of cluster dynamics on the Sierpinski gasket

We develop and implement an algorithm for the quantitative characterization of cluster dynamics occurring on cellular automata defined on an arbitrary structure. As a prototype for such systems we focus on the Ising model on a finite Sierpsinski Gasket, which is known to possess a complex thermodynamic behavior. Our algorithm requires the projection of evolving configurations into an appropriate partition space, where an information-based metrics (Rohlin distance) can be naturally defined and worked out in order to detect the changing and the stable components of clusters. The analysis highlights the existence of different temperature regimes according to the size and the rate of change of clusters. Such regimes are, in turn, related to the correlation length and the emerging "critical" fluctuations, in agreement with previous thermodynamic analysis, hence providing a non-trivial geometric description of the peculiar critical-like behavior exhibited by the system. Moreover, at high temperatures, we highlight the existence of different time scales controlling the evolution towards chaos.Comment: 20 pages, 8 figure

Post-critical set and non existence of preserved meromorphic two-forms

We present a family of birational transformations in $CP_2$ depending on two, or three, parameters which does not, generically, preserve meromorphic two-forms. With the introduction of the orbit of the critical set (vanishing condition of the Jacobian), also called ``post-critical set'', we get some new structures, some "non-analytic" two-form which reduce to meromorphic two-forms for particular subvarieties in the parameter space. On these subvarieties, the iterates of the critical set have a polynomial growth in the \emph{degrees of the parameters}, while one has an exponential growth out of these subspaces. The analysis of our birational transformation in $CP_2$ is first carried out using Diller-Favre criterion in order to find the complexity reduction of the mapping. The integrable cases are found. The identification between the complexity growth and the topological entropy is, one more time, verified. We perform plots of the post-critical set, as well as calculations of Lyapunov exponents for many orbits, confirming that generically no meromorphic two-form can be preserved for this mapping. These birational transformations in $CP_2$, which, generically, do not preserve any meromorphic two-form, are extremely similar to other birational transformations we previously studied, which do preserve meromorphic two-forms. We note that these two sets of birational transformations exhibit totally similar results as far as topological complexity is concerned, but drastically different results as far as a more ``probabilistic'' approach of dynamical systems is concerned (Lyapunov exponents). With these examples we see that the existence of a preserved meromorphic two-form explains most of the (numerical) discrepancy between the topological and probabilistic approach of dynamical systems.Comment: 34 pages, 7 figure