• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1077-1088
• /
• 2003

To increase the retrieval performance in spatial database systems, it is required to develop spatial indexing methods considered the spatial locality. The spatial locality is related to the location property of objects. The previous spatial indexing methods are not considered the circular location property that objects will be taken. In this paper, we propose a dynamic spatial index structure called $Cr^*$-tree, and evaluate the performance of the proposed index structure. This is a new spatial index structure considered the circular location property of objects in which a search space is constructed with the circular and linear domains. By the simulation results, the $Cr^*$-tree shows that the number of disk across is low and the bucket utilization is high regardless of object distribution and bucket capacity.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.81-90
• /
• 2004

Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.

• Proceedings of the ESK Conference
• /
• 1996.04a
• /
• pp.113-127
• /
• 1996

In Human Reliability Analysis(HRA), the uncertainties involved in many factors that affect human reliability have to be represented as the quantitative forms. Conventional probability- based human reliability theory is used to evaluate the effect of those uncertainties but it is pointed out that the actual human reliability should be different from that of conventional one. Conventional HRA makes use of error rates, however, it is difficult to collect data enough to estimate these error rates, and the estimates of error rates are dependent only on engineering judgement. In this paper, the error possibility that is proposed by Onisawa is used to represent human reliability, and the error possibility is obtained by use of fuzzy reasoning that plays an important role to clarify the relation between human reliability and human error. Also, assuming these factors are connected to the top event through Fault Tree structure, the influence and correlation of these factors are measured by fuzzy operation. When a fuzzy operation is applied to Fault Tree Analysis, it is possible to simplify the operation applying the logic disjuction and logic conjuction to structure function, and the structure of human reliability can be represented as membership function of the top event. Also, on the basis of the the membership function, the characteristics of human reliability can be evaluated by use of the concept of pattern recognition.

• Journal of Forest and Environmental Science
• /
• v.32 no.3
• /
• pp.237-252
• /
• 2016

Improved knowledge of the environmental factors affecting the natural regeneration of tree species in limestone forest is urgently required for species conservation. We examined the environmental factors and tree species characteristics that are important for colonization in diverse forest stands growing on a limestone hill in northern Thailand. Our analysis estimated the relative influence of forest structure and environmental factors on the regeneration traits of tree species. We established sixty-four $100-m^2$ plots in four forest stands on the limestone hill. We determined the species composition of canopy trees, regenerating seedlings, and saplings in relation to the physical environment. The relationships between environmental variables and tree species abundance were assessed by canonical correspondence analysis (CCA), and we used generalized linear mixed models to examine data on seedling/sapling abundances. The CCA ordination indicated that the abundance of tree species within the mixed deciduous forest was closely related to soil depth. The abundances of tree species growing within the sink-hole and hill-slope stands were positively related to the extent of rocky outcropping; light and soil moisture positively influenced the abundance of tree species in the hill-cliff stand. Physical factors had a greater effect on tree regeneration than did factors related to forest structure. Tree species, such as Ficus macleilandii, Dracaena cochinchinensis, and Phyllanthus mirabilis within the hill-cliff or sink-hole stand, colonized well on large rocky outcroppings that were well illuminated and had soft soils. These species regenerated well under conditions prevailing on the limestone hill. The colonization of several species in other stands was negatively influenced by environmental conditions at these sites. We found that natural regeneration of tree species on the limestone hill was difficult because of the prevailing combination of physical and biological factors. The influence of these factors was species dependent, and the magnitude of effects varied across forest stands.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.20-25
• /
• 2009

The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a suboptimum multiple-input multiple-output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation.We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly compared to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.129-132
• /
• 2004

