• Journal of Korean Society of Forest Science
• /
• v.59 no.1
• /
• pp.15-30
• /
• 1983

To select the superior clones of Populus alba ${\times}$ Populus glandulosa $F_1$, growth and some growth-related physiological characters were examined for thirteen, one-year-old and fifteen, two-year-old clones, respectively at the Seoul National University nursery in Suweon, Clonal differences in growth (total dry weight per tree), leaf area per tree and leaf chlorophyll content per tree at tow-year-old plots were highly significant at the 1% level, but not at one-year-old plots, Highly significant correlation was found between leaf area per tree and total dry weigh per tree (r=0.865), between leaf chlorophyll content per tree and total dry weight per tree (r=0.888), and between photosynthetic ability per tree and total dry weight per tree (r=0.745). The photosynthetic ability and leaf chlorophyll content per unit leaf area of one-year-old plant increased with increasing leaf order number from top. reached maximum value in the twenty-eithth and thirty-third leaves, respectively, and then decreased gradually from those leaved to base, Clones 68-1-54, 66-26-55 and 65-22-11 showed test growth based on leaf area per tree, leaf chlorophyll content per unit leaf area and photosynthetic ability of leaf tissue per unit area. Growth yield of populus alba ${\times}$ P. glandulosa $F_1$ clones could be estimated from either leaf area per tree of leaf chlorophyll content per tree. Therefore, measurements of leaf area and leaf chlorophyll content appear useful to select superior populus clones early growth.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.259-267
• /
• 2013

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.

• Korean Journal of Environment and Ecology
• /
• v.33 no.4
• /
• pp.440-446
• /
• 2019

This study examined the growth and fruiting characteristics and the acorns biomass allometric equation of Quercus acuta to provide reference data related to the growth and seed supply during the restoration of evergreen forest in the warm temperate zone in Wando Island, Korea. For the growth survey, we selected and cut three sample trees having a mean diameter at breast height (DBH) to investigate the growth analysis through a stem analysis. We then developed the allometric equation (Y=aX+b) of DBH and tree height growth characteristic (Y) according to the average tree age (X) of sampled trees and estimated the DBH and tree height according to the age of Quercus acuta. For the fruiting survey, we selected and cut three sample trees with full fruit in August when, they are at the early mature fruiting stage, for the analysis. To develop the acorns/tree biomass allometric equation of Quercus acuta, we selected and cut ten sample trees of evenly divided diameters. The acorns biomass allometric equation ($Y=aX^b$) was derived by analyzing the biomass (Y) and the growth characteristics (X), such as the DBH, tree height, crown width, and crown height. The allometric equations of average tree age according to DBH and tree height were Y=0506X-2.064 ($R^2=0.999$) and Y=0.321X+0689 ($R^2=0.992$), respectively. The developed allometric equations estimated that the DBH were 3.0cm, 8.1cm, 13.1cm and 18.2cm while the tree heights were 3.9m, 7.1m, 10.3m, and 13.5m when the tree ages were 10, 20, 30, and 40 years, respectively. The analysis results of fruiting characteristics showed that the length, the diameter, the number of fruits, and the number of acorns per fruiting branch had the statistically significant difference and tended to decrease from the upper part to the lower part of crown downward. The total number of acorns was 1,312 acorns/tree in the upper part, 115 acorns/tree in the middle part, and 5 acorns/tree in the lower part of the crown. The allometric equation for the amount of acorns with DBH as an independent variable was $Y=0.003X^{4.260}$ with the coefficient of determination at 0.896. Although the coefficient of determination of the allometric equation using only DBH as the independent variable was lower than that using DBH and tree height ($D^2H$), it would be more practical to consider only DBH as the independent variable because of measurement errors.

• The Journal of Society for e-Business Studies
• /
• v.15 no.3
• /
• pp.85-98
• /
• 2010

The prevailing infrastructure of ubiquitous computing paradigm on the one hand making significant development for integrating technology in the daily life but on the other hand raising concerns for privacy and confidentiality. This research presents a new privacy-preserving spatio-temporal query processing technique, in which location based services (LBS) can be serviced without revealing specific locations of private users. Existing location cloaking techniques are based on a grid-based structures such as a Quad-tree and a multi-layered grid. Grid-based approaches can suffer a deterioration of the quality in query results since they are based on pre-defined size of grids which cannot be adapted for variations of data distributions. Instead of using a grid, we propose a location-cloaking algorithm which uses the R-tree, a widely adopted spatio-temporal index structure. The proposed algorithm uses the MBRs of leaf nodes as the cloaked locations of users, since each leaf node guarantees having not less than a certain number of objects. Experimental results show the superiority of the proposed method.

