A. Arun Prakash
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
A. Arun Prakash has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Constantinos Antoniou
Transportation Systems Engineering, Technical University of Munich, Germany
1 shared publication - Francisco Camara Pereira
Technical University of Denmark Kongens Lyngby Denmark
1 shared publication - Isil Dillig
University of Texas at Austin, Austin, USA
1 shared publication - Moshe Ben-Akiva
Massachusetts Institute of Technology
1 shared publication - Ravi Seshadri
Technical University of Denmark
1 shared publication - Shankara Pailoor
The University of Texas at Austin, Austin, TX, USA
1 shared publication
Latest Publications
- Open Access
- 20 June 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 8 (PLDI) , 1014-1039
From Batch to Stream: Automatic Generation of Online Algorithms
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.
- 20 June 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 8 (PLDI) , 1014-1039
Open AccessFrom Batch to Stream: Automatic Generation of Online Algorithms
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.
- Open Access
- 7 September 2018
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2672 (48) , 79-92
Improving Scalability of Generic Online Calibration for Real-Time Dynamic Traffic Assignment Systems
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.
- 7 September 2018
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2672 (48) , 79-92
Open AccessImproving Scalability of Generic Online Calibration for Real-Time Dynamic Traffic Assignment Systems
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.