• Journal of the Korean Institute of Landscape Architecture
• /
• v.47 no.3
• /
• pp.31-38
• /
• 2019

This study quantified, through a direct harvesting method, storage and annual uptake of carbon from open-grown trees for three landscape tree species frequently planted in the southern region of Korea, and developed quantitative models to easily estimate the carbon reduction by tree growth for each species. The tree species for the study included Camellia japonica, Lagerstroemia indica, and Quercus myrsinaefolia, for which no information on carbon storage and uptake was available. Ten tree individuals for each species (a total of 30 individuals) were sampled considering various stem diameter sizes at given intervals. The study measured biomass for each part of the sample trees to quantify the total carbon storage per tree. Annual carbon uptake per tree was computed by analyzing the radial growth rates of the stem samples at breast height or ground level. Quantitative models were developed using stem diameter as an independent variable to easily calculate storage and annual uptake of carbon per tree for study species. All the quantitative models showed high fitness with $r^2$ values of 0.94-0.98. The storage and annual uptake of carbon from a Q. myrsinaefolia tree with dbh of 10 cm were 24.0 kg and 4.5 kg/yr, respectively. A C. japonica tree and L. indica tree with dg of 10 cm stored 11.2 kg and 8.1 kg of carbon and annually sequestered 2.6 kg and 1.2 kg, respectively. The above-mentioned carbon storage equaled the amount of carbon emitted from the gasoline consumption of about 42 L for Q. myrsinaefolia, 20 L for C. japonica, and 14 L for L. indica. A tree with the diameter size of 10 cm annually offset carbon emissions from gasoline use of approximately 8 L for Q. myrsinaefolia, 5 L for C. japonica, and 2 L for L. indica. The study pioneers in quantifying biomass and carbon reduction for the landscape tree species in the southern region despite difficulties in direct cutting and root digging of the planted trees.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.506-508
• /
• 2006

A frequency selective surface (FSS), whose unit cell consists of a ternary tree loop loaded with a modified tripole, is proposed to block multiple frequency bands. Target frequency bands correspond to Korean personal communication services, cellular mobile communication, and 2.4 GHz industrial, scientific, and medical bands. Through the adjustment of inter-element and inter-unit cell gaps, and adjustment of the length of elements, we present an FSS design method that makes the precise tuning of multiple resonance frequencies possible. Additionally, to verify the validity of our approach, simulation results obtained from a commercial software tool and experimental data are also presented.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2003.05a
• /
• pp.186-187
• /
• 2003

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.3
• /
• pp.235-242
• /
• 2008

This paper proposes a method for improving the process plan quality by use of dimensional tolerances. Dimensioning and tolerancing plays a key role in manufacturing process plan because the final part must ensure conformance with the dimensions and tolerances in its drawing. As a first step for the improvement of process plan quality, two resultant tolerances in design and process plan should be compared each other, and so a tolerance chart is used for acquisition and comparison of the two tolerances. In addition to two kinds of design and manufacturing tolerances, operational sequences or paths for the resultant dimension and tolerance are additionally recognized for measuring the quality of process plan quantitatively. Rooted tree is applied to find the related paths for the manufacturing resultant tolerances. A quality coefficient is defined by the components of two tolerances and their relations, the paths related to manufacturing resultant tolerances and the difficulty of an operation. In order to improve the quality of manufacturing process plan, the paths that two kinds of tolerances are the same or different in the rooted tree are recognized respectively and a method for tolerance rearrangement is developed. A procedure for improving the quality is suggested by combining the coefficient and the tolerance rearrangement method. A case study is applied to illustrate the efficiency of improvement method.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.63-66
• /
• 2001

In this paper, We propose the new interconnection network which is designed to edge numbering labeling using postorder traversal which can reduce diameter when it has same node number with Hypercube, which can reduce total node numbers considering node degree and diameter on Fibonacci trees and its jump sequence of circulant is Fibonacci numbers. It has a simple (shortest oath)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded to Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.727-734
• /
• 1999

Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.59-62
• /
• 2000

In this paper, We propose the new interconnection network which is designed to edge numbering method using inorder traversal a Fibonacci trees and its jump sequence is Fibonacci numbers. It has a simple (shortest path)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube on interconnection network measrtes.

• Communications for Statistical Applications and Methods
• /
• v.2 no.1
• /
• pp.74-88
• /
• 1995

This article introduces a unified method of choosing the most explanatory and significant multiway partitions for classification tree design and analysis. The method is derived on the impurity reduction (IR) measure of divergence, which is proposed to extend the proportional-reduction-in-error (PRE) measure in the decision-theory context. For the method derivation, the IR measure is analyzed to characterize its statistical properties which are used to consistently handle the subjects of feature formation, feature selection, and feature deletion required in the associated classification tree construction. A numerical example is considered to illustrate the proposed approach.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.1049-1050
• /
• 2006

In this paper, we present the analysis of Tree-LDPC codes using EXIT(Extrinsic information transfer) charts methods. Two different EXIT charts schemes are compared. One is based on the closed form equation and the other is based on Monte-Carlo simulation. The thresholds by these two schemes match well with the threshold by DE(density evolution) scheme. Simulation performance is also shown with the obtained thresholds.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.371-374
• /
• 2000

This paper proposes a 16-bit ${\times}$ 16-bit multiplier for 2 twos-complement binary numbers with tree-like structure and implements it on a FPGA. The space and time complexity analysis shows that the 16-bit Tree-like multiplier represents lower circuit complexity and computes more quickly than both Booth array multiplier md Modified array multiplier.