• Title/Summary/Keyword: sequence-to-sequence

Search Result 15,180, Processing Time 0.045 seconds

On Some Lacunary Generalized Difference Sequence Spaces of Invariant Means De ned by a Sequence of Modulus Function

  • Atici, Gulcan;Bektas, Cigdem Asma
    • Kyungpook Mathematical Journal
    • /
    • v.51 no.4
    • /
    • pp.385-393
    • /
    • 2011
  • The aim of this paper is to introduce and study the sequence spaces [w, ${\theta}$, F, p, q]$_{\infty}({\Delta}_{\upsilon}^m)$, [w, ${\theta}$, F, p, q]$_1({\Delta}_{\upsilon}^m)$ and [w, ${\theta}$, F, p, q]$_0({\Delta}_{\upsilon}^m)$, which arise from the notions of generalized difference sequence space, lacunary convergence, invariant mean and a sequence of Moduli $F=(f_k)$. We establish some inclusion relations between these spaces under some conditions.

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

Sequence Variations in the Non-Coding Sequence of CTX Phages in Vibrio cholerae

  • Kim, Eun Jin;Yu, Hyun Jin;Kim, Dong Wook
    • Journal of Microbiology and Biotechnology
    • /
    • v.26 no.8
    • /
    • pp.1473-1480
    • /
    • 2016
  • This study focused on the variations in the non-coding sequences between ctxB and rstR of various CTX phages. The non-coding sequences of CTX-1 and CTX-cla are phage type-specific. The length of the non-coding region of CTX-1 and CTX-cla is 601 and 730 nucleotides, respectively. The non-coding sequence of CTX phage could be divided into three regions. There is a phage type-specific Variable region between two homologous Common regions (Common regions 1 and 2). The non-coding sequence of RS1 element is similar to CTX-1 except that Common region 1 is replaced by a short RS1-specific sequence. The non-coding sequences of CTX-2 and CTX-cla are homologous, indicating the non-coding sequence of CTX-2 is derived from CTX-cla. The non-coding region of CTX-O139 is similar to CTX-cla and CTX-2; however, it contains an extra phage type-specific sequence between Common region 2 and rstR. The variations in the non-coding sequences of CTX phages might be associated with the difference in the replication efficiency and the directionality in the integration into the V. cholerae chromosome.

A Novel Calibration Method Using Zadoff-Chu Sequence and Its FPGA Implementation (Zadoff-Chu sequence를 이용한 실시간 Calibration 알고리즘과 FPGA 구현)

  • Jang, Jae Hyun;Sun, Tiefeng;Yang, Hyun Wook;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.59-65
    • /
    • 2013
  • This paper presents a novel calibration method for a base station system adopting an antenna array. The proposed technique utilizes Zadoff-Chu sequence, which is included in the LTE pilot signal periodically, in order to compute the phase characteristic of each antenna channel. As the Zadoff-Chu sequence exhibits an excellent autocorrelation characteristic, it is possible for the receiving base station to retrieve the Zadoff-Chu sequence transmitted from each mobile terminal. In addition, we can obtain the phase characteristic of each antenna channel, which is the ultimate goal of the calibration procedure. The proposed calibration algorithm has been implemented using an FPGA (Field Programmable Gate Array). We have applied the proposed algorithm to an array consisting of 2 antenna elements for simplicity. the phase value implied to the first and second antenna path is very accurately calculated from the proposed procedure. From the experimental test, the proposed method provides accurate calibration results.

A GENERALIZATION OF A SUBSET-SUM-DISTINCT SEQUENCE

  • Bae, Jae-Gug;Choi, Sung-Jin
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.5
    • /
    • pp.757-768
    • /
    • 2003
  • In 1967, as an answer to the question of P. Erdos on a set of integers having distinct subset sums, J. Conway and R. Guy constructed an interesting sequence of sets of integers. They conjectured that these sets have distinct subset sums and that they are close to the best possible with respect to the largest element. About 30 years later (in 1996), T. Bohman could prove that sets from the Conway-Guy sequence actually have distinct subset sums. In this paper, we generalize the concept of subset-sum-distinctness to k-SSD, the k-fold version. The classical subset-sum-distinct sets would be 1-SSD in our definition. We prove that similarly derived sequences as the Conway-Guy sequence are k-SSD.

