Details:
WHERE: Hackerman Hall B-17, unless otherwise noted
WHEN: 10:30 a.m. refreshments available, seminar runs from 10:45 a.m. to 12 p.m., unless otherwise noted
Recordings will be available online after each seminar.
Schedule of Speakers
Click to expand for talk title, abstract, and speaker biography.
Please note this seminar will take place in Hodson Hall 213 at 11 a.m.
Zoom link »
Passcode: 059998
Computer Science and Information Security Institute Seminar Series
“Assured and Intelligent Cyber-Physical Systems”
Abstract: Cyber-physical systems (CPS) tightly couple computing and network components with physical processes via sensors and actuators. On the one hand, integration of AI enables autonomous CPS that perceive, understand, and perform complex tasks in the physical world. On the other hand, safety is critical for real-world CPS applications such as autonomous vehicles, drones, and various robotic systems. In this talk, Fanxin Kong will introduce his recent works on assured and intelligent CPS as follows: i) Foundation model-enabled CPS—this thread of works studies how to enhance safety of foundation models (e.g., large language models and vision-language action models) when applied to task/motion planning; ii) Secure and safe reinforcement learning (RL)—this thread of works addresses the synthesis of safe control policies using RL and explores safety-violation vulnerabilities of safe RL; and iii) Real-time attack-resilience for CPS—this thread of works discusses how to detect, diagnose, and recover from sensor faults/attacks in real-time and in a safe manner. System demonstrations with implementation of these works on multiple autonomous CPS simulators/testbeds will be also presented.
Speaker Biography: Fanxin Kong is an assistant professor in the Department of Computer Science and Engineering at the University of Notre Dame. His research centers around assured and intelligent cyber-physical systems with a focus on physical AI, safety and security, and real-time embedded systems, as well as their applications to various robotic systems. Kong has published over 85 research papers at top venues such as the Institute of Electrical and Electronics Engineers (IEEE) International Conference on Robotics and Automation, the ACM/IEEE International Conference on Cyber-Physical Systems, the IEEE Symposium on Real-Time Systems, the IEEE Real-Time and Embedded Technology and Applications Symposium, the IEEE/ACM International Conference on Embedded Software, and the Design Automation Conference; in various IEEE/ACM transactions; and books and book chapters. His research has been supported by the NSF, the Air Force Research Laboratory (AFRL), the Air Force Office of Scientific Research, and DARPA. He has received multiple awards such as the 2025 NSF CAREER Award, the 2025 ACM Special Interest Group on Embodied Systems (SIGBED) Early Career Researcher Award, and the AFRL Summer Faculty Extension Award in 2022 and 2024. Together with his students, Kong has won multiple competitions such as the 2024 Embedded System Software Competition at Embodied Systems Week and the 2024 ACM SIGBED Student Research Competition (SRC), as well as taking home the Best Scientific Research Award at the ACM SIGBED SRC in 2022.
Past Speakers
Click to expand for recording, date, abstract, and speaker biography.
Computer Science Seminar Series
June 9, 2026
Abstract: In many modern applications—including machine learning, robotics, distributed systems, and network design—the input data, often represented as points in a finite metric space, can be massive in size. Efficient processing of such data requires compact representations that preserve the essential structural properties of the underlying space. Metric sketching provides a principled approach to achieving this compression. Among the most fundamental metric sketching primitives are spanners and tree covers, which capture distance relationships in a concise form. In the first part of the talk, Sujoy Bhore will discuss recent advances in geometric sketching. Traditional algorithmic models often assume complete knowledge of the input in advance; however, this assumption breaks down in evolving environments where the input changes over time. In these settings, algorithms must continuously adapt while maintaining strong performance guarantees. In the second part of the talk, Bhore will explore dynamic aspects of metric sketching, discuss related problems, and highlight emerging directions at the interface of geometry and uncertainty.
Speaker Biography: Sujoy Bhore is a faculty member in the Department of Computer Science and Engineering at the Indian Institute of Technology Bombay and a visiting fellow in the Department of Mathematics at the London School of Economics and Political Science. Previously, he held postdoctoral positions at TU Wien Informatics and in the Université libre de Bruxelles Department of Computer Science. Bhore received his PhD from the Stein Faculty of Computer and Information Science at Ben-Gurion University of the Negev. He has received a Kreitman Foundation Fellowship, a U.S.-Israel Binational Science Foundation fellowship, a London Mathematical Society Fellowship, and a Young Faculty Award and Krithi Ramamritham Award for Creative Research at IIT Bombay. Bhore’s research interests include computational geometry, algorithms, combinatorial optimization, and algorithmic aspects of machine learning.
Archive
From the calendar years 1997–2026.
- Spring 2026
- Fall 2025
- Spring 2025
- Fall 2024
- Spring 2024
- Fall 2023
- Spring 2023
- Fall 2022
- Summer 2022
- Spring 2022
- Fall 2021
- Summer 2021
- Spring 2021
- Fall 2020
- Spring 2020
- Fall 2019
- Summer 2019
- Spring 2019
- Fall 2018
- Summer 2018
- Spring 2018
- Fall 2017
- Summer 2017
- Spring 2017
- Fall 2016
- Summer 2016
- Spring 2016
- Fall 2015
- Spring 2015
- Fall 2014
- Spring 2014
- Fall 2013
- Spring 2013
- Fall 2012
- Spring 2012
- Fall 2011
- Spring 2011
- Fall 2010
- Spring 2010
- Fall 2009
- Spring 2009
- Fall 2008
- Spring 2008
- Fall 2007
- Spring 2007
- Fall 2006
- Spring 2006
- Fall 2005
- Spring 2005
- Fall 2004
- Spring 2004
- Fall 2003
- Spring 2003
- Fall 2002
- Spring 2002
- Spring 2001
- Fall 2000
- Spring 2000
- Fall 1999
- Spring 1999
- Fall 1998
- Spring 1998
- Fall 1997
- Summer 1997
- Spring 1997