• Communications for Statistical Applications and Methods
• /
• v.11 no.3
• /
• pp.539-551
• /
• 2004

Multiple responses are often observed in many application fields, such as customer's time-of-day pattern for using internet. Some decision trees for multiple responses have been constructed by many researchers. However, if the response is a high-dimensional vector that can be thought of as a discretized function, then fitting a multivariate decision tree may be unsuccessful. Yu and Lambert (1999) suggested spline tree and principal component tree to analyze high dimensional response vector by using dimension reduction techniques. In this paper, we shall propose factor tree which would be more interpretable and competitive. Furthermore, using Korean internet company data, we will analyze time-of-day patterns for internet user.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.850-853
• /
• 2018

In this paper, we propose a decoding method using a balanced binary tree and a canonical Huffman tree for efficient decoding of Huffman codes. The balanced binary tree scheme reduces the number of searches by lowering the height of the tree and binary search. However, constructing a tree based on the value of the code instead of frequency of symbol is a drawback of the balanced binary tree. In order to overcome these drawbacks, a balanced binary tree is reconstructed according to the occurrence probability of symbols at each level of the tree and binary search is performed for each level. We minimize the number of searches using a canonical Huffman tree to find level of code to avoid searching sequentially from the top level to bottom level.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2003.11a
• /
• pp.123-128
• /
• 2003

최근 프로세서와 메인 메모리간의 속도 차이가 커지면서 캐시 실패가 메인 메모리에서 동작하는 R-Tree의 성능 저하에 미치는 영향이 커짐에 따라 캐시 실패를 줄여 캐시 성능을 개선하려는 연구가 많이 진행되고 있다. 일반적인 캐시 성능 개선 방법은 엔트리 정보를 줄설 노드에 더 않은 엔트리를 저장함으로써 펜-아웃(fanout)을 증가시키고 캐시 실패를 최소화한다. 그러나 이러한 방법은 엔트리 정보를 줄이는 추가 연산으로 인해 갱신 성능이 떨어지고, 노드간 이동시 발생하는 캐시 실패는 여전히 해결하지 못하고 있다. 본 논문은 이를 해결하기 위해 선반입(prefetching)을 적용한 확장된 R-Tree인 PR-tree(Prefetching R-Tree)를 제안하고 평가하였다 PR-Tree는 펜-아웃을 증가시키고 트리의 높이를 낮추기 위해 실제 캐시 라인의 정수 배인 노드를 생성하고, 선반입을 적용하여 노드 캐시로 인한 메모리 지연을 최소화하였다. 또한 접근할 노드를 선반입하여 노드간 이동시 발생하는 캐시 실패도 최소화하였다. PR-Tree는 실험에서 R-Tree보다 검색 연산에서 최대 38%의 성능 향상을 보였으며, 갱신 연산에서도 최대 30%의 성능 향상을 보였다.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.173-189
• /
• 2009

Recently, video data has attracted many interest. That is the reason why efficient indexing schemes are required to support the content-based retrieval of video data. But most indexing schemes are not suitable for indexing a high-dimensional data except Hybrid Spill-Tree. In this paper, we propose an efficient high-dimensional indexing scheme to support the content-based retrieval of video data. For this, we extend Hybrid Spill-Tree by using a newly designed clustering technique and by adopting a signature method. Finally, we show that proposed signature-based high dimensional indexing scheme achieves better retrieval performance than existing M-Tree and Hybrid Spill-Tree.

• Journal of Forest and Environmental Science
• /
• v.32 no.2
• /
• pp.129-139
• /
• 2016

