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

Han-Gyu Ko

dblp:99/8283 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

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

Software engineering, systems software and programming languages · 4Databases, data management, data science and information retrieval · 2Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%

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

TopicWeightPapersLastEvidence papers
Services computing and microservices › service selection
qos-aware service selection
0.212016
Adaptive Service Selection According to the Service Density in Multiple Qos Aspects · IEEE Trans. Serv. Comput. 2016
Services computing and microservices
service composition
0.212016
Adaptive Service Selection According to the Service Density in Multiple Qos Aspects · IEEE Trans. Serv. Comput. 2016
Services computing and microservices
service selection
0.212016
Adaptive Service Selection According to the Service Density in Multiple Qos Aspects · IEEE Trans. Serv. Comput. 2016

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

utility optimization · 0.2heuristic search · 0.2
YearPublicationVenuePosition
2018 Multi-criteria matrix localization and integration for personalized collaborative filtering in IoT environments
Han-Gyu Ko, In-Young Ko, Dongman Lee
Multim. Tools Appl.1
2016 SoIoT: Toward A User-Centric IoT-Based Service Framework
abstract
An emerging issue in urban computing environments is the seamless selection, composition, and delivery of user-centric services that run over what is known as the Internet of Things (IoT). This challenge is about enabling services actuated by IoT devices to be delivered spontaneously from the perspective of users. To accomplish this goal, we propose the Service-Oriented Internet of Things (SoIoT), a user-centric IoT-based service framework, which integrates services that utilize IoT resources in an urban computing environment. This framework provides a task-oriented computing approach that enables the composition of IoT-based services in a spontaneous manner to accomplish a user task. Tasks can also be recommended to users based on the available IoT resources in an environment and on the contextual knowledge that is represented and managed in social, spatial, and temporal aspects. These tasks are then bound to a set of service instances and performed in a distributed manner. This final composition ensures the Quality of Service (QoS) requirements of the tasks and is assigned to multiple client devices for the efficient utilization of IoT resources. We prove the practicality of our approach by showing a real-case service scenario implemented in our IoT-based test-bed as well as experimental results.
In-Young Ko, Han-Gyu Ko, Angel Jiménez Molina, Jung-Hyun Kwon
ACM Trans. Internet Techn.2
2016 Adaptive Service Selection According to the Service Density in Multiple Qos Aspects
abstract
In task-oriented service computing, a user's computing goal is modeled and represented as a task, which is composed of activities that are performed by accessing service instances in a local environment. The abstract service requirements specified in an activity of a task are resolved and bound to service instances dynamically in runtime. When there are many candidate services that provide similar capabilities for a task, it is essential to consider quality of service (QoS) such as response time, latency, and availability to determine which service instances to use. Finding a service composition that meets the optimal level of quality is a well-known NP-hard problem-the time complexity for task-level (global) optimization increases exponentially as the number of services and the number of quality attributes increase. Although it is possible to use a heuristic approach that shows a reasonable response time with a certain level of service quality, this strategy often fails when there are hard QoS constraints that need to be considered in the task level. In this paper, to overcome this limitation, we propose an adaptive method of selecting services based on the hardness of QoS constraints. The basic idea is to sample services that represent a specific quality-value range. The quality-value range of candidate services is divided into smaller sub-ranges in which representative services are sampled and evaluated. At this time, the size of the QoS sub-ranges is determined adaptably based on the hardness of the QoS constraints. In a QoS sub-range, candidate services may have a similar QoS value for a quality attribute. We calculate the utility of candidate services in a QoS sub-range and sample the highest utility service. This process of sampling services and evaluating their utility value is repeated until it makes a composite service that has the highest level of global utility for a task. Our experiment results show that the proposed approach effectively improves the success rate of service composition while achieving a certain level of global optimality and maintaining a reasonable level of performance. Our approach shows up to 80 percent improvement in success rate in comparison to the existing heuristic approaches.
Jae-Hyun Cho, Han-Gyu Ko, In-Young Ko
IEEE Trans. Serv. Comput.2
2015 An Empirical Study of the Use of Multi-dimensional Contexts for Collaborative-Filtering-Based Service Recommendations in IoT Environments
Joo-Sik Son, Han-Gyu Ko, In-Young Ko
ICWE2
2014 Place-aware opportunistic service recommendation scheme in a smart space with Internet of Things
abstract
In this paper, we present an opportunistic service recommendation scheme in a place with smart objects to provide users with appropriate composite services to accomplish their task goals. The proposed scheme infers possible tasks from interactions that people have experienced with smart objects including other places that are similar to a given place. The proposed scheme then evaluates the candidate tasks by measuring quality satisfaction of each task against given QoS constraints. We test the proposed scheme on our three smart testbeds where various smart objects equipped. Experiment results show that the proposed scheme finds potential tasks in the testbeds in a reasonable time.
Han-Gyu Ko, Byoungoh Kim, Dongman Lee, In-Young Ko, Soon J. Hyun
CCNC1
2013 Distributed Coordination of IoT-Based Services by Using a Graph Coloring Algorithm
abstract
As emerging paradigms such as service-oriented computing and ubiquitous computing become combined, end-users are now being provided with a myriad of services to utilize smart objects to achieve their goals. The most promising standard to utilize these services is WS-BPEL, which employs centralized coordination for simpler management of interaction and synchronization. However, centralized approaches suffer from scalability and heterogeneity issues as well as inefficiency, especially when the system is managed across different entities. Moreover, it is quite unrealistic to assume that one client device has permissions to access all available operations of smart objects and can also support different types of required communication interfaces. Hence, in this paper, we propose a novel distributed coordination scheme that helps end-users collaborate more efficiently to achieve their common goals. Unlike traditional distributed coordination methods, which are limited to static environments, the proposed scheme incorporates dynamic ubiquitous computing environments where requirements of tasks and available resources can be altered throughout task execution. Under the proposed scheme, mobile client devices are able to self-collaborate without a dedicated central server by spontaneously electing a task coordinator among them. The proposed scheme also deals with dynamic events such as the joining and leaving of users, clients and tasks, and supporting dynamic reallocation while keeping them transparent for end-users. Finally, the proposed scheme is evaluated through simulations with different numbers of services and client devices, showing improved results in performance optimality, assignment efficiency, and dependency coverage of composition.
Jang-Ho Choi, Jae-Hyun Cho, Han-Gyu Ko, In-Young Ko
COMPSAC3
2010 A Blog-Centered IPTV Environment for Enhancing Contents Provision, Consumption, and Evolution
In-Young Ko, Han-Gyu Ko
ICWE3