• Title/Summary/Keyword: Sequence to Sequence

Search Result 15,238, Processing Time 0.036 seconds

The Performance Analysis of MPDA in Out of Sequence Measurement Environment (Out of Sequence Measurement 환경에서의 MPDA 성능 분석)

  • Seo, Il-Hwan;Lim, Young-Taek;Song, Taek-Lyul
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.9
    • /
    • pp.401-408
    • /
    • 2006
  • In a multi-sensor multi-target tracking systems, the local sensors have the role of tracking the target and transferring the measurements to the fusion center. The measurements from the same target can arrive out of sequence called the out-of-sequence measurements(OOSMs). Out-of-sequence measurements can arise at the fusion center due to communication delay and varying preprocessing time for different sensor platforms. In general, the track fusion occurs to enhance the tracking performance of the sensors using the measurements from the sensors at the fusion center. The target informations can wive at the fusion center with the clutter informations in cluttered environment. In this paper, the OOSM update step with MPDA(Most Probable Data Association) is introduced and tested in several cases with the various clutter density through the Monte Carlo simulation. The performance of the MPDA with OOSM update step is compared with the existing NN, PDA, and PDA-AI for the air target tracking in cluttered and out-of-sequence measurement environment. Simulation results show that MPDA with the OOSM has compatible root mean square errors with out-of-sequence PDA-AI filter and the MPDA is sufficient to be used in out-of-sequence environment.

Partial Sequence Analysis of Puumala Virus M Segment from Bats in Korea

  • Yun, Bo-Kyoung;Yoon, Jeong-Joong;Lee, Yun-Tai
    • The Journal of Korean Society of Virology
    • /
    • v.29 no.1
    • /
    • pp.23-31
    • /
    • 1999
  • Hantavirus is a genus of the Bunyaviridae family causing two serious diseases, hemorrhagic fever with renal syndrome (HFRS) and hantavirus pulmonary syndrome (HPS). Puumala virus is a member of hantavirus originally found in Europe, and its natural reservoir is Clethrionomys glareolus. It is also associated with the human disease nephropathia epidemica, a milder form of HFRS. To identify the hantaviruses in bats, bats were collected from Jeong-Sun, Won-Joo, Chung-Ju and Hwa-Cheon area in Korea, and nested RT-PCR was performed with serotype specific primer from M segment. Interestingly, Puumala virus was detected in bats (Rhinolophus ferrum-equinum) only from Won-Joo. The 327 bp nested RT-PCR product, was sequenced. The sequence database search indicates that the sequence is homologous to the published sequence of Puumala viruses. The sequence similarities were ranged from 71% to 97%. The highest sequence similarity was 97% with Puumala virus Vranicam strain, and the lowest was 71% with Puumala virus K27 isolate. Puumala virus Vranicam strain was isolated from a bank vole (Clethrionomys glareolus) in Bosnia-Hercegovina. Puumala virus K27 was isolated from human in Russia. This analysis confirms that bats (Rhinolophus ferrum-equinum) in Korea are natural reservoir of Puumala virus.

  • PDF

Implementation and Application of Multiple Local Alignment (다중 지역 정렬 알고리즘 구현 및 응용)

  • Lee, Gye Sung
    • The Journal of the Convergence on Culture Technology
    • /
    • v.5 no.3
    • /
    • pp.339-344
    • /
    • 2019
  • Global sequence alignment in search of similarity or homology favors larger size of the sequence because it keeps looking for more similar section between two sequences in the hope that it adds up scores for matched part in the rest of the sequence. If a substantial size of mismatched section exists in the middle of the sequence, it greatly reduces the total alignment score. In this case a whole sequence would be better to be divided into multiple sections. Overall alignment score over the multiple sections of the sequence would increase as compared to global alignment. This method is called multiple local alignment. In this paper, we implement a multiple local alignment algorithm, an extension of Smith-Waterman algorithm and show the experimental results for the algorithm that is able to search for sub-optimal sequence.

Construction Method of Binary Low Correlation Zone Sequence Set Using Gray Mapping (Gray 사상을 이용한 이진 낮은 상관구역 수열군의 생성법)

  • Jang, Ji-Woong;Kim, Young-Sik;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.2C
    • /
    • pp.169-174
    • /
    • 2009
  • In this paper, we propose a new construction method of binary low correlation zone (LCZ) sequence set. New construction method applies Gray mapping to conventional quaternary LCZ sequence set that has specific property. The period of new binary sequence set is twice as that of used sequence set in construction, and maximum magnitude of correlation value within the LCZ and cardinality of new set is also twice as those of used quaternary sequence set. But the LCZ size is the same with that of used sequence set. If the used Quaternary sequence set is optimal, the constructed binary sequence set is optimal with high probability.

