• Title/Summary/Keyword: k-d tree

Search Result 680, Processing Time 0.023 seconds

One-to-All Broadcasting of Odd Networks for One-Port and All-Port Models

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • ETRI Journal
    • /
    • v.30 no.6
    • /
    • pp.856-858
    • /
    • 2008
  • Odd networks were introduced in the context of graph theory. However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we introduce efficient one-to-all broadcasting schemes of odd networks for one-port and all-port models. We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal.

  • PDF

Development of Tree Stem Weight Equations for Larix kaempferi in Central Region of South Korea (중부지역 일본잎갈나무의 수간중량 추정식 개발)

  • Ko, Chi-Ung;Son, Yeong-Mo;Kang, Jin-Taek;Kim, Dong-Geun
    • Journal of Korean Society of Forest Science
    • /
    • v.107 no.2
    • /
    • pp.184-192
    • /
    • 2018
  • In this study was implemented to develop tree stem weight prediction equation of Larix kaempferi in central region by selecting a standard site, taking into account of diameter and position of the local trees. Fifty five sample trees were selected in total. By utilizing actual data of the sample trees, 11 models were compared and analyzed in order to estimate four different kinds of weights which include fresh weight, ovendry outside bark weight, ovendry inside bark weight and merchantable weight. As to estimate its weight, the study has classified its model according to three parameters: DBH, DBH and height, and volume. The optimal model was chosen by comparing the performance of model using the fit index and standard error of estimate and residual distribution. As a result, the formula utilizing DBH (Variable 1) is $W=a+bD+cD^2$ (3) and its fit index was 90~92%. The formula for DBH and height (Variable 2) is $W=aD^bH^C$ (8) and its fit index was 97~98%. In summation, Variable 2 model showed higher fitness than Variable 1 model. Moreover, fit index of formula for total volume and merchantable volume (W=aV) showed high rate of 98~99%, as well as resulting 7.7-17.5 with SEE and 8.0-10.0 with CV(%) which lead to predominately high fitness in conclusion. This study is expected to provide information on weights for single trees and furthermore, to be used as a basic study for weight of stand unit and biomass estimation equations.

Studies on the Content of Lectin in Korean Mistletoe according to the Host Tree Species and Characterization for Its Application to the Quality Control (한국산 겨우살이 숙주별 렉틴 함량과 지표물질로서의 특성 조사)

  • Kim, Inbo;Yoon, Taek Joon;Park, Choon Ho;Lee, Woo Kyoung;Lee, So Hee;Kim, Jong Bae
    • The Korean Journal of Food And Nutrition
    • /
    • v.28 no.6
    • /
    • pp.1090-1097
    • /
    • 2015
  • Traditionally, mistletoe is known as an effective anti-cancer medicinal plant, and lectin is recognized as a major component with cytotoxic and immuno-stimulant activity in mistletoe. A Korean mistletoe lectin (KML) has specificity to galactose and galactosamine and is distinguish from European mistletoe lectin (EML). When we examined the concentration of lectin in mistletoe originated from five different types of host trees, the result indicate that the lectin concentration is variable depending on the host tree. Noticeably, mistletoe from chestnut tree contains ten folds higher lectins than that of an oak tree. We also tested the concentration of KML and crude extract (KM-110) of Korean mistletoe that shows 90% cytotoxicity in L5178Y-ML25 lymphoma cell. In addition, the cells show 90% and 70% viability by the treatment of two neutralizing antibodies of KML, 9H7-D10 and 8B11-2C5 neutralization effect with two monoclonal antibodies of KML, 9H7-D10 and 8B11-2C5. Therefore, the result expected that the mistletoe contain some other cytotoxic components except lectin. Finally, the production of $TNF-{\alpha}$ and IL-6 by RAW 264.7 cells stimulated with lectin free-crude extract (LFKM-110) following neutralization by 9H7-D10 monoclonal antibody shows higher than that of lectin containing-crude extract (KM-110). These results suggest that the Korean mistletoe lectin ha a great potential to be developed as therapeutic agent of cancer.

