• Journal of Korean Society of Forest Science
• /
• v.74 no.1
• /
• pp.82-87
• /
• 1986

Noticed that large number of the Korean white pine (Pinus koraiensis S. et Z.) has lost its typical excurrent tree from by removal of apical shoot in the process of cone harvesting, the investigation and analysis for the species were made on the basis of the relationship among DBH, total height, merchantable height, and merchantable volume, compared with normally grown Japanese larch (Larix leptolepis Gordon). One hundred sample trees for each species were selected in the same aged stands for the study. Results have indicated that the pine has shown abnormal height growth pattern mainly by the disturbance of external artificial force. The pine's forked and/or crooked stems by the reason lave led the result of less merchantable volume in the same DBH classes. Consequently, the pine would have undesirable tree form in terms of timber production, unless free from apical shoot disturbances. Considered to the merit of the Korean white pine that can produce timber and pine nuts, management alternatives for the pine stand were suggested to achieve maximum rate of return for the silvicultural investment.

• The Research Journal of the Costume Culture
• /
• v.11 no.3
• /
• pp.423-430
• /
• 2003

Cotton fabric md nylon fabric were chosen as base fabric specimens for dyeing using Japanese pagoda tree colorants through chitosan, treatment. With the chitosan treatment, the dye-uptake of the treated fabric increased. This treatment is also expected to be effective in terms of environment-friendliness. The effect of the dyeing methods, mordanting or non-mordanting, and chitosan treatment on the dye-uptake and air permeability of the treated fabrics was investigated. In case of cotton fabric, Al mordanted dyeing resulted in higher dye-uptake through the chitosan treatment. Therefore, the chitosan treatment is effective in this case. Japanese pagoda tree seems to have direct affinity for nylon fabric without the mordanting treatment. In case of cotton fabric, it seems that the cellulose molecules, colorants, and the chitosan make a complex, thereby reducing the air permeability. In case of nylon fabric, due to the fact the Japanese pagoda tree colorant molecules form direct physical bonding with the nylon molecules, it seems that there is not much of air permeability reduction.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.263-277
• /
• 2005

In this paper, we introduce algorithms for constructing broadcasting and multicasting trees. These algorithms are general because they may be used for tree cost functions that are of arbitrary form. Thus, essentially the same algorithmic procedures are used for different tree cost functions. We evaluate the effectiveness of the general algorithms by applying them to different cost functions that are often used to model wired and wireless net­works. Besides providing a unifying framework for dealing with many present and future tree-construction applications, these algorithms typically outperform some existing algorithms that are specifically designed for energy-aware wireless networks. These general algorithms perform well at the expense of higher computational complexity. They are centralized algorithms, requiring the full network information for tree construction. Thus, we also present variations of these general algorithms to yield other algorithms that have lower complexity and distributed implementation.

• Communications for Statistical Applications and Methods
• /
• v.24 no.6
• /
• pp.543-559
• /
• 2017

Tree-based regression and classification ensembles form a standard part of the data-science toolkit. Many commonly used methods take an algorithmic view, proposing greedy methods for constructing decision trees; examples include the classification and regression trees algorithm, boosted decision trees, and random forests. Recent history has seen a surge of interest in Bayesian techniques for constructing decision tree ensembles, with these methods frequently outperforming their algorithmic counterparts. The goal of this article is to survey the landscape surrounding Bayesian decision tree methods, and to discuss recent modeling and computational developments. We provide connections between Bayesian tree-based methods and existing machine learning techniques, and outline several recent theoretical developments establishing frequentist consistency and rates of convergence for the posterior distribution. The methodology we present is applicable for a wide variety of statistical tasks including regression, classification, modeling of count data, and many others. We illustrate the methodology on both simulated and real datasets.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.06a
• /
• pp.383-384
• /
• 2009

• Proceedings of the Korean Society of Life Science Conference
• /
• 2000.09a
• /
• pp.96-96
• /
• 2000

• Journal of Korean Society of Forest Science
• /
• v.85 no.4
• /
• pp.557-564
• /
• 1996

Based on stem analysis as well as branch analysis data of each tree from 8 plots of circle clear-cutting and 1 biomass plot in Changbai Mountain area, located in Northeast of China, the effective crown form of Changbai larch(Larix olgensis H.) plantation were studied by using the approach of crown curve. The results indicated that the cross-section forms of effective crown were stable and showed approximate circle for different tree size. Because the effective crown was on upper position of the canopy and its form reflects crown architecture under non-competition condition, the architecture is mainly affected by species hereditary feature. Therefore, for the specified species the effective crown form was thought to be relatively stable. The effective crown form of tree was neither related to the tree size within stand nor to the stand condition for different stand. The total effective crown curve of larch plantation could be characterized by using mean effective crown taper.

• Proceedings of the KIEE Conference
• /
• 1986.07a
• /
• pp.449-452
• /
• 1986

• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.90-95
• /
• 2022

This paper proposes a method to find a tree with the maximum number of terminals that can be connected by a given length when numerous terminals distributed in a cluster form are given to the Euclidean plane R2 with several constraints. First constraint is that a given terminal is distributed in a cluster form, second is that a given length cannot connect all terminals in the tree, and third is that there is no curved connection between each terminal. This paper proposes a method to establish more efficient interconnections within terminals distributed in a cluster form by improving a randomly distributed memetic genetic algorithm. The construction of interconnections has been extensively used in design-related fields, from networking to architecture. Additionally, in real life, the construction of interconnections is mostly distributed in the form of clusters. Therefore, the heuristic algorithm proposed in this paper can be effectively utilized in real life and is expected to provide various cost savings.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.1-8
• /
• 2007

Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. Therefore, in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implements CTOC. In order to statically determine the value and type, CTOC uses the SSA Form which separates the variable according to assignment. Also, it uses a Tree Form for statements. But, due to insertion of the $\phi$-function in the process of conversion into the SSA Form, the number of nodes increased. This paper shows the dead code elimination to obtain a more optimized code in SSA Form. We add new live field in each node and achieve dead code elimination in tree structures. We can confirm after dead code elimination though test results that nodes decreases.