• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.2019-2022
• /
• 2002

This paper presents design of spreading codes for asynchronous DS-CDMA systems. We have been trying to generate maximal-period sequences based on one-dimensional maps with finite bits whose shapes are similar to piecewise linear chaotic maps. We propose an efficient search algorithm finding such mammal-period sequences. This algorithm makes it possible to find many kinds of maximal-period sequences with sufficiently long period for CDMA applications. We also investigate bit error rate(BER) in asynchronous DS-CDMA systems using the maximal-period binary sequences by computer simulations.

• Genomics & Informatics
• /
• 제10권1호
• /
• pp.51-57
• /
• 2012

Mining interesting patterns from DNA sequences is one of the most challenging tasks in bioinformatics and computational biology. Maximal contiguous frequent patterns are preferable for expressing the function and structure of DNA sequences and hence can capture the common data characteristics among related sequences. Biologists are interested in finding frequent orderly arrangements of motifs that are responsible for similar expression of a group of genes. In order to reduce mining time and complexity, however, most existing sequence mining algorithms either focus on finding short DNA sequences or require explicit specification of sequence lengths in advance. The challenge is to find longer sequences without specifying sequence lengths in advance. In this paper, we propose an efficient approach to mining maximal contiguous frequent patterns from large DNA sequence datasets. The experimental results show that our proposed approach is memory-efficient and mines maximal contiguous frequent patterns within a reasonable time.

• 한국정보통신학회논문지
• /
• 제17권3호
• /
• pp.627-633
• /
• 2013

무선이동통신 시스템에서 두 수열의 상호상관 함숫값은 통화 품질과 사용자 수를 결정하는데 있어 큰 영향을 끼치고 있다. 본 논문에서는 주기 $2^n-1$인 m-수열에 새로운 데시메이션 $d=\frac{2^{m-st-1}}{2^s-1}(2^n+2^{st+s+1}-2^{m+st+1}-1)$를 적용하여 또 다른 m-수열을 생성하고 두 수열의 상호상관 함숫값과 그 값들의 발생횟수를 결정한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -2
• /
• pp.567-570
• /
• 2000

A design method of nonlinear feedback shift registers that can produce maximal-period sequences is given. Such a design is based on one-to-one mappings which are similar to well-known chaotic maps. Some properties of generated binary sequences are investigated and discussed.

• International Journal of Contents
• /
• 제3권2호
• /
• pp.18-24
• /
• 2007

Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1882-1885
• /
• 2002

This paper shows design of maximal-period sequences with prescribed constant auto-correlation values based on one-dimensional (1-D) maps with (mite bits. We construct such 1-D maps based on piecewise linear onto chaotic maps. Theoretical analyses and some design examples are given.

• 한국전자통신학회논문지
• /
• 제8권6호
• /
• pp.891-897
• /
• 2013

최대 주기를 갖는 이진 수열에 대한 상호상관 함숫값은 통신 분야에서 다양하게 응용되고 있기 때문에 그 값의 범위와 발생빈도에 대한 분석은 다양하게 연구되고 있다. 본 논문에서는 데시메이션 $d=2^{m-1}(3{\cdot}2^{m}-1)$를 이용하여 새로운 수열군을 제안하고 그 수열의 상호상관 함숫값의 범위와 분포에 대하여 분석한다.

• 대한수학회논문집
• /
• 제35권1호
• /
• pp.83-116
• /
• 2020

Let G be a finite group. By a sequence over G, we mean a finite unordered sequence of terms from G, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals the identity element of G. The large Davenport constant D(G) is the maximal length of a minimal product-one sequence, that is, a product-one sequence which cannot be factored into two non-trivial product-one subsequences. We provide explicit characterizations of all minimal product-one sequences of length D(G) over dihedral and dicyclic groups. Based on these characterizations we study the unions of sets of lengths of the monoid of product-one sequences over these groups.

• 대한수학회보
• /
• 제35권3호
• /
• pp.515-525
• /
• 1998

In this paper we obtain a "compactness" result that asserts the existence, in certain sets of sequences, of a sequence which has a maximal reciprocal sum. We derive this result from a much more general theorem which will be proved by introducing a metric into the set of sequences and using a topological argument.

• 대한수학회지
• /
• 제53권1호
• /
• pp.57-72
• /
• 2016

We establish maximal moment inequalities of partial sums under ${\psi}$-weak dependence, which has been proposed by Doukhan and Louhichi [P. Doukhan and S. Louhichi, A new weak dependence condition and application to moment inequality, Stochastic Process. Appl. 84 (1999), 313-342], to unify weak dependence such as mixing, association, Gaussian sequences and Bernoulli shifts. As an application of maximal moment inequalities, a functional central limit theorem is developed for linear processes with ${\psi}$-weakly dependent innovations.