During the course of an epidemic, one most challenging tasks for authorities is to decide what kind restrictive measures introduce and when these should be enforced. In order take informed decisions in a fully rational manner, onset critical regime, characterized by exponential growth contagion, must identified as quickly possible. Providing rigorous quantitative tools detect such represents im...

Page’s test is a well-known statistical technique to approach quickest detection problems, namely the detection of an abrupt change in the statistical distribution of a certain monitored phenomenon. Running consensus is a recently proposed signal processing procedure aimed at reaching agreement among the nodes of a fully flat network, and its peculiar feature is the simultaneity of two stages: ...

Advances in technology equip tra c domain with instruments to gather and analyze data for safe and fuele cient traveling. This article elaborates on the e↵ects from taxi drivers route selection on fuel e ciency. We fuse real driving behavior data from taxi cabs, weather, and digital map information for fuel consumption prediction. That way we compare actually driven trips and their quickest and...

In this article, the historical study from Carathéodory-Zermelo about computing quickest nautical path is generalized to Zermelo navigation problems on surfaces of revolution, in frame geometric optimal control. Using Maximum Principle, we present two methods dedicated analyzing geodesic flow and compute conjugate cut loci. We apply these calculations investigate case studies related applicatio...

Based on extensive pre-clinical achievements over the past decades, it appears to be due time for a successful clinical translation in the renal fibrosis field-but what is the quickest road to get there? In light of the recent launch of the Precision Medicine Initiative and success of molecularly informed drugs in oncology, we here discuss what it may take to bring molecularly targeted anti-fib...

Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several basic ingredients. However, not all of those ingredients have been analyzed in a dynamic scenario where edge weights change after preprocessing. In this work, we present how one of those ingredients, i.e., Arc-Flags can be app...