• 한국생물공학회:학술대회논문집
• /
• 2003.04a
• /
• pp.686-689
• /
• 2003

A Gene content phylogenetic tree and a 16S rRNA based phylogenetic tree were compared for 9 Archaea and 15 Proteobacteria, whole-genome sequenced, by neighbor joining and bootstrap methods (n=1000). Ratio of conserved COG (clusters of orthologous groups of proteins) to ortholog revealed that they were within the range of 4.60% (Mezorhizobium loti) or 56.57% (Mycoplasma genitalium), The diversity of ratio meant the Possibility of searching for useful genes, as they possess peculiar genes. The gene content tree and the 16S rDNA tree showed coincidence and discordance in Archaea and Proteobacteria.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.589-590
• /
• 2010

Recently, as various smart phones released smart phones are becoming popular.Accordingly, the growing interest in mobile information service or advertising serviece, and attention has been concentrated in the mobile environment. These servieces should be carried out smoothly in the all situation (cannot access mobile Wi-Fi networks and 3G services), and should have the uniqueness that is fit for purpose. In this papaer, module for a particular purpose of the foundation of specialized location-based map services was implemented using a Packing R-tree by using a GIS engine based on Microsoft Window Mobile and Android operating system without communication device like 3G or Wi-Fi.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.678-691
• /
• 2000

