• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.13-21
• /
• 2010

One of the most distinguished features of the DHP association rules mining algorithm is that it counts the support of hash key combinations composed of k items at phase k-1, and uses the counted support for pruning candidate large itemsets to improve performance. At this time, it is desirable for each hash key combination to have a separate count variable, where it is impossible to allocate the variables owing to memory shortage. So, the algorithm uses a direct hashing mechanism in which several hash key combinations conflict and are counted in a same hash bucket. But the direct hashing mechanism is not efficient because the distribution of hash key combinations is unvalanced by the characteristics sourced from the mining process. This paper proposes a mapped perfect hashing function which maps the region of hash key combinations into a continuous integer space for phase 3 and maximizes the efficiency of direct hashing mechanism. The results of a performance test experimented on 42 test data sets shows that the average performance improvement of the proposed hashing mechanism is 7.3% compared to the existing method, and the highest performance improvement is 16.9%. Also, it shows that the proposed method is more efficient in case the length of transactions or large itemsets are long or the number of total items is large.

• Spatial Information Research
• /
• v.23 no.2
• /
• pp.1-9
• /
• 2015

Graphical processing unit (GPU) contains many arithmetic logic units (ALUs). Because many ALUs can be exploited to process parallel processing, GPU provides efficient data processing. The spatial data require many geographic coordinates to represent the shape of them in a map. The coordinates are usually stored as geodetic longitude and latitude. To display a map in 2-dimensional Cartesian coordinate system, the geodetic longitude and latitude should be converted to the Universal Transverse Mercator (UTM) coordinate system. The conversion to the other coordinate system and the rendering process to represent the converted coordinates to screen use complex floating-point computations. In this paper, we propose a parallel processing technique that processes the conversion and the rendering using the GPU to improve the performance. Large spatial data is stored in the disk on files. To process the large amount of spatial data efficiently, we propose a technique that merges the spatial data files to a large file and access the file with the method of memory mapped file. We implement the proposed technique and perform the experiment with the 747,302,971 points of the TIGER/Line spatial data. The result of the experiment is that the conversion time for the coordinate systems with the GPU is 30.16 times faster than the CPU only method and the rendering time is 80.40 times faster than the CPU.

• Journal of Intelligence and Information Systems
• /
• v.15 no.2
• /
• pp.33-48
• /
• 2009

Capsule endoscopy is one of the most remarkable inventions in last ten years. Causing less pain for patients, diagnosis for entire digestive system has been considered as a most convenience method over a normal endoscope. However, it is known that the diagnosis process typically requires very long inspection time for clinical experts because of considerably many duplicate images of same areas in human digestive system due to uncontrollable movement of a capsule endoscope. In this paper, we propose a method for clinical diagnosticians to get highly valuable information from capsule-endoscopy video. Our software system consists of three global maps, such as movement map, characteristic map, and brightness map, in temporal domain for entire sequence of the input video. The movement map can be used for effectively removing duplicated adjacent images. The characteristic and brightness maps provide frame content analyses that can be quickly used for segmenting regions or locating some features(such as blood) in the stream. Our experiments show the results of four patients having different health conditions. The result maps clearly capture the movements and characteristics from the image frames. Our method may help the diagnosticians quickly search the locations of lesion, bleeding, or some other interesting areas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1167-1175
• /
• 2016

This paper proposes an efficient page-level mapping algorithm that reduces the erase count in the FTL for flash memory systems. By maintaining the weight for each write request in the request buffer, the proposed algorithm estimates the degree of temporal locality for each incoming write request. To exploit temporal locality deliberately for determination of hot request, the degree of temporal locality should be much higher than the reference point determined experimentally. While previous LRU algorithm treats a new write request to have high temporal locality, the proposed algorithm allows write requests that are estimated to have high temporal locality to access hot blocks to store hot data intensively. The pages are more frequently updated in hot blocks than warm blocks. A hot block that has most of invalid pages is always selected as victim block at Garbage Collection, which results in delayed erase operation and in reduced erase count. Experimental results show that erase count is reduced by 9.3% for real I/O workloads, when compared to the previous LRU algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.5
• /
• pp.993-1000
• /
• 2017

When the availability of embedded device is considered, combined countermeasure such as first-order masking and hiding countermeasures is quite attractive because the security and efficiency can be provided at the same time. Especially, combined countermeasure can be applied to the confusion and diffusion layers of the first and last rounds in order to provide the efficiency. Also, the middle rounds only employs first-order masking countermeasure or no countermeasure. In this paper, we suggest a novel side channel analysis with low complexity in the output of diffusion layer. In general, the attack target cannot be set to the output of diffusion layer owing to the high complexity. When the diffusion layer of block cipher is composed of AND operations, we show that the attack complexity can be reduced. Here, we consider that the main algorithm is SEED. Then, the attack complexity with $2^{32}$ can be reduced by $2^{16}$ according to the fact that the correlation between the combination of S-box outputs and that of the outputs of diffusion layer. Moreover, compared to the fact that the main target is the output of S-box in general, we demonstrate that the required number of traces can be reduced by 43~98% in terms of simulated traces. Additionally, we show that only 8,000 traces are enough to retrieve the correct key by suggested scheme, although it fails to reveal the correct key when performing the general approach on 100,000 traces in realistic device.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.3
• /
• pp.100-109
• /
• 2019

