• Journal of Forest and Environmental Science
• /
• v.38 no.1
• /
• pp.38-47
• /
• 2022

Hymenodictyon orixensis (Roxb.) Mabberley (locally known as Bhutum in Bangladesh) is both an ecologically and economically valuable multipurpose tree species for afforestation and reforestation programs in Bangladesh. Seed germination and seedling development study of H. orixense were conducted to find out the response to different growing medium, e.g., polybag (15×10 cm (T₀) and 20×15 cm (T₁)), sand medium in propagator house (T₂), conventional nursery bed (T₃), and root trainer (T₄) in the Nursery. Consequently, germination behavior and seedling morphological parameters of H. orixense were assessed. The results revealed that the sand medium of the propagator house (T₂) provided the highest germination % (58.57±22.30) and the highest germination energy (11.43±2.43) followed by seedlings growing in 20×15 cm polybags (T1) containing forest topsoil and cow-dung at a ratio of 3:1. Except for germination energy, germination values, and germination capacity, other seed biology parameters, particularly imbibition, germination period, germination rate, and plant survival percent in T₁, T₂, T₃, and T₄ were significantly (p<0.05) different from T₀. Each phenotypic parameter of seedlings and dry matter of shoot and root significantly differed from control except root length (p<0.992). Based on this study, Polybags of 20×15 cm size are regarded as the best medium for quality seedling development of H. orixense. The nursery bed (T₃) had the lowest germination performance and developed more inferior quality seedlings. Thereby, 20×15 cm size of polybags with conventional soil and cow-dung media is recommended for maximum germination and to grow the quality seedlings of H. orixense in the Nursery.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.377-386
• /
• 2001

In spatial database system, spatial view is supported for efficient access method to spatial database and is managed by materialization and non-materialization technique. In non-materialization technique, repeated execution on the same query makes problems such as the bottle-neck effect of server-side and overloads on a network. In materialization technique, view maintenance technique is very difficult and maintenance cost is too high when the base table has been changed. In this paper, the SVMT (Spatial View Materialization Technique) is proposed by using R-tree re-construction. The SVMT is a technique which constructs a spatial index according to the distribution ratio of objects in spatial view. This ratio is computed by using a SVHR (Spatial View Height in R-tree) and SVOC (Spatial View Object Count). If the ratio is higher than the average, a spatial view is materialized and the R-tree index is re-used. In this case, the root node of this index is exchanged a node which has a MBR (Minimum Boundary Rectangle) value that can contains the whole region of spatial view at a minimum size. Otherwise, a spatial view is materialized and the R-tree is re-constructed. In this technique, the information of spatial view is managed by using a SVIT (Spatial View Information Table) and is stored on the record of this table. The proposed technique increases the speed of response time through fast query processing on a materialized view and eliminates additional costs occurred from repeatable query modification on the same query. With these advantages, it can greatly minimize the network overloads and the bottle-neck effect on the server.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.5
• /
• pp.516-522
• /
• 2020

Water trees can cause considerable damage to the performance of underground cables. Theymay formwithin the dielectric used in buried or water-immersed high voltage cables. They grow in a bush-like or tree-like form, often taking decades before causing damage to a cable's performance. They are usually found on very old underground cables, often in an inaccessible place. It is costly and time-consuming to detect watertrees in underground cables. Tree detection technology, including mathematical modeling,can reduce the maintenance cost and time necessary for detecting these trees.To simulate detection of water trees in this study, a mathematical model ofan XLPE cable and a water tree were developed. The complex water tree structure was simplified, based on two identified patterns of aventedtree. A Matlab simulation was performed to calculate and analyze the capacitance and resistance of a cable insulation layer,based on growth of a watertree. Capacitance size increased about 0.025×10^-13[Farads/mm] compared to normal when the tree area of the cable was advanced to 95% of the insulation layer. The resistance value decreased by about 0.5×10¹⁶[ohm/m]. These changesand changesshowninaBurkes paper physical modeling simulation are similar.The value of mathematical modeling for detecting water trees and damage to underground cables has been demonstrated.

• Journal of the Korean Wood Science and Technology
• /
• v.39 no.3
• /
• pp.258-268
• /
• 2011

