• 제목/요약/키워드: Technology Tree

검색결과 2,150건 처리시간 0.032초

새만금 간척지 수림대 조성 방안 - 곰솔과 졸참나무의 초기 생장량 분석 - (Plan to Construct Tree Belt around Saemangeum Reclaimed Land - Analysis of Initial Growth Amount of Pinus thunbergii and Quercus serrata -)

  • 김현
    • 한국환경복원기술학회지
    • /
    • 제20권1호
    • /
    • pp.117-129
    • /
    • 2017
  • This research was conducted to construct a tree belt around Saemangeum reclaimed land using various planting methods and to analyze initial growth amount, to provide practical data to construct tree belt of various purposes. Tree species used in tree belt construction were Pinus thunbergii and Quercus serrata, and the main planting treatment methods used were categorized by existence of windy fence, mixed planting, and un-mixed planting. Growth amount analysis was conducted using ANOVA to compare growth amounts in different experimental groups and Duncan's multiple range test. Growth amount analysis results of tree belt by planting method showed that it is most statistically plausible to install 50% porous windy fence from the direction of wind and frost, followed by planting P. thunbergii and Q. serrata in areas that require mixed tree species tree belt around Saemangeum reclaimed land. In areas where un-mixed planting tree belt is required, it was appropriate to use P. thunbergii alone without a windy fence. Lastly, if the purpose of the tree belt is limited to rapid growth, it was most ideal to plant P. thunbergii alone (without windy fence) or install 50% porous windy fence from the direction of wind and frost, followed by planting P. thunbergii and Q. serrata. This research is based on initial growth amount of tree belt and there is a need for a long-term monitoring of tree belt growth to increase tree-planting success rate in establishing tree belt according to Saemangeum internal development.

Distributional Pattern of Tree Species in Response to Soil Variables in a Semi Natural Tropical Forest of Bangladesh

  • Ara, Saida Hossain;Limon, Mahedi Hasan;Kibria, Mohammad Golam
    • Journal of Forest and Environmental Science
    • /
    • 제37권1호
    • /
    • pp.14-24
    • /
    • 2021
  • A plant community is a group of populations that coexist in space and interact directly or indirectly with the environment. In this paper, we determined the pattern of tree species composition in response to soil variables in Khadimnagar National Park (KNP), which is one of the least studied tropical forests in Bangladesh. Soil and vegetation data were collected from 71 sample plots. Canonical Correspondence Analysis (CCA) with associated Monte Carlo permutation tests (499 permutations) was carried out to determine the most significant soil variable and to explore the relationship between tree species distribution and soil variables. Soil pH and clay content (pH with p<0.01 and Clay content with p<0.05) were the most significant variables that influence the overall tree species distribution in KNP. Soil pH is related to the distribution and abundance of Syzygium grande and Magnolia champaca, which were mostly found and dominant species in KNP. Some species were correlated with clay content such as Artocarpus chaplasha and Cassia siamea. These observations suggest that both the physico-chemical properties of soil play a major role in shaping the tree distribution in KNP. Hence, these soil properties should take into account for any tree conservation strategy in this forest.

Development of an Analytical Approach for the Utilization of Edible Tree Sprouts

  • Choi, Jungwon;Kim, Juree;Lee, Hak-Dong;Cho, Hyejin;Paje, Leo Adrianne;Shin, Hanna;Lee, Sanghyun
    • Natural Product Sciences
    • /
    • 제28권1호
    • /
    • pp.27-32
    • /
    • 2022
  • This study evaluated the general nutritional ingredients such as crude fats, crude ashes, crude proteins, total polyphenols, and total flavonoids in 18 kinds of edible tree sprouts. The tree sprouts of Philadelphus schrenckii, Lycium chinense, and Morus alba had the highest crude fat, crude ash, and crude protein content, respectively. The tree sprouts of Cedrela sinensis (CSS) with high ABTS+ radical scavenging activities had a high content of total polyphenols (175.65 mg/g ext.) and total flavonoids (75.18 mg/g ext.). The simultaneous determination of flavonoids such as rutin, isoquercitrin, quercitrin, afzelin, and quercetin in CSS was conducted using high-performance liquid chromatography with a wavelength of 270 nm. Among the flavonoids, the content of quercitrin in CSS was the highest at 59.28 mg/g ext. This study also aids the quality control of many edible tree sprouts by analyzing the general components, total polyphenols, and total flavonoids.

