• Title/Summary/Keyword: weight tree

Search Result 483, Processing Time 0.022 seconds

Use of Tree Traversal Algorithms for Chain Formation in the PEGASIS Data Gathering Protocol for Wireless Sensor Networks

  • Meghanathan, Natarajan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.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.

PREPARATION OF CARBON DIOXIDE ABSORPTION MAP USING KOMPSAT-2 IMAGERY

  • Kim, So-Ra;Lee, Woo-Kyun
    • Proceedings of the KSRS Conference
    • /
    • 2008.10a
    • /
    • 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.

  • PDF

연결강도분석을 이용한 통합된 부도예측용 신경망모형

  • Lee Woongkyu;Lim Young Ha
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 2002.11a
    • /
    • 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.

  • PDF

An Attribute Weighting Approach for Naive Bayesian based on Very Fast Decision Tree (Very Fast Decision Tree 기반 Naive Bayesian 알고리즘의 Weight 부여 기법)

  • Kim, Se-Jun;Yoo, Seung-Eon;Lee, Byung-Jun;Kim, Kyung-Tae;Youn, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2018.07a
    • /
    • pp.139-140
    • /
    • 2018
  • 본 논문에서는 지도 기계 학습 알고리즘 중 하나인 Naive Bayesian (NB) 알고리즘의 데이터 분류 정확도를 향상시키기 위하여 데이터 속성에 Weight를 부여하는 새로운 기법을 제안하였다. 기존에 Decision Tree(DT) 알고리즘의 깊이를 이용하여 Weigth를 부여하는 방법이 제안되었으나, DT를 구축하는데 오버헤드가 크기 때문에 데이터의 실시간 분석이나 자원 제한적인 환경에서의 적용은 어렵다는 단점이 있다. 이를 해결하기 위하여 본 논문에서는 최소한의 데이터를 사용하여 신속하게 DT를 구축하는 Very Fast Decision Tree (VFDT) 알고리즘 기반의 Weight 부여 기법을 제안함으로써 적은 오버헤드로 NB의 정확도를 향상시킨다.

  • PDF

Mining Frequent Itemsets with Normalized Weight in Continuous Data Streams

  • Kim, Young-Hee;Kim, Won-Young;Kim, Ung-Mo
    • Journal of Information Processing Systems
    • /
    • v.6 no.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.

Growth Characteristics of Several Kinds of Trees According to Mixture Ratio of Used-Rockwool in Pot Nursery (용기 양묘 시 폐암면 혼합 비율에 따른 몇 가지 수종의 생육 특성)

  • Kim, Ho-Cheol;Cha, Seung-Hoon;Choi, Jeong-Ho;Yoo, Sung-Oh;Lee, Soo-Won;Bae, Jong-Hyang
    • Journal of Bio-Environment Control
    • /
    • v.16 no.2
    • /
    • pp.142-145
    • /
    • 2007
  • Growth characteristics according to mixture ratio of used-rockwool in pot nursery, in Pinus densiflora, Torreya nucifera, Quercus acutissina and Fraxinus mandshurica nursery, was investigated. The used-rockwool on mixture ratio between used-rockwool and control (peatmoss: pearlite=1:1, v/v) were 0%, 30%, 50% and 70%. Flesh weight, dry weight and height of tree, in Pinus densiflora nursery, increased much more in 50% and 70% media but trunk diameter of tree had no difference according to mixture ratio. In Torreya nucifera nursery, flesh weight and height of tree in 70% medium and trunk diameter and numbers of shoot of tree in 50% and 70% media increased. Flesh weight, height and trunk diameter of tree, and chlorophyll (SPAD) and photosynthesis rate, in Quercus acutissina nursery, increased much more in 50% and 70% media, but dry weight of tree had only difference between non-mixed and mixed with rockwool. In Fraxinus mandshurica nursery, flesh weight and photosynthesis rate of tree increased much more in 70% medium, height, trunk diameter and total chlorophyll of tree had difference according to non-mixed and mixed with rockwool or had no only difference according to mixture ratio, respectively.

Distributed Algorithm for Updating Minimum-Weight Spanning Tree Problem (MST 재구성 분산 알고리즘)

  • Park, Jeong-Ho;Min, Jun-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.2
    • /
    • pp.184-193
    • /
    • 1994
  • This paper considers the Updating Minimum-weight Spanning Tree Problem(UMP), that is, the problem to update the Minimum-weight Spanning Tree(MST) in response to topology change of the network. This paper proposes the algorithm which reconstructs the MST after several links deleted and added. Its message complexity and its ideal-time complexity are Ο(m+n log(t+f)) and Ο(n+n log(t+f)) respectively, where n is the number of processors in the network, t(resp.f) is the number of added links (resp. the number of deleted links of the old MST), And m=t+n if f=Ο, m=e (i.e. the number of links in the network after the topology change) otherwise. Moreover the last part of this paper touches in the algorithm which deals with deletion and addition of processors as well as links.

  • PDF

Characteristics and Germination of Xanthoceras sorbifolia Bunge Seeds Originated from Inner Mongolia and Liaoning, China

  • An, Chan-Hoon;Lee, Hyun-Seok;Yin, Zhi-Yang;Yi, Jae-Seon
    • Journal of Forest and Environmental Science
    • /
    • v.27 no.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.

Tree Build Heuristics for Spatial Partitioning Trees of 3D Games (3D 게임 공간 분할 트리에서 트리 빌드 휴리스틱)

  • Kim, Youngsik
    • Journal of Korea Game Society
    • /
    • v.13 no.4
    • /
    • pp.25-34
    • /
    • 2013
  • Spatial partitioning trees are needed for processing collision detections efficiently. In order to select split planes for spatial partitioning trees, the tree balance and the number of polygons overlapped with the split plane should be considered. In this paper, the heuristic algorithm controlling weight values of tree build criteria is proposed for spatial partitioning trees of 3D games. As the weight values are changed, tree build time, T-junction elimination time which can cause visual artifacts in splitting polygons overlapped with the split plane, rendering speed (frame per second: FPS) according to tree balance are analysed under 3D game simulations.

Optimal tree location model considering multi-function of tree for outdoor space - considering shading effect, shielding, openness of a tree - (옥외공간에서 수목의 다기능을 고려한 최적의 배식 위치 선정 모델 - 수목의 그림자 효과, 시야차단, 개방성을 고려하여 -)

  • Park, Chae-Yeon;Lee, Dong-Kun;Yoon, Eun-Joo;Mo, Yong-Won;Yoon, June-Ha
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.22 no.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.