• Journal of Korean Society of Forest Science
• /
• v.86 no.2
• /
• pp.208-213
• /
• 1997

Tree form characteristics and biomass distribution and volume increment for Quercus spp., Larix leptolepis and Pinus koraiensis growing in Kwangju-Gun, Kyunggi-Do were investigated. P. koraiensis showed higher crown percentage than L. leptolepis, indicating that P. koraiensis maybe shade-tolerant species. Biomass allocation by tree height showed significant difference among three species. Stem biomass distributed more dimminishing along tree height with Quercus spp. and P. koraiensis than L. leptolepis. The allometric pattern of leaf-and branch biomass appeared as normal distribution. Present biomass was highest in L. leptolepis showing 171.1tons/ha and followed by P. koraiensis and Quercus spp, with 75.3tons/ha and 61.6tons/ha, respectively.

• Journal of Korean Society of Forest Science
• /
• v.99 no.5
• /
• pp.726-735
• /
• 2010

Publications with the data on allometric equation, biomass and productivity of major oak forests in Korea were reviewed. Different allometric equations of major oak species showed site- or speciesspecific dependences. The biomass of major oak forests varied with age, dominant species, and location. Aboveground tree biomass over the different oak species was expressed as a power equation of the stand age. The proportion of tree component (stem, branch and leaf) to total aboveground biomass differed among oak species, however, biomass ranked stem > branch > leaf in general. The leaf biomass allocation over the different oak species was expressed as a power equation of total aboveground biomass while there were no significant patterns of biomass allocation from stem and branch to the aboveground biomass. Tree root biomass continuously increased with the aboveground biomass for the major oak forests. The relationship between the root to shoot ratio and the aboveground tree biomass was expressed by a logarithmic equation for major oak forests in Korea. Thirteen sets of data were used for estimating the net primary production (NPP) and net ecosystem production (NEP) of oak forests. The mean NPP and NEP across different oak forests was 10.2 and 1.9 Mg C $ha^{-1}year^{-1}$. The results in biomass allocation, NPP and NEP generally make Korean oak forests an important carbon sinks.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.120-127
• /
• 2002

The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. However. there have been few researches about the relation between multiple and concurrent multicast groups. In this paper, the multiple multicast tree allocation algorithm to avoid congestion is proposed. The multicast group with different bandwidth requirement is also considered. A two-phase algorithm is proposed. The first phase is for basic search and the second phase for further improvement. The performance of the proposed algorithm is experimented with computational results. Computational results show that the proposed algorithm outperforms an existing algorithm.

• Communications for Statistical Applications and Methods
• /
• v.8 no.3
• /
• pp.739-751
• /
• 2001

In this paper, a sample design is studied for 2000 forestry management survey of five types forestry , tree felling, gathering of pine mushroom, growing of nut trees, growing of wild flowers, and lumbering industry. We introduce population stratification and a modified stratified cut-off sampling which deal with determination of sample size, sample allocation, and estimation of total and variance of estimator. Substitution of sample units and imputation of nonresponse units are discussed for reducing the nonsampling errors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.639-649
• /
• 2000

In the relational database systems, the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed to reduce the execution time. Multiple hash join algorithm using allocation tree is one of most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. In this paper, to solve the performance degrading problem by the delay, we develop a join algorithm using the concept of 'synchronization of page execution time' for multiple hash joins. We reduce the processing time of each nodes in the allocation tree and improve the total system performance. In addition, we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

• 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.

• East Asian mathematical journal
• /
• v.38 no.3
• /
• pp.277-292
• /
• 2022

This study investigates the convergence of the optimal consumption and investment policies in a binomial-tree model to those in the continuous-time model of Merton (1969). We provide the convergence in explicit form and show that the convergence rate is of order ∆t, which is the length of time between consecutive time points. We also show by numerical solutions with realistic parameter values that the optimal policies in the binomial-tree model do not differ significantly from those in the continuous-time model for long-term portfolio management with a horizon over 30 years if rebalancing is done every 6 months.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.781-790
• /
• 1996

processors must be allocated to incoming tasks in a way that will maximize the processor utilization and minimize the system fragmentation. Thus, an efficient method of allocating processors in a hypercube is a key to system performance. In order to achieve this goal, it is necessary to detect the availability of a subcube of required size and merge the released small cubes to form a larger ones. This paper presents the tree-exchange algorithm which detemines the levels and partners of the binary tree representation of a hypercube, and an efficient allocation strategy using the algorithm. The complexity for search time of the algorithm is $O\ulcorner$n/2$\lrcorner$$\times$2n)and it shows good performance in comparison with other strategies.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.22 no.2
• /
• pp.1-12
• /
• 2019

Open space planners and designers should consider scientific and quantified functions of trees when they have to locate where to plant the tree. However, until now, most planners and designers could not consider them because of lack of tool for considering scientific and quantitative tree functions. This study introduces a tree location supporting tool which focuses on the multi-objective including scientific function using ACO (Ant colony optimization). We choose shading effect (scientific function), shielding, and openness as objectives for test application. The results show that when the user give a high weight to a particular objective, they can obtain the optimal results with high value of that objective. When we allocate higher weight for the shading effect, the tree plans provide larger shadow value. Even when compared with current tree plan, the study result has a larger shading effect plan. This result will reduce incident radiation to the ground and make thermal friendly open space in the summer. If planners and designers utilize this tool and control the objectives, they would get diverse optimal tree plans and it will allow them to make use of the many environmental benefits from trees.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.455-460
• /
• 2001

For some applications, the computational structure changes dynamically during the program execution. When this happens, static partitioning and allocation of tasks are not enough to achieve high performance in parallel computers. In this paper, we propose a dynamic load balancing algorithm efficiently distributes the computation with dynamically growing tree structure to processors. We present an implementation technique for the algorithm on mesh architectures, and analyze its complexity. We also demonstrate through experiments how our algorithm provides good quality solutions.