• Title/Summary/Keyword: Tree-Reconstruction

Search Result 107, Processing Time 0.024 seconds

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
    • /
    • v.50 no.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 (선릉 정자각 목부재의 연륜연대 분석)

  • Son, Byung-Hwa;Han, Sang-Hyo;Park, Won-Kyu
    • Journal of the Korea Furniture Society
    • /
    • v.23 no.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
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.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
    • /
    • v.48 no.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.

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

  • 김재흥
    • Spatial Information Research
    • /
    • v.8 no.1
    • /
    • pp.155-170
    • /
    • 2000
  • When we use R-Tree,a spatial index, to find objects matches some predicate, it often leads to an incorrect result of perform filtering step only with MBR. And , each candidates need to be inspected to conform if it really satisfies with given query, so called, 'refinement step'. In refinement step. we should perform disk I/O and expansive spatial operations which is the cause of increasing retrieval costs. Therefore, to minimize the number of candidate after filtering step, two-phase filtering methods were studied, but there was many problems such as inefficiency of filtering,maintenance of additional informations and reconstruction of data resulted from the loss of original information. So , in this paper, I propose an Extended R-Tree which provides ability to retrieve spatial objects only with some simple logical operations using Grid Table, truth table strong the information about the existence of spatial objects, in second filtering step. Consequently , this Extended R-Tree using Grid Filter has low cost of operation for filtering because of efficient second filtering step, and better filtering efficiency caused by high quality of approximation.

  • 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
    • /
    • v.16 no.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 (무선 센서 망에서 이동싱크 지원을 위한 지역 수정 기반 멀티캐스팅 기법)

  • Lee, Jeong-Cheol;Park, Ho-Sung;Oh, Seung-Min;Jung, Ju-Hyun;Park, Soo-Chang;Lee, Eui-Sin;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.80-84
    • /
    • 2010
  • Data multicasting from a source to multiple sinks in wireless sensor networks is used to achieve both reducing communication costs and energy efficiency. Almost all existing schemes for the multicasting might be effectively performed by optimal construction of a multicasting tree between a source and multiple stationary sinks. However, in practical sensor applications, sinks could move around on the wireless sensor networks for own missions, such as scouting of soldiers and saving lives of victims by firefighters. Unfortunately, the sink mobility causes frequent entire reconstruction of the multicasting tree and thus it leads to exhaustion of battery power of sensors. Hence, we propose an energy-efficient multicast protocol to support multiple mobile sinks by the local multicast tree reconstruction, called Local Update-based geographic Multicasting for Mobile sinks (LUMM) for wireless sensor networks. Our simulation results show that our scheme for mobile sinks is more efficient in terms of energy resource management than other exist works.

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

  • Park, Won-Kyu;Son, Byung-Wha;Han, Sang-Hyo
    • Journal of architectural history
    • /
    • v.12 no.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 (멀티미디어 데이터베이스 전송 알고리즘에 관한 연구)

  • 최진탁
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.7
    • /
    • pp.921-926
    • /
    • 2002
  • B+-Tree is the most popular indexing method in DBMS to manage large size data in more efficiency. However the existing B+-Tree has shortcomings in there is overhead on DISK/IO when the first time of constructing DB or of making Index, and it lessens the concurrency if there are frequent delete operations so that the index structure also should be changed frequently. To solve these problems almost DBMS is using batch construction method and lazy deletion method. But to apply B+-Tree, which is using batch construction method and lazy deletion method, into DBMS the technique for controlling and recovering concurrency is necessary, but its researching is still unsatisfactory so that there is a problem on applying it into actual systems. On this paper I suggest the technique for controlling and recovering concurrency how to implement the batch construction method and the lazy deletion method in actual DBMS. Through the suggested technique there is no cascade rollback by using Pending list, it enhances the concurrency by enabling insertion and deletion for base table on every reconstruction, and it shortens transaction response time for user by using system queue which makes the batch constructing operation is processed not in user's transaction level but in system transaction level.

  • 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.06a
    • /
    • 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