Study was conducted to investigate tree diversity and its population and regeneration status in homegardens of upper Assam, Northeast India through field study by quadrat method. A total of 154 tree species have been recorded from 135 studied homegardens under 109 genera 53 families. Most of these species (79%) are indigenous to our country, while the rest (21%) arealiens (naturalized and cultivated exotics) by origin. Tree species richness per homegarden varies greatly in different homegardens and is ranged from 5 to 52 tree species with a mean of 22 ($SE{\pm}0.58$). A. malaccensis is the most dominant tree species in the studied homegardens contributed 34% of the total tree density of the documented trees. The tree density is much higher with 4,259 individuals $ha^{-1}$ but, basal area ($36.32m^2ha^{-1}$) is very less. Based on the number of individuals present, very rare species is accounted for 10%, rare species 39%, common species 19%, dominants 14% and predominant species 18% in the present study. The population density of 154 tree species is 4,259 (individuals $ha^{-1}$) for adults (>3.18 cm DBH), 5,902 (individuals $ha^{-1}$) for saplings and 38,164 (individuals $ha^{-1}$) for seedlings. The density of seedlings>saplings>adults represents good regeneration status of tree species in studied homegardens. The population structure study showed that about 8% tree species have good regeneration status, 9% have fair regeneration status, 48% have poor regeneration status and 34% tree species have no regeneration. Study suggests that research and development action is needed to stimulate regeneration of those tree species which having high importance value indices but showing poor or no regeneration. Based on present observation, it can be conclude that homegarden can emerge as an effective means for both economic well-being and biodiversity conservation in upper Assam, Northeast India.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.169-178
• /
• 2011

Recently, data sharing between enterprises or organizations is required matter for task cooperation. In this process, when the enterprise opens its database to the affiliates, it can be occurred to problem leaked sensitive information. To resolve this problem it is needed to hide sensitive information from the database. Previous research hiding sensitive information applied different heuristic algorithms to maintain quality of the database. But there have been few studies analyzing the effects on the items modified during the hiding process and trying to minimize the hided items. This paper suggests eFP-Tree(Extended Frequent Pattern Tree) based FP-Tree(Frequent Pattern Tree) to hide sensitive frequent itemsets. Node formation of eFP-Tree uses border to minimize impacts of non sensitive frequent itemsets in hiding process, by organizing all transaction, sensitive and border information differently to before. As a result to apply eFP-Tree to the example transaction database, the lost items were less than 10%, proving it is more effective than the existing algorithm and maintain the quality of database to the optimal.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.18-27
• /
• 2002

A hierarchical representation scheme for planar curves, MBO-tree, is proposed in this paper, which provides natural approximation and efficient localization. MBO-tree is based on the Douglas-Peucker algorithm (iterative end-point fit algorithm), but approximation errors that are stored with corresponding points in MBO-tree nodes and are used for abstraction measures are adjusted by force to eliminate unnatural approximation. The error adjusting is just making the approximation error of a node in a MBO-tree to be less than or equal to that of its parent. In point of localization, the bounding area of a curve is represented with a minimum bounding octangle (MBO), which can enclose the curve more compactly compared with those of other hierarchical schemes, such as the strip tree, the arc tree and the HAL tree. The MBO satisfies the hierarchical inclusion property that is useful for hierarchical geometrical operations, such as the point-inclusion test and the polygon intersection test. Through several experiments, we found that the proposed scheme was able to approximate more naturally and to localize more effectively.

• Journal of People, Plants, and Environment
• /
• v.23 no.3
• /
• pp.347-362
• /
• 2020

Background and objective: It is difficult to conclusively determine the exact cause of tree defects since multiple causes are involved such as climate change, plantation, tree quality and planting time, construction, planting base, drainage, sunshine conditions, maintenance, and microclimate. The data related to landscaping construction defects are scattered or fragmented by companies and years, but not managed systematically by the defect information management system. Most of the earlier studies associated with tree defects in apartment complexes suggested defect rates after examining tree defects in the completed construction site and proposed fragmentary and subjective conclusions about the causes of defects observed in trees with high defect rates. It is proposed to continue to conduct studies on the establishment and analysis of systematic databases to identify the exact causes of tree defects and measures to improve, and the need to accumulate systematic data in the construction process where many defects arises. This study was conducted to reduce the defects of trees planted in apartment complexes. Methods: Main factors related to tree defects were subdivided based on the results of literature review and a defect investigation at the completion site, and tree history management items were selected and subdivided during the construction stage. Results: The criteria for the preparation of subdivided items were obtained, and the tree history management checklist was written for the site under actual construction and a systematic database was established. Items that are categorized based to the causes of defects include the location of nurseries, date, tree quality, site conditions, planting techniques, microclimates, and maintenance. Conclusion: This study suggested tree history management items based on the tree defects that can be identified at the construction stage and applied them to the selected study site, which differentiates this study from earlier studies. It will be necessary to conduct a comprehensive and objective time series analysis on tree defects that occur over time by continuously monitoring and collecting data after construction.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

• Landscaping Tree
• /
• s.101
• /
• pp.4-5
• /
• 2007