• The Journal of the Korea Contents Association
• /
• v.19 no.9
• /
• pp.476-484
• /
• 2019

RFID yoking proof proves that a pair of tags is scanned at the same time. Since the tags scanned simultaneously by a single reader are adjacent to each other, the yoking proof is used in applications that need to check the physical proximity of tagged objects. Most of the yoking proof schemes require pre-knowledge on adjacent tags. If an error occurs in the process of collecting information about adjacent tags, all subsequent proofs will fail verification. However, there is no research that suggests specific methods for obtaining information about adjacent tags. In this study, I propose a tag proximity information acquisition scheme for a yoking proof. The proposed method consists of two steps: scanning area determination and scanning area verification. In the first step, the size and position of the area to scan tags is determined in consideration of position and transmission range of the tags. In the next step, whether tag scanning is performed within the scanning area or not is verified through reference tags of the fixed position. In analysis, I show that the determined scanning area assures acquisition of adjacent tag information and the scanning area verification detects deformation and deviation of the scanning area.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.3
• /
• pp.183-190
• /
• 2019

This paper introduces a near-tip grid refinement and explores its usefulness in the crack analysis by the natural element method(NEM). As a sort of local h-refinement in finite element method(FEM), a NEM grid is locally refined around the crack tip showing high stress singularity. This local grid refinement is completed in two steps in which grid points are added and Delaunay triangles sharing the crack tip node are divided. A plane strain rectangular plate with symmetric edge cracks is simulated to validate the proposed local grid refinement and to examine its usefulness in the crack analysis. The crack analysis is also simulated using a uniform NEM grid for comparison. Unlike the uniform grid, the refined grid provides near-tip stress distributions similar to the analytic solutions and the fine grid. In addition, the refined grid shows higher convergence than the uniform grid, the global relative error to the total number of grid points.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.9
• /
• pp.143-153
• /
• 2021

In this paper, we propose "flexible routing with flex" to provide fast delivery by using the flexible routing for the delivery vehicle and crowd-shipper named flex. To this end, we have introduced an algorithm that can build the delivery plan for delivery vehicles and flexes. The introduced algorithm uses the 2-opt algorithm to construct routes with low complexity and acceptable quality, and the revised saving algorithm to assign customer orders to the flex. The algorithm allows the vehicle and the flex to function complement each other without separating the delivery vehicle from the flex. The experiments consider the 3 different instances named Random, Mixed, Cluster, and show that "the flexible routing with flex" has a better result than "vehicle only". The sensitivity analysis of the flex cost and time penalty shows "the flexible routing with flex" can provide better service not only to the customers who are serviced by flex but also to the customers who are serviced by the delivery vehicle.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.10
• /
• pp.1311-1319
• /
• 2019

Currently, the web environment is a commonly used area for sharing information and conducting business. It is becoming an attack point for external hacking targeting on personal information leakage or system failure. Conventional signature-based detection is used in cyber threat but signature-based detection has a limitation that it is difficult to detect the pattern when it is changed like polymorphism. In particular, injection attack is known to the most critical security risks based on web vulnerabilities and various variants are possible at any time. In this paper, we propose a novelty detection technique to detect abnormal state that deviates from the normal state on web-server log dataset(WSLD). The proposed method is a machine learning-based technique to detect a minor anomalous data that tends to be different from a large number of normal data after replacing strings in web-server log dataset with vectors using machine learning-based embedding algorithm.

• Journal of the Korean GEO-environmental Society
• /
• v.12 no.8
• /
• pp.39-50
• /
• 2011

Nowadays, H-piles are usually used as temporary retaining walls, and sometimes buried in the ground after construction. The purpose of this study is the development of flowable fill materials that are easy to fill holes of retaining wall structure and minimize friction during pulling out H-pile. The first test was performed to decide mix proportion that is reasonable for purpose, in the second test, direct shear test was performed to get pullout resistance between flowable fills material and H-pile, and one dimensional consolidation test was performed to analyze the compressibility. In the test result, it showed that flowable fill material mix proportion is 350-450% of water, 70-100% of cement and 70-100% of sand based on the bentonite weight.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.2
• /
• pp.3-11
• /
• 2003

