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

Wonyoung Park

dblp:94/5239 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Computer networks · 3 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 since 2021

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.

Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%

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

TopicWeightPapersLastEvidence papers
Collaborative and social computing
video conferencing
0.612022
Distracting Moments in Videoconferencing: A Look Back at the Pandemic Period · CHI 2022
Collaborative and social computing
remote work
0.212022
Distracting Moments in Videoconferencing: A Look Back at the Pandemic Period · CHI 2022

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

participatory design workshop · 0.6focus groups · 0.6
YearPublicationVenuePosition
2022 Distracting Moments in Videoconferencing: A Look Back at the Pandemic Period
abstract
The COVID-19 pandemic has forced workers around the world to switch their working paradigms from on-site to video-mediated communication. Despite the advantages of videoconferencing, diverse circumstances have prevented people from focusing on their work. One of the most typical problems they face is that various surrounding factors distract them during their meetings. This study focuses on conditions in which remote workers are distracted by factors that disturb, interrupt, or restrict them during their meetings. We aim to explore the various problem situations and user needs. To understand users’ pain points and needs, focus group interviews and participatory design workshops were conducted to learn about participants’ troubled working experiences over the past two years and the solutions they expected. Our study provides a unified framework of distracting factors by which to understand causes of poor user experience and reveals valuable implications to improve videoconferencing experiences.
Minha Lee, Wonyoung Park, Sunok Lee
CHI2
2021 Discovering the Design Challenges of Autonomous Vehicles through Exploring Scenarios via an Immersive Design Workshop
abstract
A major challenge for autonomous vehicles (AVs) today is driving in a complex urban environment where various traffic participants, infrastructures, and events are mixed. A growing body of research is studying the interaction between AVs and human road users (HRUs) to mitigate this challenge. Although traffic is complicated, research has focused on limited situations, such as pedestrian crossings. This study aims to explore scenarios that have a high possibility of causing problems in mixed traffic situations. We devised a design workshop method using miniatures and small cameras, thus allowing participants to experience scenarios from the HRU perspective and easily creating new road situations to uncover various problems. By analyzing 133 scenarios found through the workshop, we defined five factors and 51 elements of AV–HRU problem scenarios. Through qualitative analysis of the factors found through experiments and comparison with existing studies, we identified research gaps and discussed future design challenges.
Jaemyung Lee 0001, Wonyoung Park
Conference on Designing Interactive Systems2
2012 Analysis of minimal backlogging-based available bandwidth estimation mechanism
Seung Yeob Nam, Sunggon Kim, Wonyoung Park
Comput. Commun.3
2012 Dynamic Parameter Adaptation for M-LWDF/M-LWWF Scheduling
abstract
M-LWWF/M-LWDF scheduling schemes have attracted much interest due to their ability to both stabilize queues whenever possible and control delay through parameter selection. However, a good implementation of these schedulers would require a mechanism to minimize the required fraction of the bandwidth while satisfying its stability and delay requirements. To the best of our knowledge, previous works on these scheduling policies did not address the problem of minimizing the bandwidth utilization while satisfying delay constraints. In this paper, we explore the solution of this problem using a joint bandwidth and weight adaptation approach. We characterize the problem solution space for M-LWWF and M-LWDF scheduling, assuming time-varying traffic. We also show that, starting from any point in the solution space, simple dynamic bandwidth and weight updates can surely lead to the convergence to the optimal operation point in this space. Based on these characteristics, we propose a dynamic parameter adaptation algorithm that is able to track the time-varying optimal operation points for dynamic traffic and channel conditions. Simulation results show the efficiency of our proposed algorithm in tracking the optimal operation points in dynamic traffic and channel settings.
Ju Yong Lee, Sameh Sorour, Shahrokh Valaee, Wonyoung Park
IEEE Trans. Wirel. Commun.4
2006 Bandwidth Optimization Algorithm Based on Bandwidth Ratio Adjustment in Generalized Processor Sharing Servers
abstract
We consider a bandwidth optimization problem in a Generalized Processor Sharing servers with multiple class queues to minimize the total bandwidth such that QoS requirements for each class queue are satisfied. In our previous paper [13], since it is difficult to obtain the performance such as the delay distribution mathematically with self-similar input traffic in a GPS server, we obtained an optimized bandwidth vector using a simulation-based optimization technique. However, the previous optimization algorithm requires rather long simulation time to solve the problem by using exterior penalty function methods. We propose a new bandwidth optimization algorithm based on bandwidth ratio adjustment without complex calculations. In numerical results, the required time to find the optimal bandwidth allocation in GPS servers is greatly reduced.
Wonyoung Park, Ju Yong Lee, Dan Keun Sung
ICC1