• Title/Summary/Keyword: Pair Selection

Search Result 126, Processing Time 0.026 seconds

Estimation of Effective Population Size in the Sapsaree: A Korean Native Dog (Canis familiaris)

  • Alam, M.;Han, K.I.;Lee, D.H.;Ha, J.H.;Kim, J.J.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.25 no.8
    • /
    • pp.1063-1072
    • /
    • 2012
  • Effective population size ($N_e$) is an important measure to understand population structure and genetic variability in animal species. The objective of this study was to estimate $N_e$ in Sapsaree dogs using the information of rate of inbreeding and genomic data that were obtained from pedigree and the Illumina CanineSNP20 (20K) and CanineHD (170K) beadchips, respectively. Three SNP panels, i.e. Sap134 (20K), Sap60 (170K), and Sap183 (the combined panel from the 20K and 170K), were used to genotype 134, 60, and 183 animal samples, respectively. The $N_e$ estimates based on inbreeding rate ranged from 16 to 51 about five to 13 generations ago. With the use of SNP genotypes, two methods were applied for $N_e$ estimation, i.e. pair-wise $r^2$ values using a simple expectation of distance and $r^2$ values under a non-linear regression with respective distances assuming a finite population size. The average pair-wise $N_e$ estimates across generations using the pairs of SNPs that were located within 5 Mb in the Sap134, Sap60, and Sap183 panels, were 1,486, 1,025 and 1,293, respectively. Under the non-linear regression method, the average $N_e$ estimates were 1,601, 528, and 1,129 for the respective panels. Also, the point estimates of past $N_e$ at 5, 20, and 50 generations ago ranged between 64 to 75, 245 to 286, and 573 to 646, respectively, indicating a significant $N_e$ reduction in the last several generations. These results suggest a strong necessity for minimizing inbreeding through the application of genomic selection or other breeding strategies to increase $N_e$, so as to maintain genetic variation and to avoid future bottlenecks in the Sapsaree population.

Putative Secondary Structure of Human Hepatitis B Viral X mRNA

  • Kim, Ha-Dong;Choi, Yoon-Chul;Lee, Bum-Yong;Junn, Eun-Sung;Ahn, Jeong-Keun;Kang, Chang-Won;Park, In-Won
    • BMB Reports
    • /
    • v.28 no.6
    • /
    • pp.509-514
    • /
    • 1995
  • A putative secondary structure of the mRNA for the human hepatitis B virus (HBV) X gene is proposed based on not only chemical and enzymatic determination of its single- and double-stranded regions but also selection by the computer program MFOLD for energy minimum conformation under the constraints that the experimentally determined nucleotides were forced or prohibited to base pair. An RNA of 536 nucleotides including the 461-nucleotide HBV X mRNA sequence was synthesized in vitro by the phage T7 RNA polymerase transcription. The thermally renatured transcripts were subjected to chemical modifications with dimethylsulfate and kethoxal and enzymatic hydrolysis with single strand-specific RNase T1 and double strand-specific RNase V1, separately. The sites of modification and cleavage were detected by reverse transcriptase extension of 4 different primers. Many nucleotides could be assigned with high confidence, twenty in double-stranded and thirty-seven in Single-stranded regions. These nucleotides were forced and prohibited, respectively, to base pair in running the recursive RNA folding program MFOLD. The results suggest that 6 different regions (5 within X mRNA) of 14~23 nucleotides are Single-stranded. This putative structure provides a good working model and suggests potential target sites for antisense and ribozyme inhibitors and hybridization probes for the HBV X mRNA.

  • PDF

A Fingerprint Identification System using Large Database (대용량 DB를 사용한 지문인식 시스템)

  • Cha, Jeong-Hee;Seo, Jeong-Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.203-211
    • /
    • 2005
  • In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps; preprocessing, classification, and matching, in the classification. we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

  • PDF

Accuracy Analysis of DEMs Generated from High Resolution Optical and SAR Images (고해상도 광학영상과 SAR영상으로부터 생성된 수치표고모델의 정확도 분석)

  • Kim, Chung;Lee, Dong-Cheon;Yom, Jae-Hong;Lee, Young-Wook
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2004.04a
    • /
    • pp.337-343
    • /
    • 2004
  • Spatial information could be obtained from spaceborne high resolution optical and synthetic aperture radar(SAR) images. However, some satellite images do not provide physical sensor information instead, rational polynomial coefficients(RPC) are available. The objectives of this study are: (1) 3-dimensional ground coordinates were computed by applying rational function model(RFM) with the RPC for the stereo pair of Ikonos images and their accuracy was evaluated. (2) Interferometric SAR(InSAR) was applied to JERS-1 images to generate DEM and its accuracy was analysis. (3) Quality of the DEM generated automatically also analyzed for different types of terrain in the study site. The overall accuracy was evaluated by comparing with GPS surveying data. The height offset in the RPC was corrected by estimating bias. In consequence, the accuracy was improved. Accuracy of the DEMs generated from InSAR with different selection of GCP was analyzed. In case of the Ikonos images, the results show that the overall RMSE was 0.23327", 0.l1625" and 13.70m in latitude, longitude and height, respectively. The height accuracy was improved after correcting the height offset in the RPC. i.e., RMSE of the height was 1.02m. As for the SAR image, RMSE of the height was 10.50m with optimal selection of GCP. For the different terrain types, the RMSE of the height for urban, forest and flat area was 23.65m, 8.54m, 0.99m, respectively for Ikonos image while the corresponding RMSE was 13.82m, 18.34m, 10.88m, respectively lot SAR image.

  • PDF