공간 색인구조는 공간 데이터를 효율적으로 관리하기 위한 도구로써, GIS와 같은 공간 데이터베이스의 성능을 결정하는 중요한 요소라 하겠다. 대부분의 응용분야에서 공간 데이터베이스는 보조기억장치에 저장된 방대한 양의 공간데이터 처리를 요구하므로 디스크 접근의 수를 줄이는 것이 전체 데이터베이스의 성능을 향상시키는데 중요한 요소이다. 이 논문에서는 SMR-tree라는 공간색인구조의 여러 응용분야에서 활용 가능성을 기존의 색인구조들과의 비교를 통해 확인한다. SMR-tree는 R-tree 계열의 구조로써 기존의 R-tree계열의 구조들과 동일한 노드의 형태를 가지고 있으나, 여러 개의 data space를 사용하여 data object를 배분함으로써 $R^{+}-tree$의 말단노드 내에 존재하는 잉여공간을 제거하면서 R-tree의 단점인 색인노드들 사이에 중첩을 허용치 않는다. SMR-tree의 성능은 여러 종류의 테스트 데이터(VLSI layout data, Tiger/Line file data)를 사용하여 R-tree, $R^{+}-tree,\;R^{\ast}-tree$와 비교된다. SMR-tree는 높은 공간 활용도와 다른 색인구조에 비해 빠른 질의 성능을 보임으로써 GIS와 같은 공간 데이터베이스를 위한 효율적인 색인구조로 사용이 될 것으로 기대된다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.71-79
• /
• 2007

Recent advances in the internet infrastructure have resulted in a large number of huge Web sites and portals worldwide. These Web sites are being visited by various types of users in many different ways. Among all the web page access sequences from different users, some of them occur so frequently that may need an attention from those who are interested. We call them frequent access patterns and access sequences that can be frequent the candidate patterns. Since these candidate patterns play an important role in the incremental Web mining, it is important to efficiently generate, add, delete, and search for them. This thesis presents a novel tree structure that can efficiently store the candidate patterns and a related set of algorithms for generating the tree structure, adding new patterns, deleting unnecessary patterns, and searching for the needed ones. The proposed tree structure has a kind of the 3 dimensional link structure and its nodes are layered.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.34 no.11
• /
• pp.436-439
• /
• 1985

An effect of the salt solution on the Water Tree Propagation was shown systematically from the actions of the salt concentration in deionized water. It may be able to suggest that the tree propagation is possibly to be connected with an intervention of the electrochemical or chemical actions of the salt solution on water tree propagation, which may likely depend on the growth level of the trees. We have pointed out that it is necessary to study the structure of water tree under the electrical stress.

• Korean Journal of Computational Design and Engineering
• /
• v.8 no.2
• /
• pp.75-83
• /
• 2003

In this paper, OSP(Octal Space Partitioning) tree is proposed for the real time culling of infinite sets of geometries in interactive Virtual Environment applications. And MSVBSP(Modified Shadow Volume BSP) tree is suggested for the occlusion culling. Experimental results show that the OSP and MSVBSP tree are efficiently implemented in real time rendering of interactive geometries.

• Journal of People, Plants, and Environment
• /
• v.24 no.2
• /
• pp.219-227
• /
• 2021

Background and objective: Urban street trees play an important role in carbon reduction in cities where greenspace is scarce. There are ongoing studies on carbon reduction by street trees. However, information on the carbon reduction capacity of street trees based on field surveys is still limited. This study aimed to quantify carbon uptake and storage by urban street trees and suggest a method to improve planting of trees in order to increase their carbon reduction capacity. Methods: The cities selected were Sejong, Chungju, and Jeonju among cities without research on carbon reduction, considering the regional distribution in Korea. In the cities, 155 sample sites were selected using systematic sampling to conduct a field survey on street environments and planting structures. The surveyed data included tree species, diameter at breast height (DBH), diameter at root collar (DRC), height, crown width, and vertical structures. The carbon uptake and storage per tree were calculated using the quantification models developed for the urban trees of each species. Results: The average carbon uptake and storage of street trees were approximately 7.2 ± 0.6 kg/tree/yr and 87.1 ± 10.2 kg/tree, respectively. The key factors determining carbon uptake and storage were tree size, vertical structure, the composition of tree species, and growth conditions. The annual total carbon uptake and storage were approximately 1,135.8 tons and 22,737.8 tons, respectively. The total carbon uptake was about the same amount as carbon emitted by 2,272 vehicles a year. Conclusion: This study has significance in providing the basic unit to quantify carbon uptake and storage of street trees based on field surveys. To improve the carbon reduction capacity of street trees, it is necessary to consider planning strategies such as securing and extending available grounds and spaces for high-density street trees with a multi-layered structure.