Maintainability indicates the extent to which maintenance can be done easily and quickly. The consideration of maintainability is crucial to reduce the operation and support costs of weapon systems, but if the maintainability is evaluated after the prototype production is done and necessitates design changes, it may increase the cost and delay the schedule. The evaluation should verify whether maintenance work can be performed, and support the designers in developing a design to improve maintainability. In previous studies, the maintainability index was calculated using the graph theory at the early design phase, but evaluation accuracy appeared to be limited. Analyzing the methods of evaluating the maintainability using fuzzy logic and 3D modeling indicate that the design of a system with good maintainability should be done in an integrated manner during the whole system life cycle. This paper proposes a method to evaluate maintainability using SysML-based modeling and simulation technique and fuzzy logic. The physical design structure with maintainability attributes was modeled using SysML 'bdd' diagram, and the maintainability was represented by an AHP matrix for maintainability attributes. We then calculated the maintainability using AHP-based weighting calculation and fuzzy logic through the use of SysML 'par' diagram that incorporated MATLAB. The proposed maintainability model can be managed efficiently and consistently, and the state of system design and maintainability can be analyzed quantitatively, thereby improving design by early identifying the items with low maintainability.

• The Journal of the Korea Contents Association
• /
• v.19 no.5
• /
• pp.187-193
• /
• 2019

Key-value storage engines are an essential component of growing demand in many computing environments, including social networks, online e-commerce, and cloud services. Recent key-value storage engines offer many features such as transaction, versioning, and replication. In a key-value storage engine, transaction processing provides atomicity through Write-Ahead-Logging (WAL), and a synchronous commit method for transaction processing flushes log data before the transaction completes. According to our observation, flushing log data to persistent storage is a performance bottleneck for key-value storage engines due to the significant overhead of fsync() calls despite the various optimizations of existing systems. In this article, we propose a group synchronization method to improve the performance of the key-value storage engine. We also design and implement a transaction scheduling method to perform other transactions while the system processes fsync() calls. The proposed method is an efficient way to reduce the number of frequent fsync() calls in the synchronous commit while supporting the same level of transaction provided by the existing system. We implement our scheme on the WiredTiger storage engine and our experimental results show that the proposed system improves the performance of key-value workloads over existing systems.

• Journal of Internet Computing and Services
• /
• v.20 no.5
• /
• pp.95-104
• /
• 2019

Various kinds of devices are used for the Internet of Things (IoT) service, and IoT devices mainly use communication technology that uses the frequency of the unlicensed band. There are several types of communication technology in the unlicensed band, but WiFi is most commonly used. Devices used for IoT services vary in computing resources from devices with limited capabilities to smartphones and provide services over wireless networks such as WiFi. Most IoT devices can't perform complex operations for network control, thus they choose a WiFi access point (AP) based on signal strength. This causes a decrease in IoT service efficiency. In this paper, an intelligent AP system that can efficiently control the WiFi connection of the IoT devices is implemented. Based on the network information measured by the IoT device, the access point learns using a feed forward neural network algorithm, and predicts a network connection state to control the WiFi connection. By controlling the WiFi connection at the AP, the service efficiency of the IoT device can be improved.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.1
• /
• pp.43-51
• /
• 2009

In 1998, Kocher et al. introduced Differential Power Attack on block ciphers. This attack allows to extract secret key used in cryptographic primitives even if these are executed inside tamper-resistant devices such as smart card. At FSE 2003 and 2004, Akkar and Goubin presented several masking methods, randomizing the first few and last few($3{\sim}4$) rounds of the cipher with independent random masks at each round and thereby disabling power attacks on subsequent inner rounds, to protect iterated block ciphers such as DES against Differential Power Attack. Since then, Handschuh and Preneel have shown how to attack Akkar's masking method using Differential Cryptanalysis. This paper presents how to combine Truncated Differential Cryptanalysis and Power Attack to extract the secret key from intermediate unmasked values and shows how much more efficient our attacks are implemented than the Handschuh-Preneel method in term of reducing the number of required plaintexts, even if some errors of Hamming weights occur when they are measured.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.181-190
• /
• 2022

In this paper, we use a LiDAR sensor and an image camera to detect a left-turning waiting vehicle in two ways, unlike the existing image-type or loop-type left-turn detection system, and a left-turn traffic signal corresponding to the waiting length of the left-turning lane. A system that can efficiently assign a system is introduced. For the LiDAR signal transmitted and received by the LiDAR sensor, the left-turn waiting vehicle is detected in real time, and the image by the video camera is analyzed in real time or at regular intervals, thereby reducing unnecessary computational processing and enabling real-time sensitive processing. As a result of performing a performance test for 5 hours every day for one week with an intersection simulation using an actual signal processor, a detection rate of 99.9%, which was improved by 3% to 5% compared to the existing method, was recorded. The advantage is that 99.9% of vehicles waiting to turn left are detected by the LiDAR sensor, and even if an intentional omission of detection occurs, an immediate response is possible through self-correction using the video, so the excessive waiting time of vehicles waiting to turn left is controlled by all lanes in the intersection. was able to guide the flow of traffic smoothly. In addition, when applied to an intersection in the outskirts of which left-turning vehicles are rare, service reliability and efficiency can be improved by reducing unnecessary signal costs.