• Title/Summary/Keyword: Search and Identification

Search Result 507, Processing Time 0.034 seconds

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

  • Seo, Jung-Chul;Kim, Min-Jung;Lee, Chan;Leem, Kang-Hyun
    • The Korea Journal of Herbology
    • /
    • v.21 no.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 (개선된 공간 탐색 알고리즘을 이용한 정보입자 기반 퍼지모델 설계)

  • Oh, Sung-Kwun;Kim, Hyun-Ki
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.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 (스캔 만화도서 식별 및 특징 검색 시스템)

  • Lee, Sang-Hoon;Choi, Nakyeon;Lee, Sanghoon
    • Journal of KIISE:Databases
    • /
    • v.41 no.4
    • /
    • pp.199-208
    • /
    • 2014
  • In this paper, we represent a system of identification and feature search for scanned comics in consideration of their content characteristics. For creating the feature of the scanned comics, we utilize a method of hierarchical symmetry fingerprinting. Proposed identification and search system is designed to give online service provider, such as Webhard, an immediate identification result under conditions of huge volume of the scanned comics. In simulation part, we analyze the robustness of the identification of the fingerprint to image modification such as rotation and translation. Also, we represent a structure of database for fast matching in feature point database, and compare search performance between other existing searching methods such as full-search and most significant feature search.

Hybrid evolutionary identification of output-error state-space models

  • Dertimanis, Vasilis K.;Chatzi, Eleni N.;Spiridonakos, Minas D.
    • Structural Monitoring and Maintenance
    • /
    • v.1 no.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.

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

  • Lee, Tae-bong;Shon, Jin-geun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.65 no.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.

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

  • Lee, Tae-Bong
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.6
    • /
    • pp.636-642
    • /
    • 2015
  • This paper presents an application of heuristic harmony search (HS) optimization algorithm for the identification of linear continuous time-delay system from step response. Identification model is first-order plus dead time (FOPDT), which describes a linear monotonic process quite well in most chemical processes and HAVC process and is often sufficient for PID controller tuning. 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 identification method has been demonstrated through a number of simulation examples.

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
    • /
    • v.6 no.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
    • /
    • v.1 no.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
    • /
    • v.60 no.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
    • /
    • v.9 no.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.