A Buffer-Aided Successive Relaying Technique with a Priori Decoding Information (선행 복호 정보를 활용한 버퍼기반 연쇄적 중계 기법)

  • Lee, Byeong Su;Jung, Bang Chul;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.2
    • /
    • pp.275-280
    • /
    • 2016
  • In this paper, we propose a novel relay selection technique which utilizes a priori decoding information at relays for buffer-aided successive relaying networks. In the conventional relaying schemes, a single relay pair is selected for receiving data from the source and transmitting data to the destination. In the proposed technique, however, all relays except the relay selected for transmitting data to the destination try to decode the received signal from the source, and they store the data if they succeed decoding. The proposed technique selects the relay such that it can succeed its own transmission and it maximizes the number of relays successfully decoding the data from the source at the same time. It is shown that the proposed relaying technique significantly outperforms the conventional buffer-aided relaying schemes in terms of outage probability through extensive computer simulations.

3-D Sound Source Localization using Energy-Based Region Selection and TDOA (에너지 기반 영역 선택과 TDOA에 의한 3차원 음원 위치 추정)

  • Yiwere, Mariam;Rhee, Eun Joo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.2
    • /
    • pp.294-300
    • /
    • 2017
  • This paper proposes a method for 3-D sound source localization (SSL) using region selection and TDOA. 3-D SSL involves the estimation of an azimuth angle and an elevation angle. With the aim of reducing the computation time, we compare signal energies to select one out of three regions. In the selected region, we compute only one TDOA value for the azimuth angle estimation. Also, to estimate the vertical angle, we choose the higher energy signal from the selected region and pair it up with the elevated microphone's signal for TDOA computation and elevation angle estimation. Our experimental results show that the proposed method achieves average error values of $0.778^{\circ}$ in azimuth and $1.296^{\circ}$ in elevation, which is similar to other methods. The method uses one energy comparison and two TDOA computations therefore, the total processing time is reduced.

Numerical Study on the Gap Flow of a Rudder System with Bisymmetric Blocking Bar (차단 봉이 혼과 타판 사이에 대칭으로 배치된 타의 틈새유동 수치해석)

  • Oh, Jung-Keun;Seo, Dae-Won;Kim, Hyo-Chul
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.46 no.5
    • /
    • pp.460-470
    • /
    • 2009
  • In recent practice a half round prismatic bar has fillet welded or formed through foundry work along the centerline on rear concave surface of the horn to mitigate gap flow between fixed and movable part of the rudder system. When the gap clearance has been blocked with this practice, numerical simulations indicate that the practices are not only effective in reducing the gap flow but also in mitigating the cavitation. The blocking effects are remarkably improved when a pair of blocking bar is bisymmetrically attached with respect to centerline on the opposite convex surface of the movable part. The blocking bar could be placed on the exposed surface under maximum rudder angle. This implies that the blocking bar could be easily adopted not only in a design stage but also in a maintenance stage for mitigating rudder cavitation. In addition, the numerical simulations imply that more improvements could be anticipated through the selection of section shape of prismatic bar for gap flow blocking.

Selection and Characterization of Pseudomonas aeruginosa EMS1 Mutant strain Showing Enhanced Biosurfactant Production

  • Cha, Mi-Sun;Lee, Kuen-Hee;Lee, Na-Eun;Lee, Sang-Joon
    • 한국생물공학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.434-437
    • /
    • 2003
  • A new bacterial strain, was isolated from activated sludge, identified and named P. aeruginosa EMS1. The new strain produced surface-active rhamnolipids by batch cultivation in mineral salts medium with waste flying oils. The mutant strain KH7, designated P. aeruginosa EMS1, derived by random mutagenesis with N-methyl-N-nitro-N-nitrosogoanidine treatment producing high levels of the biosurfactants was selected by an ion-pair plate assay. The mutant strain KH7 showed 4-5 times more hydrocarbon emulsification as compared to the parent when grown on waste frying oils and various hydrocarbons. Furthermore, P. aeruginosa EMS1 and mutant strain KH7 was also able to use whey as a co-substrate for growth and biosurfactant production. As results of this study, mutant strain KH7 is a very efficient biosurfactant producer, and its culture conditions are relatively inexpensive and economical. Rhamnolipid is synthesized by the rhlAB-encoded rhamnosyltransferase. To be convinced of these genes, we performed PCR based on P. aeruginosa PAO1 whole-genome database. rhl gene cluster nucleotide and amino acid sequences were compared for both parent and mutant. Comparison of nucleotide sequence of rhlAB, there were usually terminal's codons exchange.

  • PDF

Question Classification Based on Word Association for Question and Answer Archives (질문대답 아카이브에서 어휘 연관성을 이용한 질문 분류)

  • Jin, Xueying;Lee, Kyung-Soon
    • The KIPS Transactions:PartB
    • /
    • v.17B no.4
    • /
    • pp.327-332
    • /
    • 2010
  • Word mismatch is the most significant problem that causes low performance in question classification, whose questions consist of only two or three words that expressed in many different ways. So, it is necessary to apply word association in question classification. In this paper, we propose question classification method using translation-based language model, which use word translation probabilities for question-question pair that is learned in the same category. In the experiment, we prove that translation probabilities of question-question pairs in the same category is more effective than question-answer pairs in total collection.

Recursive compensation algorithm application to the optimal edge selection

  • Chung, C.H.;Lee, K.S.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.79-84
    • /
    • 1992
  • Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the optimal collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy and a traveling salesman problem strategy (TSP). The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Hopfield Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is used to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm.

  • PDF