This study was conducted to investigate the effects of sawdust size and moisture content, pelletizing temperature and time on the durability of the pellets fabricated with larch and tulip tree sawdust. The durability of larch-pellet was significantly higher than that of tulip tree-pellet. For the larch-pellets, the durability of the pellets fabricated with > 18 mesh sawdust was higher than that of 8~18 mesh sawdust. With the increases of pelletizing temperature and time, the durabilities of larch- and tulip tree-pellets steadily improved. The durabilities of larch- and tulip tree-pellets also increased as the moisture content of sawdust increased. In the comparison of durabilities between commercial pellets and larch- or tulip tree-pellets, the pellets fabricated with larch and tulip tree sawdusts in our study were less denser than commercial pellets, but the durability of most larch-pellets was satisfied with the 1st-grade pellet standard designated by Korea Forest Research Institute. In addition, the durability of tulip tree-pellets were higher than that of the 3rd-grade pellet standard. From the scanning electron microscopic observation of larchand tulip tree-pellets, the gap between the sawdusts of each pellet was reduced with the increases of pelletizing temperature and time. In particular, it was visually confirmed that the surface of the pellets made with the pelletizing temperature of $180^{\circ}C$ for 3 min did not differ from that of commercial pellets.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.755-766
• /
• 2008

Recently, NAND flash memory is becoming into the spotlight as a next-generation storage device because of its small size, fast speed, low power consumption, and etc. compared to the hard disk. However, due to the distinct characteristics such as erase-before-write architecture, asymmetric operation speed and unit, disk-based systems and applications may result in severe performance degradation when directly implementing them on NAND flash memory. Especially when a B-tree is implemented on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation. Although ${\mu}$-tree has been proposed in order to overcome this problem, it suffers from frequent node split and rapid increment of its height. In this paper, we propose Log-Structured B-Tree(LSB-Tree) where the corresponding log node to a leaf node is allocated for update operation and then the modified data in the log node is stored at only one write operation. LSB-tree reduces additional write operations by deferring the change of parent nodes. Also, it reduces the write operation by switching a log node to a new leaf node when inserting the data sequentially by the key order. Finally, we show that LSB-tree yields a better performance on NAND flash memory by comparing it to ${\mu}$-tree through various experiments.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.669-680
• /
• 2011

R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.18-28
• /
• 2004

Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.43-49
• /
• 2020

This paper proposes a lossless image compression method based on arithmetic coding using block-adaptive Context Tree Weighting. The CTW method predicts and compresses the input data bit by bit. Also, it can achieve a desirable coding distribution for tree sources with an unknown model and unknown parameters. This paper suggests the method to enhance the compression rate about image data, especially aerial and satellite images that require lossless compression. The value of aerial and satellite images is significant. Also, the size of their images is huger than common images. But, existed methods have difficulties to compress these data. For these reasons, this paper shows the experiment to prove a higher compression rate when using the CTW method with divided images than when using the same method with non-divided images. The experimental results indicate that the proposed method is more effective when compressing the divided images.

• Journal of the Korean Geosynthetics Society
• /
• v.16 no.4
• /
• pp.129-137
• /
• 2017

In this study, the prediction of landslide probability was performed to the study area located in ${\bigcirc}{\bigcirc}$ area of Muan-gun, Jeonnam Province around Honam railway using the computer program SHAPP ver 1.0 developed by a decision tree model. The soil samples were collected at total 8 points, and soil tests were performed to measure soil properties. The thematic maps of soil properties such as coefficient of permeability and void ratio were made on the basis of soil test results. The slope angle analysis of topography was performed using a digital map. As the prediction result of landslide probability, 435 cells among total 15,552 cells were predicted to be in the event of landslides. Therefore, the predicted area of occurring landslides may be $43,500m^2$ because the analyzed cell size was $10m{\times}10m$.

• Journal of Korean Society of Transportation
• /
• v.28 no.6
• /
• pp.43-54
• /
• 2010

In recent years there have been studies on tour based approaches for freight travel demand modelling. The purpose of this paper is to analyze tour type choice behavior of commercial vehicles which are divided into round trips and chained tours. The methods of the study are based on the decision tree and the logit model. The results indicates that the explanation variables for classifying tour types of commercial vehicles are loading factor, average goods quantity, and total goods quantity. The results of the decision tree method are similar to those of logit model. In addition, the explanation variables for tour type classification of small trucks are not different from those for medium trucks', implying that the most important factor on the vehicle tour planning is how to load goods such as shipment size and total quantity.