• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1427-1433
• /
• 2008

There is SARLM scheme for dynamic adaptation to network congestion status which arises from multicast applications. However, in this scheme, when congestion occurs in a local, the waste of available bandwidth occurs in non-congestion local because of reducing of transmission rate in congestion local. In this paper, we propose a hierarchical multicast for dynamic adaptation to network congestion. In proposed scheme, we select a representative in each local. while congestion status. It receives packet from multicast sender and hierarchically transmits packet to the representative in congestion status by unicast for preventing decrease of transmission rate and the representative in congestion local transmits packet to the receivers in local by multicast. In experimental results, it was known that the proposed scheme could improve transmission rate of receivers in congestion status and more efficiently used available bandwidth.

• 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 Korean Institute of Information Technology
• /
• v.17 no.12
• /
• pp.81-92
• /
• 2019

Weeds are a major object which is very harmful to crops. To remove the weeds effectively, we have to classify them accurately and use herbicides. As computing technology has developed, image-based machine learning methods have been studied in this field, specially convolutional neural network(CNN) based models have shown good performance in public image dataset. However, CNN with numerous training parameters and high computational amount. Thus, it works under high hardware condition of expensive GPUs in real application. To solve these problems, in this paper, a hierarchical architecture based deep-learning model is proposed. The experimental results show that the proposed model successfully classify 21 species of the exotic weeds. That is, the model achieve 97.2612% accuracy with a small number of parameters. Our proposed model with a few parameters is expected to be applicable to actual application of network based classification services.

• Communications for Statistical Applications and Methods
• /
• v.21 no.3
• /
• pp.225-234
• /
• 2014

We propose a novel hierarchical clustering for distribution valued dissimilarities. Analysis of large and complex data has attracted significant interest. Symbolic Data Analysis (SDA) was proposed by Diday in 1980's, which provides a new framework for statistical analysis. In SDA, we analyze an object with internal variation, including an interval, a histogram and a distribution, called a symbolic object. In the study, we focus on a cluster analysis for distribution valued dissimilarities, one of the symbolic objects. A hierarchical clustering has two steps in general: find out step and update step. In the find out step, we find the nearest pair of clusters. We extend it for distribution valued dissimilarities, introducing a measure on their order relations. In the update step, dissimilarities between clusters are redefined by mixture of distributions with a mixing ratio. We show an actual example of the proposed method and a simulation study.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.12
• /
• pp.2329-2336
• /
• 2010

Hierarchical tree routing is a inefficient routing method of transmitting data in a wireless sensor network. Zigbee routing which is made to improve inefficiency of the hierarchical tree routing only fulfills the tree routing when a destination node don't exists in neighbor nodes of a router. We suggest a TFSR algorithm that is improved more than the zigbee routing. The TFSR algorithm generates a family set included a parent node and child nodes and over of a destination node, and uses this information. According to simulation results, the TFSR algorithm reduce routing costs over 30 percent in comparison with the hierarchical tree routing and the zigbee routing.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.1-16
• /
• 1995

The performance of a computer system depends on the system architecture and workload, and the high performance required in many applications can be achieved by the scalability of the system architecture and workload. This paper presents scalable workload, a performance metric of scalable speedup and hierarchical modeling for the scalable computer system as well as the development of the object-oriented simulator spmplC++ Which is an advanced C++ version of the discrete event-driven simulation environment smplE. In addition, this paper presents two examples of applying scalable speedup, hierarchical modeling and simulator smplC++ to analyze the performance effect of the sclcbility in a multiprocessor system and a network-based client/server system.

• ETRI Journal
• /
• v.34 no.1
• /
• pp.142-145
• /
• 2012

The main challenge at present in constructing hierarchical identity-based encryption (HIBE) is to solve the trade-off between private-key size and ciphertext size. At least one private-key size or ciphertext size in the existing schemes must rely on the hierarchy depth. In this letter, a new hierarchical computing technique is introduced to HIBE. Unlike others, the proposed scheme, which consists of only two group elements, achieves constant-size private keys. In addition, the ciphertext consists of just three group elements, regardless of the hierarchy depth. To the best of our knowledge, it is the first efficient scheme where both ciphertexts and private keys achieve O(1)-size, which is the best trade-off between private-key size and ciphertext size at present. We also give the security proof in the selective-identity model.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.11
• /
• pp.1209-1216
• /
• 2009

Nano-micro hierarchical structures that nanoprotrusions were formed on the network-type microstructures were fabricated using an ultrasonic vibration forming technology. A commercial ultrasonic welding system was used to apply ultrasonic vibration energy. To evaluate the formability of ultrasonic vibration forming, nickel nano-micro hierarchical mold was fabricated and polyethylene (PE) was used as the replication material. The optimal molding time was 3.5 sec for PE nano-micro hierarchical structures. The molding process was conducted at atmospheric pressure.

• Journal of Korea Multimedia Society
• /
• v.18 no.7
• /
• pp.793-805
• /
• 2015

Nowadays the amount of data obtained from advanced weather radars is growing to provide higher spatio-temporal resolution. Accordingly radar data compression is important to use limited network bandwidth and storage effectively. In this paper, we proposed a hierarchical compression method for weather radar data having high spatio-temporal resolution. The method is applied to radar reflectivity and evaluated in aspects of accuracy of quantitative rainfall intensity. The technique provides three compression levels from only 1 compressed stream for three radar user groups-signal processor, quality controller, weather analyst. Experimental results show that the method has maximum 13% and minimum 33% of compression rates, and outperforms 25% higher than general compression technique such as gzip.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.13-14
• /
• 2007

We propose HERAH(Hierarchical Energy-Aware Routing Algorithm for Heterogeneous Wireless Sensor Networks) that is the hierarchical routing algorithm in WSNs and is established on heterogeneous environment. HERAH performs CH selection by considering residual energy level and uses multi-hop communication within cluster. So, HERAH makes improvements in the energy savings and the network lifetime compared with LEACH.