• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권6호
• /
• pp.612-627
• /
• 2009

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.200-203
• /
• 2008

The objective of this study is to produce the $CO_2$ (carbon dioxide) absorption map using KOMPSAT-2 imagery. For estimating the amount of $CO_2$ absorption, the stand biomass of forest was estimated with the total weight, which was the sum of individual tree weight. Individual tree volumes could be estimated by the crown width extracted from KOMPSAT-2 imagery. In particular, the carbon conversion index and the ratio of the $CO_2$ molecular weight to the C atomic weight, reported in the IPCC (Intergovernmental Panel on Climate Change) guideline, was used to convert the stand biomass into the amount of $CO_2$ absorption. Thereafter, the KOMPSAT-2 imagery was classified with the SBC (segment based classification) method in order to quantify $CO_2$ absorption by tree species. As a result, the map of $CO_2$ absorption was produced and the amount of $CO_2$ absorption was estimated by tree species.

• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2002년도 추계학술대회
• /
• pp.289-312
• /
• 2002

This study suggests the Link weight analysis approach to choose input variables and an integrated model to make more accurate bankruptcy prediction model. the Link weight analysis approach is a method to choose input variables to analyze each input node's link weight which is the absolute value of link weight between an input nodes and a hidden layer. There are the weak-linked neurons elimination method, the strong-linked neurons selection method in the link weight analysis approach. The Integrated Model is a combined type adapting Bagging method that uses the average value of the four models, the optimal weak-linked-neurons elimination method, optimal strong-linked neurons selection method, decision-making tree model, and MDA. As a result, the methods suggested in this study - the optimal strong-linked neurons selection method, the optimal weak-linked neurons elimination method, and the integrated model - show much higher accuracy than MDA and decision making tree model. Especially the integrated model shows much higher accuracy than MDA and decision making tree model and shows slightly higher accuracy than the optimal weak-linked neurons elimination method and the optimal strong-linked neurons selection method.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2018년도 제58차 하계학술대회논문집 26권2호
• /
• pp.139-140
• /
• 2018

본 논문에서는 지도 기계 학습 알고리즘 중 하나인 Naive Bayesian (NB) 알고리즘의 데이터 분류 정확도를 향상시키기 위하여 데이터 속성에 Weight를 부여하는 새로운 기법을 제안하였다. 기존에 Decision Tree(DT) 알고리즘의 깊이를 이용하여 Weigth를 부여하는 방법이 제안되었으나, DT를 구축하는데 오버헤드가 크기 때문에 데이터의 실시간 분석이나 자원 제한적인 환경에서의 적용은 어렵다는 단점이 있다. 이를 해결하기 위하여 본 논문에서는 최소한의 데이터를 사용하여 신속하게 DT를 구축하는 Very Fast Decision Tree (VFDT) 알고리즘 기반의 Weight 부여 기법을 제안함으로써 적은 오버헤드로 NB의 정확도를 향상시킨다.

• Journal of Information Processing Systems
• /
• 제6권1호
• /
• pp.79-90
• /
• 2010

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Data mining over data streams should support the flexible trade-off between processing time and mining accuracy. In many application areas, mining frequent itemsets has been suggested to find important frequent itemsets by considering the weight of itemsets. In this paper, we present an efficient algorithm WSFI (Weighted Support Frequent Itemsets)-Mine with normalized weight over data streams. Moreover, we propose a novel tree structure, called the Weighted Support FP-Tree (WSFP-Tree), that stores compressed crucial information about frequent itemsets. Empirical results show that our algorithm outperforms comparative algorithms under the windowed streaming model.

• 생물환경조절학회지
• /
• 제16권2호
• /
• pp.142-145
• /
• 2007

몇 수종을 대상으로 한 용기 양묘에서 폐암면 혼합 배지 이용 시 폐암면과 다른 배지의 혼합 비율에 따른 생육 특성을 조사하였다. 폐암면 혼합 비율에 따른 소나무의 생육 특성에서 생체중, 건물중 및 수고는 50% 와 70% 혼합배지에서 기장 좋았지만 원줄기 직경은 차이를 나타내지 않았다. 비자나무에서 생체중과 수고는 70% 혼합배지에서 가장 많이 증가하였고 원줄기 직경과 신초수는 50% 와 70% 혼합배지에서 많이 증가하였다. 상수리나무에서 생체중, 수고 및 원줄기 직경은 50%와 70% 혼합배 지에서 좋았고, 건물중은 혼합배지와 대조구간 차이를 나타났으나 혼합 비율간에는 차이를 나타내지 않았다. 잎의 엽록소 함량도 70% 혼합배지에서 높게 나타났으며 이에 광합성도 가장 활발하였다. 들메나무에서 생체 중은 70% 혼합배지에서 월등히 많이 증가하였지만, 수고와 원줄기 직경은 폐암면 혼합배지와 대조구 간 차이만 나타나고 혼합 비율간에는 차이를 나타내지 않았다. 잎의 엽록소 함량은 처리 간 차이를 나타내지 않았지만 혼합 배지에서 다소 높은 경향을 나타내었지만, 광합성은 70% 혼합배지에서 아주 활발하였다.

