• Title/Summary/Keyword: sequence.

Search Result 17,705, Processing Time 0.047 seconds

ON FUZZY UNIFORM CONVERGENCE

  • Kong, Jae Eung;Cho, Sung Ki
    • Korean Journal of Mathematics
    • /
    • v.5 no.1
    • /
    • pp.1-8
    • /
    • 1997
  • In this note, we study on fuzzy uniform convergences of sequences of fuzzy numbers, and sequences of fuzzy functions.

  • PDF

Basic and Advanced MR Pulse Sequence - Fundamental Understanding-

  • 장용민
    • Proceedings of the KSMRM Conference
    • /
    • 2002.11a
    • /
    • pp.15-29
    • /
    • 2002
  • MRI에서 펄스 시퀀스(pulse sequence)란 고주파 RF(radiofrequency) 펄스 및 경사자장(gradient) 펄스를 가하고 MR 신호를 획득하는 순서를 시간대별로 도식화 한 pulse diagram을 이야기한다. 이러한 pulse sequence는 실제로 영상을 획득하기 위한 RF amplifier, gradient amplifier 등의 하드웨어를 순차적(sequential)으로 구동하는 역할을 한다. 따라서 이러한 pulse sequence는 현재 임상적으로 사용되는 다양한 영상기법들을 이해하는데 필수적이다.

  • PDF

Dummy Sequence Insertion for PAPR Reduction of OFDM Communication System (OFDM 통신시스템의 PAPR 저감을 위한 더미 시퀀스 삽입)

  • 이재은;유흥균;정영호;함영권
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.12
    • /
    • pp.1239-1247
    • /
    • 2003
  • OFDM(orthogonal frequency division multiplexing) communications system is very attractive for the high data rate transmission in the frequency selective lading channel. Since OFDM has high PAPR(peak-to-average power ratio), OFDM signal may be distorted by the nonlinear HPA(high power amplifier). In this paper, we propose the DSI(dummy sequence insertion) method for OFDM communication system. Some sub-carriers are inserted for PAPR reduction. They carry the specified dummy data sequence which are used for only PAPR reduction and do not work as side information like the conventional PTS(partial transmit sequence) or SLM(selected mapping) method. We use the complementary sequence and the combination of the correlation sequence as the dummy sequence. Flipping technique is used for the DSI method to get the effective PAPR reduction. It is important that BER of the proposed method is independent of the damage of the dummy data sequence. And DSI method has better spectral efficiency than the conventional block coding. On the other hand, threshold PAPR method is applied to cut down the processing time. However, this DSI method is not better than the conventional PTS method in the respect of the PAPR reduction performance. The DSI method includes the threshold PAPR lower than the PAPR of the OFDM signal, reduces the processing time and improves the BER performance.

LOTOS Protocol Conformance Testing for Formal Description Specifications (형식 기술 기법에 의한 LOTOS 프로토콜 적합성 시험)

  • Chin, Byoung-Moon;Kim, Sung-Un;Ryu, Young-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1821-1841
    • /
    • 1997
  • This paper presents an automated protocol conformance test sequence generation based on formal methods for LOTOS specification by using and applying many existing related algorithms and technique, such as the testing framework, Rural Chinese Postman tour concepts. We use the state-transition graphs obtained from LOTOS specifications by means of the CAESAR tool. This tool compiles a specification written in LOTOS into an extended Petri net, from which a transition graph of a event finite-state machine(EvFSM) including data is generated. A new characterizing sequence(CS), called Unique Event sequence(UE sequence) is defined. An UE sequence for a state is a sequence of accepted gate events that is unique for this state. Some experiences about UE sequence, partial UE sequence and signature are also explained. These sequences are combined with the concept of the Rural Chinese Postman Tour to obtain an optimal test sequence which is a minimum cost tour of the reference transition graph of the EvFSM. This paper also presents a fault coverage estimation experience of an automated method for optimized test sequences generation and the translation of the test sequence obtained by using our tool to TTCN notation are also given. A prototype of the proposed framework has been built with special attention to real application in order to generated the executable test cases in an automatic way. This formal method on conformance testing can be applied to the protocols related to IN, PCS and ATM for the purpose of verifying the correctness of implementation with respect to the given specification.

  • PDF

