• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.170-175
• /
• 2002

An optical fiber code-division multiple-access (CDMA) network is proposed in which encoding is based on the use of concatenated sequences of relatively large weight. The first short component sequence in the concatenated sequence permits realistic electronic encoding of each data bit. The chips of this sequence are then all-optically encoded at substantially higher rate. In spite of the relatively large weight of the sequence the all-optical encoder is practical by virtue of the shortness of the component sequences. The use of Gold and Lempel sequences as component sequences for generating the concatenated sequences is studied and the bit-error rate (BER) performance of the proposed system is presented as a function of the received optical power with the number of simultaneous users as parameter.

• Communications of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.21-38
• /
• 2023

Let R be a commutative ring with identity. Let R be an integral domain and M a torsion-free R-module. We investigate the relation between the notion of e-exactness, recently introduced by Akray and Zebari [1], and generalized the concept of homology, and establish a relation between e-exact sequences and homology of modules. We modify some applications of e-exact sequences in homology and reprove some results of homology with e-exact sequences such as horseshoe lemma, long exact sequences, connecting homomorphisms and etc. Next, we generalize two special drived functor T or and Ext, and study some properties of them.

• Speech Sciences
• /
• v.9 no.1
• /
• pp.193-206
• /
• 2002

The aim of this study is to find out how the labiovelar onglide /w/ in English kwV sequences that have minimal pairs with kV sequences is pronounced differently among Korean EFL learners based on acoustic evidence. This study tries to identify /w/ sound in English kwV sequences through spectrograms and to examine the duration ratios of each segment in kwV words to compare the patterns of an English native speaker with those of Korean speakers of English. In spectrographic analyses, the complete deletion of /w/ and partial pronunciation of /w/ dubbed [$k^{w}$] were identified as well as the targetappropriate production of /w/. The general production patterns with respect to the duration ratios in English [kw] sequence words showed that the subjects who produced /w/ had similar ratio patterns that the native speaker had in that the vowel duration ratio in kwV sequences was shorter than that in kV sequences. By contrast, the subjects who deleted [w] had a long ratio of the onset [$k^{h}$] while the speaker with a partial pronunciation of /w/ had a long ratio of the following vowel.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.46-50
• /
• 2006

According to the advancement of experimental techniques in molecular biology, genomic and protein sequence databases are increasing in size exponentially, and mean sequence lengths are also increasing. Because the sizes of these databases become larger, it is difficult to search similar sequences in biological databases with significant homologies to a query sequence. In this paper, we present the N-gram indexing method to retrieve similar sequences fast, precisely and comparably. This method regards a protein sequence as a text written in language of 20 amino acid codes, adapts N-gram tokens of fixed-length as its indexing scheme for sequence strings. After such tokens are indexed for all the sequences in the database, sequences can be searched with information retrieval algorithms. Using this new method, we have developed a protein sequence search system named as ProSeS (PROtein Sequence Search). ProSeS is a protein sequence analysis system which provides overall analysis results such as similar sequences with significant homologies, predicted subcellular locations of the query sequence, and major keywords extracted from annotations of similar sequences. We show experimentally that the N-gram indexing approach saves the retrieval time significantly, and that it is as accurate as current popular search tool BLAST.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.418-424
• /
• 2010

Many researchers studied methods for the generation of maximum length pseudo random sequences. Sabater et al. analyzed shrunken sequences which are effectively generated by SG(Shrinking Generator) using CA(Cellular Automata). In this paper we propose a new SG which is called LCSG(LFSR and CA based Shrinking Generator) using an LFSR with control register and CA with generator register. The proposed shrunken sequences generated by LCSG have longer periods and high complexities than the shrunken sequences generated by the known method. And we analyze the generated sequences using LCSG.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1686-1692
• /
• 2012

Spreading sequence play an important role in wireless communications, such as in a CDMA(code division multiple access) communication system and multi-carrier spectrum communication system. Spreading sequences with low cross-correlation, in a direct-sequence spread spectrum communication system, help to minimize multiple access interference and to increase security degree of system. Analysis of cross-correlations between the sequences is a necessary process to design sequences. However it require lots of computing time for analysis of cross-correlations between sequences. In this paper we propose a method which is possible to compute effectively cross-correlation using subfield in the process of practical computation of cross-correlation between nonlinear binary sequences.

• Journal for History of Mathematics
• /
• v.20 no.3
• /
• pp.1-16
• /
• 2007

In order to generalize theory of series in Iksan(翼算), we introduce a concept of double sequence of partial sums and elementary double sequence of partial sums, which play a dominant role in the study of double sequences of partial sums. We introduce a concept of finitely generated double sequence of partial sums and find a necessary and sufficient condition for those double sequences. Finally we prove a multiplication theorem for tetrahedral numbers and for 4 dimensional tetrahedral numbers.

• Genomics & Informatics
• /
• v.6 no.1
• /
• pp.54-58
• /
• 2008

Genotyping Tool for Viral SEQuences (GTVseq) provides scientists with the genotype information on the viral genome sequences including HIV-1, HIV-2, HBV, HCV, HTLV-1, HTLV-2, poliovirus, enterovirus, flavivirus, Hantavirus, and rotavirus. GTVseq produces alternative and additive genotype information for the query viral sequences based on two different, but related, scoring methods. The genotype information produced is reported in a graphical manner for the reference genotype matches and each graphical output is linked to the detailed sequence alignments between the query and the matched reference sequences. GTVseq also reports the potential 'repeats' and/or 'recombination' sequence region in a separated window. GTVseq does not replace completely other well-known genotyping tools such as NCBI's virus sequence genotyping tool (http://www.ncbi. nlm.nih.gov/projects/genotyping/formpage.cgi), but provides additional information useful in the confirmation or for further investigation of the genotype(s) for the newly isolated viral sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11C
• /
• pp.1113-1121
• /
• 2009

In this paper, the channel estimation and pilot sequence design technique of multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in multi-cell environments are studied for situations in which the inter cell interference (ICI) is the dominant channel impairment. We design pilot sequence aiming at minimizing mean square error and propose the channel estimation technique correspond to the designed pilot sequences. The proposed pilot sequences employ the sequences with good correlation properties such as Chu sequence and through simulations, it is shown that channel estimation algorithm using designed pilot sequence is effective for mitigating the ICI.

• Journal of Plant Biology
• /
• v.39 no.1
• /
• pp.49-55
• /
• 1996

We have studied the DNA of Allium sativum L. with respect to highly repetitive sequences. Fast reassociated DNA fragments expected to be highly repetitive sequences based on $C_{o}t$ curve were isolated and characterized. Their copy numbers were approximately $10^{5}~10^{7}$ per haploid genome. Nucleotide sequences analysis of six candidates reveals that their G/C content were low, 25-40% and typical patterns of repeating sequences exist. Repeat sequences were used as probes to access restriction fragment length polymorphism (RFLP) of genomic DNAs of four local clones, Tanyang, Mungyong, So san, and Uisong. The hybridization pattern were very similar among these four local clones.clones.