Hyunjoo Lee

dblp:49/6554 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2023
—ORCID · conflict

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

Computer networks · 2 · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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.

Network and information security
1 paper
Web and mobile security · 100%
Computer networks
1 paper
Internet architecture and protocols · 91% Wireless networking · 9%

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

TopicWeightPapersLastEvidence papers
Web and mobile security
online advertising fraud
0.512021
AdCube: WebVR Ad Fraud and Practical Confinement of Third-Party Ads · USENIX Security Symposium 2021
Web and mobile security
web security
0.512021
AdCube: WebVR Ad Fraud and Practical Confinement of Third-Party Ads · USENIX Security Symposium 2021
Internet architecture and protocols › network coding
minimum-cost multicast
0.112005
Achieving minimum-cost multicast: a decentralized approach based on network coding · INFOCOM 2005
Internet architecture and protocols
multicast
0.112005
Achieving minimum-cost multicast: a decentralized approach based on network coding · INFOCOM 2005
Internet architecture and protocols
network coding
0.112005
Achieving minimum-cost multicast: a decentralized approach based on network coding · INFOCOM 2005
Wireless networking › wireless group communication › wireless multicast
minimum-energy multicast
0.012005
Achieving minimum-cost multicast: a decentralized approach based on network coding · INFOCOM 2005

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

measurement study · 0.5confinement mechanism · 0.5steiner tree approximation · 0.1decentralized algorithm · 0.1
YearPublicationVenuePosition
2023 Dynamic Selection Scheme of LTE-M and 5G for Efficient Maritime Communication Based on Traffic Volume
Mahnsuk Yoon, Jaeuk Kwon, Hyunjoo Lee, Kyucheol Cho, Ji Hun Seo, Jangkyu Yun
APNOMS3
2021 AdCube: WebVR Ad Fraud and Practical Confinement of Third-Party Ads
Hyunjoo Lee, Daejun Kim, Suman Jana, Insik Shin, Sooel Son
USENIX Security Symposium1
2014 Determining the factors that influence college students' adoption of smartphones
abstract
This study examines smartphone adoption behavior among American college students by combining all components of innovation diffusion theory (IDT), the technology acceptance model (TAM), the value‐based adoption model (VAM), and the social influence (SI) model. Data indicate that the smartphone adoption rates are beyond the early majority and are now approaching the late majority. The findings of analysis of variance tests revealed that all variables of TAM, VAM, and SI varied across the adopter groups: The current adopter's mean values of the variables were the highest, followed by those of potential and nonadoption groups. Multinomial logistic regression (MLR) analyses revealed that perceived value and affiliation mainly determine the different perceptions of adoption groups. Smartphone adoption, however, was relatively unaffected by perceived ease of use and perceived usefulness. Perceived popularity, perceived price, and ethnicity played a role in distinctive determinants between current adopters and nonadopters. The results imply that adopters perceive smartphones as not only a worthwhile device in which to invest money but also a symbolic device to signal their affiliation and timely technology adoption. Another intriguing finding is the differences of interest in contents between current adopters and nonadopters. Social interactions via social networking services, acquisition for lifestyle, information seeking, and entertainment via gaming were the main applications of interest.
Daejoong Kim, Heasun Chun, Hyunjoo Lee
J. Assoc. Inf. Sci. Technol.3
2005 Achieving minimum-cost multicast: a decentralized approach based on network coding
abstract
We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with existing decentralized schemes for constructing network codes, constitute a fully decentralized approach for achieving minimum-cost multicast. Our approach is in sharp contrast to the prevailing approach based on approximation algorithms for the directed Steiner tree problem, which is suboptimal and generally assumes centralized computation with full network knowledge. We also give extensions beyond the basic problem of fixed-rate multicast in networks with directed point-to-point links, and consider the case of elastic rate demand as well as the problem of minimum-energy multicast in wireless networks.
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, Muriel Médard, Ebad Ahmed, Hyunjoo Lee
INFOCOM6