published journal article

Autonomous or driver-less vehicles: Implementation strategies and operational concerns

Transportation Research Part E: Logistics and Transportation Review

Publication Date

December 1, 2017
Suggested Citation
Neda Masoud and R. Jayakrishnan (2017) “Autonomous or driver-less vehicles: Implementation strategies and operational concerns”, Transportation Research Part E: Logistics and Transportation Review, 108, pp. 179–194. Available at: 10.1016/j.tre.2017.10.011.

published journal article

Fiscal federalism and economic growth

Journal of Public Economics

Publication Date

November 1, 2006

Author(s)

Abstract

This paper uses an endogenous-growth model with overlapping generations to explore the connection between fiscal federalism and economic growth. The analysis shows that federalism, which allows public-good levels to be tailored to suit the differing demands of young and old consumers, who live in different jurisdictions, increases the incentive to save. This stronger incentive in turn leads to an increase in investment in human capital, and a byproduct of this higher investment is faster economic growth. (c) 2006 Elsevier B.V. All rights reserved.

Suggested Citation
Jan K. Brueckner (2006) “Fiscal federalism and economic growth”, Journal of Public Economics, 90(10-11), pp. 2107–2120. Available at: 10.1016/j.jpubeco.2006.05.003.

conference paper

WIP: End-to-End Analysis of Adversarial Attacks to Automated Lane Centering Systems