• 한국정보처리학회논문지
• /
• 제1권2호
• /
• pp.184-193
• /
• 1994

본 논문은 최소목(Minimum-weight Spanning Tree, MST)에 있어서 네트워크의 랭크 중 몇개가 삭제(또는 파괴) 또는 추가(또는 회복) 되었을 때, MST를 재구성하는 분산 알고리즘을 제안한다. 본 논문에서 제안한 알고리즘의 메세지 복잡도는 Ο(m＋n log(t＋f))이고, 이상시간 복잡도는 Ο(n＋n log(t＋f))가 되며, 여기서 n은 네트워크의 프로세서의 수이고 t(resp. f)는 추가되는 링크의 수(resp. 이전 MST의 삭제된 링크의 수)이다. 그래서 네트워크의 형태가 변형이 된 다음에 f=O이고 m=e일 경우에는 m=t＋n이 된다. 또한 본 논문의 마지막 부분에서는 링크의추가, 삭제와 마찬가지로 프로세서의 추가, 삭제되었을 경우의 알고리즘도 제안한다.

• Journal of Forest and Environmental Science
• /
• 제27권3호
• /
• pp.151-156
• /
• 2011

Seeds of Xanthoceras sorbifolia Bunge were collected from two plantations and two superior trees in Inner Mongolia: and one plantation and one superior tree in Liaoning, China in late August, 2011. Yellowhorn or goldenhorn is an important tree species, from the aspects of source of edible oil and biodiesel and pioneering capacity of degraded and desert land. Characteristics investigated were seed length, width, and weight: weight and volume of 1,000 seeds: and weight and volume of one-liter seeds. The seeds of Qingsonglingxiang No. 1, growing alone in an open space, showed the highest values in seed length (16.08 mm), width (14.48 mm) and weight (1.40 g), while those of Tree No. 160 in Ar Khorqin Banner were the lowest ones: that is, 11.48mm for length, 11.81 mm for width, and 0.73 g for weight, respectively. Traits of seeds varied quite much between trees and among areas; for example, Tree No. 38 and No. 160 produced quite different seeds in several traits, although they are adjacent to each other in the same farm. Weight of 1,000 seeds varied from 718.0 g to 1,010.1 g and volume from 0.76 L to 1.52 L. Weight of one-liter seeds were 522.3 g to 688.2 g, while the number of seeds were 603 to 935. Seeds which were soaked in the water at $4^{\circ}C$ for 2 days showed the highest germination rate (89%) in a 30-day test, which was about 10% to 40% higher than those of non-treatment and dipping treatment at $36^{\circ}C$ followed by keeping under room temperature for 2 days. 81% of seeds in the wet sand at room temperature germinated, while 23% of seeds deprived of seed coat germinated. It is necessary to understand seed traits to select superior clones or provenances for the increased, unfluctuating production of seed.

• 한국게임학회 논문지
• /
• 제13권4호
• /
• pp.25-34
• /
• 2013

3D 게임에서 충돌 탐지를 효과적으로 하기 위해 구성하는 공간 분할 트리는 분할 평면을 결정하는데 트리 밸런스와 분할 평면과 겹치는 폴리곤의 개수 등을 고려해야 한다. 본 논문에서는 3D 게임 공간 분할 트리에서 트리 빌드 조건에 대한 가중치를 제어하는 휴리스틱 알고리즘을 제안하였다. 가중치의 변화에 따라서 트리 빌드 시간, 분할 평면과 겹치는 폴리곤을 쪼갤 때 시각적 불일치를 유발할 수 있는 T-junction 의 제거 시간, 트리 밸런스에 따른 렌더링 속도(frame per second) 등을 3D 게임 시뮬레이션을 통하여 분석하였다.

• 한국환경복원기술학회지
• /
• 제22권2호
• /
• pp.1-12
• /
• 2019

Open space planners and designers should consider scientific and quantified functions of trees when they have to locate where to plant the tree. However, until now, most planners and designers could not consider them because of lack of tool for considering scientific and quantitative tree functions. This study introduces a tree location supporting tool which focuses on the multi-objective including scientific function using ACO (Ant colony optimization). We choose shading effect (scientific function), shielding, and openness as objectives for test application. The results show that when the user give a high weight to a particular objective, they can obtain the optimal results with high value of that objective. When we allocate higher weight for the shading effect, the tree plans provide larger shadow value. Even when compared with current tree plan, the study result has a larger shading effect plan. This result will reduce incident radiation to the ground and make thermal friendly open space in the summer. If planners and designers utilize this tool and control the objectives, they would get diverse optimal tree plans and it will allow them to make use of the many environmental benefits from trees.