Birdwatching

Overview (1 min) | Participant. Oct 2019 ~ Jun 2020

Utilized C++ to implement features for character navigation, combat, item selection, map loading and NPC iteraction.
Overview (1 min) | Participant. Jun 2020 ~ Oct 2020

Collaborated in designing and programming a robot with STM32 embedded systems for moving simulated patients to designated beds; programmed and controlled the robotic arm for task execution. Achieved Fourth Place in the second round of the competition.
Overview (1 min) | Participant. Oct 2020 ~ Jun 2021

Enhanced a Fortran-based weather forecasting model (WRF) by optimizing compilation flags and parallelization strategies. Ranked 1st on the WRF application and 6th overall among 13 finalist teams in the competition.
Overview (1 min) | Team leader. Sep 2022 ~ Dec 2022

Led the design and development of a Visual Studio Code extension enabling pull request (PR) workflows with Azure DevOps.
Overview (1 min) | Team leader. Jan 2022 ~ May 2023

Led a team to optimize various applications, including numerical simulation and large language models (LLMs). Awarded 2nd Place among 300 teams worldwide.
Overview (1 min) | Paper
Authors: Kyoungjun Park, Zhiyuan He, Cheng Luo, Yi Xu*, Lili Qiu, Changhan Ge, Muhammad Muaz, Yuqing Yang
We propose and evaluate new algorithms for video-aware mobility management in satellite networks, jointly optimizing satellite handoff and video bitrate to improve streaming experience for both single and multiple users.
Overview (1 min) | Paper | Slides
Authors: Zhiyuan He, Yi Xu*, Cheng Luo, Lili Qiu, Yuqing Yang
Satellites can be applied as content replica servers to improve client experience in the remote locations. We optimized the placement of servers in satellite networks to reduce transmission and storage costs while considering satellite movement.
Overview (1 min) | Paper | Slides
Authors: Pan Peng, Christian Sohler, Yi Xu* (alphabetical order)
We proposed new cost functions about SLC, which reflects properties of datasets, and estimated our costs in sublinear time. We studied this problem in both distance and similarity measurements, and conducted extensive experiments to validate our results. We also proved the lower bounds, and our algorithms nearly match them.
Presented an in-depth overview of our work on sublinear algorithms for estimating SLC costs.
Briefly presented recent work on sublinear algorithms for estimating SLC costs.
Teaching assistance, Master's course, USTC, 2024
This course mainly introduces the basics of Randomized Algorithms, Approximation Algorithms, and Distributed Algorithms, and the methods to analyze the efficiency and correctness of algorithms.
Teaching assistance, Bachelor's course, USTC, 2025
This course is a theory-oriented course, and introduces modern algorithmic techniques for big data.