A. Arun Prakash

A. Arun Prakash

Auto-generated profile, based on publicly available information

A. Arun Prakash

University of Texas at Austin, Austin, TX, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
7 September 2018 in Transportation Research Record: Journal of the Transportation Research Board
Verified
Journal Article
Open access
APA. Arun Prakash
A. Arun Prakash
RSRavi Seshadri
Ravi Seshadri
Constantinos AntoniouConstantinos Antoniou
Constantinos Antoniou
FPFrancisco C. Pereira
Francisco C. Pereira
Moshe Ben-AkivaMoshe Ben-Akiva
Moshe Ben-Akiva
Flexible calibration of dynamic traffic assignment (DTA) systems in real time has important applications in effective traffic management. However, the existing approaches are either limited to small networks or to a specific class of parameters. In this light, this study presents a framework to systematically reduce the dimension of the generic online calibration problem, making it more scalable. Specifically, a state–space formulation of the problem in the reduced dimension space is proposed. Following this the problem is solved using the constrained extended Kalman filter, which is made tractable because of the low dimensionality of the formulated problem. The effectiveness of the proposed approach is demonstrated using a real-world network leading to better state estimation by 13% and better state predictions by 11%—with a 50 fold dimensionality reduction. Insights into choosing the right degree of dimensionality reduction are also discussed. This work has the potential for a more widespread application of real-time DTA systems in practice.

20 June 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
ZWZiteng Wang
Ziteng Wang
SPShankara Pailoor
Shankara Pailoor
APAaryan Prakash
Aaryan Prakash
YWYuepeng Wang
Yuepeng Wang
IDIşıl Dillig
Işıl Dillig
Online streaming algorithms, tailored for continuous data processing, offer substantial benefits but are often more intricate to design than their offline counterparts. This paper introduces a novel approach for automatically synthesizing online streaming algorithms from their offline versions. In particular, we propose a novel methodology, based on the notion of relational function signature (RFS) , for deriving an online algorithm given its offline version. Then, we propose a concrete synthesis algorithm that is an instantiation of the proposed methodology. Our algorithm uses the RFS to decompose the synthesis problem into a set of independent subtasks and uses a combination of symbolic reasoning and search to solve each subproblem. We implement the proposed technique in a new tool called Opera and evaluate it on over 50 tasks spanning two domains: statistical computations and online auctions. Our results show that Opera can automatically derive the online version of the original algorithm for 98% of the tasks. Our experiments also demonstrate that Opera significantly outperforms alternative approaches, including adaptations of SyGuS solvers to this problem as well as two of Opera ’s own ablations.