Workshop on Automotive and Autonomous Vehicle Security (AutoSec'21)

Publication Date

February 1, 2021

Author(s)

Hengyi Liang, Ruochen Jiao, Takami Sato, Junjie Shen, Qi Alfred Chen, Qi Zhu
Suggested Citation
Hengyi Liang, Ruochen Jiao, Takami Sato, Junjie Shen, Qi Alfred Chen and Qi Zhu (2021) “WIP: End-to-End Analysis of Adversarial Attacks to Automated Lane Centering Systems”, in Workshop on Automotive and Autonomous Vehicle Security (AutoSec'21). Available at: https://par.nsf.gov/biblio/10289738-wip-end-end-analysis-adversarial-attacks-automated-lane-centering-systems (Accessed: October 11, 2023).

conference paper

Quadratic Programming Method for Vehicle Trajectory Imputation Using Fixed and Mobile Sensor Data

Transportation Research Board 103rd Annual Meeting

Publication Date

January 1, 2024
Suggested Citation
Ximeng Fan, Xuting Wang and Wen-Long Jin (2024) “Quadratic Programming Method for Vehicle Trajectory Imputation Using Fixed and Mobile Sensor Data”.

other

Safely scheduling offloading of computing tasks for an autonomous vehicle

Publication Date

November 7, 2024

Author(s)

Mohammad Al Faruque, Yasser Shoukry Ahmed SAKR, Mohanad Odema, James Robert FERLEZ

Report Number

US20240367678A1

Abstract

A local computing device of a vehicle receives a stream of sensor data from one or sensors of the vehicle. If a remote computing device is estimated to process the stream of sensor data and provide driving instructions within a maximum acceptable wait time, then the local computing device sends a request to the remote computing device to process the stream of sensor data and provide driving instructions. If the processing is estimated to meet or exceed the maximum acceptable wait time, then the local computing device uses a locally executed neural network to determine driving instructions. The driving instructions received either from the remote computing or from the local neural network are sent to an autonomous driving system of the vehicle. Offloading processing the sensor data to the remote computing device may result in the local computing device consuming less energy.

Suggested Citation
Mohammad Abdullah Al Faruque, Yasser Shoukry Ahmed SAKR, Mohanad Mohamed Abdelmagid Abdelkhalek Odema and James Robert FERLEZ (2024) “Safely scheduling offloading of computing tasks for an autonomous vehicle”. Available at: https://patents.google.com/patent/US20240367678A1/en (Accessed: August 21, 2025).

published journal article

Measuring the impact of efficient household travel decisions on potential travel time savings and accessibility gains

Transportation Research Part A: Policy and Practice

Publication Date

May 1, 2001

Abstract

Using the conceptual framework of time-space geography, this paper incorporates both spatio-temporal constraints and household interaction effects into a meaningful measure of the potential of a household to interact with the built environment. Within this context, personal accessibility is described as a measure of the potential ability of individuals within a household not only to reach activity opportunities, but to do so with sufficient time available for participation in those activities, subject to the spatio-temporal constraints imposed by their daily obligations and transportation supply environment. The incorporation of activity-based concepts in the measurement of accessibility as a product of travel time savings not only explicitly acknowledges a temporal dimension in assessing the potential for spatial interaction but also expands the applicability of accessibility consideration to such real-world policy options as the promotion of ride-sharing and trip chaining behaviors. An empirical application of the model system provides an indication of the potential of activity-based modeling approaches to assess the bounds on achievable improvements in accessibility and travel time based on daily household activity patterns. It also provides an assessment of roles for trip chaining and ride-sharing as potentially effective methods to facilitate transportation policy objectives. (C) 2001 Elsevier Science Ltd. All rights reserved.

Suggested Citation
W.W. Recker, C. Chen and M.G. McNally (2001) “Measuring the impact of efficient household travel decisions on potential travel time savings and accessibility gains”, Transportation Research Part A: Policy and Practice, 35(4), pp. 339–369. Available at: 10.1016/s0965-8564(99)00062-2.

published journal article

Travel Probability Fields and Urban Spatial Structure: 2. Empirical Tests

Environment and Planning A: Economy and Space

Publication Date

June 1, 1983

Author(s)

M J Beckmann, Thomas Golob, Y Zahavi

Abstract

The research presented here is a continuation of the work published in a previous issue of this journal. The overall objective was to relate travel patterns and urban structure using continuous spatial distributions and urban-economic concepts of residential location choice. In the present paper, model hypotheses are tested using data from a transportation planning study in Washington.

Suggested Citation
M J Beckmann, T F Golob and Y Zahavi (1983) “Travel Probability Fields and Urban Spatial Structure: 2. Empirical Tests”, Environment and Planning A: Economy and Space, 15(6), pp. 727–738. Available at: 10.1068/a150727.

presentation

Qualitative Assessment of Transit Agencies and Transportation Network Companies in Public-Private Partnership

Suggested Citation
Dylan Ando (2022) “Qualitative Assessment of Transit Agencies and Transportation Network Companies in Public-Private Partnership”. ITS-Irvine, 28 October. Available at: https://youtu.be/Rpdf6-T_fCk?t=541.

conference paper

DOMINO: Domain-Invariant Hyperdimensional Classification for Multi-Sensor Time Series Data

2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD)

Publication Date

October 1, 2023

Author(s)

Junyao Wang, Luke Chen, Mohammad Al Faruque

Abstract

With the rapid evolution of the Internet of Things, many real-world applications utilize heterogeneously connected sensors to capture time-series information. Edge-based machine learning (ML) methodologies are often employed to analyze locally collected data. However, a fundamental issue across data-driven ML approaches is distribution shift. It occurs when a model is deployed on a data distribution different from what it was trained on, and can substantially degrade model performance. Additionally, increasingly sophisticated deep neural networks (DNNs) have been proposed to capture spatial and temporal dependencies in multi-sensor time series data, requiring intensive computational resources beyond the capacity of today’s edge devices. While brain-inspired hyperdimensional computing (HDC) has been introduced as a lightweight solution for edge-based learning, existing HDCs are also vulnerable to the distribution shift challenge. In this paper, we propose DOMINO, a novel HDC learning framework addressing the distribution shift problem in noisy multi-sensor time-series data. DOMINO leverages efficient and parallel matrix operations on high-dimensional space to dynamically identify and filter out domain-variant dimensions. Our evaluation on a wide range of multi-sensor time series classification tasks shows that DOMINO achieves on average 2.04% higher accuracy than state-of-the-art (SOTA) DNN-based domain generalization techniques, and delivers 16.34times faster training and 2.89times faster inference. More importantly, DOMINO exhibits notably better performance when learning from partially labeled data and highly imbalanced data, and provides 10.93times higher robustness against hardware noises than SOTA DNNs.

Suggested Citation
Junyao Wang, Luke Chen and Mohammad Abdullah Al Faruque (2023) “DOMINO: Domain-Invariant Hyperdimensional Classification for Multi-Sensor Time Series Data”, in 2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD), pp. 1–9. Available at: 10.1109/ICCAD57390.2023.10323848.

published journal article

A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem

Transportation Research Part B: Methodological

Publication Date

May 1, 2017

Abstract

In this paper, the authors mathematically model the multi-hop Peer-to-Peer (P2P) ride-matching problem as a binary program. The authors formulate this problem as a many-to-many problem in which a rider can travel by transferring between multiple drivers, and a driver can carry multiple riders. The authors propose a pre-processing procedure to reduce the size of the problem, and devise a decomposition algorithm to solve the original ride-matching problem to optimality by means of solving multiple smaller problems. The authors conduct extensive numerical experiments to demonstrate the computational efficiency of the proposed algorithm and show its practical applicability to reasonably-sized dynamic ride-matching contexts. Finally, in the interest of even lower solution times, the authors propose heuristic solution methods, and investigate the trade-offs between solution time and accuracy.

Suggested Citation
Neda Masoud and R. Jayakrishnan (2017) “A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem”, Transportation Research Part B: Methodological, 99, pp. 1–29. Available at: 10.1016/j.trb.2017.01.004.