• 제목/요약/키워드: Tree-Reconstruction

검색결과 107건 처리시간 0.024초

Genetic Diversity of Amylomyces rouxii from Ragi tapai in Java Island Based on Ribosomal Regions ITS1/ITS2 and D1/D2

  • Delva, Ega;Arisuryanti, Tuty;Ilmi, Miftahul
    • Mycobiology
    • /
    • 제50권2호
    • /
    • pp.132-141
    • /
    • 2022
  • Amylomyces rouxii is commonly found as amylolytic fungi in tapai fermentation. However, its diversity is rarely reported despite being often used for food production in Southeast Asia. This research aims to analyze the genetic diversity and the distribution pattern of A. rouxii from Ragi tapai in Java Island, Indonesia. We isolated the fungus from samples obtained from Ragi tapai producing centers in Bandung, Sumedang, Muntilan, Blora, Yogyakarta, and Bondowoso. The obtained isolates were molecularly identified based on the ribosomal regions ITS1/ITS2 and D1/D2, then analyzed for phylogenetic tree reconstruction, genetic distance, genetic variation, and haplotype networking. Six isolates showed specific morphological traits of A. rouxii. However, phylogenetic tree reconstruction on the ribosomal genes showed that the isolates were grouped into two different clades related to two species. Clade A included BDG, SMD, and MTL isolates related to A. rouxii, whereas clade B included YOG, BLR, and BDS isolates related to Mucor indicus. The genetic distances between clades for ITS1/ITS2 and D1/D2 were 0.6145 and 0.1556, respectively. In conclusion, we confirmed the genetic diversity of molds from Ragi tapai in Java Island and showed that the isolates are not only related to A. rouxii as reported before.

선릉 정자각 목부재의 연륜연대 분석 (Tree-Ring Dating of Wood Elements for Jeongjagak of Seonreung, Seoul, Korea)

  • 손병화;한상효;박원규
    • 한국가구학회지
    • /
    • 제23권2호
    • /
    • pp.222-228
    • /
    • 2012
  • Seonreung is the tomb of Seong-jong (A.D. 1457~1494), the 9th king of Joseon Dynasty (1392-1910) and his second queen Jeonghyeon-wanghu (1462~1530). We obtained dendrochronological dates of Jeongjagak (ceremonial hall) of Seonreung. It was known first built in 1495 and reconstructed in October 1706, We obtained tree-ring dates of 20 wood elements (beams, pillars, truss posts, cant strips, roof boards and roof loaders). Their outermost rings were dated from 1630 to 1705. The dates of bark rings in four elements were A.D. 1705 with completed latewoods, indicating that these woods were cut some time between the autumn of 1705 and spring of 1706. The results confirmed the reconstruction date Jeongjagak of Seonreung in 1706, suggesting that there was not so long period for wood drying or storage, i.e., less than 6 months. The dates of outermost rings prior to 1705 in other elements indicated that some outer rings of these elements were removed during wood processing. Tree-ring dating proved that the present Jeongjagak of Seonreung had been well preserved for more than 300 years.

  • PDF

QUARTET CONSISTENCY COUNT METHOD FOR RECONSTRUCTING PHYLOGENETIC TREES

  • Cho, Jin-Hwan;Joe, Do-Sang;Kim, Young-Rock
    • 대한수학회논문집
    • /
    • 제25권1호
    • /
    • pp.149-160
    • /
    • 2010
  • Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualitative nature of neighbor-joining and that of dissimilarity maps from DNA sequence data. Moreover, the new algorithm always reconstructs correct trees from quartet consistent dissimilarity maps.

Radial forearm free flap in a patient with an unusual radial artery variation: a case report

  • Menichini, Giulio;Calabrese, Sara;Alfonsi, Nicola;Innocenti, Marco
    • Archives of Plastic Surgery
    • /
    • 제48권6호
    • /
    • pp.646-650
    • /
    • 2021
  • Head and neck reconstruction poses unique challenges in rehabilitating surgical defects in terms of integrity, function, and form. The radial forearm free flap (RFFF) has been widely used for defect coverage, especially in the head and neck area, but its versatility allows it to be used for soft-tissue reconstruction in various parts of the body. The vascular features of the flap are quite constant and reliable. Nevertheless, abnormalities of the forearm vascular tree have been described over the decades. We report a case of intraoral reconstruction after verrucous carcinoma recurrence in a 74-year-old woman with an unusual forearm flap, which we called the median forearm free flap, based on a median branch of the radial artery that was preoperatively detected using handheld Doppler ultrasonography. The distally located skin paddle was predominantly supplied by the aberrant median vessel with its perforators. The flap was thus safely harvested with this atypical pedicle. Successful reconstruction of the intraoral defect was achieved, with an uneventful postoperative course.

