Logo: University of Southern California

Events Calendar



Select a calendar:



Filter May Events by Event Type:



Events for the 3rd week of May

  • Department of Biomedical Engineering Seminar - Dr. Kristin Swanson

    Mon, May 10, 2021 @ 09:00 AM - 10:00 AM

    Biomedical Engineering

    Conferences, Lectures, & Seminars


    Speaker: Dr. Kristin Swanson , Professor & Vice Chair of Research, Neurological Surgery in Arizona, Mayo Clinic Professor, Mathematics, Arizona State University

    Talk Title: Every Patient Deserves Their Own Equation

    Host: Kirk Shung

    More Information: Dr. Kristin Swanson Flier as of 4 26.pdf

    Audiences: Everyone Is Invited

    Contact: Michele Medina

    OutlookiCal
  • PhD Defense - Nitin Kamra

    Mon, May 10, 2021 @ 10:30 AM - 12:00 PM

    Computer Science

    University Calendar


    PhD Candidate: Nitin Kamra

    Committee: Prof. Yan Liu (chair), Prof. Bistra Dilkina, Prof. Ashutosh Nayyar

    Date: 10th May, 2021
    Time: 10:30am-12:00pm

    Zoom: https://usc.zoom.us/j/96990524233?pwd=M3BzcTdOenZtRjlkN1J5dmxDQmVpUT09

    Meeting ID: 969 9052 4233
    Passcode: 015551


    Title: Machine Learning in Interacting Multi-agent Systems

    Abstract:

    Making predictions and learning optimal behavioral strategies are important problems in many domains such as traffic prediction, pedestrian tracking, financial investments and security systems. These systems often consist of multiple agents interacting with each other in complex ways, which makes both the above tasks very challenging. In this thesis, I propose methods to advance the state-of-the-art for such multi-agent learning problems. The first part of my talk focuses on trajectory prediction and I will present a relational model involving a fuzzy decision making attention mechanism for multi-agent trajectory prediction. Our approach shows significant performance gains over many existing state-of-the-art predictive models in diverse domains such as human crowds, US freeway traffic and various physics datasets. The second part of my talk focuses on placing multiple resources to protect and cover geographical spaces. We propose the Coverage Gradient Theorem and a spatial discretization based framework to improve existing benchmarks for spatial coverage domains. The third part of the talk focuses on computing nash equilibrium strategies in spatial security games with continuous action spaces. We present our model-free learning algorithm, OptGradFP, and our model-based learning algorithm, DeepFP, which search for the optimal defender strategy in a parameterized continuous search space. These algorithms scale to large domains and compute strategies robust to adversarial exploitation. Finally, we combine the Coverage Gradient framework with DeepFP to show improved performance on spatial coverage security domains.

    WebCast Link: https://usc.zoom.us/j/96990524233?pwd=M3BzcTdOenZtRjlkN1J5dmxDQmVpUT09

    Audiences: Everyone Is Invited

    Contact: Lizsl De Leon

    OutlookiCal
  • Thesis Proposal - Shen Yan

    Mon, May 10, 2021 @ 11:00 AM - 01:00 PM

    Computer Science

    University Calendar


    Title: Fair Machine Learning for Human Behavior Understanding

    Time: 11:00 AM-1:00 PM PST, May 10 (Monday)

    Committee: Emilio Ferrara, Cyrus Shahabi, Shri Narayanan, Kristina Lerman, and Fred Morstatter.

    Zoom link: https://usc.zoom.us/j/96050343860

    Abstract:
    Artificial intelligence (AI) and machine learning models have been recently applied extensively to understand and predict human behavior, often in applications with major societal implications, such as making recruitment decisions, estimating daily well-beings, or assessing clinical treatments. Despite the increasing body of research on modeling human behavior and fair machine learning, most studies focus on homogeneous and objective measurements, and little has been discussed on how to mitigate the impact of heterogeneity on utility and fairness simultaneously. The increasing amount of collected data also raises concerns on data privacy. Recent regulations such as European General Data Protection Regulation (GDPR) and California Consumer Privacy Act (CCPA) regulate the usage of personal data. However, most previous fairness work requires the access of sensitive attributes (e.g., race, gender) to debias the system.
    This dissertation proposal will articulate the challenges posed by complex, multimodal human behavior data in both model utility and fairness. The proposed work is decomposed into three tasks, namely tackling machine learning fairness issues originating from the heterogeneous human behaviors (Task 1), and biased behavior annotations (Task 2), and designing fair machine learning methods without sensitive attributes (Task 3) for both centralized and federated learning. This work will provide possible solutions to mitigate bias of human behavior understanding systems, reducing barriers to access, alleviating systemic racism, discrimination, and unfair process.

    WebCast Link: https://usc.zoom.us/j/96050343860

    Audiences: Everyone Is Invited

    Contact: Lizsl De Leon

    OutlookiCal
  • Thesis Proposal - Jiaoyang Li

    Mon, May 10, 2021 @ 02:00 PM - 03:30 PM

    Computer Science

    University Calendar


    Title:

    Efficient and Effective Multi-Agent Path Finding via Heuristic Search, Symmetry Breaking, and Large Neighborhood Search


    Time:

    2:00-3:30pm PST, May 10 (Monday)

    Committee: Sven Koenig, Nora Ayanian, Bistra Dilkina, T. K. Satish Kumar, Satyandra K. Gupta, and Brian Williams (MIT)

    Zoom link:

    https://usc.zoom.us/j/96942890548?pwd=SkFzQm80cHNOMHBPQXZBa1N3eVZvZz09


    Abstract:

    Recent advances in robotics have laid the foundation for building large-scale multi-agent systems. One fundamental task in many multi-agent systems is to navigate teams of agents in a shared environment to their target locations without colliding with obstacles or other agents. Applications include evacuation, formation control, object transportation, traffic management, search and rescue, autonomous driving, drone swarm coordination, video game character control, and large-scale warehouse automation, to list a few. One well-studied abstract model for this problem is known as Multi-Agent Path Finding (MAPF). MAPF is NP-hard to solve optimally (or, in some cases, even bounded-suboptimally) in general. Existing algorithms for solving MAPF either have limited scalability, generate costly solutions, or fail to find any solutions for hard MAPF problems. I propose to develop fundamental techniques for solving MAPF more efficiently and effectively that exploit the combinatorial structure of the MAPF problem and combine ideas from both AI and OR. In particular, I design admissible heuristics by cost partitioning (ideas from the AI planning community) to speed up optimal MAPF algorithms. I also develop symmetry-breaking constraints (ideas from the constraint programming community) to eliminate symmetries in optimal MAPF solving. For future work, I plan to learn inadmissible heuristics (ideas from the heuristic search community) to speed up bounded-suboptimal MAPF algorithms and build an anytime MAPF framework via large neighborhood search (ideas from the constraint programming and operations research communities) to improve the success rate and the solution quality of non-optimal MAPF algorithms.

    WebCast Link: https://usc.zoom.us/j/96942890548?pwd=SkFzQm80cHNOMHBPQXZBa1N3eVZvZz09

    Audiences: Everyone Is Invited

    Contact: Lizsl De Leon

    OutlookiCal
  • PhD Defense - Ryan Julian

    Tue, May 11, 2021 @ 04:00 PM - 05:30 PM

    Computer Science

    University Calendar



    PhD Candidate: Ryan Julian

    Committee: Prof. Gaurav Sukhatme (chair), Prof. Satyandra Gupta, Prof. Heather Culbertson, Prof. Joseph Lim, Prof. Stefanos Nikolaidis, Dr. Karol Hausman

    Title: Algorithms and Systems for Continual Robot Learning

    Abstract:
    The last decade has seen the rapid evolution of machine learning (ML) from an academic curiosity to an essential capability of modern computing systems, and with it has come an explosion of ML applications which help humans in the real world every day. Whether machine learning can affect such an evolution in the nearby field of robotics--concerned with automating tasks in the physical, rather than the digital world--remains to be seen. Though the last decade has seen an explosion of new methods, remarkably few of these exhibit properties which make them good candidates for building an efficient, continual, multi-task robot skill learning system. This of course begs the question: given a novel method, how should we assess its suitability for building a continually-learning multi-task robot? In other words, how can we systematically assure progress towards new real world capabilities, and avoid getting trapped, running in circles studying novel trivialities? I will argue that three elements--benchmarks, baselines, and novel methods--together form the three-legged stool of research in artificial intelligence. Robotics can only make progress towards the goal of real-world, general-purpose, continually-learning robots by periodically advancing each of these legs, creating a virtuous cycle of new challenges, new systems, new solutions, and ultimately new knowledge. We will follow one such cycle for a small slice of the field, namely continual learning for robotic manipulation, visiting each step to illustrate its effectiveness by example.

    Zoom Info:
    Topic: PhD Defense - Ryan Julian
    Time: May 11, 2021 04:00 PM Pacific Time (US and Canada)

    Join Zoom Meeting
    https://usc.zoom.us/j/94821577914?pwd=NW14YW5WWjdPcXVna3grcjZqQnFuQT09

    WebCast Link: https://usc.zoom.us/j/94821577914?pwd=NW14YW5WWjdPcXVna3grcjZqQnFuQT09

    Audiences: Everyone Is Invited

    Contact: Lizsl De Leon

    OutlookiCal
  • Repeating EventVirtual First-Year Admission Information Session

    Tue, May 11, 2021 @ 04:00 PM - 05:00 PM

    Viterbi School of Engineering Undergraduate Admission

    Workshops & Infosessions


    Our virtual information session is a live presentation from a USC Viterbi admission counselor designed for high school students and their family members to learn more about the USC Viterbi undergraduate experience. Our session will cover an overview of our undergraduate engineering programs, the application process, and more on student life. Guests will be able to ask questions and engage in further discussion toward the end of the session.

    Please Register Here!

    Audiences: Everyone Is Invited

    View All Dates

    Contact: Viterbi Undergraduate Admission

    OutlookiCal
  • Info Session: ENGR 345 Principle and Practices of Global Innovation

    Wed, May 12, 2021 @ 12:00 PM - 12:30 PM

    USC Viterbi School of Engineering

    Workshops & Infosessions


    Build your global competence and network without leaving campus!

    A global class using the classroom-without-border platform and learning-from-diversity pedagogy. Students will study the dynamic lifecycle of technology innovation in competitive global market with classmates from multiple universities around the world.

    The ENGR 345 course is 3 units and is open to all USC majors, levels, and USC schools. It can be taken as a free elective course or as an approved elective course if approved by your advisor.

    Join our info session in Microsoft Teams to learn more about the course and get your questions answered at tinyurl.com/ipodiainfo.

    Location: tinyurl.com/ipodiainfo

    Audiences: Everyone Is Invited

    Contact: Jenny iPodia Program

    OutlookiCal
  • PhD Defense - Sivaram Ramanathan

    Thu, May 13, 2021 @ 11:00 AM - 01:00 PM

    Computer Science

    University Calendar


    Ph.D. Candidate: Sivaram Ramanathan

    Committee: Dr. Jelena Mirkovic, Dr. Minlan Yu, Dr. Emilio Ferrara and Dr. Ramesh Govindan

    Time: May 13, 2021, 11am

    Title: Improving Network Security and Performance Through Programmability and Machine Learning

    Abstract:
    The rise in different types of applications has attracted many users to the Internet. Companies generate revenue from users and a key component for user retention is reliable network performance. Network operators are constantly scaling their infrastructure to provide tight network and security guarantees to their users. However, issues in networks such as packet drops, low utilization of links, and targeted attacks can violate these guarantees.

    Network operators use different tools to understand and diagnose problems in the network. As the network scales to support more users, tools that are traditionally used to understand and diagnose problems, also need to change. For instance, there exist transient events occurring at microsecond granularity in datacenter networks that could affect the network's performance. Traditional tools may miss such events as they work at coarser time granularities.

    As networks grow to accommodate more users, securing the network has also become hard. In the past year, there has been a 776% increase in large volumetric denial of service (DDoS) attacks and networks have spent up to $50,000 to protect themselves. Moreover, most deployed defenses are reactive, where a mitigation strategy is only developed when symptoms of attacks are seen. Proactively detecting attackers would not only block all attack traffic but also reduce cost for victim networks.

    In this talk, we use recent advancements in programmable switches and machine learning to develop frameworks for better network management. We present SPred, which uses machine learning models in switches to detect transient events faster. We designed SDProber to balance the cost of monitoring with event detection time. We also built frameworks that help network operators to meet security guarantees. We present SENSS, which allows networks to coordinate with upstream networks to develop better detection and mitigation strategies against DDoS attacks. Finally, we present BLAG that makes blocklists more suitable for emergency response by combining blocklists of different attack types and reducing the collateral damage by using a recommendation system and reused address detection.

    Our work has had several real-world impacts. SENSS has been deployed in three academic networks to provide better detection of DDoS attacks. Our technique to identify reused addresses is being adopted by IPInfo, which maintains a large repository of IP address-related information. Finally, AT&T has partially deployed SDProber in their network to detect persistent congestion and we hold two patents for SDProber and SPred.

    Zoom info:
    https://usc.zoom.us/j/98493286938?pwd=UXRFVzNlQUl5aVJtUXNQZnpEekNaZz09


    Topic: Sivaram's Defense

    Join Zoom Meeting
    https://usc.zoom.us/j/98493286938?pwd=UXRFVzNlQUl5aVJtUXNQZnpEekNaZz09

    WebCast Link: https://usc.zoom.us/j/98493286938?pwd=UXRFVzNlQUl5aVJtUXNQZnpEekNaZz09

    Audiences: Everyone Is Invited

    Contact: Lizsl De Leon

    OutlookiCal
  • ASTE Virtual Department Commencement Celebration

    Thu, May 13, 2021 @ 01:00 PM - 01:30 PM

    Astronautical Engineering

    Receptions & Special Events




    To honor and celebrate the Class 2020-21 astronautics graduates via zoom.


    https://usc.zoom.us/j/99766721808?pwd=SFNyZWEwcHhmeTEvQzVmWTFienJEQT09


    Audiences: participants only

    Contact: Dell Cuason

    OutlookiCal
  • Aerospace and Mechanical Engineering Commencement Reception 2021

    Thu, May 13, 2021 @ 01:30 PM - 02:00 PM

    Aerospace and Mechanical Engineering

    Conferences, Lectures, & Seminars


    Speaker: AME faculty and students, USC

    Talk Title: Aerospace and Mechanical Engineering Commencement Reception 2021

    Host: AME Department

    More Info: https://viterbischool.usc.edu/commencement-portal/

    Audiences: Everyone Is Invited

    Contact: Tessa Yao

    OutlookiCal
  • CEE 2021 Virtual Commencement Celebration

    Thu, May 13, 2021 @ 02:30 PM - 03:00 PM

    Sonny Astani Department of Civil and Environmental Engineering

    University Calendar


    To honor and celebrate the Class 2020-21 Civil and Environmental Engineering graduates via zoom, please click on the following link:

    https://usc.zoom.us/j/97944495184?pwd=ZXN5d0FPdk1XcEdBdnl6dHZYaHhjQT09
    Passcode: 332144

    Location: ONLINE

    WebCast Link: https://usc.zoom.us/j/97944495184?pwd=ZXN5d0FPdk1XcEdBdnl6dHZYaHhjQT09

    Audiences: Everyone Is Invited

    Contact: Salina Palacios

    OutlookiCal
  • Repeating EventVirtual First-Year Admission Information Session

    Thu, May 13, 2021 @ 04:00 PM - 05:00 PM

    Viterbi School of Engineering Undergraduate Admission

    Workshops & Infosessions


    Our virtual information session is a live presentation from a USC Viterbi admission counselor designed for high school students and their family members to learn more about the USC Viterbi undergraduate experience. Our session will cover an overview of our undergraduate engineering programs, the application process, and more on student life. Guests will be able to ask questions and engage in further discussion toward the end of the session.

    Please Register Here!

    Audiences: Everyone Is Invited

    View All Dates

    Contact: Viterbi Undergraduate Admission

    OutlookiCal
  • MFD Distinguished Alumni and Graduates Award Event ​

    Thu, May 13, 2021 @ 05:00 PM - 06:00 PM

    Mork Family Department of Chemical Engineering and Materials Science, USC Viterbi School of Engineering

    Receptions & Special Events


    Honoring Distinguished Alumni & Outstanding 2021 MFD Graduates

    Zoom: https://usc.zoom.us/j/92621973057

    Meeting ID: 926 2197 3057



    WebCast Link: https://usc.zoom.us/j/92621973057​

    Audiences: Everyone Is Invited

    Contact: Greta Harrison

    OutlookiCal
  • PhD Defense - Mian Wan

    Fri, May 14, 2021 @ 01:30 PM - 04:00 PM

    Computer Science

    University Calendar


    PhD Candidate: Mian Wan



    Date: May 14th, 2021

    Time: 1:30-4pm

    title: Automatic Detection and Optimization of Energy Optimizable UIs in Android Applications Using Program Analysis


    Committee: Prof. William Halfond (chair), Prof. Nenad Medvidovic, Prof. Chao Wang, Prof. Jyotirmoy Deshmukh, Prof. Sandeep Gupta

    Zoom link:
    https://usc.zoom.us/j/94745439598

    Abstract:
    Mobile apps and smartphones play an essential role in our daily life, and the energy consumption of an app has become an important concern for its developers. Given the fact that an app's display energy consumption can be optimized at the software level, many techniques have been proposed to help optimize the apps' display energy on OLED screens. However, there are no automated techniques for detecting and repairing energy optimizable user interfaces (UIs) in Android apps. Instead, for detection, the developers can only manually examine each UI's colors and determine which UIs are optimizable based on their intuition. As for repairing, the developers need to manually analyze the app to modify the color settings to recolor the UIs.

    My dissertation overcomes the above challenges and limitations by automating the process of detecting and repairing energy optimizable UIs in mobile apps. I have two main insights underlying my research. The first insight is that display energy optimization potential can be quantified. Based on this insight, I designed and developed an approach that combines dynamic analysis, power modeling, and color transformation to detect energy optimizable UIs. The second insight is that both types of program analyses can be used to gather UI information. Based on this insight, I designed and developed an approach that employs dynamic analysis, static analysis, and a search based technique to model and recolor Android UIs. In the empirical evaluation, my techniques were highly effective and efficient in detecting and repairing the energy optimizable UIs in mobile apps. These results indicate that my detection technique can help developers in locating energy optimizable UIs and that my repair technique can help developers in repairing energy optimizable UIs while maintaining their aesthetic quality.

    WebCast Link: https://usc.zoom.us/j/94745439598

    Audiences: Everyone Is Invited

    Contact: Lizsl De Leon

    OutlookiCal