• 제목/요약/키워드: Search and Identification

검색결과 507건 처리시간 0.029초

Cervus elaphus 종의 sequencing과 BLAST search에 의한 감별 (Identification of Cervus elaphus Species by Sequencing Analysis and BLAST Search)

  • 서정철;김민정;이찬;임강현
    • 대한본초학회지
    • /
    • 제21권2호
    • /
    • pp.129-133
    • /
    • 2006
  • Objectives : Cervus elaphus species are some of the most medicinally important genera in the Oriental medicine. This study was performed to determine if Cenvus elaphus species could be identified by sequencing analysis and to verify Basic Local Alignment Search Tool (BLAST) search, which was used to assess genetic identification. Methods : The DNAs of Cervus elaphus species were extracted, amplified by PCR, and sequenced. The DNAs of Cervus species were identified by BLAST search in website. Results : By BLAST search one of Cervus elaphus species was identified as Cervus elaphussibericus but the other was identified as Cervus elaphus nelsoni. This work showed that identification can efficiently be performed by BLAST search. Conclusion : These results suggest that sequencing following BLAST search might be able to provide the identification of Cervus elaphus species.

  • PDF

개선된 공간 탐색 알고리즘을 이용한 정보입자 기반 퍼지모델 설계 (Design of IG-based Fuzzy Models Using Improved Space Search Algorithm)

  • 오성권;김현기
    • 한국지능시스템학회논문지
    • /
    • 제21권6호
    • /
    • pp.686-691
    • /
    • 2011
  • This study is concerned with the identification of fuzzy models. To address the optimization of fuzzy model, we proposed an improved space search evolutionary algorithm (ISSA) which is realized with the combination of space search algorithm and Gaussian mutation. The proposed ISSA is exploited here as the optimization vehicle for the design of fuzzy models. Considering the design of fuzzy models, we developed a hybrid identification method using information granulation and the ISSA. Information granules are treated as collections of objects (e.g. data) brought together by the criteria of proximity, similarity, or functionality. The overall hybrid identification comes in the form of two optimization mechanisms: structure identification and parameter identification. The structure identification is supported by the ISSA and C-Means while the parameter estimation is realized via the ISSA and weighted least square error method. A suite of comparative studies show that the proposed model leads to better performance in comparison with some existing models.

스캔 만화도서 식별 및 특징 검색 시스템 (An Identification and Feature Search System for Scanned Comics)

  • 이상훈;최낙연;이상훈
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제41권4호
    • /
    • pp.199-208
    • /
    • 2014
  • 본 논문에서는 스캔된 만화의 콘텐츠 특성을 고려한 식별 및 특징 검색 시스템을 제안하였다. 스캔 만화의 특징점을 생성하기 위해서 계층적 대칭 핑거프린팅 방법을 활용하였다. 제안하는 핑거프린트 식별 및 검색 시스템은 웹하드와 같은 온라인 서비스 제공자들이 대량의 스캔만화에 대하여 즉각적인 식별 결과를 얻을 수 있도록 설계되었다. 실험에서는 회전, 이동 등의 이미지 변형에 대해서 핑거프린트의 식별 강인성에 대하여 분석하였다. 또한 특징점 데이터베이스에서의 빠른 매칭을 위한 데이터베이스 구조를 제안하였고, 전역 검색 및 최대중요특징 검색과 같은 기존의 다른 검색방법과 성능을 비교하였다.

Hybrid evolutionary identification of output-error state-space models

  • Dertimanis, Vasilis K.;Chatzi, Eleni N.;Spiridonakos, Minas D.
    • Structural Monitoring and Maintenance
    • /
    • 제1권4호
    • /
    • pp.427-449
    • /
    • 2014
  • A hybrid optimization method for the identification of state-space models is presented in this study. Hybridization is succeeded by combining the advantages of deterministic and stochastic algorithms in a superior scheme that promises faster convergence rate and reliability in the search for the global optimum. The proposed hybrid algorithm is developed by replacing the original stochastic mutation operator of Evolution Strategies (ES) by the Levenberg-Marquardt (LM) quasi-Newton algorithm. This substitution results in a scheme where the entire population cloud is involved in the search for the global optimum, while single individuals are involved in the local search, undertaken by the LM method. The novel hybrid identification framework is assessed through the Monte Carlo analysis of a simulated system and an experimental case study on a shear frame structure. Comparisons to subspace identification, as well as to conventional, self-adaptive ES provide significant indication of superior performance.

HS 최적화 알고리즘을 이용한 계단응답과 연속시스템 인식 (Identification of Continuous System from Step Response using HS Optimization Algorithm)

  • 이태봉;손진근
    • 전기학회논문지P
    • /
    • 제65권4호
    • /
    • pp.292-297
    • /
    • 2016
  • The first-order plus dead time(FOPDT) and second-order plus dead time(SOPDT), which describes a linear monotonic process quite well in most chemical and industrial processes and is often sufficient for PID and IMC controller tuning. This paper presents an application of heuristic harmony search(HS) optimization algorithm to the identification of linear continuous time-delay systems from step response. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through a number of simulation examples.

HS 알고리즘을 이용한 계단응답으로부터 FOPDT 모델 인식 (Identification of First-order Plus Dead Time Model from Step Response Using HS Algorithm)

  • 이태봉
    • 한국항행학회논문지
    • /
    • 제19권6호
    • /
    • pp.636-642
    • /
    • 2015
  • 본 논문에서는 계단응답으로부터 시 지연을 갖는 선형 연속시스템을 식별하기 위해 HS 최적화 알고리즘을 적용에 관하여 연구하였다. 인식 모델은 1차 시 지연 모델 (FOPDT)로써, FOPDT은 많은 화학 공정과 HAVC 공정에 실효성이 있으며 PID 튜닝에도 적합하다. 최근에 개발된 HS 알고리즘은 완벽한 하모니를 찾아가는 음악적 과정을 개념화 한 것이다. 수학을 기반으로 하는 전통적 기법과 달리 HS는 확률적인 방법을 사용하므로 미분과 같은 수학적 접근을 필요로 하지 않는다. 제시된 인식 방법의 효과를 입증하기 위해 많은 수치 예를 수행하여 결과를 제시하였다.

