• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2018.05a
• /
• pp.6-7
• /
• 2018

Although the importance of the construction lift is increasing, no improvements are being made to its operating system. This study proposed an optimal call-response algorithm of the construction lift for high-rise building construction by using image sensing technology, height measuring sensor, and load cell. This algorithm makes turn-around decision of the construction lift by considering the information and the number of user. It occurs when the call comes from a floor where the construction lift already have passed. The purpose of this study is to reduce the total latency of the construction lift user. Furthermore, it is possible to prevent delay in construction duration by carrying out a priority operation of the construction lift for the critical workforce.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.1-9
• /
• 2007

in this paper, we propose the Adaptive Decision Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Adaptive Decision algorithm identify smaller one ,each Tag_ID bit's sum of bit '1'. In other words, Adaptive Decision algorithm had standard of selection by actively, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Adaptive Decision algorithm had performance test that criterions were reader's number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Adaptive Decision algorithm better than exisiting algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.12
• /
• pp.2232-2240
• /
• 2017

IMO has made AIS and VHF mandatory for international sailing vessels through SOLAS, and korea if mandating specific vessels through the law for safety of vessels and the ship installation technology standards. However, due to various communication equipments and complicated usage method, malfunction occurs, and the response delay to the actual structure signal often causes human accidents. So recently, as a part of GMDSS modernization, maritime communication devices are attempting to interwork and integrate different types of marine communication system in order to construct a next generation maritime communication system. In this paper, we describe a technique to implement the DSC function by interlocking and integrating the AIS device and VHF. We will present the basis for achieving domestic technical standards and standardization through the linking algorithm of the data that can extract the ship information from AIS and utilize it the DSC function of VHF.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.957-965
• /
• 2002

Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.113-130
• /
• 2014

In this paper, we propose BLOCS algorithm to find sequence of data that should be saved in cache device of hybrid storage system which uses SSD as a cache device. BLOCS algorithm which uses a sequence pattern mining scheme, creates a set of frequently requested sectors with respect to requested order of sectors. To compare the performance of the proposed scheme, we introduce Distance (DIST) based scheme, Request Frequency (FREQ) based scheme, and Frequency times Size (F-S) based scheme. We measure the hit ratio and I/O latency of different caching schemes using hybrid storage caching simulator. We acquired booting workload along with ten scenarios of launching applications and use the workloads as input to the cache simulator. After experiment with booting workload, we find that BLOCS scheme gives hit ratio of 61% which is about 15% higher than the least performing DIST scheme.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.526-535
• /
• 2005

Ontology is a methodology on describing specific concepts and their relationships, and it is being considered important more and more as semantic web and variety of knowledge management systems are being highlighted. Ontology uses the relationships among concerts to represent some concrete semantics of specific concept. When we want to get some useful information from ontology, we severely have to process the transitive relationships because most of relationships among concepts represent transitivity. Technically, it causes recursive calls to process such transitive closure queries with heavy costs. This paper describes the efficient technique for processing transitive closure queries in ontology. To the purpose of it, we examine some approaches of current systems for transitive closure queries, and propose a technique by graph labeling scheme. Basically, we assume large size of ontology, and then we show that our approach gives relative efficiency in processing of transitive closure, queries.