Francis Tiausas

Francis Tiausas

Auto-generated profile, based on publicly available information

Francis Tiausas

ICT Testbed Research and Development Promotion Center, NICT, Tokyo, Japan

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 October 2023 in ACM Transactions on Cyber-Physical Systems
Verified
Journal Article
Open access
FTFrancis Tiausas
Francis Tiausas
KYKeiichi Yasumoto
Keiichi Yasumoto
JTJose Paolo Talusan
Jose Paolo Talusan
HYHayato Yamana
Hayato Yamana
HYHirozumi Yamaguchi
Hirozumi Yamaguchi
SSajal K. Das
Sajal K. Das
Route Planning Systems (RPS) are a core component of autonomous personal transport systems essential for safe and efficient navigation of dynamic urban environments with the support of edge-based smart city infrastructure, but they also raise concerns about user route privacy in the context of both privately owned and commercial vehicles. Numerous high-profile data breaches in recent years have fortunately motivated research on privacy-preserving RPS, but most of them are rendered impractical by greatly increased communication and processing overhead. We address this by proposing an approach called Hierarchical Privacy-Preserving Route Planning (HPRoP), which divides and distributes the route-planning task across multiple levels and protects locations along the entire route. This is done by combining Inertial Flow partitioning, Private Information Retrieval (PIR), and Edge Computing techniques with our novel route-planning heuristic algorithm. Normalized metrics were also formulated to quantify the privacy of the source/destination points ( endpoint location privacy ) and the route itself ( route privacy ). Evaluation on a simulated road network showed that HPRoP reliably produces routes differing only by ≤ 20% in length from optimal shortest paths, with completion times within ∼ 25 seconds, which is reasonable for a PIR-based approach. On top of this, more than half of the produced routes achieved near-optimal endpoint location privacy (∼ 1.0) and good route privacy (≥ 0.8).

30 April 2024 in ACM Transactions on Cyber-Physical Systems
Verified
Journal Article
Open access
MIMohammad Jaminur Islam
Mohammad Jaminur Islam
JTJose Paolo Talusan
Jose Paolo Talusan
SBShameek Bhattacharjee
Shameek Bhattacharjee
FTFrancis Tiausas
Francis Tiausas
Abhishek DubeyAbhishek Dubey
Abhishek Dubey
SSajal K. Das
Sajal K. Das
Modern smart cities need smart transportation solutions to quickly detect various traffic emergencies and incidents in the city to avoid cascading traffic disruptions. To materialize this, roadside units and ambient transportation sensors are being deployed to collect speed data that enables the monitoring of traffic conditions on each road segment. In this article, we first propose a scalable data-driven anomaly-based traffic incident detection framework for a city-scale smart transportation system. Specifically, we propose an incremental region growing approximation algorithm for optimal Spatio-temporal clustering of road segments and their data; such that road segments are strategically divided into highly correlated clusters. The highly correlated clusters enable identifying a Pythagorean Mean-based invariant as an anomaly detection metric that is highly stable under no incidents but shows a deviation in the presence of incidents. We learn the bounds of the invariants in a robust manner such that anomaly detection can generalize to unseen events, even when learning from real noisy data. Second, using cluster-level detection, we propose a folded Gaussian classifier to pinpoint the particular segment in a cluster where the incident happened in an automated manner. We perform extensive experimental validation using mobility data collected from four cities in Tennessee and compare with the state-of-the-art ML methods to prove that our method can detect incidents within each cluster in real-time and outperforms known ML methods.

4 January 2026
Verified
Conference Paper
Open access
FTFrancis Tiausas
Francis Tiausas
YMYuki Murakami
Yuki Murakami
YTYuuichi Teranishi
Yuuichi Teranishi
HNHidehisa Nagano
Hidehisa Nagano
KKKazutaka Kikuta
Kazutaka Kikuta
KKKazuki Kobayashi
Kazuki Kobayashi