• 한국조경학회지
• /
• 제26권2호
• /
• pp.219-228
• /
• 1998

This study was investigated a optimum planting density of urban public park in seoul. Eight species commonly usd as landscape plants were selected. The survey was conducted to measure hight and width of the trees by five years interval. The results are summarized as follows. The average annual growth rates of the trees after planting were 7.4% in height 11.7% in width. Faster grown trees than average growth rate of the survey tres wee Metasequoia, glyptostroboides and Acer buergerianum, While the slower grown trees were Pinus koraiensis, Ginkgo biloba and Zelkova serrata. The average grown trees were Pinus strobus, Pinus densiflora and Acer palmatum . The planting density of survey area was 0.20tree/$m^2$. The optimum planting density was kept until five years after planting, however overcrowding density was found beyond five years after planting. This study also found the density of ten years after planting reaches about 3 times of optimum density.

• Asian Journal of Atmospheric Environment
• /
• 제6권3호
• /
• pp.192-205
• /
• 2012

The effects on birch (Betula spp.) of elevated carbon dioxide ($CO_2$) and ozone ($O_3$), which are both increasing in the troposphere, are surveyed in detail based on the literature. Birches establish themselves in the open field after disturbances, and then become dominant trees in temperate or boreal forests. Ecophysiological approaches include the measurement of photosynthesis, biomass, growth, and survival of seedlings and trees. Elevated $CO_2$ levels give rise to a net enhancement of the growth of birch trees, whereas high $O_3$ generally reduces growth. Although the effects of the two are opposed, there is also an interactive effect. Basic physiological responses of the single genus Betula to $CO_2$ and $O_3$ are set out, and some data are summarized regarding ecological interactions between trees, or between trees and other organisms.

• East Asian mathematical journal
• /
• 제31권5호
• /
• pp.695-706
• /
• 2015

Let ${\mathcal{H}}$ be an infinite dimensional complex Hilbert space, and let $B({\mathcal{H}})$ be the algebra of all bounded linear operators on ${\mathcal{H}}$. Recall that an operator $T{\in}B({\mathcal{H})$ has property B(n) if ${\mid}T^n{\mid}{\geq}{\mid}T{\mid}^n$, $n{\geq}2$, which generalizes the class A-operator. We characterize the property B(n) of weighted shifts $S_{\lambda}$ over (${\eta},\;{\kappa}$)-type directed trees which appeared in the study of subnormality of weighted shifts over directed trees recently. In addition, we discuss the property B(n) of weighted shifts $S_{\lambda}$ over (2, 1)-type directed trees with nonzero weights are being distinct with respect to $n{\geq}2$. And we give some properties of weighted shifts $S_{\lambda}$ over (2, 1)-type directed trees with property B(2).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.1855-1858
• /
• 2003

In this paper, we propose image retrieval method more accurate and efficient than the conventional one. First of ail, we perform a shot detection and key frame extraction from the DC image constructed by DCT DC coefficients in the compressed video stream that is video compression standard such as MPEG[I][2]. We get principal axis applying PCA(Principal Component Analysis) to key frames for obtaining indexing information, and divide a domain. Video retrieval uses indexing information of high dimension. We apply KD-Trees(K Dimensional-Trees)[3] which shows efficient retrieval in data set of high dimension to video retrieval method. The proposed method can represent property of images more efficiently and property of domains more accurately using KD-Trees.

• Journal of Communications and Networks
• /
• 제9권1호
• /
• pp.84-92
• /
• 2007

This paper deals with the creation of multicast trees in a differentiated services (DiffServ) domain. Initially, we model the integration problems of multicast & DiffServ and give a general de-scription of our framework for multicast provisioning in DiffServ domains. Within this framework, we introduce a novel heuristic algorithm which calculates the multicast trees efficiently. The multicast tree's format and the bandwidth constraints per service class are modeled. The heuristic is based on the Dijkstra's shortest path algorithm and aims to produce the cheapest possible trees (Steiner tree problem) that conform to the defined model. The produced trees can be considered as DiffServ-customized Steiner trees. Furthermore, we evaluate the algorithm with theoretical and experimental analysis and finally, we present our conclusions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권10호
• /
• pp.4007-4024
• /
• 2020

It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권9호
• /
• pp.2232-2245
• /
• 2013

The present study proposes efficient procedural modeling methods for enabling the growth and creation of various trees with minimal user control. Growth volume algorithms are utilized in order to easily and effectively calculate many parameters that determine tree growth, including branch propagation. Procedural methods are designed so that users' interactive control structures can be applied to these algorithms to create unique tree models efficiently. First, through a two-line-based interactive growth volume control method, the growth information that determines the overall shape of the tree is intuitively adjusted. Thereafter, independent branch control methods designed to control individual branches are added to the growth deformation in order to enable the growth of unique trees. Whether the growth processes of desired trees can be easily and intuitively controlled by the proposed method is verified through experiments. Methods that can apply the proposed methods are also verified.

• 경영과학
• /
• 제23권1호
• /
• pp.63-74
• /
• 2006

Decision tree induction algorithm is one of the most widely used methods in classification problems. However, they could be trapped into a local minimum and have no reasonable means to escape from it if tree algorithm uses top-down search algorithm. Further, if irrelevant or redundant features are included in the data set, tree algorithms produces trees that are less accurate than those from the data set with only relevant features. We propose a hybrid algorithm to generate decision tree that uses genetic programming with sequentially selected features. Correlation-based Feature Selection (CFS) method is adopted to find relevant features which are fed to genetic programming sequentially to find optimal trees at each iteration. The new proposed algorithm produce simpler and more understandable decision trees as compared with other decision trees and it is also effective in producing similar or better trees with relatively smaller set of features in the view of cross-validation accuracy.

• 한국조경학회지
• /
• 제32권4호
• /
• pp.21-27
• /
• 2004

This study aims to analyze the frequency of the use of internet web sites for information on landscape trees, and to suggest an improved direction for internet information content concerning of landscape trees. 10 areas of 5internet web-sites that are presented by an internet search with Yahoo Korea, Empas and Naver were studied for their importance and satisfaction degrees by landscape architects who use them. The users recognized the importance of the contents of the internet web-sites for landscape trees, but were not satisfied with it. It was proposed that the web-sites should provide higher quality information on the growth history, price, shipping and handling, payment and the place of origin. Especially, the paper proposes that web-sites should more aggressively utilize information on the quality of landscape trees such as tree forms, trimming states of roots, etc.

• 대한안전경영과학회지
• /
• 제13권1호
• /
• pp.51-58
• /
• 2011

The uniformity of lighting distribution on the roadway is essential factor for drivers and pedestrians's safety during nighttime in urban streets. Also, the importance of roadside trees is one of the growing concern for better citizens' health and mitigating environmental impact on the urban street. But roadway lightings and roadside trees have different design or planting standards and they are not integrated in the systemic viewpoint for better safety of users during nighttime. The purpose of this study is to propose a simulation approach which assesses lighting quality in the view of illumination uniformity distribution of roadway lighting from design step and consider the layout of roadside trees. For improving lighting quality of roadway, simulation approach is needed for assessing the impact of diverse planting situation of trees and encouraged from beginning of design step for roadway construction.