• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.48-57
• /
• 2008

Wireless sensor networks are composed of a lot of sensor nodes and they are used to monitor environments. Since many studies on wireless sensor networks have considered a stationary sink node, they cannot provide fully ubiquitous applications based on a mobile sink node. In those applications, routing paths for a mobile sink node should be updated while a sink node moves in order to deliver sensor data without data loss. In this paper, we propose a method to continuously update routing paths for a mobile sink node which can be extended on hierarchical multi-hop routing protocols in wireless sensor networks. The efficiency of the proposed scheme has been validated through comparing existing method using a location based routing protocol by extensive computer simulation.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.391-406
• /
• 2002

In order to realize a practical VOD system, it is necessary for a high-capacity and cost-effective hierarchical VOD server based on tertiary storages such as DVD jukebox. In such a system, it is possible to transfer multiple streams to users by alternatively swapping DVDs using the fixed number of drives. But it takes a long time for loading DVD to a drive. In this paper, we propose a primitive pipelined loading mechanism for hiding the loading time to swap DVDs in a hierarchical VOD server based on DVD jukebox. We also propose a enhanced pipelined loading mechanism for increasing the maximum admittable streams with the fixed number of drives. The enhanced mechanism caches the initial segment of each stream on a disk storage allowing faster data transfer. The performance analysis shows that the proposed mechanisms can admit the maximum allowed stream capacity under the fixed number of disk drives.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.318-325
• /
• 2010

In this study, the wrapper database description language and model is suggested to collect product reviews from Korean shopping malls with multi-layer structures and are built in a variety of web languages. Above all, the wrapper based web crawlers have the website structure information to bring the exact desired data. The previously suggested wrapper based web crawler can collect HTML documents and the hierarchical structure of the target documents were only 2-3 layers. However, the Korean shopping malls in the study consist of not only HTML documents but also of various web language (JavaScript, Flash, and AJAX), and have a 5-layer hierarchical structure. A web crawler should have information about the review pages in order to visit the pages without visiting any non-review pages. The proposed wrapper contains the location information of review pages. We also propose a language grammar used in describing the location information.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.159-167
• /
• 2015

We consider a wafer lot transfer/release planning problem from semiconductor wafer fabrication facilities to probing facilities with the objective of minimizing the deviation of workload and total tardiness of customers' orders. Due to the complexity of the considered problem, we propose a two-level hierarchical production planning method for the lot transfer problem between two parallel facilities to obtain an executable production plan and schedule. In the higher level, the solution for the reduced mathematical model with Lagrangian relaxation method can be regarded as a coarse good lot transfer/release plan with daily time bucket, and discrete-event simulation is performed to obtain detailed lot processing schedules at the machines with a priority-rule-based scheduling method and the lot transfer/release plan is evaluated in the lower level. To evaluate the performance of the suggested planning method, we provide computational tests on the problems obtained from a set of real data and additional test scenarios in which the several levels of variations are added in the customers' demands. Results of computational tests showed that the proposed lot transfer/planning architecture generates executable plans within acceptable computational time in the real factories and the total tardiness of orders can be reduced more effectively by using more sophisticated lot transfer methods, such as considering the due date and ready times of lots associated the same order with the mathematical formulation. The proposed method may be implemented for the problem of job assignment in back-end process such as the assignment of chips to be tested from assembly facilities to final test facilities. Also, the proposed method can be improved by considering the sequence dependent setup in the probing facilities.

• Journal of Korea Water Resources Association
• /
• v.54 no.9
• /
• pp.643-656
• /
• 2021

