• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.12-23
• /
• 2005

In the past decade, advances in speed of commodity CPUs have iu out-paced advances in memory latency Main-memory access is therefore increasingly a performance bottleneck for many computer applications, including database systems. To reduce memory access latency, cache memory incorporated in the memory subsystem. but cache memories can reduce the memory latency only when the requested data is found in the cache. This mainly depends on the memory access pattern of the application. At this point, previous research has shown that B+ trees perform much faster than T-trees because B+ trees are more cache conscious than T-trees, and also proposed 'Cache Sensitive B+trees' (CSB. trees) that are more cache conscious than B+trees. The goal of this paper is to make T-trees be cache conscious as CSB-trees. We propose a new index structure called a 'Cache Sensitive T-trees (CST-trees)'. We implemented CST-trees and compared performance of CST-trees with performance of other index structures.

• Journal of Climate Change Research
• /
• v.8 no.4
• /
• pp.415-424
• /
• 2017

This study was conducted to estimate carbon stocks of Pinus densiflora with drawing volume of trees in each tree height and DBH applying the suitable stem taper equation and tree specific carbon emission factors, using collected growth data from all over the country. Information on distribution area, tree age, tree number per hectare, tree volume and volume stocks were obtained from the $5^{th}$ National Forest Inventory (2006~2010) and Statistical yearbook of forest (2016), and method provided in IPCC GPG was applied to estimate carbon stock and uptake. Performance in predicting stem diameter at a specific point along a stem in Pinus densiflora by applying Kozak's model, $d=a_{1}DBH^{a_2}a_3^{DBH}X^{b_{1}Z^2+b_2ln(Z+0.001)+b_3\sqrt{Z}+b_4e^z+b_5(\frac{DBH}{H})}$, which is well known equation in stem taper estimation, was evaluated with validations statistics, Fitness Index, Bias and Standard Error of Bias. Consequently, Kozak's model turned out to be suitable in all validations statistics. Stem volume table of P. densiflora was derived by applying Kozak's model and carbon stock tables in each tree height and DBH were developed with country-specific carbon emission factors ($WD=0.445t/m^3$, BEF = 1.445, R = 0.255) of P. densiflora. As the results of analysis in carbon uptake for each province, the values were high with Gangwon-do $9.4tCO_2/ha/yr$, Gyeongsandnam-do and Gyeonggi-do $8.7tCO_2/ha/yr$, Chungcheongnam-do $7.9tCO_2/ha/yr$ and Gyeongsangbuk-do $7.8tCO_2/ha/yr$ in order, and Jeju-do was the lowest with $6.8tC/ha/yr$. Total carbon stocks of P. densiflora were 127,677 thousands tC which is 25.5% compared with total percentage of forest and carbon stock per hectare (ha) was $84.5tC/ha/yr$ and $7.8tCO_2/ha/yr$, respectively.

• 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.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.102-110
• /
• 1996

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature subset is selected which optimizes fitness function in genetic algorithm. The fitness function is inversely proportional to classification error, balance between cluster, number of feature used. The binary strings in genetic algorithm determine the feature subset and classification results - error, balance - form fuzzy partition matrix affect reproduction of next genratin. The proposed design scheme is applied to the tire tread patterns and handwriteen alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.141-148
• /
• 1994

Both the neural network classifier utilizing multi-layer perceptron and the linear tree classifier composed of hierarchically structured linear discriminating functions can form arbitrarily complex decision boundaries in the feature space and have very similar decision making processes. In this paper, a new method for automatically choosing the number of neurons in the hidden layers and for initalzing the connection weights between the layres and its supporting theory are presented by mapping the sequential structure of the linear tree classifier to the parallel structure of the neural networks having one or two hidden layers. Experimental results on the real data obtained from the military ship images show that this method is effective, and that three exists no siginificant difference in the classification acuracy of both classifiers.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1057-1063
• /
• 1995

This paper describes an approach for constucting a Rectilinear Steiner Tree (RST) derivable from a Minimum Spanning Tree (MST), using Associative Processor (AP). We propose a fast parallel algorithm using AP's basic algorithms which can be realized by the processing capability of rudimentary logic and the selective matching capability of Content- Addressable Memory (CAM). The main idea behind the proposed algorithm is to maximize the overlaps between the consecutive edges in MST, thus minimizing the cost of a RST. An efficient parallel linear algorithm with O(n) complexity to construct a RST is proposed using an algorithm to find a MST, where n is the number of nodes. A node insertion method is introduced to allow the Z-type layout. The routing process which only depends on the neighbor edges and the no-rerouting strategy both help to speed up finding a RST.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. 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 dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (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. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.10
• /
• pp.1322-1329
• /
• 2018

In this paper, the reliability test of three kinds of epoxy resin for GIS Spacer, which is a high voltage based heavy electric machine, AC electrical treeing experiments were performed. Three types of epoxy resins, Araldite B41, CT 5531 CI and B46, have slight viscosity differences. An non-uniform electric field, E = 1149.4 kV/mm, as the needle to plate electrode, a power source with a frequency of 1 kHz was applied to the tree electrode for accelerated deterioration. The treeing phenomena of the three kinds of epoxy resin all initiated, propagated, and destroyed by the branch tree. Epoxy Resin B46 was 145 times longer than B41 and 53 times longer than CT 5531CI. I think that the choice of epoxy resin is very important in choosing high voltage heavy electric machine insulation materials.

• Steel and Composite Structures
• /
• v.15 no.5
• /
• pp.507-518
• /
• 2013

The seismic performance of six types of weak-axis steel moment connections was investigated through cyclic testing of six full-scale specimens. These weak-axis moment connections were the column-tree type, WUF-B type, FF-W type, WFP type, BFP-B type and DST type weak-axis connections. The testing results showed that each of these weak-axis connection types achieved excellent seismic performance, except the WFP and the WUF-B types. The WFP and WUF-B connections displayed poor seismic performance because a fracture appeared prematurely at the weld joint due to stress concentrations. The column-tree type connection showed the best seismic behavior such that the story drift ratio could reach 5%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.748-750
• /
• 2001

최근 Human Genome Project(HGP)에서 사람의 염기 서열의 초안이 발표되었다. 생물체의 염기 서열을 분석하는 방법은 매우 많은데, 그 중 하나가 k-mer 분석이다. k-mer는 유전자의 염기 서열내의 길이가 k인 연속된 염기 서열이다. k-mer 분석은 염기서열이 가진 k-mer들의 빈도의 분포나 대칭성 등을 탐색하는 것이다. 그런데 유전자의 염기 서열은 대용량 텍스트이고 k가 줄 때 기존의 온메모리 알고리즘으로는 처리가 불가능하므로 효율적인 자료구조와 알고리즘이 필요하다. 본 논문에서는 패턴 일치(pattern matching)에 적합하고 외부 메모리를 지원하는 스트링 B-트리(string B-tree)를 이용한 k-mer 분석 방법을 제시하고, 그것을 구현하였으며 몇 가지 실험 결과에 대하여 기술한다.