• Korean Journal of Agricultural and Forest Meteorology
• /
• v.16 no.4
• /
• pp.259-266
• /
• 2014

Understanding the forest fire patterns is necessary to comprehend the stability of the forest ecosystems. Thus, researchers have suggested the simulation models to mimic the forest fire spread dynamics, which enables us to predict the forest damage in the scenarios that are difficult to be experimentally tested in laboratory scale. However, many of the models have the limitation that many of them did not consider the complicated environmental factors, such as fuel types, wind, and moisture. In this study, we suggested a simple model with the factors, especially, the geomorphological structure of the forest and two types of fuel. The two fuels correspond to susceptible tree and resistant tree with different probabilities of transferring fire. The trees were randomly distributed in simulation space at densities ranging from 0.5 (low) to 1.0 (high). The susceptible tree had higher value of the probability than the resistant tree. Based on the number of burnt trees, we then carried out the sensitivity analysis to quantify how the forest fire patterns are affected by the structure and tree density. We believe that our model can be a useful tool to explore forest fire spreading patterns.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.1
• /
• pp.19-25
• /
• 2010

In this paper, digital watermarking method using quad-tree algorithm is proposed. The proposed algorithm searches the significant coefficient of the watermark by using quad-tree algorithm and inserts the watermark by the Cox's algorithm. The simulation for performance analysis of the proposed algorithm is implemented about the effect of quad-tree algorithm in wavelet domain and that of embedding watermark in each subband coefficient (HH, LH, HL) and each DWT level, and that of embedding in the lowest frequency band (LL). As a simulation result, digital watermarking using quad-tree algorithm improves the watermarking performance in comparison with inserting watermark in the significant coefficients of fixed frequency band. The watermarking performance of simultaneously embedding in HH, LH, and HL band of DWT(6 level) is better than that of different cases. In addition, insertion the watermark to the LL band about 30~60% of all watermarks improves the correlation value while PSNR performance decreases 1~3dB.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.1
• /
• pp.44-52
• /
• 2008

In this paper we consider detecting collisions between characters whose motion is specified by motion capture data. Since we are targeting on massive crowd simulation, we only consider rough collisions, modeling the characters as a disk in the floor plane. To provide efficient collision detection, we introduce a hierarchical bounding volume, the Motion Oriented Bounding Box tree (MOBB tree). A MOBBtree stores space-time bounds of a motion clip. In crowd animation tests, MOBB trees performance improvements ranging between two and an order of magnitude.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.47-54
• /
• 2005

This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center). We also validated analytic results using OPNET simulation. Based on analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.483-492
• /
• 2007

In this paper, we propose a new hybrid approach based on query tree protocol to arbitrate tag collisions in RFID systems. The hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, we use a 4-ary query tree instead of a binary query tree. To reduce idle time, we introduce a slotted backoff mechanism to reduce the number of unnecessary Query commands. Simulation and numerical analysis reveal that the proposed protocol achieves lower identification delay than existing tag collision arbitration protocols.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.633-642
• /
• 2000

This paper proposes a dominant source-based tree (DSBT) that constructs a localized multicast routing tree for dynamic multicasting without rerouting. To constrain end-to-end delays a multicast tree needs to be reconstructed when a new node joins the group due to additive tree constraint. In DSBT, a multicast group G is expressed by a (DS, NCM) pair, where DS is a dominant source address and NCM is a normalized cost margin. A node wishing to participate in a group selects a path that complies with NCM toward DS such that the end-to-end cost is constrained without any rerouting. Simulation results show that the proposed method performed better in terms of the overall tree cost compared with the Nave algorithm and in terms of the end-to-end delays between any two members compared with the Greedy algorithm.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.15 no.3
• /
• pp.178-185
• /
• 2013

Forest fires are expected to increase in severity and frequency under global climate change and thus better understanding of fire dynamics is critical for mitigation and adaptation. Researchers with different background, such as ecologists, physicists, and mathematical biologists, have developed various simulation models to reproduce forest fire spread dynamics. However, these models have limitations in the fire spreading because of the complicated factors such as fuel types, wind, and moisture. In this study, we suggested a simple model considering the wind effect and two different fuel types. The two fuels correspond to susceptible tree and resistant tree with different probabilities of transferring fire. The trees were randomly distributed in simulation space with a density ranging from 0.0 (low) to 1.0 (high). The susceptible tree had higher value of the probability than the resistant tree. Based on the number of burnt trees, we then carried out the sensitivity analysis to quantify how the forest fire patterns are affected by wind and tree density. The statistical analysis showed that the total tree density had greatest effect on the forest fire spreading and wind had the next greatest effect. The density of the susceptible tree was relatively lower factor affecting the forest fire. We believe that our model can be a useful tool to explore forest fire spreading patterns.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.4
• /
• pp.310-319
• /
• 2010

In this paper, digital watermarking method using wavelet transform and quad-tree algorithm is proposed. The proposed algorithm transforms the input image by DWT(Discrete Wavelet Transform) and AWPT(Adaptive Wavelet Packet Transform), inserts the watermark by quad-tree algorithm and the Cox's algorithm. The simulation for performance analysis of the proposed algorithm is implemented about the effect of embedding watermark in each subband coefficient (HH, LH, HL) of DWT, each DWT level, and each AWPT level. The simulation result by using DWT is compared with that using AWPT in the proposed algorithm. In addition, the effect of embedding watermark in the lowest frequency band (LL) is simulated. As a simulation result using DWT, the watermarking performance of simultaneously embedding in HH, LH, and HL band of DWT(6 level) is better than that of different cases. The result of AWPT(3 level) improves the correlation value compared to that of DWT(3 level). In addition, insertion the watermark to the LL band about 30~60% of all watermarks improves the correlation value while PSNR performance decreases 1~2dB.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.8
• /
• pp.55-62
• /
• 2004

This paper proposes and analyzes two anti-collision algorithms in Ubiquitous ID system. We mathematically compares the performance of the proposed algorithms with that of binary search algorithm slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center. We also validated analytic results using OPNET simulation. Based on analytic result comparing the proposed Modified bit-by-bit binary tree algorithm with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Modified bit-by-bit binary tree algorithm is about 5% higher when the number of tags is 20, and 100% higher when the number of tags is 200. Furthermore, the performance of proposed Enhanced bit-by-bit binary tree algorithm is about 335％ and 145% higher than Modified bit-by-bit binary tree algorithm for 20 and 200 tags respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1460-1478
• /
• 2020

This paper proposes a novel anti-collision protocol for large-scale RFID tags identification, named Bi-response Collision Tree Protocol (BCT). In BCT, two group of tags answer the reader's same query in two response-cycles respectively and independently according to the bi-response pattern. BCT improves the RFID tag identification performance significantly by decreasing the query cycles and the bits transmitted by the reader and tags during the identification. Computation and simulation results indicate that BCT improves the RFID tag identification performance effectively, e.g. the tag identification speed is improved more than 13.0%, 16.9%, and 22.9% compared to that of Collision Tree Protocol (CT), M-ary Collision Tree Protocol (MCT), and Dual Prefix Probe Scheme (DPPS) respectively when tags IDs are distributed uniformly.