Recently, water supply management technology is highly developed, and a computer simulation model plays a critical role for estimating hydraulics and water quality in water distribution networks (WDNs). However, a simulation of complex large water networks is computationally intensive, especially for the water quality simulations, which require a short simulation time step and a long simulation time period. Thus, it is often prohibitive to analyze the water quality in real-scale water networks. In this study, in order to improve the computational efficiency of water quality simulations in complex water networks, a hierarchical water-quality-simulation technique was proposed. The water network is hierarchically divided into two sub-networks for improvement of computing efficiency while preserving water quality simulation accuracy. The proposed approach was applied to a large-scale real-life water network that is currently operating in South Korea, and demonstrated a spatiotemporal distribution of chlorine concentration under diverse chlorine injection scenarios.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.1
• /
• pp.257-264
• /
• 2019

This paper presents a single image haze removal method via a pixel-based joint BDCP (bright and dark channel prior) and a hierarchical bilateral filter in order to reduce computational complexity and memory requirement while improving the dehazing performance. Pixel-based joint BDCP reduces the computational complexity compared to the patch-based DCP, while making it possible to estimate the atmospheric light in pixel unit and the transmission more accurately. Moreover the bilateral filter, which can smooth an image effectively while preserving edges, refines the transmission to reduce the halo effects, and its hierarchical structure applied to edges only prevents the increase of complexity from the iterative application. Experimental results on various hazy images show that the proposed method exhibits excellent haze removal performance with low computational complexity compared to the conventional methods, and thus it can be applied in various fields.

• Korean Journal of Labor Studies
• /
• v.19 no.1
• /
• pp.65-104
• /
• 2013

This study aims to examine the intermediary roles of employee performance between high performance work system (HPWS) and its operational performance on the resource based view. Taking into account the unit of analysis, this study used a hierarchical linear modeling analysis in order to test rigorously the association between HPWS at the organisational level and employee performance at the individual level. For this empirical test, Human Capital Corporate Panel (HCCP) data including 316 firms and 7,872 respondents (including 923 team leaders) were used. To meet the unit of analysis and test the mediation effect, data at the individual and team level were aggregated into the organisational level. The empirical results show that HPWS have a positive impact on operational performance as well as employee performance such as job satisfaction, organisational commitment and organisational trust. Regarding the mediation effect, job satisfaction and organisational trust mediate between HPWS and operational performance. Theoretical implications are discussed in conclusion.

• Journal of Creative Information Culture
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2020

In order to represent and process spatial data, hierarchical data structures such as a quadtree or a bintree are used. Various approaches for linearly representing the bintree have been proposed. S-Tree has the advantage of compressing the storage space by expressing binary region image data as a linear binary bit stream, but the higher the resolution of the image, the longer the length of the binary bit stream, the longer the storage space and the lower the search performance. In this paper, we construct a hierarchical structure of multiple separated bintrees with a full binary tree structure and express each bintree as two linear binary bit streams to reduce the range required for image search. It improves the overall search performance by performing a simple number conversion instead of searching directly the binary bit string path. Through the performance evaluation by the worst-case space-time complexity analysis, it was analyzed that the proposed method has better search performance and space efficiency than the previous one.

• Journal of Creative Information Culture
• /
• v.5 no.3
• /
• pp.345-353
• /
• 2019

Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.564-567
• /
• 2011

Preserving energy of sensor node in wireless sensor network is an effort to prolong the lifetime of network. Energy of sensor node is very crucial because battery powered and irreplaceable. Energy conservation of sensor node is an effort to reduce energy consumption in order to preserve resource for network lifetime. It can be achieved through efficient energy usage by reducing consumption of energy or decrease energy usage while achieving a similar outcome. In this paper, we propose optimization of energy efficient base station assisted hierarchical routing protocol in wireless sensor network, named BSAH, which use base station to controlled overhead of sensor node and create clustering to distribute energy dissipation and increase energy efficiency of all sensor node. Main idea of BSAH is based on the concept of BeamStar, which divide sensor node into group by base station uses directional antenna and maximize the computation energy in base station to reduce computational energy in sensor node for conservation of network lifetime. The performance of BSAH compared to PEGASIS and CHIRON based of hierarchical routing protocol. The simulation results show that BSAH achieve 25% and 30% of improvement on network lifetime.