• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2255-2263
• /
• 1994

Protocol conformance testing consists of procedures to observe an output and to check a transition state of the Implementation Under Test considered as a black box by applying an input. There are several methods to check the transition state such as Unique Input/Output(UIO) sequence. Distinguishing Sequence(DS) and Characterization Set(CS). Particularly, as a test method for a state having no UIO sequence, Partial UIO sequence method can be considered. In this paper, three properties which can be found among Partial UIO sequence and a modified algorithm using these properties are suggested.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.1
• /
• pp.39-47
• /
• 2009

Pan, Shen and Woo [8] introduced the concept of the G-sequence of a map. We introduce the G'-sequence of a map, which is a dual concept of the G-sequence of a map. We obtain some sufficient conditions for the all sets in the G'-sequence of a map are groups, and for the exact G'-sequence of a map.

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.413-424
• /
• 2011

A variety of different metrics has been introduced to measure the similarity of two given sequences. These widely used metrics are ranging from spell correctors and categorizers to new sequence mining applications. Different metrics consider different aspects of sequences, but the essence of any sequence is extracted from the ordering of its elements. In this paper, we propose a novel sequence similarity measure that is based on all ordered pairs of one sequence and where a Hasse diagram is built in the other sequence. In contrast with existing approaches, the idea behind the proposed sequence similarity metric is to extract all ordering features to capture sequence properties. We designed a clustering problem to evaluate our sequence similarity metric. Experimental results showed the superiority of our proposed sequence similarity metric in maximizing the purity of clustering compared to metrics such as d2, Smith-Waterman, Levenshtein, and Needleman-Wunsch. The limitation of those methods originates from some neglected sequence features, which are considered in our proposed sequence similarity metric.

• Kyungpook Mathematical Journal
• /
• v.46 no.4
• /
• pp.591-595
• /
• 2006

In this paper, we define ${\Delta}^m$-Lacunary strongly convergent sequences defined by sequence of moduli and give various properties and inclusion relations on these sequence spaces.

• The Pure and Applied Mathematics
• /
• v.6 no.2
• /
• pp.103-111
• /
• 1999

We find some conditions under which G(f)-sequence of a CW-pair (X, A) is exact. And we also introduce a G(f)-sequence for a CW-triple (X, A, B) and examine when the sequence is exact.

• Communications of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.1-16
• /
• 2016

The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the modified k-Fibonacci-like sequence and prove Binet's formula for this sequence and then use it to introduce and prove the Catalan, Cassini, and d'Ocagne identities for the modified k-Fibonacci-like sequence. Also, the ordinary generating function of this sequence is stated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.952-958
• /
• 1994

In this paper a method calculates the time offset between a binary sequence and its shifted sequence based on the number theoretic approach is presented. Using this method the time offset between a binary sequence and its shifted sequence can be calculated. It has been recongnized that the defining the reference (zero-offset) sequence is important in synchronous code division multiple access(CDMA) system since the same spreading sequence are used by the all base station. The time offset of the sequence with respect to the zero offset sequence are used to distinguish signal received at a mobile station from different base stations. This paper also discusses a method that defines the reference sequence.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.15 no.1
• /
• pp.70-75
• /
• 2006

This paper represents a study on disassembly sequence generation system for automobile parts. This system is practically very useful because proper disassembly sequence of end-of-life product becomes crucial as take-back obligations are imposed for environmental reasons. Therefore a disassembly sequence generation system is suggested to automatically derive all the feasible disassembly sequences from the assembly modeling files. As a result, in consideration of the all parts and subassemblies the optimum disassembly sequence is generated. And the optimum disassembly sequence for a certain part or subassembly can be also suggested.

• Journal of Life Science
• /
• v.9 no.2
• /
• pp.9-14
• /
• 1999

Pseudomonas iodinum IFO 3558 adenosine deaminase(ADA) gene was cloned by the polymerase chain reaction and deduced the amino acid sequence of the enzyme. DNA sequence homology of Pseudomonas iodinum IFO 3558 ADA gene was compared to those of E. coli, human and mouse ADA genes. Unambiguous sequence from both strands of pM21 was obtained for the region believed to encode ADA. The sequence included a 804-nucleotide open reading frame, bounded on one end by sense primer and on the other end by two antisense primer. This open reading frame encodes a protein of 268 amino acids having a molecular weight of 29,448. The deduced amino acid sequence shows considerable similarity to those of E. coli, mouse and human ADA. Pseudomonas iodinum IFO 3558 nucleotide sequence shows 98.5% homology with that of the E. coli ADA sequence and 51.7% homology with that of the mouse ADA sequence and 52.5% homology with that of the human ADA sequence. The ADA protein sequence of Pseudomonas iodinum IFO 3558 shows 96.9% homology with that of the E. coli and 40.7% homology with that of the mouse and 41.8% homology with that of the human. The distance between two of the conserved elements, TVHAGE and SL(1)NTDDP has veen exactly conserved at 76 amino acids for all four ADAs. Two of the four conserved sequence elements shared among the four ADAs are also present in the yeast, rat, human (M), and Human(L) AMP deaminase. The SLSTDDP sequence differs only in the conservative substitution of a serine for an asparagine. A conserved cysteine with conserved spacing between these two regions is also found. Thus, sequence analysis of four ADAs and four AMP deaminases revealed the presence of a highly conserved sequence motif, SLN(S)TDDP, a conserved dipeptide, HA, and a conserved cysteine residue.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.4
• /
• pp.121-128
• /
• 2018

A Korean morphological analyzer adopts sequence-to-sequence (seq2seq) model, which can generate an output sequence of different length from an input. In general, a seq2seq based Korean morphological analyzer takes a syllable-unit based sequence as an input, and output a syllable-unit based sequence. Syllable-based morphological analysis has the advantage that unknown words can be easily handled, but has the disadvantages that morpheme-based information is ignored. In this paper, we propose a reranking model as a post-processor of seq2seq model that can improve the accuracy of morphological analysis. The seq2seq based morphological analyzer can generate K results by using a beam-search method. The reranking model exploits morpheme-unit embedding information as well as n-gram of morphemes in order to reorder K results. The experimental results show that the reranking model can improve 1.17% F1 score comparing with the original seq2seq model.