• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1460-1478
• /
• 2020

This paper proposes a novel anti-collision protocol for large-scale RFID tags identification, named Bi-response Collision Tree Protocol (BCT). In BCT, two group of tags answer the reader's same query in two response-cycles respectively and independently according to the bi-response pattern. BCT improves the RFID tag identification performance significantly by decreasing the query cycles and the bits transmitted by the reader and tags during the identification. Computation and simulation results indicate that BCT improves the RFID tag identification performance effectively, e.g. the tag identification speed is improved more than 13.0%, 16.9%, and 22.9% compared to that of Collision Tree Protocol (CT), M-ary Collision Tree Protocol (MCT), and Dual Prefix Probe Scheme (DPPS) respectively when tags IDs are distributed uniformly.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.5 no.2
• /
• pp.54-68
• /
• 2002

In this paper, We propose a multi-dimensional index structure, called a VA (vector approximate) -tree that constructs a tree with vector approximates of multi-dimensional feature vectors. To save storage space for index structures, the VA-tree employs vector approximation concepts of VA-file that presents feature vectors with much smaller number of bits than original value. Since the VA-tree is a tree structure, it does not suffer from performance degradation owing to the increase of data. Also, even though the VA-tree is MBR Minimum Bounding Region) based tree structure like a R-tree, its split algorithm never allows overlap between MBRs. We show through various experiments that our proposed VA-tree is the efficient index structure for large amount of multi-dimensional data.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.5
• /
• pp.25-34
• /
• 2010

By introducing additional nodes called Steiner points, the problem of Steiner Minimum Tree whose length can be shorter than Minimum Spanning Tree and which connects all input terminal nodes belongs to Non-Polynomial Complete domain. Though diverse heuristic methods can be applied to the problem, most of them may meet serious pains in computing and waiting for a solution of the problem with numerous input nodes. For numerous input nodes, an efficient PTAS approximation method producing candidate unit steiner trees with portals in most bottom layer, merging them hierarchically to construct their parent steiner trees in upper layer and building swiftly final approximation Steiner tree in most top layer is suggested in this paper. The experiment with 16,000 input nodes and designed 16 unit areas in most bottom layer shows 85.4% execution time improvement in serial processing and 98.9% in parallel processing comparing with pure Steiner heuristic method, though 0.24% overhead of tree length. Therefore, the suggested PTAS Steiner tree method can have a wide range applications to build a large scale approximation Steiner tree quickly.

• Journal of the Korean Society of Safety
• /
• v.30 no.3
• /
• pp.100-106
• /
• 2015

A module or independent subtree is a part of a fault tree whose child gates or basic events are not repeated in the remaining part of the fault tree. Modules are necessarily employed in order to reduce the computational costs of fault tree quantification. This quantification generates fault tree solutions such as minimal cut sets, minimal path sets, or binary decision diagrams (BDDs), and then, calculates top event probability and importance measures. This paper presents a new linear time algorithm to detect modules of large fault trees. It is shown through benchmark tests that the new method proposed in this study can very quickly detect the modules of a huge fault tree. It is recommended that this method be implemented into fault tree solvers for efficient probabilistic safety assessment (PSA) of nuclear power plants.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.94-100
• /
• 2010

Data Mining is mainly used for pattern extracting and information discovery from collected data. However previous methods is difficult to reflect changing patterns with time. In this paper, we introduce Streaming Decision Tree(SDT) analyzing data with continuity, large scale, and changed patterns. SDT defines continuity data as blocks and extracts rules using a Decision Tree's learning method. The extracted rules are combined considering time of occurrence, frequency, and contradiction. In experiment, we applied time series data and confirmed resonable result.

• Proceedings of the National Institute of Ecology of the Republic of Korea
• /
• v.2 no.2
• /
• pp.76-81
• /
• 2021

With continuous decline of Philippine forest cover, sustainable forest management and restoration are essential to restore destroyed forest ecosystems. Unfortunately, of ten most planted trees in reforestation projects in the Philippines, eight are exotic species, with large leaf mahogany (Swietenia macrophylla) being the most dominant. In this study, effect of Swietenia macrophylla in reforestation projects on native tree species was evaluated. Effects of S. macrophylla leaf litter, frequency, and canopy closure on the growth of the Philippine native species Pterocarpus indicus were investigated. Results showed that S. macrophylla leaf litter significantly inhibited the growth of P. indicus seedlings based on root collar-to-shoot height. The standardized growth rate of seedlings in plots without S. macrophylla leaf litter was significantly higher than the growth rate of seedlings in plots with leaf litter. Furthermore, there was no significant difference in the standardized growth rate of seedlings between plots without leaf litter and a control plot. On the contrary, S. macrophylla tree frequency and canopy closure showed no significant effect. These results attest to the negative effect of widely planted S. macrophylla to a valuable Philippine native tree P. indicus. With accumulating scientific evidence about negative effects of S. macrophylla on native trees, discontinued use in tree planting and reforestation efforts with active management of restoration sites previously planted with large leaf mahogany are needed.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.1
• /
• pp.37-46
• /
• 2010