Binary Sequence Generator with a Large Number of Output Sequences (다수열 출력 이진 수열 발생기)

  • 이훈재;문상재
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.7 no.3
    • /
    • pp.11-22
    • /
    • 1997
  • The number of output sequence was proposed as a characteristic of binary sequence generators for cryptographic application, but in general most of binary sequence generators have single number of output sequence. In this paper, we propose two types of binary sequence generators with a large number of output sequences. The first one is a Switched-Tap LFSR (STLFSR) and it applies to the generalized nonlinear function and the Geffe's generator as example. The other is a generalized memory sequence generator(GMEM-BSG) which is an improved version of the Golic's memory sequence generator (MEM-BSG) with a large number of output sequences, and its period, linear complexity, and the number of output sequence are derived.

PC-Based Hybrid Grid Computing for Huge Biological Data Processing

  • Cho, Wan-Sup;Kim, Tae-Kyung;Na, Jong-Hwa
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.569-579
    • /
    • 2006
  • Recently, the amount of genome sequence is increasing rapidly due to advanced computational techniques and experimental tools in the biological area. Sequence comparisons are very useful operations to predict the functions of the genes or proteins. However, it takes too much time to compare long sequence data and there are many research results for fast sequence comparisons. In this paper, we propose a hybrid grid system to improve the performance of the sequence comparisons based on the LanLinux system. Compared with conventional approaches, hybrid grid is easy to construct, maintain, and manage because there is no need to install SWs for every node. As a real experiment, we constructed an orthologous database for 89 prokaryotes just in a week under hybrid grid; note that it requires 33 weeks on a single computer.

  • PDF

Assembly Sequence Determination from Design Data Using Voxelization (복셀화를 통한 디자인 데이타로부터의 조립순서 결정)

  • Lee, Changho;Cho, Hyunbo;Jung, Mooyoung
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.6
    • /
    • pp.90-101
    • /
    • 1996
  • Determination of assembly sequence of components is a key issue in assembly operation. Although a number of articles dealing with assembly sequence determination have appeared, an efficient and general methodology for complex products has yet to appear. The objective of this paper is to present the problems and models used to generate assembly sequence from design data. An essential idea of this research is to acquire a finite number of voxels from any complex geometric entity, such as 3D planar polygons, hollow spheres, cylinders. cones, tori, etc. In order to find a feasible assembly sequence, the following four steps are needed: (1) The components composing of an assembly product are identified and then the geometric entities of each component are extracted. (2) The geometric entities extracted in the first step are translated into a number of voxels. (3) All the mating or coupling relations between components are found by considering relations between voxels. (4) The components to be disassembled are determined using CCGs (Component Coupling Graph).

  • PDF

Analysis of Sequence Impedances of 345kV Cable Transmission Systems (실계통 345kV 지중송전선 대칭좌표 임피던스의 해석)

  • Choi, Jong-Kee;Ahn, Yong-Ho;Yoon, Yong-Beum;Oh, Sei-Ill;Kwa, Yang-Ho;Lee, Myoung-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.7
    • /
    • pp.905-912
    • /
    • 2013
  • Power system fault analysis is commonly based on well-known symmetrical component method, which describes power system elements by positive, negative and zero sequence impedance. In case of balanced fault, such as three phase short circuit, transmission line can be represented by positive sequence impedance only. The majority of fault in transmission lines, however, is unbalanced fault, such as line-to-ground faults, so that both positive and zero sequence impedance is required for fault analysis. When unbalanced fault occurs, zero sequence current flows through earth and skywires in overhead transmission systems and through cable sheaths and earth in cable transmission systems. Since zero sequence current distribution between cable sheath and earth is dependent on both sheath bondings and grounding configurations, care must be taken to calculate zero sequence impedance of underground cable transmission lines. In this paper, conventional and EMTP-based sequence impedance calculation methods were described and applied to 345kV cable transmission systems (4 circuit, OF 2000mm2). Calculation results showed that detailed circuit analysis is desirable to avoid possible errors of sequence impedance calculation resulted from various configuration of cable sheath bonding and grounding in underground cable transmission systems.

A Comparison of Three Fixed-Length Sequence Generators of Synthetic Self-Similar Network Traffic (Synthetic Self-Similar 네트워크 Traffic의 세 가지 고정길이 Sequence 생성기에 대한 비교)

  • Jeong, Hae-Duck J.;Lee, Jong-Suk R.
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.899-914
    • /
    • 2003
  • It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.