Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

SoYoung Park

dblp:71/1404 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing › mobile edge computing › computation offloading › mobile computation offloading
cyber foraging
0.012003
Tactics-Based Remote Execution for Mobile Computing · MobiSys 2003
Edge and fog computing
remote execution
0.012003
Tactics-Based Remote Execution for Mobile Computing · MobiSys 2003

Methods — techniques the papers use, named apart from their topics

runtime system · 0.0dynamic repartitioning · 0.0
YearPublicationVenuePosition
2025 FnRGNN: Distribution-aware Fairness in Graph Neural Network
abstract
Graph Neural Networks (GNNs) excel at learning from structured data, yet fairness in regression tasks remains underexplored. Existing approaches mainly target classification and representation-level debiasing, which cannot fully address the continuous nature of node-level regression. We propose FnRGNN, a fairness-aware in-processing framework for GNN-based node regression that applies interventions at three levels: (i) structure-level edge reweighting, (ii) representation-level alignment via MMD, and (iii) prediction-level normalization through Sinkhorn-based distribution matching. This multi-level strategy ensures robust fairness under complex graph topologies. Experiments on four real-world datasets demonstrate that FnRGNN reduces group disparities without sacrificing performance. Code is available at https://github.com/sybeam27/FnRGNN.
SoYoung Park, Sungsu Lim
CIKM1
2025 Zero-Shot Industrial Anomaly Segmentation with Image-Aware Prompt Generation
SoYoung Park, MinGyu Choi, Seunghoon Han, Jong-Ryul Lee, Sungsu Lim
PAKDD (5)1
2003 Tactics-Based Remote Execution for Mobile Computing
abstract
Remote execution can transform the puniest mobile device into a computing giant able to run resource-intensive applications such as natural language translation, speech recognition, face recognition, and augmented reality. However, easily partitioning these applications for remote execution while retaining application-specific information has proven to be a difficult challenge. In this paper, we show that automated dynamic repartitioning of mobile applications can be reconciled with the need to exploit application-specific knowledge. We show that the useful knowledge about an application relevant to remote execution can be captured in a compact declarative form called tactics. Tactics capture the full range of meaningful partitions of an application and are very small relative to code size. We present the design of a tactics-based remote execution system, Chroma, that performs comparably to a runtime system that makes perfect partitioning decisions. Furthermore, we show that Chroma can automatically use extra resources in an over-provisioned environment to improve application performance.
Rajesh Krishna Balan, Mahadev Satyanarayanan, SoYoung Park, Tadashi Okoshi
MobiSys3
2002 Balancing Performance, Energy, and Quality in Pervasive Computing
abstract
We describe Spectra, a remote execution system for battery-powered clients used in pervasive computing. Spectra enables applications to combine the mobility of small devices with the greater processing power of static compute servers. Spectra is self-tuning: it monitors both application resource usage and the availability of resources in the environment, and dynamically determines how and where to execute application components. In making this determination, Spectra balances the competing goals of performance, energy conservation, and application quality. We have validated Spectra's approach on the Compaq Itsy v2.2 and IBM ThinkPad 560X using a speech recognizer a document preparation system, and a natural language translator. Our results confirm that Spectra almost always selects the best execution plan, and that its few suboptimal choices are very close to optimal.
Jason Flinn, SoYoung Park, Mahadev Satyanarayanan
ICDCS2