• Journal of Korean Society of Forest Science
• /
• v.102 no.2
• /
• pp.229-238
• /
• 2013

This study was conducted to analyze on the operational cost of logging operations in the whole-tree logging operation system by tower-yarder and swing-yarder, and in the cut-to-length logging operation system by excavator with grapple in order to spread efficient logging operation technique and to establish the logging operation system. In the results of the analysis of operation cost, in case of the whole-tree logging operation system, the operation cost was 2,099 won/$m^3$ in felling by chain saw, 28,286 won/$m^3$ in yarding by tower-yarder, 18,265 won/$m^3$ in yarding by swing-yarder, 18,939 won/$m^3$ in bucking by excavator with grapple and chain saw, 20,484 won/$m^3$ in forwarding and accumulation by wheel type mini-forwarder, 12,701 won/$m^3$ in forwarding and accumulation by excavator with grapple and small forwarding vehicle. In case of the cut-to-length logging operation system, the operation cost was 10,160 won/$m^3$ in felling and bucking by chain saw, 7,567 won/$m^3$ in cut-to-length extraction by excavator with grapple, 6,982 won/$m^3$ in branches and leaves extraction by excavator with grapple, 3,040 won/$m^3$ in the operation road construction by excavator with grapple, 20,484 won/$m^3$ in forwarding and accumulation by wheel type mini-forwarder, 12,701 won/$m^3$ in forwarding and accumulation by excavator with grapple and small forwarding vehicle.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.319-323
• /
• 2003

Let P be a set of n points in the plane. A minimum spanning tree(MST) is a spanning tree connecting n points of P such that the sum of lengths of edges of the tree is minimized. A diameter of a tree is the maximum length of paths connecting two points of a spanning tree of P. The problem considered in this paper is to compute the spanning tree whose diameter is minimized over all spanning trees of P. We call such tree a minimum-diameter spanning tree(MDST). The best known previous algorithm[3] finds MDST in $O(n^2)$ time. In this paper, we suggest an approximation algorithm to compute a spanning tree whose diameter is no more than 5/4 times that of MDST, running in O(n$^2$log$^2$n) time. This is the first approximation algorithm on the MDST problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.100-109
• /
• 2003

A differential index assignment scheme is proposed for the image encoding system in which a variable-length tree-structured vector quantizer is adopted. Each source vector is quantized into a terminal node of VLTSVQ and each terminal node is represented as a unique binary vector. The proposed index assignment scheme utilizes the correlation between interblocks of the image to increase the compression ratio with the image quality maintained. Simulation results show that the proposed scheme achieves a much higher compression ratio than the conventional one does and that the amount of the bit rate reduction of the proposed scheme becomes large as the correlation of the image becomes large. The proposed encoding scheme can be effectively used to encode R images whose pixel values we, in general, highly correlated with those of the neighbor pixels.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.316-324
• /
• 2001

A table compression method for reversible variable length code is proposed in this paper. TNWT(Transition Number and Weight of Tree) method, which uses the transition number of bits within a symbol and the level of a code tree, is proposed. Compression of table values is performed after arrangment of values that is not distinghishable by transition number and weights. In decoding, the transition number and weight of code are used. In this method, the table for RVLC decoding can be implemented with a smaller memory.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1324-1342
• /
• 2020

Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

• Journal of Forest and Environmental Science
• /
• v.38 no.4
• /
• pp.275-283
• /
• 2022

A study was designed to investigate the pattern of sexual dimorphism in a plantation of Garcinia kola. Twenty trees were randomly selected for the study and have been observed to flower regularly. A total of 100 inflorescence were randomly collected from the crown of each tree and 500 flowers randomly assessed within the period of four (4) flowering seasons. Floral sex assessment was done visually and with a hand magnifying lens; floral morphometric measurements (i.e. pedicel and perianth length and breadth), inflorescence length, and breadth) was taken using a veneer caliper; number of flowers per inflorescence and inflorescence per twig was counted; while, data analysis was conducted on excel using analysis of variance and pairwise t-test comparison. Four floral sexes were identified in the G. kola plantation studied which were unisexual male flowers, unisexual female flowers, cosexual unisexual male flowers, and cosexual hermaphrodite flowers. Three tree sexes were identified viz: inconstant male, invariant female, and cosexual trees. The plantation was significantly sexually dimorphic in floral sex and phenotypic traits (i.e. pedicel and perianth size), and as well as sexually dimorphic in tree sex and reproductive phenotypic traits (i.e. inflorescence size, number of inflorescences per twig, and number of flower bud per inflorescence). The sexual system of the plantation was therefore trioecious with features suggestive of evolving dioecy through the gynodioecious pathway.

• Journal of Forest and Environmental Science
• /
• v.28 no.2
• /
• pp.63-67
• /
• 2012

Crown ratio is the ratio of live crown length to tree height. It is often used as an important predictor variable for tree growth equation. It indicates tree vigor and is a useful parameter in forest health assessment. The objective of the study was to develop crown ratio prediction models for Tectona grandis. Based on the data set from the temporary sample plots, several non linear equations including logistics, Chapman Richard and exponential functions were tested. These functions were evaluated in terms of coefficient of determination ($R^2$) and standard error of the estimate (SEE). The significance of the estimated parameters was also verified. Plot of residuals against estimated crown ratios were observed. Although the logistic model had the highest $R^2$ and the least SEE, Chapman-Richard and Exponential functions were observed to be more consistent in their predictive ability; and were therefore recommended for predicting crown ratio in the stand.

• The Plant Pathology Journal
• /
• v.21 no.1
• /
• pp.27-32
• /
• 2005

Leaf anthracnose was observed on leaves of Japanese spindle tree in Seoul, Korea from autumn 2003 to spring 2004. The causal fungus was purely isolated from he leaf spot lesions and cultured on PDA. The colony on PDA was cream to orange but blackish in the center n old cultures. Conidia were formed in blackish orange asses and were cylindrical in shape, measured 13-17${\times}$5-7 ${\mu}$m in size. Blackish brown setae were often observed on PDA and ranged up to 100 ${\mu}$m in length. Based on morphological and ITS region sequence analyses, the fungal strain was identified as Colletotrichum boninense. Koch’s postulates were fulfilled by inoculating tree leaves with 1 ${\times}$ $106^6$ conidia per ml in a moist chamber. This is the first study on the pathogenicity, growth and phylogenetic characteristics of C. boninense causing leaf anthracnose on Japanese spindle tree in Korea.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.99-108
• /
• 1997

An efficient wavelet packet algorithm to find wavelet packet quickly is presented in this paper. The top-down method maximizing the transform coding gain that is obtained from the second moment of the band is used to divide the subbands into wavelet tree. The bit allocation for each band in the tree is performed in proportion to its variance. Bands are coded by the lossless coding algorithm called the bit plane run length coding(BPRLC) and uniform quantizer. The proposed algorithm is compared with of the single tree algorithim proposed by Ramchandran and Vetterli. To verify the efficiency of our algorithm, simulations are jperformed using several sets of images. The results show us that our method reduces the execution time by about forty percent of that required by the single tree method while maintaining the comparable reconstructed image qualities.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.