3D Multimedia Contents Generation using R-tree Index (R-tree 인덱스를 활용한 3D 멀티미디어 콘텐츠 생성)

  • Lee, Hyun-Chang;Choi, Hyun-Seok;Kim, Ju-Ri;Jang, Hee-Seon;Shin, Sung-Yoon
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2010.07a
    • /
    • pp.27-29
    • /
    • 2010
  • 유비쿼터스 환경에서 대표적인 장치들 가운데 하나로서 이동장치를 고려할 수 있다. 요즈음 전반적인 이동장치의 흐름은 스마트폰에 주목하고 있으며, 이를 이용한 증강현실 등 객체들에 대한 지리적인 위치 및 현실적용 사례가 증가하고 있으며, 이들에 대한 데이터 처리가 매우 중요해지고 있다. 이와 같이 사용자에게 제공하는 모바일 응용 서비스들은 이동 객체에 기반한 다양한 서비스에 대한 기술이 요구되어지며, 또한 이들 기술을 활용하여 데이터를 시각적으로 인덱싱하여 신속하게 데이터가 처리되는 것을 시각적으로 표현하는 기술도 요구되어지고 있다. 그러나 이와 같이 사용자의 작업 이해를 높이기 위한 시각화 작업이 부족한 것이 사실이다. 이러한 문제를 해결하기 위해 본 논문에서는 하위 트리를 갖는 R 트리 인덱스를 활용하여 객체 생성을 수행하며, 생성된 객체들을 기반으로 3차원 도형으로 표현한 구현 결과를 보인다. 또한, 생성되는 시점에서 객체에 붙여진 이름은 마우스를 이용한 위치점과 인접하였을 때 이름을 표시할 수 있도록 시각화한 결과에 대해 살펴본다.

  • PDF

A Cache Consistency Control for B-Tree Indices in a Database Sharing System (데이타베이스 공유 시스템에서 B-트리 인덱스를 위한 캐쉬 일관성 제어)

  • On, Gyeong-O;Jo, Haeng-Rae
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.593-604
    • /
    • 2001
  • A database sharing system (DSS) refers to a system for high performance transaction processing. In the DSS, the processing nodes are coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches data pages and index pages in its memory buffer. In general, B-tree index pages are accessed more often and thus cached at more processing nodes, than their corresponding data pages. There are also complicated operations in the B-tree such as Fetch, Fetch Next, Insertion and Deletion. Therefore, an efficient cache consistency scheme supporting high level concurrency is required. In this paper, we propose cache consistency schemes using identifiers of index pages and page_LSN of leaf page. The propose schemes can improve the system throughput by reducing the required message traffic between nodes and index re-traversal.

  • PDF

A Prototype of Three Dimensional Operations for GIS

  • Chi, Jeong-Hee;Lee, Jin-Yul;Kim, Dae-Jung;Ryu, Keun-Ho;Kim, Kyong-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.880-884
    • /
    • 2002
  • According to the development of computer technology, especially in 3D graphics and visualization, the interest for 3D GIS has been increasing. Several commercial GIS softwares are ready to provide 3D function in their traditional 2D GIS. However, most of these systems are focused on visualization of 3D objects and supports few analysis functions. Therefore in this paper, we design not only a spatial operation processor which can support spatial analysis functions as well as 3D visualization, but also implement a prototype to operate them. In order to support interoperability between the existing models, the proposed spatial operation processor supports the 3D spatial operations based on 3D geometry object model which is designed to extend 2D geometry model of OGIS consortium, and supports index based on R$^*$-Tree. The proposed spatial operation processor can be applied in 3D GIS to support 3D analysis functions.

  • PDF

A comparison of three design tree based search algorithms for the detection of engineering parts constructed with CATIA V5 in large databases

  • Roj, Robin
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.3
    • /
    • pp.161-172
    • /
    • 2014
  • This paper presents three different search engines for the detection of CAD-parts in large databases. The analysis of the contained information is performed by the export of the data that is stored in the structure trees of the CAD-models. A preparation program generates one XML-file for every model, which in addition to including the data of the structure tree, also owns certain physical properties of each part. The first search engine is specializes in the discovery of standard parts, like screws or washers. The second program uses certain user input as search parameters, and therefore has the ability to perform personalized queries. The third one compares one given reference part with all parts in the database, and locates files that are identical, or similar to, the reference part. All approaches run automatically, and have the analysis of the structure tree in common. Files constructed with CATIA V5, and search engines written with Python have been used for the implementation. The paper also includes a short comparison of the advantages and disadvantages of each program, as well as a performance test.