A DNA Sequence Alignment Algorithm Using Quality Information and a Fuzzy Inference Method (품질 정보와 퍼지 추론 기법을 이용한 DNA 염기 서열 배치 알고리즘)

  • Kim, Kwang-Baek
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.2
    • /
    • pp.55-68
    • /
    • 2007
  • DNA sequence alignment algorithms in computational molecular biology have been improved by diverse methods. In this paper, we proposed a DNA sequence alignment algorithm utilizing quality information and a fuzzy inference method utilizing characteristics of DNA sequence fragments and a fuzzy logic system in order to improve conventional DNA sequence alignment methods using DNA sequence quality information. In conventional algorithms, DNA sequence alignment scores were calculated by the global sequence alignment algorithm proposed by Needleman-Wunsch applying quality information of each DNA fragment. However, there may be errors in the process for calculating DNA sequence alignment scores in case of low quality of DNA fragment tips, because overall DNA sequence quality information are used. In the proposed method, exact DNA sequence alignment can be achieved in spite of low quality of DNA fragment tips by improvement of conventional algorithms using quality information. And also, mapping score parameters used to calculate DNA sequence alignment scores, are dynamically adjusted by the fuzzy logic system utilizing lengths of DNA fragments and frequencies of low quality DNA bases in the fragments. From the experiments by applying real genome data of NCBI (National Center for Biotechnology Information), we could see that the proposed method was more efficient than conventional algorithms using quality information in DNA sequence alignment.

  • PDF

Expression of Lymphocyte ADP-ribosyltransferase in Rat Mammary Adenocarcinoma Cells (임파구 ADP-ribosyltransferase의 rat mammary adenocarcinoma cell에서의 발현)

  • 김현주
    • Journal of Life Science
    • /
    • v.8 no.1
    • /
    • pp.102-108
    • /
    • 1998
  • The nascent from of glycosylphosphatidylinositol (GPI)-anchored proteins possesses both amino and carboxy terminal hydrophobic signal sequences to direct processing in the endoplasmic reticulum (ER). Following cleavage of the amino-terminal signal peptide, the carboxy-terminal peptide is processed. Previously, mouse lymphocyte NDA: agrinine ADP-ribosyltransferase (Yac-1) was cloned and the deduced amino acid sequence of the Yac-1 transferase contained hydrophobic amino and carboxy termini, consistent with known signal sequences of GPI-anchored proteins. This tranferase was present on the surface of NMU (rat mammary adenocarcinoma) cells transfected with the wildtype cDNA and was released with phosphatidylinositol-specific phosphilpase C. Expression of the mutant protein, lacking the carboxy terminal hydrophobic sequence, resulted in the peoduction of soluble, secreted from of the transferase. This result shows that carboxy terminal sequence is important for GPI-attachment.

  • PDF

A Multiple Sequence Alignment Algorithm using Clustering Divergence (콜러스터링 분기를 이용한 다중 서열 정렬 알고리즘)

  • Lee Byung-ll;Lee Jong-Yun;Jung Soon-Key
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.1-10
    • /
    • 2005
  • Multiple sequence alignment(MSA) is a fundamental technique of DNA and Protein sequence analysis. Biological sequences are aligned vertically in order to show the similarities and differences among them. In this Paper, we Propose an effcient group alignment method, which is based on clustering divergency, to Perform the alignment between two groups of sequences. The Proposed algorithm is a clustering divergence(CDMS)-based multiple sequence alignment and a top-down approach. The algorithm builds the tree topology for merging. It is so based on the concept that two sequences having the longest distance should be spilt into two clusters. We expect that our sequence alignment algorithm improves its qualify and speeds up better than traditional algorithm Clustal-W.

  • PDF