Proxy signatures are signature schemes in which an original signer delegates her signing capability to a proxy entity, who signs a message on behalf of the original signer. In this paper we propose the ID-based proxy signature schemes using a bilinear map. In the previous R-based proxy signature scheme, the proxy signer can misuse the right of the signing capacity and the public key directory is required. However, by inserting the warrant information such as the identity of the proxy signer and the limit of the signing capacity to the proxy signature, our scheme can prevent the misuse of the proxy key pair by the proxy signer and does not require a public key certificate. Furthermore, our scheme dose not need a secure channel to deliver the warrant. Consequently, the proposed scheme is more efficient and useful than the previous proxy signature schemes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.97-107
• /
• 2004

This paper presents an System-on-Chip(SoC) implementation of fingerprint feature extraction system. Typical fingerprint feature extraction systems employ binarization and thinning processes which cause many extraction errors for low qualify fingerprint images and degrade the accuracy of the entire fingerprint recognition system. To solve these problems, an algorithm directly following ridgelines without the binarization and thinning process has been proposed. However, the computational requirement of the algorithm makes it hard to implement it on SoCs by using software only. This paper presents an implementation of the ridge-following algorithm onto SoCs. The algorithm has been modified to increase the efficiency of hardwares. Each function block of the algorithm has been implemented in hardware or in software by considering its computational complexity, cost and utilization of the hardware, and efficiency of the entire system. The fingerprint feature extraction system has been developed as an IP for SoCs, hence it can be used on many kinds of SoCs for smart cards.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.1
• /
• pp.15-28
• /
• 1999

In Multilevel Secure Database Management System(MLS/DBMS), we assume that system has a security clearance level for each user and a classification level for each data item in system and the objective of these systems is to protect secure information from unauthorized user. Many algorithms which have been researched have focus on removing covert channel by modifying conventional lock-based algorithm or timestamp-based algorithm. but there is high-level starvation problem that high level transaction is aborted by low level transaction repeatedly. In order to solve this problem, we propose an algorithm to reduce high-level starvation using dynamic adjustment of serialization order, which is basically using orange lock. Because our algorithm is based on a single version unlike conventional secure algorithms which are performed on multiversion, it can get high degree of concurrency control. we also show that it guarantees the serializability of concurrent execution, and satisfies secure properties of MLS/DBMS.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.4
• /
• pp.29-39
• /
• 2009

In order to respond against worms which are malicious programs automatically spreading across communication networks, worm detection approach by generating signatures resulting from analyzing worm-related packets is being mostly used. However, to avoid such signature-based detection techniques, usage of exploits employing mutated polymorphic types are becoming more prevalent. In this paper, we propose a novel static analysis approach for detecting the decryption routine of polymorphic exploit code, Our approach detects a code routine for performing the decryption of the encrypted original code which are contained with the polymorphic exploit code within the network flows. The experiment results show that our approach can detect polymorphic exploit codes in which the static analysis resistant techniques are used. It is also revealed that our approach is more efficient than the emulation-based approach in the processing performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.21 no.3
• /
• pp.113-120
• /
• 2020

With the recent development of communication equipment, the demand for communication equipment is gradually increasing. Accordingly, various signal processing has been studied. In the case of an image, noise removal is an indispensable step because noise propagation problems may occur if noise is not removed in the pre-processing process. Salt and Pepper noise is a typical impulse noise with two extremes. Various studies have been conducted to remove such noise, and there are CWMF, MF and MMF. However, the existing methods are somewhat insufficient in the high-density noise region. Therefore, in this study, we have proposed an algorithm that filters the size of the mask according to the number of noises inside the 7×7 mask and filters it with a modified switching filter using the histogram distribution of the image. In the case of the proposed algorithm, noise can be effectively removed in a high-density noise region. For objective judgment, PSNR was used to compare and analyze with existing algorithms.