• Spatial Information Research
• /
• v.6 no.2
• /
• pp.125-132
• /
• 1998

The I/O performance for spatial queries is extremely important since the handling of huge amount of multidimensional data is required in spatial databases for geographic information systems. Therefore, we describe representative spatial access methods handling complex spatial objects, z-transform B tree, KDB tree, R tree, MAX tree, to increase I/O performance. In addition, we measure the performance of spatial indexing schemes by testing against various realistic data and query sets. Results from the benchmark test indicates that MAX outperforms other indexing schemes on insertion, range query, spatial join. MAX tree is expected to use as index scheme organizing storage system of GIS in the future.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.521-531
• /
• 2003

Multi-level geographic data can be mainpulated by a window query such as a zoom operation. In order to handle multi-level geographic data efficiently, a spatial indexing method supporting a window query is needed. However, the conventional spatial indexing methods are not efficient to access multi-level geographic data quickly. To solve it, other a few spatial indexing methods for multi-level geographic data are known. However these methods do not support all types of multi-level geographic data. This paper presents a new efficient spatial indexing method, the MLR-tree for window query of multi-level geographic data. The MLR-tree offers both high search performance and no data redundancy. Experiments show them. Moreover, the MLR-tree supports all types of multi-level geographic data.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.1-4
• /
• 2009

In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

• Journal of Korea Technology Innovation Society
• /
• v.9 no.1
• /
• pp.84-102
• /
• 2006

This paper compares four models to value a biotechnology R&D project; option tree model, dynamic discounted cash flow(DCF) model, and option thinking DCF model with general DCF model. Real Options, especially 6-folded option tree model yields boner estimate of value than values using other methods. According to sensitivity analysis, sales of final products, number of investigational new drug developments(INDs) and success rates of each stage are key factors for the value of biotechnology R&D investment.

• Journal of Environmental Health Sciences
• /
• v.14 no.2
• /
• pp.29-41
• /
• 1988

This study was performed to investigate the air pollution levels in Daegu area titrough measuring of contents of water, chlorophyll, water soluble sulfur and lead metal in the leaves of roadside trees and chemical properties of soil under the urban trees. The results can be summarized as follows 1. The range of water content was from 60.4% to 74.6%. The comparisons of chlorophyll, water soluble sulfur and water content were regression equation, chlorophyll=0.1981+ 0.0040 water content (July), water soluble sulfur=3,139-0.0416 water content (July). and correlation coefficient, r=0.561 and r=0.549 respectively 2. Average contents of chlorophyll, water soluble sulfur and lead metal in the leaves of roadside tree at sampling sites were chlorophyll 0.050, 0.072mg/cm$^2$, water soluble sulfur 0.244, 0.333%, and lead metal 12.25, 12.68ppm in Oct. and Jul. respectively. 3. Correlation between chlorophyll and contents of water soluble sulfur and lead metal in the leaves of roadside tree at sampling sites were water soluble sulfur r=-0.564, -0.613 and lead metal r=-0.693, -0.699 in October and July, respectively. 4. Correlation between chlorophyll and water content, water soluble sulfur and lead metal in the leaves of tree showed positive significance.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.396-408
• /
• 2006

Moving object databases manage a large amount of past location data which are accumulated as the time goes. To retrieve fast the past location of moving objects, we need index structures which consider features of moving objects. The KDB-tree has a good performance in processing range queries. Although we use the KDB-tree as an index structure for moving object databases, there has an over-split problem in the spatial domain since the feature of moving object databases is to increase the time domain. Because the over-split problem reduces spatial regions in the MBR of nodes inverse proportion to the number of splits, there has a problem that the cost for processing spatial-temporal range queries is increased. In this paper, we propose the dynamic split strategy of the KDB-tree to process efficiently the spatial-temporal range queries. The dynamic split strategy uses the space priority splitting method for choosing the split domain, the recent time splitting policy for splitting a point page to maximize the space utilization, and the last division policy for splitting a region page. We compare the performance of proposed dynamic split strategy with the 3DR-tree, the MV3R-tree, and the KDB-tree. In our performance study for range queries, the number of node access in the MKDB-tree is average 30% less than compared index structures.