효율적인 여과를 위한 그리드 필터를 갖는 R-Tree 의 확장 (Extended R-Tree with Grid Filter for Efficient Filtering)

  • 김재흥
    • Spatial Information Research
    • /
    • 제8권1호
    • /
    • pp.155-170
    • /
    • 2000
  • 공간 인덱스인 R-Tree를 이용하여 조건에 만족하는 공간 객체를 찾기 위해서 MBR의 비교하는 여과 과정만으로는 부정확한 경우가 있으며 그러한 경우에는 해당 공간 객체를 읽어 조건과 직접 비교하는 과정, 즉 정제과정이 필요하게 된다. 정제과정을 수행하기 위해서는 디스크 입출력이 요구되고 고비용 공간 연상을 수행해야 하므로 이는 검색 비용이 커지는 요인이 된다. 그래서, 여과 과정후의 후보 객체수를 최소화하기 위한 2단계 여과 기법들이 연구되었지만, 여과 효율이 떨어지거나, 추가로 데이터를 유지해야하거나, 원래 객체의 정보를 잃어버려 객체들을 재구성해야하는 문제점이 발생한다. 따라서, 본 논문에서는 이차 여과 과정에서 공간 객체의 존재여부를 저장하는 진위 테이블인 그리드 필터를 이용하여 간단한 논리 연산만으로 공간객체를 검색할 수 있도록 하는 확장된 R-Tree를 제안한다. 그러므로, 그리드 필터를 가지는 확장된 R-Tree 는 효율적인 이차 여과과정을 수행하기 때문에 여과를 위한 연산비용이 작고, 근사의 질이 높아 여과 효율이 우수하다.

  • PDF

A Method for Tree Image Segmentation Combined Adaptive Mean Shifting with Image Abstraction

  • Yang, Ting-ting;Zhou, Su-yin;Xu, Ai-jun;Yin, Jian-xin
    • Journal of Information Processing Systems
    • /
    • 제16권6호
    • /
    • pp.1424-1436
    • /
    • 2020
  • Although huge progress has been made in current image segmentation work, there are still no efficient segmentation strategies for tree image which is taken from natural environment and contains complex background. To improve those problems, we propose a method for tree image segmentation combining adaptive mean shifting with image abstraction. Our approach perform better than others because it focuses mainly on the background of image and characteristics of the tree itself. First, we abstract the original tree image using bilateral filtering and image pyramid from multiple perspectives, which can reduce the influence of the background and tree canopy gaps on clustering. Spatial location and gray scale features are obtained by step detection and the insertion rule method, respectively. Bandwidths calculated by spatial location and gray scale features are then used to determine the size of the Gaussian kernel function and in the mean shift clustering. Furthermore, the flood fill method is employed to fill the results of clustering and highlight the region of interest. To prove the effectiveness of tree image abstractions on image clustering, we compared different abstraction levels and achieved the optimal clustering results. For our algorithm, the average segmentation accuracy (SA), over-segmentation rate (OR), and under-segmentation rate (UR) of the crown are 91.21%, 3.54%, and 9.85%, respectively. The average values of the trunk are 92.78%, 8.16%, and 7.93%, respectively. Comparing the results of our method experimentally with other popular tree image segmentation methods, our segmentation method get rid of human interaction and shows higher SA. Meanwhile, this work shows a promising application prospect on visual reconstruction and factors measurement of tree.

무선 센서 망에서 이동싱크 지원을 위한 지역 수정 기반 멀티캐스팅 기법 (Local Update-based Multicasting Scheme for Mobile Sinks in Wireless Sensor Networks)

  • 이정철;박호성;오승민;정주현;박수창;이의신;김상하
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제16권1호
    • /
    • pp.80-84
    • /
    • 2010
  • 한 소스로부터 다수의 싱크로의 데이터 멀티캐스팅은 통신 비용 절약 뿐 아니라 효율적인 에너지의 사용을 위해 이루어진다. 무선 센서 네트워크에서, 지금까지의 멀티캐스팅 위한 방안들은 대부분 하나의 소스와 다수의 고정적인 싱크들 사이의 최적화된 멀티캐스트 트리로 만들어진다. 하지만 전쟁 지역에서의 적군 감지 시스템, 재난지역 구조 시스템 등의 실질적인 응용들에서, 싱크는 자신의 미션을 수행하기 위해 이동성을 가지고 센서 네트워크를 돌아다닐 것이다. 불행히도 싱크의 이동성은 전체 멀티캐스트 트리의 빈번한 재구성을 초래하고 이것은 제한된 배터리를 가진 센서들의 에너지 고갈을 야기시킨다. 그러므로, 우리는 지역적인 멀티캐스트 트리의 재구성을 통해 다수의 이동 싱크를 지원하는 에너지 효율적인 멀티캐스트 프로토콜을 제안한다. 또한 시뮬레이션을 통해 제안된 방안이 기존 연구들 보다 에너지 자원 관리 측면에서 더 효과적임을 보인다.