Applying Decision Tree Algorithms for Analyzing HS-VOSTS Questionnaire Results

  • Kang, Dae-Ki
    • 공학교육연구
    • /
    • 제15권4호
    • /
    • pp.41-47
    • /
    • 2012
  • Data mining and knowledge discovery techniques have shown to be effective in finding hidden underlying rules inside large database in an automated fashion. On the other hand, analyzing, assessing, and applying students' survey data are very important in science and engineering education because of various reasons such as quality improvement, engineering design process, innovative education, etc. Among those surveys, analyzing the students' views on science-technology-society can be helpful to engineering education. Because, although most researches on the philosophy of science have shown that science is one of the most difficult concepts to define precisely, it is still important to have an eye on science, pseudo-science, and scientific misconducts. In this paper, we report the experimental results of applying decision tree induction algorithms for analyzing the questionnaire results of high school students' views on science-technology-society (HS-VOSTS). Empirical results on various settings of decision tree induction on HS-VOSTS results from one South Korean university students indicate that decision tree induction algorithms can be successfully and effectively applied to automated knowledge discovery from students' survey data.

개발예정지 내 자생수목 처리방법에 따른 비용 연구 (Cost Effectiveness Depending on the Native Tree Treatment Methods)

  • 조흥렬;김세빈;오도교
    • 한국환경복원기술학회지
    • /
    • 제12권6호
    • /
    • pp.51-62
    • /
    • 2009
  • The purpose of this study is to analyze the profitability by selecting Pinus densiflora S. et Z. worthy of ornamental tree from among the cutting timber in the urban development project, and then presents the improvements. The study site is the whole area of Oedong-eup Gyeongju city Gyeongsangbuk-do and subject trees numbers are 2,180 trees. Analysis method is cost analysis because it is used generously pubic land development. In results, at first, in case of forest development currently cutting tree costs 7.3 million Won/ha. and no profit is occurred at all. Secondly, the forward direction order of tree treatments expenses are in sawdust production, selling lumber, selling ornamental tree, and selling ornamental tree, sawdust production, selling lumbered on the aspect of profits by the selling stumpage. Especially, selling trees as ornamental tree costs 127 million Won/ha. which shows the highest profits. Third, the management of ornamental tree pine tree after transplantation from development site costs 5 times less than purchasing the same quality trees. Hence, it is recommended to re-utilize the trees from the development sites to produce a high standard gardens and it also provides the basis for the low carbon green growth society.

함정전투체계 표적 색인을 위한 TPR-Tree 상향식 갱신 기법 (A Study on Bottom-Up Update of TPR-Tree for Target Indexing in Naval Combat Systems)

  • 고영근
    • 한국군사과학기술학회지
    • /
    • 제22권2호
    • /
    • pp.266-277
    • /
    • 2019
  • In modern warfare, securing time for preemptive response is recognized as an important factor of victory. The naval combat system, the core of naval forces, also strives to increase the effectiveness of engagement by improving its real-time information processing capabilities. As part of that, it is considered to use the TPR-tree in the naval combat system's target indexing because spatio-temporal searches can be performed quickly even as the number of target information increases. However, because the TPR-tree is slow to process updates, there is a limitation to handling frequent updates. In this paper, we present a method for improving the update performance of TPR-tree by applying the bottom-up update scheme, previously proposed for R-tree, to the TPR-tree. In particular, we analyze the causes of overlaps occurring when applying the bottom-up updates and propose ways to limit the MBR expansion to solve it. Our experimental results show that the proposed technique improves the update performance of TPR-tree from 3.5 times to 12 times while maintaining search performance.