A variety of multimedia applications require multimedia database management systems to manage multimedia data, such as text, image, and video, as well as t support content-based image or video retrieval. In this paper we design and implement a content-based image retrieval system, BADA-IV/I$^2$R(Image Information Retrieval), which is developed based on BADA-IV multimedia database management system. In this system image databases can be efficiently constructed and retrieved with the visual features, such as color, shape, and texture, of image. we extend SQL statements to define image query based on both annotations and visual features of image together. A high-dimensional index structure, called CIR-tree, is also employed in the system to provide an efficient access method to image databases. We show that BADA-IV/I$^2$R provides a flexible way to define query for image retrieval and retrieves image data fast and effectively: the effectiveness and performance of image retrieval are shown by BEP(Bull's Eye Performance) that is used to measure the retrieval effectiveness in MPEG-7 and comparing the performance of CIR-tree with those of X-tree and TV-tree, respectively.

• Journal of Korean Society for Geospatial Information Science
• /
• v.3 no.2 s.6
• /
• pp.137-149
• /
• 1995

A spatial index is necessary to support an efficient search in a geographical information system (GIS) that is important in these days. In this paper, we design and implement a geographical data manager, called GOOD (Geo-object Oriented Data Manager) 2.0, by extending GOOD 1.0 with a spatial index processing module. That is, R-tree and R*-tree are used as a spatial index in this paper to make an efficient search possible. In addition, this paper conducts a performance evaluation to measure the improvement in search efficiency and analyzes the results of the performance evaluation. When the performance evaluation is carried out, we consider various environment factors to allow an GIS administrator to use the results as a basic data in selecting an appropriate spatial index.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1584-1590
• /
• 2008

The combined query which consists of the region and trajectory query finds trajectories of moving objects which locate in a certain region. The trajectory query is very informant factor to determine query performance because it processes a point query continuously to find predecessors. This results in bad performance due to revisiting nodes in an index. This paper suggests an efficient method for the combined query based on the 3-dimensional R-tree which has good performance of the region query. The basic idea is that we define the least common search line which enables to search single path and a filtering method based on prediction without revisiting nodes.

• Steel and Composite Structures
• /
• v.35 no.3
• /
• pp.353-370
• /
• 2020

This paper describes a new type of replaceable fuse for moment resisting frames. Column-tree connections with beam splice connections are frequently preferred in the moment resisting frames since they eliminate field welding and provide good quality. In the column-tree connections, a part of the beam is welded to the column in the shop and the rest of the beam is bolted with the splice connection in the field. In this study, a replaceable reduced beam section (R-RBS) connection is proposed in order to eliminate welding process and facilitate assembly at the site. In the proposed R-RBS connection, one end is connected by a beam splice connection to the beam and the other end is connected by a bolted end-plate connection to the column. More importantly is that the proposed R-RBS connection allows the replacement of the damaged R-RBS easily right after an earthquake. Pursuant to this goal, experimental and numerical studies have been undertaken to investigate the performance of the R-RBS connection. An experimental study on the RBS connection was used to substantiate the numerical model using ABAQUS, a commercially available finite element software. Additionally, five different finite element models were developed to conduct a parametric study. The results of the analysis were compared in terms of the moment and energy absorption capacities, PEEQ, rupture and tri-axiality indexes. The design process as well as the optimum dimensions of the R-RBS connections are presented. It was also demonstrated that the proposed R-RBS connection satisfies AISC criteria based on the nonlinear finite element analysis results.

• Geomechanics and Engineering
• /
• v.29 no.5
• /
• pp.523-533
• /
• 2022

Several prediction model of penetration rate (PR) of tunnel boring machines (TBMs) have been focused on applying to design stage. In construction stage, however, the expected PR and its trends are changed during tunneling owing to TBM excavation skills and the gap between the investigated and actual geological conditions. Monitoring the PR during tunneling is crucial to rescheduling the excavation plan in real-time. This study proposes a sequential prediction method applicable in the construction stage. Geological and TBM operating data are collected from Gunpo cable tunnel in Korea, and preprocessed through normalization and augmentation. The results show that the sequential prediction for 1 ring unit prediction distance (UPD) is R²≥0.79; whereas, a one-step prediction is R²≤0.30. In modeling algorithm, a gradient boosted regression tree (GBRT) outperformed a least square-based linear regression in sequential prediction method. For practical use, a simple equation between the R² and UPD is proposed. When UPD increases R² decreases exponentially; In particular, UPD at R²=0.60 is calculated as 28 rings using the equation. Such a time interval will provide enough time for decision-making. Evidently, the UPD can be adjusted depending on other project and the R² value targeted by an operator. Therefore, a calculation process for the equation between the R² and UPD is addressed.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1003-1010
• /
• 2004

In this paper, we address efficient processing of subsequence matching in time-series databases. We first point out the performance problems occurring in the index searching of a prior method for subsequence matching. Then, we propose a new method that resolves these problems. Our method starts with viewing the index searching of subsequence matching from a new angle, thereby regarding it as a kind of a spatial-join called a window-join. For speeding up the window-join, our method builds an R＊-tree in main memory for f query sequence at starting of sub-sequence matching. Our method also includes a novel algorithm for joining effectively one R＊-tree in disk, which is for data sequences, and another R＊-tree in main memory, which is for a query sequence. This algorithm accesses each R＊-tree page built on data sequences exactly cure without incurring any index-level false alarms. Therefore, in terms of the number of disk accesses, the proposed algorithm proves to be optimal. Also, performance evaluation through extensive experiments shows the superiority of our method quantitatively.

• Smart Media Journal
• /
• v.4 no.3
• /
• pp.9-15
• /
• 2015

A pub(lish)/sub(scribe) system is a data forwarding system which forwards only interesting data among the whole published data, which is related to the subscriptions registered by end users. Classical pub/sub systems are realized by constructing a network of brokers which are responsible for storing or forwarding data. Along with the substantial increase of the population mobile users, it is required that the pub/sub system handles the subscriptions of user locations which changes continuously and frequently. In this paper, a new broker network based pub/sub system which efficiently handles the frequent changes of subscriptions related to user locations is proposed. In consideration of moving patterns of users and geographical property, the proposed pub/sub system categorize the entire data space into Slow Moving Region and Normal Moving Region, and manages the brokers which are responsible for these regions by using Q+R tree in order to handle user requests more efficiently. Through the extensive simulation, it is presented that the proposed Q+R tree based pub/sub system can reduce unnecessary needs of brokers and network traffic and can support the dynamic subscription related to user location.

• Journal of Forest and Environmental Science
• /
• v.33 no.3
• /
• pp.187-196
• /
• 2017

The use of unmanned aerial vehicles (UAV) for the estimation of tree height is gaining recognition. This study aims to assess the effectiveness of tree height estimation of Pinus densiflora Sieb. et Zucc. and Pinus koraiensis Sieb. et Zucc. using digital surface model (DSM) generated from UAV-acquired imageries. Images were taken with the $Trimble^{(R)}$ UX5 equipped with Sony ${\alpha}5100$. The generated DSM, together with the digital elevation model (DEM) generated from a digital map of the study areas, were used in the estimation of tree height. Field measurements were conducted in order to generate a regression model and carry out accuracy assessment. The obtained coefficients of determination (R2) and root mean square error (RMSE) for P. densiflora (R2=0.71; RMSE=1.00 m) and P. koraiensis (R2=0.64; RMSE=0.85 m) are comparable to the results of similar studies. The results of the paired two-tailed t-test show that the two tree height estimation methods are not significantly different (p-value=0.04 and 0.10, alpha level=0.01), which means that tree height estimation using UAV imagery could be used as an alternative to field measurement.