Jongik Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jongik Kim has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Tae-Sun Chung
Department of Artificial Intelligence, Ajou University, Suwon, Republic of Korea
4 shared publications - Prince Hamandawana
Department of Software, Ajou University, Suwon 16499, Republic of Korea
2 shared publications - Awais Khan
Oak Ridge National Laboratory, Oak Ridge, TN, USA
1 shared publication - Aziz Hasanov
Ajou University, Korea, Republic of
1 shared publication - Chen Li
University of California, Irvine, Irvine, USA
1 shared publication - Hongrae Lee
Google, Mountain View, CA, USA
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- p. 1
A Data-Driven Framework for Route Structure Modeling in Strategic Air Traffic Flow Management
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- p. 1
Open AccessA Data-Driven Framework for Route Structure Modeling in Strategic Air Traffic Flow Management
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1477-1486
Learning Graph Edit Distance via Node Matching Patterns
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1477-1486
Open AccessLearning Graph Edit Distance via Node Matching Patterns
- Open Access
- 26 June 2024
- Published by MDPI AG in Electronics
- Vol. 13 (13) , 2498
Lightlore: An Adaptation Framework for Design and Development of xAPI-Based Adaptive Context-Aware Learning Environments
The age of pervasive computing has initiated a boom in the development of adaptive context-aware learning environments (ACALEs), i.e., systems that are capable of detecting a learner’s context and providing adaptive learning services based on this context. Many of the existing educational systems were developed as standalone applications for specific or a small range of adaptive educational scenarios. It would be extremely helpful for developers and educators to have a unified framework that provides an infrastructure for the development of ACALEs. In this study, we propose Lightlore—an adaptation framework that enables the development of different types of ACELEs for a wide range of learning scenarios in formal and informal settings. We first used scenario-based design (SBD) as the design methodology for creating a conceptual model of Lightlore. Educational scenarios were adopted from the results of a previous literature review. We then developed a proof-of-concept implementation of Lightlore, with a hypermedia system for learning data structures that uses the adaptation service of Lightlore. This implementation is essentially an adaptation infrastructure and a programming API for creating new (or transforming existing) adaptive and context-aware educational services. It exploits the experience API (xAPI), a modern e-learning standard and learning record store, thus making coupling with existing learning environments easier. We expect that diverse types of users will benefit from using Lightlore, such as learners, educators, learning environment developers, and researchers on educational technologies.
- 26 June 2024
- Published by MDPI AG in Electronics
- Vol. 13 (13) , 2498
Open AccessLightlore: An Adaptation Framework for Design and Development of xAPI-Based Adaptive Context-Aware Learning Environments
The age of pervasive computing has initiated a boom in the development of adaptive context-aware learning environments (ACALEs), i.e., systems that are capable of detecting a learner’s context and providing adaptive learning services based on this context. Many of the existing educational systems were developed as standalone applications for specific or a small range of adaptive educational scenarios. It would be extremely helpful for developers and educators to have a unified framework that provides an infrastructure for the development of ACALEs. In this study, we propose Lightlore—an adaptation framework that enables the development of different types of ACELEs for a wide range of learning scenarios in formal and informal settings. We first used scenario-based design (SBD) as the design methodology for creating a conceptual model of Lightlore. Educational scenarios were adopted from the results of a previous literature review. We then developed a proof-of-concept implementation of Lightlore, with a hypermedia system for learning data structures that uses the adaptation service of Lightlore. This implementation is essentially an adaptation infrastructure and a programming API for creating new (or transforming existing) adaptive and context-aware educational services. It exploits the experience API (xAPI), a modern e-learning standard and learning record store, thus making coupling with existing learning environments easier. We expect that diverse types of users will benefit from using Lightlore, such as learners, educators, learning environment developers, and researchers on educational technologies.
- Open Access
- 1 January 2024
- Published by Tech Science Press in Computers, Materials & Continua
- Vol. 78 (3) , 4263-4282
A Framework for Enhancing Privacy and Anonymity in Blockchain-Enabled IoT Devices
With the increase in IoT (Internet of Things) devices comes an inherent challenge of security. In the world today, privacy is the prime concern of every individual. Preserving one’s privacy and keeping anonymity throughout the system is a desired functionality that does not come without inevitable trade-offs like scalability and increased complexity and is always exceedingly difficult to manage. The challenge is keeping confidentiality and continuing to make the person innominate throughout the system. To address this, we present our proposed architecture where we manage IoT devices using blockchain technology. Our proposed architecture works on and off blockchain integrated with the closed-circuit television (CCTV) security camera fixed at the rental property. In this framework, the CCTV security camera feed is redirected towards the owner and renter based on the smart contract conditions. One entity (owner or renter) can see the CCTV security camera feed at one time. There is no third-party dependence except for the CCTV security camera deployment phase. Our contributions include the proposition of framework architecture, a novel smart contract algorithm, and the modification to the ring signatures leveraging an existing cryptographic technique. Analyses are made based on different systems’ security and key management areas. In an empirical study, our proposed algorithm performed better in key generation, proof generation, and verification times. By comparing similar existing schemes, we have shown the proposed architectures’ advantages. Until now, we have developed this system for a specific area in the real world. However, this system is scalable and applicable to other areas like healthcare monitoring systems, which is part of our future work.
- 1 January 2024
- Published by Tech Science Press in Computers, Materials & Continua
- Vol. 78 (3) , 4263-4282
Open AccessA Framework for Enhancing Privacy and Anonymity in Blockchain-Enabled IoT Devices
With the increase in IoT (Internet of Things) devices comes an inherent challenge of security. In the world today, privacy is the prime concern of every individual. Preserving one’s privacy and keeping anonymity throughout the system is a desired functionality that does not come without inevitable trade-offs like scalability and increased complexity and is always exceedingly difficult to manage. The challenge is keeping confidentiality and continuing to make the person innominate throughout the system. To address this, we present our proposed architecture where we manage IoT devices using blockchain technology. Our proposed architecture works on and off blockchain integrated with the closed-circuit television (CCTV) security camera fixed at the rental property. In this framework, the CCTV security camera feed is redirected towards the owner and renter based on the smart contract conditions. One entity (owner or renter) can see the CCTV security camera feed at one time. There is no third-party dependence except for the CCTV security camera deployment phase. Our contributions include the proposition of framework architecture, a novel smart contract algorithm, and the modification to the ring signatures leveraging an existing cryptographic technique. Analyses are made based on different systems’ security and key management areas. In an empirical study, our proposed algorithm performed better in key generation, proof generation, and verification times. By comparing similar existing schemes, we have shown the proposed architectures’ advantages. Until now, we have developed this system for a specific area in the real world. However, this system is scalable and applicable to other areas like healthcare monitoring systems, which is part of our future work.
- 7 March 2023
- Published by Elsevier in Pattern Recognition Letters
- Vol. 168, 71-78
Efficient graph edit distance computation using isomorphic vertices
- 7 March 2023
- Published by Elsevier in Pattern Recognition Letters
- Vol. 168, 71-78
Efficient graph edit distance computation using isomorphic vertices
- Open Access
- 28 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 79180-79191
Efficient Top-k Graph Similarity Search With GED Constraints
It is essential to identify similarity between graphs for various tasks in data mining, machine learning and pattern recognition. Graph edit distance (GED) is the most popular graph similarity measure thanks to its flexibility and versatility. In this paper, we study the problem of top-k graph similarity search, which finds k graphs most similar to a given query graph under the GED measure. We propose incremental GED computation algorithms that compute desired GED lower and upper bounds. Based on the algorithms, we develop novel search frameworks to address the top-k search problem. Our frameworks are also designed to use a state-of-the art indexing technique to speed up top-k search. By conducting extensive experiments on real datasets, we show that the proposed frameworks significantly improve the performance of top-k graph similarity search.
- 28 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 79180-79191
Open AccessEfficient Top-k Graph Similarity Search With GED Constraints
It is essential to identify similarity between graphs for various tasks in data mining, machine learning and pattern recognition. Graph edit distance (GED) is the most popular graph similarity measure thanks to its flexibility and versatility. In this paper, we study the problem of top-k graph similarity search, which finds k graphs most similar to a given query graph under the GED measure. We propose incremental GED computation algorithms that compute desired GED lower and upper bounds. Based on the algorithms, we develop novel search frameworks to address the top-k search problem. Our frameworks are also designed to use a state-of-the art indexing technique to speed up top-k search. By conducting extensive experiments on real datasets, we show that the proposed frameworks significantly improve the performance of top-k graph similarity search.
- Open Access
- 20 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. PP (6) , 1
Accelerating ML/DL Applications with Hierarchical Caching on Deduplication Storage Clusters
Large scale machine learning (ML) and deep learning (DL) platforms face challenges when integrated with deduplication enabled storage clusters. In the quest to achieve smart and efficient storage utilization, removal of duplicate data introduces bottlenecks since deduplication alters the I/O transaction layout of the storage system. Therefore, it is critical to address such deduplication overhead for acceleration of ML/DL computation in deduplication storage. Existing state of the art ML/DL storage solutions such as Alluxio and AutoCache adopt non deduplication-aware caching mechanisms, which lacks the much needed performance boost when adopted in deduplication enabled ML/DL clusters. In this paper, we introduce Redup, which eliminates the performance drop caused by enabling deduplication in ML/DL storage clusters. At the core, is a Redup Caching Manager (RDCM), composed of a 2-tier deduplication layout-aware caching mechanism. The RDCM provides an abstraction of the underlying deduplication storage layout to ML/DL applications and provisions a decoupled acceleration of object reconstruction during ML/DL read operations. Our Redup evaluation shows negligible performance drop in ML/DL training performances as compared to a cluster without deduplication, whilst significantly outperforming Alluxio and AutoCache in terms of various performance metrics.
- 20 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. PP (6) , 1
Open AccessAccelerating ML/DL Applications with Hierarchical Caching on Deduplication Storage Clusters
Large scale machine learning (ML) and deep learning (DL) platforms face challenges when integrated with deduplication enabled storage clusters. In the quest to achieve smart and efficient storage utilization, removal of duplicate data introduces bottlenecks since deduplication alters the I/O transaction layout of the storage system. Therefore, it is critical to address such deduplication overhead for acceleration of ML/DL computation in deduplication storage. Existing state of the art ML/DL storage solutions such as Alluxio and AutoCache adopt non deduplication-aware caching mechanisms, which lacks the much needed performance boost when adopted in deduplication enabled ML/DL clusters. In this paper, we introduce Redup, which eliminates the performance drop caused by enabling deduplication in ML/DL storage clusters. At the core, is a Redup Caching Manager (RDCM), composed of a 2-tier deduplication layout-aware caching mechanism. The RDCM provides an abstraction of the underlying deduplication storage layout to ML/DL applications and provisions a decoupled acceleration of object reconstruction during ML/DL read operations. Our Redup evaluation shows negligible performance drop in ML/DL training performances as compared to a cluster without deduplication, whilst significantly outperforming Alluxio and AutoCache in terms of various performance metrics.
- Open Access
- 27 September 2020
- Published by MDPI AG in Electronics
- Vol. 9 (10) , 1581
FTRM: A Cache-Based Fault Tolerant Recovery Mechanism for Multi-Channel Flash Devices
Flash memory prevalence has reached greater extents with its performance and compactness capabilities. This enables it to be easily adopted as storage media in various portable devices which includes smart watches, cell-phones, drones, and in-vehicle infotainment systems to mention but a few. To support large flash storage in such portable devices, existing flash translation layers (FTLs) employ a cache mapping table (CMT), which contains a small portion of logical page number to physical page number (LPN-PPN) mappings. For robustness, it is of importance to consider the CMT reconstruction mechanisms during system recovery. Currently, existing approaches cannot overcome the performance penalty after experiencing unexpected power failure. This is due to the disregard of the delay caused by inconsistencies between the cached page-mapping entries in RAM and their corresponding mapping pages in flash storage. Furthermore, how to select proper pages for reconstructing the CMT when rebooting a device needs to be revisited. In this study we address these problems and propose a fault tolerant power-failure recovery mechanism (FTRM) for flash memory storage systems. Our empirical study shows that FTRM is an efficient recovery and robust protocol.
- 27 September 2020
- Published by MDPI AG in Electronics
- Vol. 9 (10) , 1581
Open AccessFTRM: A Cache-Based Fault Tolerant Recovery Mechanism for Multi-Channel Flash Devices
Flash memory prevalence has reached greater extents with its performance and compactness capabilities. This enables it to be easily adopted as storage media in various portable devices which includes smart watches, cell-phones, drones, and in-vehicle infotainment systems to mention but a few. To support large flash storage in such portable devices, existing flash translation layers (FTLs) employ a cache mapping table (CMT), which contains a small portion of logical page number to physical page number (LPN-PPN) mappings. For robustness, it is of importance to consider the CMT reconstruction mechanisms during system recovery. Currently, existing approaches cannot overcome the performance penalty after experiencing unexpected power failure. This is due to the disregard of the delay caused by inconsistencies between the cached page-mapping entries in RAM and their corresponding mapping pages in flash storage. Furthermore, how to select proper pages for reconstructing the CMT when rebooting a device needs to be revisited. In this study we address these problems and propose a fault tolerant power-failure recovery mechanism (FTRM) for flash memory storage systems. Our empirical study shows that FTRM is an efficient recovery and robust protocol.
- Open Access
- 25 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 175776-175787
HGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation
Graph edit distance (GED) is a measure for quantifying the similarity between two graphs. Because of its flexibility and versatility, GED is widely used in many real applications. However, the main disadvantage of GED is its high computational cost. Many solutions have been proposed to speed up GED computation, but most of them focus on developing serial algorithms and only very few solutions consider parallel computing. In this paper, we study a parallel GED computation to elaborate a fast and precise algorithm. Unlike existing solutions that utilize either a depth-first or a best-first search, we propose a hybrid approach that combines depth-first and best-first search paradigms. Our approach can quickly find tighter GED upper bounds, and effectively prune the search space using the upper bounds. Based on the approach, we develop an efficient parallel GED computation algorithm named HGED. To maximize thread utility, HGED is also equipped with a novel dynamic load balancing scheme whose main focus is on reducing the overhead of thread synchronization. Experimental results on widely used real datasets show that, on average, HGED outperforms the state-of-the art serial algorithm AStar + -LSa by 6 times and the state-of-the parallel algorithm PGED by 4 times.
- 25 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 175776-175787
Open AccessHGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation
Graph edit distance (GED) is a measure for quantifying the similarity between two graphs. Because of its flexibility and versatility, GED is widely used in many real applications. However, the main disadvantage of GED is its high computational cost. Many solutions have been proposed to speed up GED computation, but most of them focus on developing serial algorithms and only very few solutions consider parallel computing. In this paper, we study a parallel GED computation to elaborate a fast and precise algorithm. Unlike existing solutions that utilize either a depth-first or a best-first search, we propose a hybrid approach that combines depth-first and best-first search paradigms. Our approach can quickly find tighter GED upper bounds, and effectively prune the search space using the upper bounds. Based on the approach, we develop an efficient parallel GED computation algorithm named HGED. To maximize thread utility, HGED is also equipped with a novel dynamic load balancing scheme whose main focus is on reducing the overhead of thread synchronization. Experimental results on widely used real datasets show that, on average, HGED outperforms the state-of-the art serial algorithm AStar + -LSa by 6 times and the state-of-the parallel algorithm PGED by 4 times.
- Open Access
- 25 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 98193-98204
Optimized Signature Selection for Efficient String Similarity Search
In this paper, we study the problem of string similarity search to retrieve in a database all strings similar to a query string within a given threshold. To measure the similarity between strings, we use edit distance. Many algorithms have been proposed under a filtering-and-verification framework to solve the problem. To reduce the overhead of edit distance verification, it is crucial to efficiently generate a small number of candidates in the filtering phase. Recently, an index structure named HSTree has been proposed for efficiently generating candidate strings. To generate candidates, they select and utilize HSTree nodes at a specific level calculated from a given threshold. In this paper, we observe that there are many alternative ways to select HSTree nodes, and propose a novel technique that selects HSTree nodes in an optimized way based on the observation. We also propose a modified HSTree, named a threaded HSTree, which connects inverted lists of an HSTree node to inverted lists of its child nodes. With a threaded HSTree, we can reduce the overhead of index lookups in HSTree nodes while selecting optimal tree nodes. Experimental results show that the proposed technique significantly outperforms the existing technique using the HSTree.
- 25 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 98193-98204
Open AccessOptimized Signature Selection for Efficient String Similarity Search
In this paper, we study the problem of string similarity search to retrieve in a database all strings similar to a query string within a given threshold. To measure the similarity between strings, we use edit distance. Many algorithms have been proposed under a filtering-and-verification framework to solve the problem. To reduce the overhead of edit distance verification, it is crucial to efficiently generate a small number of candidates in the filtering phase. Recently, an index structure named HSTree has been proposed for efficiently generating candidate strings. To generate candidates, they select and utilize HSTree nodes at a specific level calculated from a given threshold. In this paper, we observe that there are many alternative ways to select HSTree nodes, and propose a novel technique that selects HSTree nodes in an optimized way based on the observation. We also propose a modified HSTree, named a threaded HSTree, which connects inverted lists of an HSTree node to inverted lists of its child nodes. With a threaded HSTree, we can reduce the overhead of index lookups in HSTree nodes while selecting optimal tree nodes. Experimental results show that the proposed technique significantly outperforms the existing technique using the HSTree.