제한된 영역에서의 이동 및 고정 객체를 위한 시공간 분할 트리 (The Separation of Time and Space Tree for Moving or Static Objects in Limited Region)

  • 윤종선;박현주
    • Journal of Information Technology Applications and Management
    • /
    • 제12권1호
    • /
    • pp.111-123
    • /
    • 2005
  • Many indexing methods were proposed so that process moving object efficiently. Among them, indexing methods like the 3D R-tree treat temporal and spatial domain as the same. Actually, however. both domain had better process separately because of difference in character and unit. Especially in this paper we deal with limited region such as indoor environment since spatial domain is limited but temporal domain is grown. In this paper we present a novel indexing structure, namely STS-tree(Separation of Time and Space tree). based on limited region. STS-tree is a hybrid tree structure which consists of R-tree and one-dimensional TB-tree. The R-tree component indexes static object and spatial information such as topography of the space. The TB-tree component indexes moving object and temporal information.

  • PDF

Keypoint Detection과 Annoy Tree를 사용한 2D Hand Pose Estimation (Fast Hand Pose Estimation with Keypoint Detection and Annoy Tree)

  • 이희재;강민혜
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2021년도 제63차 동계학술대회논문집 29권1호
    • /
    • pp.277-278
    • /
    • 2021
  • 최근 손동작 인식에 대한 연구들이 활발하다. 하지만 대부분 Depth 정보를 포함한3D 정보를 필요로 한다. 이는 기존 연구들이 Depth 카메라 없이는 동작하지 않는다는 한계점이 있다는 것을 의미한다. 본 프로젝트는 Depth 카메라를 사용하지 않고 2D 이미지에서 Hand Keypoint Detection을 통해 손동작 인식을 하는 방법론을 제안한다. 학습 데이터 셋으로 Facebook에서 제공하는 InterHand2.6M 데이터셋[1]을 사용한다. 제안 방법은 크게 두 단계로 진행된다. 첫째로, Object Detection으로 Hand Detection을 수행한다. 데이터 셋이 어두운 배경에서 촬영되어 실 사용 환경에서 Detection 성능이 나오지 않는 점을 해결하기 위한 이미지 합성 Augmentation 기법을 제안한다. 둘째로, Keypoint Detection으로 21개의 Hand Keypoint들을 얻는다. 실험을 통해 유의미한 벡터들을 생성한 뒤 Annoy (Approximate nearest neighbors Oh Yeah) Tree를 생성한다. 생성된 Annoy Tree들로 후처리 작업을 거친 뒤 최종 Pose Estimation을 완료한다. Annoy Tree를 사용한 Pose Estimation에서는 NN(Neural Network)을 사용한 것보다 빠르며 동등한 성능을 냈다.

  • PDF

기술트리를 이용한 입체트러스 강구조물의 과학적 기능분석 방법론에 관한 연구 (Study on the Scientific Functional Investigation of Steel Space Truss Structures by using Technology Tree Methodology)

  • 이동규;김도환;김진호
    • 한국강구조학회 논문집
    • /
    • 제25권4호
    • /
    • pp.321-333
    • /
    • 2013
  • 본 연구는 연구프로젝트의 기술과 기술의 기능의 체계적 관점에서 기술트리라는 과학적인 방법론의 사례를 제공한다. 기술트리 프로세스를 활용하여, 강구조물 중에 가장 범용적으로 사용되고 있는 입체 트러스 구조물을 대상으로, 차량을 차단하지 않는 터널 가설공사에 적합한 스마트한 입체 트러스 구조물이 되기 위한 세부 기능과 요소기술을 도출하는 기술전개 방법론을 제안한다. 본 연구에서는 이러한 기능분석 방법론은 문헌, 해석연구를 통한 검증프로세스를 통해 피드백이 가능함을 증명하였고, 향후 타 분야 기술의 효과적인 세부기능 전개 및 요구기술 도출에 활용이 가능할 것으로 사료된다.

Efficient Multicast Routing on BCube-Based Data Centers

  • Xie, Junjie;Guo, Deke;Xu, Jia;Luo, Lailong;Teng, Xiaoqiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권12호
    • /
    • pp.4343-4355
    • /
    • 2014
  • Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD(Hamming Distance)-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.