• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.507-512
• /
• 2001

Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

• Journal of Forest and Environmental Science
• /
• v.25 no.1
• /
• pp.35-41
• /
• 2009

Agroforestry combines agriculture and forestry technologies to create more integrated, diverse, productive, profitable, healthy and sustainable land-use systems. This study was performed in three union of Chhagalnaiya Upazila (Sub-district; administrative entity) under Feni district, Southern Bangladesh with a view to identify the tree resources, utilization pattern and economic return of major fruit and timber tree species. Information collected from a total of 45 households ranging from marginal, small, medium and large categories. Number of plant species increased with the increase of homestead area. A total of 39 plant species were recorded from the homegarden, of which 23 were fruit and 16 were timber tree species. Considerable number of vegetables was also planted under the shade of the homestead trees. The investment analysis showed that average benefit-cost ratios were greater than one, net present values were positive and internal rate of returns were more than 10%. Long term investment on horticulture and timber tree species is highly profitable if species like Swietenia mahagoni and Tectona grandis, Spondias pinnata, Syzygium cumini and Areca catechu were planted.

• Journal of Korea Game Society
• /
• v.20 no.5
• /
• pp.53-64
• /
• 2020

Supporting NNS method in KD-Tree algorithm is essential in multidimensional data applications. In this paper, we propose HD-Tree, a high-performance Lock-Free KD-Tree that supports NNS in situations where reads and writes occurs concurrently. HD-Tree reduced the number of synchronization nodes used in NNS and requires less atomic operations during Lock-Free method execution. Comparing with existing algorithms, in a multi-core system with 8 core 16 thread, HD-Tree's performance has improved up to 95% on NNS and 15% on modifying in oversubscription situation.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.16.1-16
• /
• 2003

A subset S of vertices of a graph G is independent if no two vertices of S are adjacent by an edge in G. Also we say that S is maximal independent if it is contained In no larger independent set in G. A planted plane tree is a tree that is embedded in the plane and rooted at an end-vertex. A (k＋1) -valent tree is a planted plane tree in which each vertex has degree one or (k＋1). We classify maximal independent sets of (k＋1) -valent trees into two groups, namely, type A and type B maximal independent sets and consider specific independent sets of these trees. We study relations among these three types of independent sets. Using the relations, we count the number of all maximal independent sets of (k＋1) -valent trees with n vertices of degree (k＋1).

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.696-703
• /
• 2017

In this paper, we show how to design based on solving Sudoku problem that is one of the NP-complete problems like Go. We show how to use greedy method which can minimize depth based on tree expansion and how to apply heuristic algorithm for pruning unnecessary branches. As a result of measuring the performance of the proposed method for solving of Sudoku problems, this method can reduce the number of function call required for solving compared with the method of heuristic algorithm or recursive method, also this method is able to reduce the 46~64 depth rather than simply expanding the tree and is able to pruning unnecessary branches. Therefore, we could see that it can reduce the number of leaf nodes required for the calculation to 6 to 34.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.183-186
• /
• 2012

To process continuous queries on a sensor network, it is required to transfer query predicates and build a query index on each sensor node. However, if we transfer query predicates to all sensor nodes, it makes the number of messages for query predicates increase. In this paper, we propose the scheme to construct the tree based relationship structure using data region of the sensor node and select the target nodes to transfer query predicates. we also implement the tree based relationship structure and measure the number of messages for sending predicates.

• Journal of the Korean Statistical Society
• /
• v.21 no.2
• /
• pp.201-207
• /
• 1992

The algorithm for obtaining the isotonic regression in simple tree order, the most basic and simplest model next to the simple order, is considered. We propose to call it "Pool-the-Maximum-Violators" algorithm (PMVA) in conjunction with the "Pool-Adjacent-Violators" algorithm (PAVA) in the simple order. The dual problem of obtaining the isotonic regression in simple tree order is our main concern. An intuitively appealing relation between the primal and the dual problems is demonstrated. The interesting difference is that in simple order the required number of pooling is at least the number of initial violating pairs and any path leads to the solution, whereas in the simple tree order it is at most the number of initial violators and there is only one advisable path although there may be some others leading to the same solution.o the same solution.

• Journal of the Korean Society of Safety
• /
• v.12 no.4
• /
• pp.180-190
• /
• 1997

A new method in the fault tree analysis (FTA) for the reliability calculation is suggested. Two steps are necessary in traditional method in evaluation of the occurrence probability of top event in fault tree (FT). The first step is to find the minimal outsets, and the second one is to substitute the result into the poincare equation. In order to reduce the enormous computing time of this method, lots of rapid algorithms have been developed. Almost of all achievements were, however, based on the partial structural properties of FT. In this paper, the FT is transformed to a non-linear graph G which has the same minimal outsets of original n, and then the reliability is calculated using the domination theory. In this new method, the required number of equation terms are at most $2^n$ (n is node number of graph G), while $2^m$-1 (m is the number of minimal cutsets) calculation terms are required in the poincare equation in traditional method. Since m>>n in general. our new method reduces the calculation time significantly.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.564-571
• /
• 2014

Sphere decoding (SD) for multiple-input and multiple-output systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method - namely, probabilistic tree pruning SD.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.597-618
• /
• 2019

Categorical range aggregation, which is conceptually equivalent to running a range aggregation query separately on multiple datasets, returns the query result on each dataset. The challenge is when the number of dataset is as large as hundreds or thousands, it takes a lot of computation time and I/O. In previous work, only a single dimension of the range restriction has been solved, and in practice, more applications are being used to calculate multiple range restriction statistics. We proposed MCRI-Tree, an index structure designed to solve multi-dimensional categorical range aggregation queries, which can utilize main memory to maximize the efficiency of CRA queries. Specifically, the MCRI-Tree answers any query in $O(nk^{n-1})$ I/Os (where n is the number of dimensions, and k denotes the maximum number of pages covered in one dimension among all the n dimensions during a query). The practical efficiency of our technique is demonstrated with extensive experiments.