• 한국기후변화학회지
• /
• 제8권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.

• 한국환경생태학회지
• /
• 제33권4호
• /
• pp.440-446
• /
• 2019

완도수목원내 백운로 상부의 붉가시나무림을 대상으로 난대 상록활엽수림 복원 시 붉가시나무의 성장 및 종실공급과 관련된 기초정보를 제공하는 목적으로 붉가시나무의 성장 및 결실특성을 조사하고 종실량 상대성장식을 구하였다. 성장특성은 평균흉고직경급에 속하는 실생 임목 3주의 표본목을 선정 벌목하여 수간석해하였다. 표본목의 평균치의 수령(X)에 의한 흉고직경과 수고의 성장특성(Y)의 상대성장식(Y=aX+b)을 개발하였으며, 추정식에 의한 붉가시나무 수령에 따른 흉고직경 및 수고를 추정하였다. 결실특성은 성숙종실초기인 8월에 평균 흉고직경급에 속하는 임목을 대상으로 결실이 충실한 임목 3주의 표본목을 선정 벌목하여 조사하였다. 붉가시나무의 종실량 상대성장식을 개발하기 위하여 결실목 중 흉고직경이 고르게 10주의 표본목을 선정 벌목하였다. 벌목한 표본목은 흉고직경, 수고, 수관폭, 수관고 등의 성장특성(X)과 종실량(Y)을 조사 분석하여 종실량 상대성장식($Y=aX^b$)을 유도하였다. 표본목 평균치의 수령에 의한 상대성장식은 흉고직경 Y=0506X-2.064($R^2=0.999$), 수고 Y=0.321X+0689($R^2=0.992$)이었다. 개발된 상대성장식에 의하여 수령 10, 20, 30, 40년일 때 흉고직경은 각각 3.0cm, 8.1cm, 13.1cm, 18.2cm, 수고는 각각 3.9m, 7.1m, 10.3m, 13.5m가 되는 것으로 추정되었다. 결실특성 조사 결과 결과모지(結果母枝)당 잎 수를 제외한 결과모지의 길이, 직경, 결과모지 당 결과지 수, 종실 수는 유의적인 차이를 보였으며, 수관 상, 중, 하부로 갈수록 감소하였다. 종실 총수의 경우 수관 상, 중, 하부 각각 1,312립, 115립, 5립이었다. 붉가시나무 표본목을 일괄하여 추정한 종실량 상대성장식의 흉고직경(D)를 독립변수로 하는 상대성장식은 $Y=0.003X^{4.260}$, 결정계수($R^2$)은 0.896이었다. 흉고직경만을 독립변수로 하는 상대성장식은 흉고직경과 수고($D^2H$)를 독립변수로 하는 결정계수가 다소 낮으나, 측정오차를 고려하면, 흉고직경만을 독립변수로 하는 상대성장식을 적용하는 것이 실용적이라고 판단된다.

• 전자공학회논문지B
• /
• 제33B권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.

• 전자공학회논문지B
• /
• 제31B권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.

• 전자공학회논문지B
• /
• 제32B권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.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• 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.

• 전기학회논문지
• /
• 제67권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
• /
• 제15권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%.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
• /
• 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 분석 방법을 제시하고, 그것을 구현하였으며 몇 가지 실험 결과에 대하여 기술한다.

• Mycobiology
• /
• 제49권2호
• /
• pp.122-132
• /
• 2021

The reexamination of the fungal genus Botryosphaeria on 12 plant species of 10 families was carried out based on molecular phylogenetic analyses using the regions of translation elongation factor 1-α, β-tubulin, DNA-directed RNA polymerase II subunit, and internal transcribed spacer region of rDNA and morphological characteristics. Japanese isolates were divided into five clades and include Botryosphaeria dothidea, B. qingyuanensis, B. sinensis, and Botryosphaeria spp. Two species, B. qingyuanensis and B. sinensis have been newly added to the Japanese mycoflora, but their host plants are not specified. Botryosphaeria tenuispora isolated from Leucothoe fontanesiana and insect galls on fruits of Aucuba japonica has been proposed as a new species.