• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.807-816
• /
• 2005

Sequential pattern mining finds all of the frequent sequences satisfying a minimum support threshold in a large database. However, when mining long frequent sequences, or when using very low support thresholds, the performance of currently reported algorithms often degrades dramatically. In this paper, we propose a novel sequential pattern algorithm using only closed frequent sequences which are small subset of very large frequent sequences. Our algorithm generates the candidate sequences by depth-first search strategy in order to effectively prune. using bitmap representation of underlying databases, we can effectively calculate supports in terms of bit operations and prune sequences in much less time. Performance study shows that our algorithm outperforms the previous algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.228-231
• /
• 2012

In this paper we propose a new family of nonlinear binary sequences generated by $m$-sequences for decimations $d=2^{k-1}(2^{s+1}-2^k+2^{k(i+1)}-2^{ki}-1)/(2^s-1)$ where $n=2k$, $i$ is odd and $s$ is such that $2s$ divides $k$. And we analyze the cross-correlation function between two $m$-sequences for new decimations $d$. Proposed sequences is extension of Rosendahl's sequnces and Dobbertin's sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.959-964
• /
• 2007

In this paper, for a positive integer M and a prime p such that $M|p^n-1$, families of M-ary sequences using the M-ary Sidel'nikov sequences with period $p^n-1$ are constructed. The family has its maximum magnitude of correlation values upper bounded by $3\sqrt{p^{n}}+6$ and the family size is $(M-1)^2(2^{n-1}-1)$+M-1 for p=2 or $(M-1)^2(p^n-3)/2+M(M-1)/2$ for an odd prime p.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.318-323
• /
• 2006

In this paper we propose three methods to generate short hopping sequences for the frequency hopping system. First, we explain the one coincidence set of sequences and the polyphase power residue seqences which have been known previously, and we suggest a method by modifying the one coincidence sequence and two methods by using the power residue sequences. We verify that the optimal position deleted-power residue sequences have the best Hamming autocorrelation property and the first position deleted-power residue sequences and the modified one coincidence sequences follows with respect to Hamming autocorrelation. We also explain that these sequences have the good balance property and can be implemented with low complexity.

• Parasites, Hosts and Diseases
• /
• v.57 no.5
• /
• pp.481-487
• /
• 2019

Mitochondrial DNA sequence variability of Spirometra erinaceieuropaei in GenBank was observed by reinvestigation of mitochondrial cox1 and cytb sequences. The DNA sequences were analyzed in this study, comprising complete DNA sequences of cox1 (n=239) and cytb (n=213) genes. The 10 complete mitochondrial DNA sequences of Spirometra species were compared with those of Korea, China and Japan. The sequences were analyzed for nucleotide composition, conserved sites, variable sites, singleton sites and parsimony-informative sites. Phylogenetic analyses was done using neighbor joining, maximum parsimony, Bayesian inference and maximum-likelihood on cox1 and cytb sequences of Spirometra species. These polymorphic sites identified 148 (cox1) and 83 (cytb) haplotypes within 239 and 213 isolates from 3 Asian countries. Phylogenetic tree topologies were presented high-level confidence values for the 2 major branches of 2 Spirometra species containing S. erinaceieuropaei and S. decipiens, and S. decipiens sub-clades including all sequences registered as S. erinaceieuropaei in cox1 and cytb genes. These results indicated that mitochondrial haplotypes of S. erinaceieuropaei and S. decipiens were found in the 3 Asian countries.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.155-162
• /
• 2008

Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of 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 dataset 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 the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• ETRI Journal
• /
• v.27 no.3
• /
• pp.273-279
• /
• 2005

Toward code division multiple access (CDMA) communications and data protection, we propose and analyze pseudorandom noise (PN) sequences generated from a 2-dimensional array structure of shift-registers. For any positive integers m and n, we construct PN sequences of period $2^{mm}-1$ using an $m{\times}n$ array of registers and show that we can generate all shifted PN sequences as required by IS-95x with the proper linear combination of available sequences.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.536-539
• /
• 2002

The use of concatenated codes in noncoherent synchronous optical fiber CDMA networks is proposed. The concatenated code sequences are generated using balanced Walsh code sequences and Walsh code sequences. The selection of balanced Walsh code sequences is presented and the design of fully programmable transmitter and receiver is reported. The analysis of the system BER performance shows that multiple-access interference is completely eliminated and the BER performance of the proposed system is better than that of the non-coherent synchronous optical fiber CDMA system using optical orthogonal codes with double hard-limiters.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.1
• /
• pp.149-155
• /
• 2005

The notion of U-exact sequence (or quasi-exact sequence) of modules was introduced by Davvaz and Parnian-Garamaleky as a generalization of exact sequences. In this paper, we prove further results about quasi-exact sequences. In particular, we give a generalization of Schanuel's Lemma. Also we obtain some relation-ship between quasi-exact sequences and superfluous (or essential) submodules.

• Journal of the Korean Mathematical Society
• /
• v.49 no.6
• /
• pp.1097-1110
• /
• 2012

The convergence properties of extended negatively dependent sequences under some conditions of uniform integrability are studied. Some sufficient conditions of the weak law of large numbers, the $p$-mean convergence and the complete convergence for extended negatively dependent sequences are obtained, which extend and enrich the known results in the literature.