• Title/Summary/Keyword: Sequence Selection

Search Result 479, Processing Time 0.029 seconds

Fault Phase Selection Algorithm using Unit Vector of Sequence Voltages for Transmission Line Protection (대칭분 전압 단위 벡터를 이용한 송전선로 보호용 고장상 선택 알고리즘)

  • Lee, Myeong-Su;Lee, Jae-Gyu;Kim, Su-Nam;Yu, Seok-Gu
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.9
    • /
    • pp.460-466
    • /
    • 2002
  • A reliable fault phase selection algorithm plays a very important role in transmission line protection, Particularly in Extra High Voltage (EHV) networks. The conventional fault phase selection algorithm used the phase difference between positive and negative sequence current excluding load current. But, it is difficult to pick out only fault current since we can not know when a fault occurs and select the fault phase in weak-infeed conditions that dominate zero-sequence current in phase current. The proposed algorithm can select the accurately fault phase using the sum of unit vectors which are calculated by positive-sequence voltage and negative-sequence voltage.

Survey on Nucleotide Encoding Techniques and SVM Kernel Design for Human Splice Site Prediction

  • Bari, A.T.M. Golam;Reaz, Mst. Rokeya;Choi, Ho-Jin;Jeong, Byeong-Soo
    • Interdisciplinary Bio Central
    • /
    • v.4 no.4
    • /
    • pp.14.1-14.6
    • /
    • 2012
  • Splice site prediction in DNA sequence is a basic search problem for finding exon/intron and intron/exon boundaries. Removing introns and then joining the exons together forms the mRNA sequence. These sequences are the input of the translation process. It is a necessary step in the central dogma of molecular biology. The main task of splice site prediction is to find out the exact GT and AG ended sequences. Then it identifies the true and false GT and AG ended sequences among those candidate sequences. In this paper, we survey research works on splice site prediction based on support vector machine (SVM). The basic difference between these research works is nucleotide encoding technique and SVM kernel selection. Some methods encode the DNA sequence in a sparse way whereas others encode in a probabilistic manner. The encoded sequences serve as input of SVM. The task of SVM is to classify them using its learning model. The accuracy of classification largely depends on the proper kernel selection for sequence data as well as a selection of kernel parameter. We observe each encoding technique and classify them according to their similarity. Then we discuss about kernel and their parameter selection. Our survey paper provides a basic understanding of encoding approaches and proper kernel selection of SVM for splice site prediction.

Negative Selection Algorithm for DNA Sequence Classification

  • Lee, Dong Wook;Sim, Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.2
    • /
    • pp.231-235
    • /
    • 2004
  • According to revealing the DNA sequence of human and living things, it increases that a demand on a new computational processing method which utilizes DNA sequence information. In this paper we propose a classification algorithm based on negative selection of the immune system to classify DNA patterns. Negative selection is the process to determine an antigenic receptor that recognize antigens, nonself cells. The immune cells use this antigen receptor to judge whether a self or not. If one composes n group of antigenic receptor for n different patterns, they can classify into n patterns. In this paper we propose a pattern classification algorithm based on negative selection in nucleotide base level and amino acid level.

Development of Automatic Selection of Assembly Direction and Assembly Sequence Correction System (조립 방향 자동 판별 및 조립 순서 자동 수정 시스템 개발)

  • Park, Hong-Seok;Park, Jin-Woo
    • Korean Journal of Computational Design and Engineering
    • /
    • v.18 no.6
    • /
    • pp.417-427
    • /
    • 2013
  • Assembly direction is used in order to confirm the generated assembly sequences in an automatic assembly sequence planning system. Moreover, assembly sequence planners can ascertain the feasibility of a sequence during simulation with assembly direction based in a CAD environment. In other words, assembly direction is essential for sequence optimizing and automatic generation. Based on the importance of assembly direction, this paper proposes a method to select the best direction for the generated assembly sequence using disassembly simulation and geometrical common area between assembled parts. Simultaneously, this idea can be applied to verify the generated assembly sequence. In this paper, the automatic selection of assembly direction and sequence correction system is designed and implemented. The developed algorithms and the implemented system are verified based on case study in the CAD environment.

