• Journal of the Korea Society of Computer and Information
• /
• v.24 no.3
• /
• pp.105-112
• /
• 2019

In this paper, we propose a technique to analyze similarity between SQL queries and to assist integrating similar tables. First, the table information was extracted from the SQL queries through the query structure analyzer, and the similarity between the tables was measured using the Jacquard index technique. Then, similar table clusters are generated through hierarchical cluster analysis method and the co-occurence probability of the table used in the query is calculated. The possibility of integrating similar tables is classified by using the possibility of co-occurence of similarity table and table, and classifying them into an integrable cluster, a cluster requiring expert review, and a cluster with low integration possibility. This technique analyzes the SQL query in practice and analyse the possibility of table integration independent of the existing business, so that the existing schema can be effectively reconstructed without interruption of work or additional cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1611-1625
• /
• 2019

The emergence of new technologies and devices brings a new environment in the field of cyber security. It is not easy to predict possible security threats about new environment every time without special criteria. In other words, most malicious codes often reuse malicious code that has occurred in the past, such as bypassing detection from anti-virus or including additional functions. Therefore, we are predicting the security threats that can arise in a new environment based on the history of repeated malicious code. In this paper, we classify and define not only the internal information obtained from malicious code analysis but also the features that occur during infection and attack. We propose a method to predict and manage security threats in new environment by continuously managing and extending.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1211-1217
• /
• 2019

Developing methods to search over an encrypted database (EDB) have received a lot of attention in the last few years. Among them, order-revealing encryption (OREnc) and order-preserving encryption (OPEnc) are the core parts in the case of range queries. Recently, some ideally-secure OPEnc schemes whose ciphertexts reveal no additional information beyond the order of the underlying plaintexts have been proposed. However, these schemes either require a large round complexity or a large persistent client-side storage of size O(n) where n denotes the number of encrypted items stored in EDB. In this work, we propose a new construction of an efficient OPEnc scheme based on an OREnc scheme. Security of our construction inherits the security of the underlying OREnc scheme. Moreover, we also show that the construction of a non-interactive ideally-secure OPEnc scheme with a constant client-side storage is theoretically possible from our construction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.4099-4113
• /
• 2022

In this paper, we propose improved maximum access delay time, noise variance, and power delay profile (PDP) estimation schemes for orthogonal frequency division multiplexing (OFDM) system in multipath fading channels. To this end, we adopt the approximate maximum likelihood (ML) estimation strategy. For the first step, the log-likelihood function (LLF) of the received OFDM symbols is derived by utilizing only the cyclic redundancy induced by cyclic prefix (CP) without additional information. Then, the set of the initial path powers is sub-optimally obtained to maximize the derived LLF. In the second step, we can select a subset of the initial path power set, i.e. the maximum access delay time, so as to maximize the modified LLF. Through numerical simulations, the benefit of the proposed method is verified by comparison with the existing methods in terms of normalized mean square error, erroneous detection, and good detection probabilities.

• Journal of Internet Computing and Services
• /
• v.24 no.1
• /
• pp.17-26
• /
• 2023

A smart city is a massive internet of things (IoT) environment, where all terminal devices are connected to a network to create and share information. In accordance with massive IoT environments, millions of IoT devices are connected, and countless data are generated in real time. However, since heterogeneous IoT devices are used, collecting the logs for each IoT device is difficult. Due to these issues, when an IoT device is invaded or is engaged in malicious behavior, such as infection with malware, it is difficult to respond quickly, and additional damage may occur due to information leakage or stopping the IoT device. To solve this problem, in this paper, we propose identifying the attack technique used for initial access to IoT devices through MITRE ATT&CK, collect the logs that can be generated from the identified attack technique, and use them to identify the cause of malware infection.

• Journal of information and communication convergence engineering
• /
• v.21 no.2
• /
• pp.167-173
• /
• 2023

Hangul is unique compared to other Asian languages because of its simple letter forms that combine to create syllabic shapes. There are 24 basic letters that can be combined to form 27 additional complex letters. This produces 51 graphemes. Hangul optical character recognition has been a research topic for some time; however, handwritten Hangul recognition continues to be challenging owing to the various writing styles, slants, and cursive-like nature of the handwriting. In this study, a dataset containing thousands of samples of 51 Hangul graphemes was gathered from 110 freshmen university students to create a robust dataset with high variance for training an artificial neural network. The collected dataset included 2200 samples for each consonant grapheme and 1100 samples for each vowel grapheme. The dataset was normalized to the MNIST digits dataset, trained in three neural networks, and the obtained results were compared.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.848-850
• /
• 2022

본 논문은 주택 청약 과정의 어려움을 줄이고 부적격 당첨으로 인한 불이익을 방지하기 위해 개발된 청약 자격 진단 알고리즘과 가점 계산 알고리즘의 설계 및 개발 결과를 제시한다. 청약 자격 판단 알고리즘은 적격 여부 판단을 위한 조건을 모두 고려하고, 부적격으로 진단될 경우 사유까지 상세하게 제공한다는 점에서 기존 서비스와 차별성을 가진다. 가점 계산 알고리즘은 자격 진단에서 적격으로 판단된 경우, 사용자 정보로 가점을 계산하고 결과를 제공한다. 분양 방식에 따라 가점 계산 기준에 차이가 있는데, 본 알고리즘은 해당 기준을 모두 고려하여 개발되었다는 점에서 실용적이다.

• Journal of KIBIM
• /
• v.13 no.4
• /
• pp.64-73
• /
• 2023

This study introduces a method of estimating the 3D coordinates of structural damage from the detection results of visual inspection provided in 2D image coordinates using sensing data of UAV and 3D shape information of BIM. This estimation process takes place in a virtual space and utilizes the BIM model, so it is possible to immediately identify which member of the structure the estimated location corresponds to. Difference from conventional structural damage localization methods that require 3D scanning or additional sensor attachment, it is a method that can be applied locally and rapidly. Measurement accuracy was calculated through the distance difference between the measured position measured by TLS (Terrestrial Laser Scanner) and the estimated position calculated by the method proposed in this study, which can determine the applicability of this study and the direction of future research.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.7
• /
• pp.56-63
• /
• 2016

This paper presents a novel method for detecting a ghost key at the membrane type keyboard, which has additional resistive coating to the membrane film. Also, the optimal ratio of resistances for detecting a ghost key was designed based on the characteristics of the membrane film. The optimal ratio of resistances was considered to be able to detect the worst case (i.e., difference voltage between normal key and ghost key is minimum). The ability of the proposed methods are evaluated by simulation studies in this paper. In order to verify the proposed method, the experiment was carried out with a designed circuit and A/D (analog to digital) in MCU (micro controller unit). The proposed method is implemented into the membrane type keyboard and is verified by experimental results.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.19-29
• /
• 2004

Recently, studies have been performed to improve the cache performance of the R-Tree in main memory. A general mothed to improve the cache performance of the R-Tree is to reduce size of an entry so that a node can store more entries and fanout of it can increase. However, this method generally requites additional process to reduce information of entries and do not support incremental updates. In addition, the cache miss always occurs on moving between a parent node and a child node. To solve these problems efficiently, this paper proposes and evaluates the PR-Tree that is an extended R-Tree indexing method using prefetching in main memory. The PR-Tree can produce a wider node to optimize prefetching without additional modifications on the R-Tree. Moreover, the PR-Tree reduces cache miss rates that occur in moving between a parent node and a child node. In our simulation, the search performance, the update performance, and the node split performance of the PR-Tree improve up to 38%. 30%, and 67% respectively, compared with the original R-Tree.