• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.59-61
• /
• 2014

유전체 연구를 위한 분석 작업은 표준유전체에 시퀀스 데이터를 정렬하는 과정을 필수적으로 요구한다. 정렬에는 single-end 또는 paired-end reads가 사용된다. Paired-end reads는 유전체 조각의 양쪽에서 시퀀싱 된 데이터로 좀 더 긴 길이에 대한 정보를 얻을 수 있어 많이 이용된다. 정렬 툴 자체적으로 paired-end reads를 다룰수 있으나, 병합툴을 활용하는 것이 더 좋은 결과를 보인다. 다섯 가지 병합툴 중에서 CASPER와 pear에서 정렬 이득이 가장 크게 나타난다.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.677-680
• /
• 2003

In this paper, the analysis of practical end-to-end delay in worst case is performed for distributed control system considering the implementation of the system. The control system delay is composed of the delay caused by multi-task scheduling of operating system, the delay caused by network communication, and the delay caused by the asynchronous between them. Through simulation tests based on CAN(Controller Area Network), the proposed end-to-end delay in worst case is validated. Additionally, online clock synchronization algorithm is proposed here for the control system. Through another simulation test, the online algorithm is proved to have better performance than offline one in the view of network bandwidth utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

• Restorative Dentistry and Endodontics
• /
• v.38 no.3
• /
• pp.119-127
• /
• 2013

The purpose of a root-end filling is to establish a seal between the root canal space and the periradicular tissues. As root-end filling materials come into contact with periradicular tissues, knowledge of the tissue response is crucial. Almost every available dental restorative material has been suggested as the root-end material of choice at a certain point in the past. This literature review on root-end filling materials will evaluate and comparatively analyse the biocompatibility and tissue response to these products, with primary focus on newly introduced materials.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.05a
• /
• pp.394-397
• /
• 2018

최근 인공지능 연구가 활발하게 진행이 되면서 여러 기업에서 자율 주행연구도 활발하게 진행되고 있다. 하지만 실제 상황에서 자동차 주행 데이터를 얻기에는 여러 위험사항들과 경제적인 낭비가 있다. 그렇기 때문에 게임 상에서 데이터를 수집하고 딥러닝을 이용해 학습을 하기로 했다. 본 논문에서는 실제 세계와 유사한 환경을 가지고 있는 자동차 게임을 이용하여 자율 주행을 시도 했다. 자율 주행 시 많이 쓰이는 End to End 방법으로 데이터를 수집하면 두 가지 데이터가 저장된다. 하나는 이미지 데이터고 두 번째는 방향키 데이터다. 이러한 데이터들을 numpy 타입으로 40분간 데이터를 수집한 후 딥러닝에 많이 쓰이는 tensorflow를 사용하여 구현한 CNN을 이용하여 학습이 되는 것을 확인을 하고 91.9%의 정확도를 얻었다. 이를 기반으로 실세계에서의 사용 가능성을 확인했다.

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

Implementation possibility of inline dispersion management (DM) using bi-end schemes, which consist of one single mode fiber (SMF) and two dispersion compensating fiber (DCF) placed at front and rear of SMF, respectively, is investigated for compensating total dispersion accumulated in a span of WDM transmission links. It is confirmed that if net residual dispersion (NRD) is decided to be ${\pm}10\;ps/nm$ then bi-end scheme is effective to compensate for WDM channels with wide launching power range.

• Bulletin of the Korean Chemical Society
• /
• v.3 no.2
• /
• pp.44-49
• /
• 1982

Dynamic and equilibrium structures of a polymer chain immersed in solvent molecules have been investigated by a molecular dynamic method. The calculation employs the Lennard-Jones potential function to represent the interactions between two solvent molecules (SS) and between a constituent particle (monomer unit) of the polymer chain and a solvent molecule (CS) as well as between two non-nearest neighbor constituent particles of the polymer chain (CC), while the chemical bond for nearest neighbor constituent particles was chosen to follow a harmonic oscillator potential law. The correlation function for the SS, CS and CC pairs, the end-to-end distance square and the radius of gyration square were calculated by varying the chain length (= 5, 10, 15, 20). The computed end-to-end distance square and the radius of gyration square were found to be in a fairly good agreement with the corresponding results from the random-flight model. Unlike earlier works, the present simulation rsesult shows that the autocorrelation function of radius of gyration square decays slower than that of the end-to-end distance square.

• Bulletin of the Korean Chemical Society
• /
• v.22 no.8
• /
• pp.827-832
• /
• 2001

The excitation temperature and electron number density have been measured for end-on-view ICP discharge. In this work, end-on-view ICP-AES equipped with the newly developed “optical plasma interface (OPI)” was used to eliminate or remove the neg ative effects caused by end-on-plasma source. The axial excitation temperature was measured using analyte (Fe I) emission line data obtained with end-on-view ICP-AES. The axial electron number density was calculated by Saha-Eggert ionization equilibrium theory. In the present study, the effects of forward power, nebulizer gas flow rate and the presence of Na on the excitation temperature and electron number density have been investigated. For sample introduction, two kinds of nebulizers (pneumatic and ultrasonic nebulizer) were utilized.

• Journal of Internet Computing and Services
• /
• v.22 no.5
• /
• pp.9-16
• /
• 2021

Recently, the traffic volume of mobile communications increases rapidly and the small-cell is one of the solutions using two offload schemes, i.e., local IP access (LIPA) and selected IP traffic offload (SIPTO), to reduce the end-to-end delay and amount of mobile data traffic in the core network (CN). However, 3GPP describes the concept of LIPA and SIPTO and there is no decision algorithm to decide the path from source nodes (SNs) to destination nodes (DNs). Therefore, this paper proposes a dynamic mobile data traffic offload scheme using small-cells to decide the path based on the SN and DN, i.e., macro user equipment, small-cell user equipment (SUE), and multimedia server, and type of the mobile data traffic for the real-time and non-real-time. Through analytical models, it is shown that the proposed offload scheme outperforms the conventional small-cell network in terms of the delay of end-to-end mobile data communications and probability of the mobile data traffic in the CN for the heterogeneous networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.9
• /
• pp.1267-1270
• /
• 2021

In this paper, we propose a distributed routing algorithm for mobile ad hoc networks (MANET) where mobile devices can be utilized as relays for communication between remote source-destination nodes. The objective of the proposed algorithm is to minimize the end-to-end communication delay caused by transmission failure with deep channel fading. In each hop, the node needs to select the next relaying node by considering a tradeoff relationship between the link stability and forward link distance. Based on such feature, we formulate the problem with partially observable Markov decision process (MDP) and apply deep reinforcement learning to derive effective routing strategy for the formulated MDP. Simulation results show that the proposed algorithm outperforms other baseline schemes in terms of the average end-to-end delay.