Phase Selection Algorithm using Sequence Voltages for Transmission Line Protection (대칭분 전압을 이용한 송전선로 보호용 고장상 선택 알고리즘)

  • Lee, Myoung-Soo;Kim, Soo-Nam;Lee, Jae-Gyu;You, Seok-Ku
    • Proceedings of the KIEE Conference
    • /
    • 2001.11b
    • /
    • pp.124-126
    • /
    • 2001
  • A reliable fault type identification (phase selection) plays a very important role in transmission line protection, particularly in Extra High Voltage(EHV) networks. The conventional fault type identification algorithm used the phase difference between positive and negative sequence current excluding load current. But, it is difficult to pick out only fault current since we can not know when a fault occurs and identify the fault type in weak-infeed conditions that dominate zero-sequence current in phase current. The proposed algorithm can identify the accurately fault type using the sum of unit vectors which are calculated by positive-sequence votage and negative-sequence voltage.

  • PDF

A Study on the Optimization of Drilling Operations(II): Optimum Drilling Sequence Selection for Producing a Hole (드릴가공 최적화에 대한 연구(2): 구멍가공시 최적의 드릴가공 순서 결정)

  • Rou, Hoi-Jin
    • IE interfaces
    • /
    • v.12 no.2
    • /
    • pp.346-353
    • /
    • 1999
  • In this paper, the optimum drilling operation sequence which results into the minimum overall machining time required to produce a (multi-diameter) hole is identified. The operation sequence is defined as the set of ordered operations used for producing a (multi-diameter) hole. The overall machining time is derived by summing the minimum machining times of each operation assigned to a sequence. The operations represent the drilling actions of certain sizes to produce the related holes. The minimum machining time of each operation is obtained by solving the optimization problem. Finally, this paper will identify the effects of machining constraints on the overall machining times and their relationships to sequence selection.

  • PDF

A Study on the Footholds Selection for Quadruped Walking Vehicle (4족 보행 로봇의 착지점 선정에 관한 연구)

  • 정경민;박윤창
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.7-10
    • /
    • 2000
  • Inadequate footholds selection may result in deadlock state where the walking vehicle can not anymore to the desired direction. This paper concerns about the footholds selection for quadruped v, vehicle to walk with the leg lifting sequence of crawl gait which is desired for straight motion. supporting states for lifting a leg are defined and the proper supporting condition for quadruped c: also proposed. When selecting a footholds of swing leg within the proposed footholds searching are; supporting states after the swing legs are placed, satisfy the proper supporting condition. So it can I for quadruped to execute continuous walking with the lifting sequence of crawl gait.

  • PDF

One-Step Selection of Artificial Transcription Factors Using an In Vivo Screening System

  • Bae, Kwang-Hee;Kim, Jin-Soo
    • Molecules and Cells
    • /
    • v.21 no.3
    • /
    • pp.376-380
    • /
    • 2006
  • Gene expression is regulated in large part at the level of transcription under the control of sequence-specific transcriptional regulatory proteins. Therefore, the ability to affect gene expression at will using sequencespecific artificial transcription factors would provide researchers with a powerful tool for biotechnology research and drug discovery. Previously, we isolated 56 novel sequence-specific DNA-binding domains from the human genome by in vivo selection. We hypothesized that these domains might be more useful for regulating gene expression in higher eukaryotic cells than those selected in vitro using phage display. However, an unpredictable factor, termed the "context effect", is associated with the construction of novel zinc finger transcription factors--- DNA-binding proteins that bind specifically to 9-base pair target sequences. In this study, we directly selected active artificial zinc finger proteins from a zinc finger protein library. Direct in vivo selection of constituents of a zinc finger protein library may be an efficient method for isolating multi-finger DNA binding proteins while avoiding the context effect.

Generation of Cutting Layers and Tool Selection for 3D Pocket Machining (3차원 포켓가공을 위한 절삭층 형성 및 공구선정)

  • 경영민;조규갑
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.9
    • /
    • pp.101-110
    • /
    • 1998
  • In process planning for 3D pocket machining, the critical issues for the optimal process planning are the generation of cutting layers and the tool selection for each cutting layers as well as the other factors such as the determination of machining types, tool path, etc. This paper describes the optimal tool selection on a single cutting layer for 2D pocket machining, the generation of cutting layers for 3D pocket machining, the determination of the thickness of each cutting layers, the determination of the tool combinations for each cutting layers and also the development of an algorithm for determining the machining sequence which reduces the number of tool exchanges, which are based on the backward approach. The branch and bound method is applied to select the optimal tools for each cutting layer, and an algorithmic procedure is developed to determine the machining sequence consisting of the pairs of the cutting layers and cutting tools to be used in the same operation.

  • PDF

An Adaptive Data Compression Algorithm for Video Data (사진데이타를 위한 한 Adaptive Data Compression 방법)

  • 김재균
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.12 no.2
    • /
    • pp.1-10
    • /
    • 1975
  • This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

  • PDF