Forest Digital Twin Implementation Study for 3D Forest Geospatial Information Service (3차원 산림공간정보 서비스를 위한 산림 디지털트윈 구현 연구)

  • In-Ha Choi;Sang-Kwan Nam;Seung-Yub Kim;Dong-Gook Lee
    • Korean Journal of Remote Sensing
    • /
    • v.39 no.5_4
    • /
    • pp.1165-1172
    • /
    • 2023
  • Recently, Korea has declared carbon neutrality by 2050. The Korea Forest Service is promoting the precision and high technology of forest resource surveys. As such, the demand for forest resource management is increasing, and the need to build a digital twin of forest space is increasing. However, to date, digital twin has only built and provided virtual city services, which are city and nationwide digital twin environments. Three-dimensional digital twin services targeting forest space are not operated and provided. Therefore, in this study, we aimed to implement a forest digital twin environment to provide 3D forest spatial information services corresponding to vertical information such as tree-level height and thorax diameter. By lightweighting realistic 3D tree models and applying 3D Tiles, we confirmed the feasibility of implementing a forest digital twin environment for 3D forest spatial information services. Through continuous research, we plan to implement a forest digital twin that can deploy and service 3D tree models for trees nationwide, including street trees in urban areas. This is expected to enable the development of forest digital twin services for forest resource management.

Above- and Below-ground Biomass and Energy Content of Quercus mongolica (신갈나무의 지상부와 지하부 바이오매스 및 에너지량)

  • Kwon, Ki-Cheol;Lee, Don-Koo
    • Journal of Korea Foresty Energy
    • /
    • v.25 no.1
    • /
    • pp.31-38
    • /
    • 2006
  • Quercus mongolica is the most common hardwood species distributed in Korea. This study was conducted to investigate the biomass and energy content of the belowground biomass of Q. mongolica and to obtain the regression equation for estimating root biomass using the tree height and diameter at breast height (DBH). A total of 18 sample trees ranging 20 to 60 year-old were selected in the study sites. Tree height, DBH, age, and weight of stemwood, sapwood, heartwood, stembark, branch, leaf, and root were measured for total biomass. The highly positive correlation was shown between the biomass of most of variables of aboveground components and root biomass. The regression equation of the aboveground total biomass was $log\;W_A\;=\;1.469\;+\;0.992\;log\;D^2H\;(R^2 =0.99)$. The regression equation of the belowground biomass was $log\;W_R\;=\;1.527\;+\;0.808\;log\;D^2H\;(R^2\;=\;0.97)$. The mean energy contents of sapwood, heartwood, bark, leaf, and root were 19,594 J/g DW, 19,571 J/g DW, 19,999 J/g DW, 20,664 J/g DW, and 19,273 J/g DW, respectively. The results obtained from this study can be used to estimate biomass and energy content of belowground using easily measurable variables such as DBH and tree height ranging from 20 to 60-year-old Q. mongolica stands.

  • PDF

Study on the Selection Criteria for Transplanting Trees in the Forest Reserve Areas Designated for Future Development (훼손예정지의 지형 및 수목 형태를 고려한 이식목 선정기준에 관한 연구)

  • Lee, Soo-Dong;Choi, Song-Hyun
    • Korean Journal of Environment and Ecology
    • /
    • v.23 no.6
    • /
    • pp.535-544
    • /
    • 2009
  • This study was conducted to establish the selection criteria for the trees to be transplanted in the forest reserves which are expected to be developed in the future. The main task in this endeavor was to access the transplantability of the trees focused on their feature, diameter at breast height (D.B.H.), soil feature, etc. The selection of the trees for transplantation consisted of two stages. The first stage was to select trees on the basis of their indigenousness and forest successional stage. The second was to select trees on the basis of their type, D.B.H., the layers of soil, etc. At the first stage, the trees which are not indigenous or expected not to survive were eliminated from the selection list, and the result showed that approximately 5.9% (about 3,841 trees) of the trees proved to be inadequate for transplanting. At the second stage, the investigation of the trees based on the criteria of tree type, D.B.H., the layers of soil was carried out, and the result showed that approximately 33.7% (1,218) out of 3,613 trees turned out to adequate for transplanting however, 23.0% of the trees, which are 829 trees, were found to be impossible to transplant. In addition, it was discovered that in the case of approximately 43.3%(1,566 trees) of the trees there was little difference between transplanting cost and planting cost of new trees. Therefore the investigation indicated that it is more advisable to transplant trees to preserve the ecological environment. However, the study showed that there are other elements to be considered, such as tree feature and soil condition, for the successful tree transplantation, and the necessary information can be provided by the managing personnel who are in charge of the forest.