Identification of Fuzzy Inference Systems Using a Multi-objective Space Search Algorithm and Information Granulation

  • Huang, Wei;Oh, Sung-Kwun;Ding, Lixin;Kim, Hyun-Ki;Joo, Su-Chong
    • Journal of Electrical Engineering and Technology
    • /
    • 제6권6호
    • /
    • pp.853-866
    • /
    • 2011
  • We propose a multi-objective space search algorithm (MSSA) and introduce the identification of fuzzy inference systems based on the MSSA and information granulation (IG). The MSSA is a multi-objective optimization algorithm whose search method is associated with the analysis of the solution space. The multi-objective mechanism of MSSA is realized using a non-dominated sorting-based multi-objective strategy. In the identification of the fuzzy inference system, the MSSA is exploited to carry out parametric optimization of the fuzzy model and to achieve its structural optimization. The granulation of information is attained using the C-Means clustering algorithm. The overall optimization of fuzzy inference systems comes in the form of two identification mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and the polynomial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by the MSSA and C-Means, whereas the parameter identification is realized via the MSSA and least squares method. The evaluation of the performance of the proposed model was conducted using three representative numerical examples such as gas furnace, NOx emission process data, and Mackey-Glass time series. The proposed model was also compared with the quality of some "conventional" fuzzy models encountered in the literature.

Reinterpretation of the protein identification process for proteomics data

  • Kwon, Kyung-Hoon;Lee, Sang-Kwang;Cho, Kun;Park, Gun-Wook;Kang, Byeong-Soo;Park, Young-Mok
    • Interdisciplinary Bio Central
    • /
    • 제1권3호
    • /
    • pp.9.1-9.6
    • /
    • 2009
  • Introduction: In the mass spectrometry-based proteomics, biological samples are analyzed to identify proteins by mass spectrometer and database search. Database search is the process to select the best matches to the experimental mass spectra among the amino acid sequence database and we identify the protein as the matched sequence. The match score is defined to find the matches from the database and declare the highest scored hit as the most probable protein. According to the score definition, search result varies. In this study, the difference among search results of different search engines or different databases was investigated, in order to suggest a better way to identify more proteins with higher reliability. Materials and Methods: The protein extract of human mesenchymal stem cell was separated by several bands by one-dimensional electrophorysis. One-dimensional gel was excised one by one, digested by trypsin and analyzed by a mass spectrometer, FT LTQ. The tandem mass (MS/MS) spectra of peptide ions were applied to the database search of X!Tandem, Mascot and Sequest search engines with IPI human database and SwissProt database. The search result was filtered by several threshold probability values of the Trans-Proteomic Pipeline (TPP) of the Institute for Systems Biology. The analysis of the output which was generated from TPP was performed. Results and Discussion: For each MS/MS spectrum, the peptide sequences which were identified from different conditions such as search engines, threshold probability, and sequence database were compared. The main difference of peptide identification at high threshold probability was caused by not the difference of sequence database but the difference of the score. As the threshold probability decreases, the missed peptides appeared. Conversely, in the extremely high threshold level, we missed many true assignments. Conclusion and Prospects: The different identification result of the search engines was mainly caused by the different scoring algorithms. Usually in proteomics high-scored peptides are selected and low-scored peptides are discarded. Many of them are true negatives. By integrating the search results from different parameter and different search engines, the protein identification process can be improved.

Structural damage identification using gravitational search algorithm

  • Liu, J.K.;Wei, Z.T.;Lu, Z.R.;Ou, Y.J.
    • Structural Engineering and Mechanics
    • /
    • 제60권4호
    • /
    • pp.729-747
    • /
    • 2016
  • This study aims to present a novel optimization algorithm known as gravitational search algorithm (GSA) for structural damage detection. An objective function for damage detection is established based on structural vibration data in frequency domain, i.e., natural frequencies and mode shapes. The feasibility and efficiency of the GSA are testified on three different structures, i.e., a beam, a truss and a plate. Results show that the proposed strategy is efficient for determining the locations and the extents of structural damages using the first several modal data of the structure. Multiple damages cases in different types of structures are studied and good identification results can be obtained. The effect of measurement noise on the identification results is investigated.

Identification of flutter derivatives of bridge decks using stochastic search technique

  • Chen, Ai-Rong;Xu, Fu-You;Ma, Ru-Jin
    • Wind and Structures
    • /
    • 제9권6호
    • /
    • pp.441-455
    • /
    • 2006
  • A more applicable optimization model for extracting flutter derivatives of bridge decks is presented, which is suitable for time-varying weights for fitting errors and different lengths of vertical bending and torsional free vibration data. A stochastic search technique for searching the optimal solution of optimization problem is developed, which is more convenient in understanding and programming than the alternate iteration technique, and testified to be a valid and efficient method using two numerical examples. On the basis of the section model test of Sutong Bridge deck, the flutter derivatives are extracted by the stochastic search technique, and compared with the identification results using the modified least-square method. The Empirical Mode Decomposition method is employed to eliminate noise, trends and zero excursion of the collected free vibration data of vertical bending and torsional motion, by which the identification precision of flutter derivatives is improved.