Skip to content
View SAA0817's full-sized avatar
  • new york university
  • new york
  • 02:34 (UTC -04:00)

Block or report SAA0817

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
SAA0817/README.md

πŸ‘‹ Hi, I'm Junqi Mao!

πŸš€ Passionate about AI, competitive programming, and computational medicine.

πŸŽ“ Bachelor's in Statistics (Data Science & AI), Shandong University.

πŸ† ICPC Regional Silver Medalist

πŸ” Interested in interpretable AI for medical applications.

πŸ’‘ Experienced in deep learning (PyTorch, TensorFlow), algorithm optimization, and software development.

πŸ“‚ Check out my projects:

Research on Optimization and Problem Reduction of Network Maximum Flow Algorithms

Project Overview:
This project delves into the network maximum flow problem, a pivotal combinatorial optimization challenge in graph theory. It begins by establishing the fundamental symbols and definitions of the maximum flow problem and then categorizes existing methods into two main approaches: augmenting path algorithms and preflow-push algorithms.

For the augmenting path approaches, the project introduces the EK/Dinic algorithms and their optimizations, along with the MPM/ISAP variants and a comparative performance analysis. For preflow-push approaches, it focuses on analyzing the characteristics of the HLPP algorithm and proposes an improved Budget Algorithm to mitigate the "ping-pong effect", validated through extensive comparative experiments.

Additionally, the project summarizes four common problem reduction paradigms:

  • Bipartite Graph Maximum Matching
  • Minimum-Cost Maximum Flow
  • Bipartite Graph Maximum Weight Matching
  • Minimum Cut Problem

All implementations are done in C++ with comprehensive testing, making the project a valuable resource for both theoretical research and practical applications.

Tech Stack:

  • C++
  • Algorithm Optimization & Performance Testing

View Repository

Medical Image Segmentation Experiment with PaddleSeg

Project Overview: This project focuses on testing the performance of various segmentation algorithms using PaddleSeg, an end-to-end image segmentation toolkit based on PaddlePaddle. It is designed to evaluate multiple segmentation models across key metrics such as accuracy, efficiency, and robustness in medical imaging tasks. By benchmarking a diverse range of pre-trained models and custom configurations, the project aims to identify optimal strategies for medical image segmentation, facilitating improvements in both research and practical applications.

Tech Stack:

  • python
  • PaddlePaddle & PaddleSeg

View Repository

Pinned Loading

  1. Data-visualization-website---operation-C-of-sophomore-of-Weihai-University Data-visualization-website---operation-C-of-sophomore-of-Weihai-University Public

    Jupyter Notebook 2

  2. Design-of-Chinese-family-tracking-survey-database---assignment-A-of-sophomore-year-in-Weihai-Shanda Design-of-Chinese-family-tracking-survey-database---assignment-A-of-sophomore-year-in-Weihai-Shanda Public

    Python 2

  3. my-luogu my-luogu Public

    C++ 1

  4. Optimizing-Network-Maximum-Flow-Algorithms-and-Problem-Reduction Optimizing-Network-Maximum-Flow-Algorithms-and-Problem-Reduction Public

    2