Demo Data from EDBT 2026 / reviewers in the wild / expert
Kevin P. Heaslip
dblp:139/2256
· DBLP profile ↗
9ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-3393-2627ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3Applied, interdisciplinary, general and emerging computing · 3Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Learning paradigms · 50% Deep learning architectures and training · 50% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Smart cities and intelligent transportation · 100% | |
| Computer networks
1 paper |
Wireless sensing and localization · 77% Vehicular, aerial and satellite networks · 23% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training › autoencoder
convolutional autoencoder |
0.4 | 1 | 2020 | Semi-Supervised Deep Learning Approach for Transportation Mode Identification Using GPS Trajectory Data · IEEE Trans. Knowl. Data Eng. 2020 |
Machine learning › Learning paradigms
semi-supervised learning |
0.4 | 1 | 2020 | Semi-Supervised Deep Learning Approach for Transportation Mode Identification Using GPS Trajectory Data · IEEE Trans. Knowl. Data Eng. 2020 |
Wireless sensing and localization
secure localization |
0.2 | 1 | 2014 | POSTER: Analysis and Comparison of Secure Localization Schemes for Intelligent Transportation Systems · CCS 2014 |
Vehicular, aerial and satellite networks
intelligent transportation systems |
0.1 | 1 | 2014 | POSTER: Analysis and Comparison of Secure Localization Schemes for Intelligent Transportation Systems · CCS 2014 |
Methods — techniques the papers use, named apart from their topics
semi-supervised learning · 0.9convolutional autoencoder · 0.9analytical security framework · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | The Parallel Scheduling Vehicle Routing Problem for Multimodal Package DeliveryabstractThis study introduces a novel model known as the Parallel Scheduling Vehicle Routing Problem (PSVRP) in an endeavor to revolutionize package delivery by enhancing its efficiency, accessibility, and cost-effectiveness. The PSVRP represents a state-of-the-art approach to vehicle routing problems, incorporating a diversified fleet of innovative delivery modes. The multi-modal fleet of electric vans, ADVs, drones, and truck-drone systems works in unison to minimize operational costs in various settings. The model can also be adapted to different scenarios, such as variations in customer numbers and package weights, by strategically deploying the most suitable mode of transport. Marcella M. Kaplan, Kevin P. Heaslip |
IV | 2 |
| 2020 | Semi-Supervised Deep Learning Approach for Transportation Mode Identification Using GPS Trajectory DataabstractIdentification of travelers' transportation modes is a fundamental step for various problems that arise in the domain of transportation such as travel demand analysis, transport planning, and traffic management. In this paper, we aim to identify travelers' transportation modes purely based on their GPS trajectories. First, a segmentation process is developed to partition a user's trip into GPS segments with only one transportation mode. A majority of studies have proposed mode inference models based on hand-crafted features, which might be vulnerable to traffic and environmental conditions. Furthermore, the classification task in almost all models have been performed in a supervised fashion while a large amount of unlabeled GPS trajectories has remained unused. Accordingly, we propose a deep SEmi-Supervised Convolutional Autoencoder (SECA) architecture that can not only automatically extract relevant features from GPS segments but also exploit useful information in unlabeled data. The SECA integrates a convolutional-deconvolutional autoencoder and a convolutional neural network into a unified framework to concurrently perform supervised and unsupervised learning. The two components are simultaneously trained using both labeled and unlabeled GPS segments, which have already been converted into an efficient representation for the convolutional operation. An optimum schedule for varying the balancing parameters between reconstruction and classification errors are also implemented. The performance of the proposed SECA model, trip segmentation, the method for converting a raw trajectory into a new representation, the hyperparameter schedule, and the model configuration are evaluated by comparing to several baselines and alternatives for various amounts of labeled and unlabeled data. Our experimental results demonstrate the superiority of the proposed model over the state-of-the-art semi-supervised and supervised methods with respect to metrics such as accuracy and F-measure. Sina Dabiri, Chang-Tien Lu, Kevin P. Heaslip, Chandan K. Reddy |
IEEE Trans. Knowl. Data Eng. | 3 |
| 2019 | Developing a Twitter-based traffic event detection model using deep learning architectures
Sina Dabiri, Kevin P. Heaslip |
Expert Syst. Appl. | 2 |
| 2019 | Facilitating Emergency Response Vehicles' Movement Through a Road Segment in a Connected Vehicle EnvironmentabstractEmergency response vehicles' (ERVs) travel is risky, as non-ERV drivers are often unsure of the ERV's next maneuver and how to facilitate its movement. An integer linear program (ILP), introduced in this paper, facilitates the ERV's movement through a transportation link. Leveraging vehicle-to-vehicle communications, information is collected about vehicles on a link section. Then, the ILP finds the ERV's fastest intra-link path. To increase safety, the ILP assigns non-ERVs locations as far away from the ERV as possible while avoiding passing and weaving among vehicles. The ILP can be adapted to different ERV sizes, road types, and surrounding conditions. Sensitivity analysis indicated that scenarios with narrower road segments and higher numbers of non-ERVs led to ERV paths with lane changes and higher computation times. When compared with the current practice requiring non-ERVs to move to the nearest road edge when an ERV with lights and sirens is noticed, the proposed formulation improved the ERV speed while reducing the conflicts and confusion experienced by downstream vehicles. Gaby Joe Hannoun, Pamela M. Murray-Tuite, Kevin P. Heaslip, Thidapat Chantem |
IEEE Trans. Intell. Transp. Syst. | 3 |
| 2016 | Optimizing Departures of Automated Vehicles From Highways While Maintaining Mainline CapacityabstractAutomated vehicles have the potential to revolutionize our nation's transportation systems as they promise to dramatically reduce congestion, accidents, and fuel usage. Namely, as it becomes possible to precisely exert control on and coordinate the movement and placement of vehicles along a stretch of highway, the separation distance between vehicles can be reduced, thus increasing flow and minimizing congestion. Precise and coordinated vehicle controls and placements also improve predictability, resulting in fewer instances of sudden braking, which reduce fuel usage and accidents. Most existing research has focused on the steady-state behaviors and operations of automated vehicles, such as platooning, and assumes complete knowledge of the system, e.g., the number of vehicles and their destinations and/or neglects dynamic or transition operations such as exiting a highway and lane changing. Uncoordinated lane-changing and exiting behaviors by automated vehicles can significantly reduce the flow of traffic as vehicles will require larger separations, are forced to slow down, or worse, collide. In this paper, we present a collision-free runtime approach to efficiently organize the departures of automated vehicles from a highway environment while maintaining highway capacity in extremely dynamic conditions. To maximize the number of safe departures, the key ideas are to: 1) determine when, and where to, an exiting vehicle should lane change in order to make a successful exit given current traffic conditions as provided by connected vehicle technology and 2) execute the actual lane-change operations using a reservation-based approach. Simulation results show that, by coordinating vehicles' behaviors, traffic flow can be improved by up to five times of today's typical flow while ensuring a 100% exit success rate in a collision-free manner. Eric Meissner, Thidapat Chantem, Kevin P. Heaslip |
IEEE Trans. Intell. Transp. Syst. | 3 |
| 2015 | Minimizing the Disruption of Traffic Flow of Automated Vehicles During Lane ChangesabstractVehicles that are becoming more highly automated are revolutionizing the world's transportation systems for their promise of increased safety and efficiency. The advantage of vehicles incorporating automation is that they do not suffer from the same limitations as human drivers, such as being distracted or impaired. In order to realize the potential of these vehicles, which operate in highly dynamic environments, online techniques are needed. This paper presents such an algorithm to minimize the disruption of traffic flow by optimizing for the number of safe lane changes, thereby increasing throughput and reducing congestion. The proposed algorithm is distributed in nature and makes use of vehicle-to-vehicle and/or vehicle-to-infrastructure communication technologies to judiciously make local lane-change decisions while guaranteeing that no collisions will occur. In contrast to existing work, the proposed technique requires no assumption on the number of lanes, nor on the dynamic attributes of the vehicles such as velocity and acceleration. Simulation results show that the proposed algorithm is both efficient and effective in maximizing the number of lane changes on a given stretch of a highway. Divya Desiraju, Thidapat Chantem, Kevin P. Heaslip |
IEEE Trans. Intell. Transp. Syst. | 3 |
| 2014 | POSTER: Analysis and Comparison of Secure Localization Schemes for Intelligent Transportation SystemsabstractIn this work, we employ distance bounding (DB) and verifiable trilateration (VT) for secure localization in an intelligent transportation system (ITS). We first demonstrate several possible attack scenarios, and then establish an analytical framework to evaluate the security of these schemes. Results are derived in terms of the probability of a given position being spoofed by maliciously-controlled vehicles assuming randomly distributed colluding attackers. The results show that while VT outperforms DB, both methods have a high probability of being spoofed. Bhaswati Deka, Ryan M. Gerdes, Ming Li 0003, Kevin P. Heaslip |
CCS | 4 |
| 2014 | Friendly Jamming for Secure Localization in Vehicular Transportation
Bhaswati Deka, Ryan M. Gerdes, Ming Li 0003, Kevin P. Heaslip |
SecureComm (1) | 4 |
| 2013 | CPS: an efficiency-motivated attack against autonomous vehicular transportationabstractThis work describes a new type of efficiency attack that can be used to degrade the performance of automated vehicular transportation systems. Next-generation transportation technologies will leverage increasing use of vehicle automation. Proposed vehicular automation systems include cooperative adaptive cruise control and vehicle platooning strategies which require cooperation and coordination among vehicles. These strategies are intended to optimize through-put and energy usage in future highway systems, but, as we demonstrate, they also introduce new vulnerabilities. In this work we show that a typical platooning system would allow a maliciously controlled vehicle to exert subtle influence on the motion of surrounding vehicles. This effect can be used to increase the energy expenditure of surrounding vehicles by 20% to 300%. Ryan M. Gerdes, Chris Winstead, Kevin P. Heaslip |
ACSAC | 3 |