A Suffix Tree is an efficient data structure that exposes the internal structure of a string and allows efficient solutions to a wide range of complex string problems, in particular, in the area of computational biology. However, as the biological information explodes, it is impossible to construct the suffix trees in main memory. We should find an efficient technique to construct the trees in a secondary storage. In this paper, we present a method for constructing a suffix tree in a disk for large set of DNA strings using new index scheme. We also show a typical application example with a suffix tree in the disk.

• Journal of Ecology and Environment
• /
• v.29 no.3
• /
• pp.185-189
• /
• 2006

Optimum tapping size and number for sap collection were investigated to minimize damage on tree growth and secure resources for sap by sap collection of Acer mono. The amounts of sap collected by tapping size of 12 mm, 10 mm and 8 mm was 189 L, 140 L and 193 L, respectively. Fusion rates by tapping size were 100% for 8 mm, 89% for 10 mm and 85% for 12 mm, respectively. Amount of sap by size and number of tapping were much at three, two and three tappings to small, middle and large diameter tree in case of 8 mm tapping, and it was large in quantity at two tappings of 12 mm tapping to large diameter tree, respectively. Trees tapped from one to three tappings of 8 mm size for small diameter tree with treatment of DB ointment (mixture of thiophane ointment and 2% bamboo charcoal powder) were completely filled up within 6 months. Diameter growth by number of tapping of 8 mm size was 0.60 mm for one tapping, 1.12 mm for two tappings and 0.47 mm for three tappings to small, middle and large diameter tree, respectively. In case of 12 mm tapping size, diameter growth was fast in the order of large (0.55 mm), middle (0.30 mm) and small (0.23 mm) diameter tree, respectively.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.43 no.4
• /
• pp.37-49
• /
• 2015

The goal of this research is to examine air temperature changes according to tree type, plantation type, roadside green area structure, and green volume of street green area within a city. The plantation type that could be analyzed for comparison by tree type with over 3 species was 1 rows of tree+shrubs. The results of analysis of average air temperature difference between pedestrian and car streets vis-a-vis 1 row of tree+shrub in high air temperature areas were: Pinus densiflora, $1.35^{\circ}C$; Zelkova serrata, $1.84^{\circ}C$; Ginkgo biloba, $2.00^{\circ}C$; Platanus occidentalis, $2.57^{\circ}C$. This standard large wide canopy species was analyzed by the roadside to provide shade to have a significant impact on air temperature reduction. In terms of analysis of the relationship between plantation type of roadside trees and air temperature, the average air temperature difference for 1 row of tree type was $1.80^{\circ}C$; for 2 rows of trees it was $2.15^{\circ}C$. In terms of analysis of the relationship between the roadside green area structure and air temperature, for tree type, average air temperature $1.94^{\circ}C$: for tree+shrub type, average air temperature $2.49^{\circ}C$; for tree+mid-size tree+shrub type, average air temperature $2.57^{\circ}C$. That is, air temperature reduction was more effective in a multi-layer structure than a single layer structure. In the relationship analysis of green volume and air temperature reduction, the air temperature reduction effect was enlarged as there was a large amount of green volume. There was a relationship with the green volume of the road, the size of the tree and number of tree layers and a multi-layer structured form of planting. The canopy volume was large and there were a great number of rows of the tree layer and the plantation type of multi-layer structure, which is what is meant through a relationship with the green volume along the roadside. Green composition standards for air temperature reduction effects and functional improvement were proposed based on the result. For a pedestrian street width of 3m or less in the field being ideal, deciduous broadleaf trees in which the canopy volume is small and the structure of the tree+shrub type through the greatest 1m green bend were proposed. For a pedestrian street width of over 3m, deciduous broadleaf trees in which the canopy volume is large and is multi-layer planted with green bend over 1m, tree+mid-size tree+shrub type was proposed.