창경궁 통명전 목부재의 연륜연대 측정 -방에서 마루로 변형된 시기규명을 중심으로- (Tree-Ring Dating of Wood Elements Used for Tongmyungjeon Hall of Changkyung Palace - The Year of Transforming from Ondol Rooms to Wooden Floors-)

  • 박원규;손병화;한상효
    • 건축역사연구
    • /
    • 제12권3호
    • /
    • pp.53-63
    • /
    • 2003
  • Tree-ring chronologies can be used to date historical buildings by matching them with the chronologies of living trees or previously dated samples. Tree-ring dating gives a calendar year to each tree ring and produces the felling dates of logs or woods which had been used for buildings. In Korea, several chronologies of Japanese red pine(Pinus densiflora Sieb. et Zucc., 'sonamu' in Korean), a major species for the wooden building materials, have been developed and used for dating historical buildings. In this study, Tongmyungjeon Hall of Changkyung Palace in Seoul was dated by tree rings. The present Tongmyungjeon Hall was known to be reconstructed in A.D. 1834 after burned-out in A.D. 1790. We sampled total of 122 wood samples which were replaced during the repair process in 2002-2003. Felling dates of the samples were determined by the dendrochronological crossdating method. Crossdating method employs graphic comparison of the master patterns (ring-width chronologies of known dates) with those of the sample chronologies of unknown dates. Tree-ring dates confirmed that the reconstruction of 1834 utilized second-handed timbers as well as fresh-cut ones. The felling dates of wooden floor frames were mostly A.D. 1913, indicating the 'Ondol' floors were changed to the wooden floors around 1914 when the Japanese rulers brutally destroyed the royal Korean Palaces and transformed palace buildings to their offices or exhibition halls after occupying Korea in 1910. This study proved that tree-ring dating was a useful and accurate method to identify the critical dates for the history of Korean traditional buildings.

  • PDF

멀티미디어 데이터베이스 전송 알고리즘에 관한 연구 (A Study on Multimedia Database Transmission Algorithm)

  • 최진탁
    • 한국컴퓨터산업학회논문지
    • /
    • 제3권7호
    • /
    • pp.921-926
    • /
    • 2002
  • B+-Tree는 데이터베이스 관리 시스템에서 대용량의 데이터를 효율적으로 관리하기 위해서 가장 널리 사용되는 인덱스이다. 하지만 기존의 B+-Tree는 데이터베이스를 처음 구성할 때나, 인덱스를 새로 구성할 시, 많은 DISK/IO가 발생하고, 삭제 연산이 빈번할 시에는 색인 구조 변경연산이 많이 발생하여 동시성이 떨어진다는 단점이 있다. 이러한 문제점을 해결하기 위해서 대부분의 데이터베이스 시스템에서는 일괄구성과 지연삭제를 이용한다. 하지만 일괄구성 및 지연(Lazy) 삭제 방법을 적용한 B+-Tree를 데이터 베이스 관리 시스템에 적용 하려면 동시성 제어 및 회복 기법이 필수적으로 요구되지만, 이에 대한 연구가 미흡하여 실제 시스템에 적용하기에는 문제가 있다. 본 연구에서는 일괄구성과 지연삭제 방법을 적용한 B+-Tree를 실제 데이터베이스 시스템에 적용할 수 있도록 동시성 및 회복기법을 제안했다. 제안기법은 트랜잭션 Pending 리스트를 사용하여 연속적인 철회(Cascade Rollback)가 발생하지 않고, 재구성시 베이스 테이블에 대한 삽입, 삭제를 가능하게 하여 동시성을 높였으며, 시스템 Queue를 사용하여 일괄구성 연산을 사용자의 트랜잭션에서 수행하지 않고 따로 시스템 트랜잭션으로 처리하여 사용자의 트랜잭션의 응답시간을 줄였다.

  • PDF

Role of the Observation Planning in Three-dimensional Environment for Autonomous Reconstruction

  • Moon, Jung-Hyun;You, Bum-Jae;Kim, Hag-Bae;Oh, Sang-Rok
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.37-42
    • /
    • 2005
  • This paper presents an autonomous system for reconstruction of three-dimensional indoor environments using a mobile robot. The system is composed of a mobile robot, a three-dimensional scanning system, and a notebook computer for registration, observation planning and real-time three-dimensional data transferring. Three-dimensional scanning system obtains three-dimensional environmental data and performs filtering of dynamic objects. Then, it registers multiple three-dimensional scans into one coordinate system and performs observation planning which finds the next scanning position by using the layered hexahedral-map and topological-map. Then, the mobile robot moves to the next scanning position, and repeats all procedures until there is no scanning tree in topological-map. In concurrence with data scanning, three-dimensional data can be transferred through wireless-LAN in real-time. This system is experimented successfully by using a mobile robot named KARA.

  • PDF