Logo: University of Southern California

Events Calendar



Select a calendar:



Filter October Events by Event Type:



Events for October 21, 2024

  • PhD Dissertation Defense - Han Zhang

    Mon, Oct 21, 2024 @ 09:30 AM - 11:30 AM

    Thomas Lord Department of Computer Science

    University Calendar


    Title: Speeding up Multi-Objective Search Algorithms
     
    Date: Oct 21, 2024 
     
    Location: SAL- Henry Salvatori Computer Science Center 213
     
    Time: 9:30 AM - 11:30 PM
     
    Committee members: Satish Kumar, Sven Koenig, Bistra Dilkina, Satyandra Kumar Gupta, Ariel Felner
     
    Abstract: The multi-objective search problem is the problem of finding paths from a start state to a goal state in a graph where each edge is annotated with multiple costs. A typical task of multi-objective search is to find the Pareto frontier, that is, the set of all undominated paths from the start state to the goal state. This problem is important for many applications, such as transporting hazardous materials, where travel distance and risk are two costs that need to be considered. While researchers have developed various techniques over the past years for speeding up single-objective searches on large graphs, many of them have not been investigated in the context of multi-objective search. In this thesis, I hypothesize that one can speed up multi-objective search algorithms by applying insights gained from single-objective search algorithms after proper generalization. Specifically, I consider the following four classes of techniques that have been used to speed up single-objective search algorithms, namely, (1) by trading off solution quality with efficiency, (2) by anytime search, (3) by preprocessing techniques, and (4) by efficient data structures for time-consuming operations. We validate this hypothesis by introducing various new multi-objective search algorithms and speed-up techniques.

    Location: Henry Salvatori Computer Science Center (SAL) - 213

    Audiences: Everyone Is Invited

    Contact: Ellecia Williams

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • Repeating EventEiS Communications Hub - Tutoring for Engineering Ph.D. Students

    Mon, Oct 21, 2024 @ 10:00 AM - 12:00 PM

    Viterbi School of Engineering Student Affairs

    Workshops & Infosessions


    Come to the EiS Communications Hub for one-on-one tutoring from Viterbi faculty for Ph.D. writing and speaking projects!

    Location: Ronald Tutor Hall of Engineering (RTH) - 222A

    Audiences: Viterbi Ph.D. Students

    View All Dates

    Contact: Helen Choi

    Event Link: https://sites.google.com/usc.edu/eishub/home

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • 2024 Kickoff Mixer USC-Amazon Center on Trustworthy AI

    Mon, Oct 21, 2024 @ 01:00 PM - 06:00 PM

    Ming Hsieh Department of Electrical and Computer Engineering

    Workshops & Infosessions


    The USC + Amazon Center on Secure & Trusted Machine Leaning is hosting its 4th Kickoff Meeting on Monday, October 21, 2024, from 1:00 p.m. – 6:00 p.m. The event will take place in the Electrical Engineering Building, EEB132. There will be a keynote talk, research presentations from the projects that were selected for 2024-2025 and from the Amazon PhD fellows, and opportunities to speak with USC faculty and Amazon scientists.   REGISTER HERE: https://forms.gle/qRaqtef1BHyNRCfB9

    More Information: 2024 USC-Amazon Kickoff Meeting-2.pdf

    Location: Hughes Aircraft Electrical Engineering Center (EEB) - 132

    Audiences: Everyone Is Invited

    Contact: Ariana Perez

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • PhD Thesis Proposal - Weizhao Jin

    Mon, Oct 21, 2024 @ 02:00 PM - 03:00 PM

    Thomas Lord Department of Computer Science

    University Calendar


    Title: Efficiency in Privacy-Preserving Computation Via Domain Knowledge 
     
    Date and Time: 10/21/24 - 2:00p - 3:00p
     
    Location: DMC 103
     
    Committee Members: Srivatsan Ravi, Bhaskar Krishnamachari, Harsha V. Madhyastha, Fred Morstatter
     
    Abstract: In recent years, the importance of privacy has grown significantly due to the increasing reliance on user data for building server-side applications and services. To comply with expanding privacy regulations such as GDPR, service providers have adopted privacy-preserving primitives that maintain computational functionality while ensuring user privacy. However, a key challenge lies in integrating these privacy-preserving techniques, such as homomorphic encryption and multi-party computation, into application protocols in a way that balances the efficiency and feasibility of deployment. My thesis proposal investigates two distinct domains emphasizing privacy-preserving computation variants and proposes practical domain-knowledge-based solutions to address challenges related to overhead and protocol complexity for efficient privacy in machine learning and in networks/IoT.

    Location: DMC 103

    Audiences: Everyone Is Invited

    Contact: Felante' Charlemagne

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • CSC/CommNetS-MHI Seminar: Murat Arcak

    CSC/CommNetS-MHI Seminar: Murat Arcak

    Mon, Oct 21, 2024 @ 02:00 PM - 03:00 PM

    Ming Hsieh Department of Electrical and Computer Engineering

    Conferences, Lectures, & Seminars


    Speaker: Dr. Murat Arcak, Professor of Electrical Engineering and Computer Sciences | University of California, Berkeley

    Talk Title: Data-Driven Approaches for Estimating Reachable Sets in Complex Dynamical Systems

    Series: CSC/CommNetS-MHI Seminar Series

    Abstract: The computation of reachable sets is essential for characterizing and verifying the behavior of safety-critical systems. However, many practical systems are high-dimensional and analytically intractable, making the exact computation of reachable sets difficult or impossible. We propose a data-driven approach that uses a finite ensemble of sample trajectories to estimate reachable sets with probabilistic accuracy guarantees. This method is broadly applicable and computationally advantageous, as the main cost comes from simulating a predetermined number of trajectories, which can be parallelized to reduce computation time. We first present a method that uses scenario optimization to construct reachable set estimates as approximate solutions to chance-constrained optimization problems. Next, we use a class of polynomials derived from empirical moment matrices, whose sublevel sets act as nonconvex estimates of the reachable set. These data-driven methods offer scalable solutions for estimating reachable sets in systems with complex dynamics.

    Biography: Murat Arcak is a professor at the University of California, Berkeley, where he holds the Robert M. Saunders Endowed Chair. He has a primary appointment in Electrical Engineering and Computer Sciences, and a courtesy appointment in Mechanical Engineering. He earned his B.S. degree in Electrical Engineering from Boğaziçi University, Istanbul, Turkey, in 1996, and his M.S. and Ph.D. degrees from the University of California, Santa Barbara, in 1997 and 2000. His research focuses on dynamical systems and control theory, with applications in multi-agent systems and transportation. He received a CAREER Award from the National Science Foundation in 2003, the Donald P. Eckman Award from the American Automatic Control Council in 2006, the Control and Systems Theory Prize from the Society for Industrial and Applied Mathematics (SIAM) in 2007, and the Antonio Ruberti Young Researcher Prize from the IEEE Control Systems Society in 2014. He is a member of ACM and SIAM, and a fellow of both IEEE and the International Federation of Automatic Control (IFAC)

    Host: Dr. Lars Lindemann, llindema@usc.edu

    More Information: 2024.10.21 CSC Seminar - Murat Arcak.pdf

    Location: Hughes Aircraft Electrical Engineering Center (EEB) - EEB 248

    Audiences: Everyone Is Invited

    Contact: Miki Arlen

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File
  • Apple: Careers In Hardware and Silicon Engineering

    Mon, Oct 21, 2024 @ 05:30 PM - 06:30 PM

    Viterbi School of Engineering Career Connections

    Workshops & Infosessions


    This event is for Viterbi Engineering students only. You must register on Handshake to attend. 
    Majors: ECE, EE, and CS
    Meet Mahdi Seddinghnezhad (Sr Director, CPU team) from Apple during this recruiting session! 
    You will get to know about different career paths in Hardware and Silicon Engineering in Apple. We will give a summary of various functions within Hardware Technology within Apple. We will also have a panel discussion where students can ask questions to experts from different fields in Apple 
    We will have a 1:1 interaction as time permits and collect resumes from students for intent / full time positions 
     Event Agenda: 
    Presentation on “Apple Engineering Careers in HW” 
    Panel Discussion 

    Hear from Apple engineers about their education and career journeys
    Ask questions about your path and opportunities at Apple

    Student / Apple 1:1 interaction (Resumes welcome) 
    IMPORTANT:  Event check-in is first come, first serve and event capacity is 319 people. If you are signing up for the event, it is the expectation that you attend the event or cancel if you are no longer able to attend. 

    Location: Mark Taper Hall Of Humanities (THH) -

    Audiences: Everyone Is Invited

    Contact: RTH 218 Viterbi Career Connections

    Event Link: https://usc.joinhandshake.com/

    Add to Google CalendarDownload ICS File for OutlookDownload iCal File