• Kyungpook Mathematical Journal
• /
• 제51권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.

• 한국컴퓨터정보학회논문지
• /
• 제10권5호
• /
• pp.1-10
• /
• 2005

다중 서열 정렬(multiple sequence alignment, MSA)은 단백질과 핵산 서열들의 분석에 필요한 가장 중요한 도구이다. 생물학적인 서열들은 그들 사이의 유사성과 차이점을 보여주기 위하여 각각의 서열들을 수직적으로 정렬한다. 본 논문에서는 클러스터링 분기를 이용하여 두 그룹의 서열들 사이에서 정렬을 수행하는 효율적인 그룹 정렬 방법을 제안하였다. 제안한 알고리즘(Multiple Sequence Alignment using Clustering Divergence : CDMS)은 하향식 발견 방법인 트리 형태의 병합을 위해 클러스터링 방법으로 구축하였다. 클러스터링 방법은 가장 긴 거리를 가지는 서열을 두 개의 클러스터로 나눌 수 있다는 것에 기초하였다. 제안한 새로운 서열 정렬 알고리즘은 기존의 Clustal W알고리즘 보다 질적 향상과 처리 시간 단축 O($n^{3} L^{2}$)이 기대된다.

• Journal of Microbiology and Biotechnology
• /
• 제26권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.

• 디지털산업정보학회논문지
• /
• 제9권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.

• 대한수학회지
• /
• 제40권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.

• ETRI Journal
• /
• 제42권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(n²) 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.

• International journal of advanced smart convergence
• /
• 제5권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.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제11권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.

• Journal of Power Electronics
• /
• 제19권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.

• 한국콘텐츠학회논문지
• /
• 제7권8호
• /
• pp.134-141
• /
• 2007

3D 애니메이션 작업의 결과물을 출력하는데 있어서 동영상 파일로의 렌더링이 가능하지만 대부분의 프로덕션에서는 Image Sequence 렌더링 방식을 택하고 있다. 이러한 Image Sequence 렌더링 방식은 최종 영상물 제작을 위한 합성에 있어서 중요한 과정이다. 이러한 Image Sequence 렌더링 방식에는 다양한 Format의 이미지 형태들이 사용되는데 그 대표적인 것으로서 TGA format을 들 수가 있다. 하지만 TGA format 방식의 이미지가 이러한 과정에서 최적인가에 대한 의문점이 제기되어지고, 3D 프로그램마다 고유의 이미지 format을 가지고 있다는 점에서 이에 대한 연구가 필요하다. 본 연구에서는 Alias 사의 Maya를 중심으로 이러한 Image Sequence format에 대한 압축률, 선명도, 합성 시 필요한 Alpha Channel의 보존성, Z-Depth에 관한 Information에 관하여 연구하고자 한다. 이 연구의 결과는 3D 애니메이션을 Pipeline에 Image Sequence format에 대한 가이드 라인을 제공해주는데 목적이 있다.