Linear-Time Korean Morphological Analysis Using an Action-based Local Monotonic Attention Mechanism

  • Hwang, Hyunsun;Lee, Changki
    • ETRI Journal
    • /
    • v.42 no.1
    • /
    • pp.101-107
    • /
    • 2020
  • For Korean language processing, morphological analysis is a critical component that requires extensive work. This morphological analysis can be conducted in an end-to-end manner without requiring a complicated feature design using a sequence-to-sequence model. However, the sequence-to-sequence model has a time complexity of O(n2) for an input length n when using the attention mechanism technique for high performance. In this study, we propose a linear-time Korean morphological analysis model using a local monotonic attention mechanism relying on monotonic alignment, which is a characteristic of Korean morphological analysis. The proposed model indicates an extreme improvement in a single threaded environment and a high morphometric F1-measure even for a hard attention model with the elimination of the attention mechanism formula.

Could Decimal-binary Vector be a Representative of DNA Sequence for Classification?

  • Sanjaya, Prima;Kang, Dae-Ki
    • International journal of advanced smart convergence
    • /
    • v.5 no.3
    • /
    • pp.8-15
    • /
    • 2016
  • In recent years, one of deep learning models called Deep Belief Network (DBN) which formed by stacking restricted Boltzman machine in a greedy fashion has beed widely used for classification and recognition. With an ability to extracting features of high-level abstraction and deal with higher dimensional data structure, this model has ouperformed outstanding result on image and speech recognition. In this research, we assess the applicability of deep learning in dna classification level. Since the training phase of DBN is costly expensive, specially if deals with DNA sequence with thousand of variables, we introduce a new encoding method, using decimal-binary vector to represent the sequence as input to the model, thereafter compare with one-hot-vector encoding in two datasets. We evaluated our proposed model with different contrastive algorithms which achieved significant improvement for the training speed with comparable classification result. This result has shown a potential of using decimal-binary vector on DBN for DNA sequence to solve other sequence problem in bioinformatics.

Misunderstandings and Difficulties in Learning Sequence and Series: A Case Study

  • Akgun, Levent;Duru, Adem
    • Research in Mathematical Education
    • /
    • v.11 no.1
    • /
    • pp.75-85
    • /
    • 2007
  • This paper analyzes the difficulties with the learning of sequence and series of the second-year students who participated in a year long whole class at the university level. The research was carried out at the end of students' third semester. These students were randomly selected. They were applied to one paper and pencil test containing eight task items on sequence and series. In this study, qualitative method (case study design) was used to explore students' difficulties and misunderstandings in learning sequence and series. Students' responses to the questions were divided into three categories: These were "correct", "partial correct" and "false or no responses". Students' responses to the paper and pencil test were evaluated. The results show that students had difficulties and misunderstandings in series and sequence.

  • PDF

Research on Carried-Based PWM with Zero-Sequence Component Injection for Vienna Type Rectifiers

  • Ma, Hui;Feng, Mao;Tian, Yu;Chen, Xi
    • Journal of Power Electronics
    • /
    • v.19 no.2
    • /
    • pp.560-568
    • /
    • 2019
  • This paper studies the inherent relationship between currents and zero-sequence components. Then a precise algorithm is proposed to calculate the injected zero-sequence component to control the DC-Link neutral-point voltage balance, which can result in a more efficient and flexible neutral point voltage balance with a desirable performance. In addition, it is shown that carried-based PWM with the calculated zero-sequence component scheme can be equivalent to space-vector pulse-width modulation (SVPWM). Based on the proposed method, the optimal zero-sequence component of the feasible modulation indices is analyzed. In addition, the unbalanced load limitation of the DC-Link neutral-point voltage balance control is also revealed. Simulation and experimental results are shown to verify the validity and practicality of the proposed algorithm.

Effective Image Sequence Format in 3D Animation Production Pipeline (3D 애니메이션 제작 공정에 있어서 효율적인 이미지 시퀀스 포맷)

  • Kim, Ho
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.8
    • /
    • pp.134-141
    • /
    • 2007
  • In 3D animation rendering process, Although we can render the output as a movie file format, most productions use image sequences in their rendering pipelines. This Image Sequence rendering process is extremely important step in final compositing in movie industries. Although there are various type of making image rendering processes, TGA format Is one of most widely used bitmap file formats using in industries. People may ask TGA format is most suitable for in any case. As we know 3D softwares have their own image formats. so we need to testify on this. In this paper, we are going to focus on Alias' 3D package software called MAYA which we will analyze of compressing image sequence, Image quality, supporting Alpha channels in compositing, and Z-depth information. The purpose of this paper is providing to 3D Pipeline as a guideline about effective image sequence format.