• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.472-473
• /
• 2021

The frequency-hopping sequence is a type of user-specific code that has been used in various ways in military communication, Bluetooth, and ultra-wideband communications. In a practical communication environment, a frequency-hopping sequence with an alphabet and a length suitable for the number of available frequencies and transmission period is required. Therefore, the design of the frequency-hopping sequence having various parameters is a very important problem in frequency-hopping spread-spectrum communication. To this end, this paper explores a method of synthesizing a sequence of a new length through the synthesis of existing frequency-hopping sequences. As a result, it is possible to present the possibility of frequency-hopping sequences applicable to various environments of communications.

• ETRI Journal
• /
• v.42 no.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.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.433-440
• /
• 2003

Artinian O-sequences of codimension 3 and type 3 with length 7 are classified as level or non-level. Some cases are proved to be non-level among the 334 cases which have been suspected to be level.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1401-1410
• /
• 2017

Cryptographic synchronization which synchronizes internal state of cryptographic algorithm and ciphertext stream between an encryptor and a decryptor affects the quality of secure communication. If there happens a synchronization loss between a transmitter and a receiver in a secure communication, the output of the receiver is unintelligible until resynchronization is made. Especially, in the secure communication on a wireless channel with high BER, synchronization performance can dominate its quality. In this paper, we proposed a novel and noise robust synchronization signal generation method as well as its detection algorithm. We generated a synchronization signal in the form of a masking structure based on the maximal length sequence, and developed a detection algorithm using a correlation property of the maximal length sequence. Experimental results have demonstrated that the proposed synchronization signal outperforms the conventional concatenated type synchronization signal in a noisy environment.

• BMB Reports
• /
• v.35 no.3
• /
• pp.273-282
• /
• 2002

Sp3 is a bifunctional transcription factor that has been reported to stimulate or repress the transcription of numerous genes. Although the size of Sp3 mRNA is 4.0kb, the size of the known Sp3 cDNA sequence is 3.6kb. Thus, Sp3 functional studies have been performed with an artificially introduced start codon, and thus an amino-terminus that differs from the wild-type. Ideally, full-length cDNA expression vectors with the appropriate start codon should be utilized for these studies. Using 5'rapid amplification of cDNA ends, a full-length Sp3 cDNA clone was generated and the sequence verified in nine cell lines. No AUG initiation codon was present. However, stop codons were present in all three frames 5' to the known coding sequence. In vitro translation of this full-length cDNA clone produced the expected three isoforms-one at 100 kDa and two in the mid 60 kDa range. Electrophoretic mobility shift assays showed that the protein products had the ability to bind to the Sp1/3 consensus sequence. In vitro studies, using our Sp3 clone and site directed mutagenesis, identified the translation initiation site for the larger isoform as AUA. AUA has not been previously described as an endogenous initiation codon in eukaryotes.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.2
• /
• pp.164-171
• /
• 2005

This study aims to examine an effect of stacking sequence and curvature on the penetration characteristic of a composite laminated shell. For the purpose, we manufactured specimens with different stacking sequences and curvatures, and conducted a penetration test using an air-gun. To examine an influence according to stacking sequence, as flat plate and curvature specimen had more plies, their critical penetration energy was higher, Critical penetration energies of specimen A and C with less interfaces somewhat higher than those of B and D with more interfaces. The reason that with less interfaces, critical penetration energy was higher is pre-impact bending stiffness of composite laminated shell with less interfaces was lower than that of laminated shell with more interfaces, but bending stiffness after impact was higher. And it is because interface, the weakest part of the composite laminated shell, was influenced by transverse impact. As curvature increases, critical penetration energy increases linearly. It is because as curvature increases, resistance to in-plane deformation as well as bending deformation increases, which need higher critical penetration energy. Patterns of cracks caused by penetration of composite laminated shells include interlaminar crack, intralaminar crack, and laminar fracture. A 0$^{\circ}$ply laminar had a matrix crack, a 90$^{\circ}$ply laminar had intralaminar crack and laminar fracture, and interface between 0$^{\circ}$and 90$^{\circ}$laminar had a interlaminar crack. We examined crack length and delamination area through a penetration test. For the specimen A and C with 2 interface, the longest circumferential direction crack length and largest delamination area were observed on the first interface from the impact point. For the specimen B and D with 4 interface, the longest crack length and largest delamination area were observed on the third interface from the impact point.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.1001-1008
• /
• 2019

A high-quality pseudorandom sequence generation is an important part of many cryptographic applications, including encryption protocols. Therefore, a pseudorandom number generator (PRNG) is an essential element for generating key sequences in a cryptosystem. A PRNG must effectively generate a large, high-quality random data stream. It is well known that the bitstreams output by the CA-based PRNG are more random than the bitstreams output by the LFSR-based PRNG. In this paper, we prove that the complemented CA derived from 90/150 maximum length cellular automata(MLCA) is a MLCA to design a PRNG that can generate more secure bitstreams and extend the key space in a secret key cryptosystem. Also we give a method for calculating the cell positions outputting a nonlinear sequence with maximum period in complemented MLCA derived from a 90/150 MLCA and a complement vector.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.461-472
• /
• 2007

The emphasis in genome projects has Been moving towards the sequence analysis in order to extract biological "meaning"(e.g., evolutionary history of particular molecules or their functions) from the sequence. Especially. palindromic or direct repeats that appear in a sequence have a biophysical meaning and the problem is to recognize interesting patterns and configurations of words(strings of characters) over complementary alphabets. In this paper, we propose an algorithm to identify variable length palindromic pairs(longer than a threshold), where we can allow gaps(distance between words). The algorithm is called palindrome algorithm(PA) and has O(N) time complexity. A palindromic pair consists of a hairpin structure. By composing collected palindromic pairs we build n-pair palindromic patterns. In addition, we dot some of the longest pairs in a circle to represent the structure of a DNA sequence. We run the algorithm over several selected genomes and the results of E.coli K12 are presented. There existed very long palindromic pair patterns in the genomes, which hardly occur in a random sequence.

• Journal of Plant Biotechnology
• /
• v.31 no.3
• /
• pp.179-184
• /
• 2004

A doubled-haploid (DH) population was developed through anther culture of F$_1$ plants obtained from a cross between a japonica cultivar, 'Nagdongbyeo', as male parent and a indica cultivar, 'Samgangbyeo', as female parent. Segregation modes for plant length, culm length, panicle length, third internode length, and days to heading in the DH lines showed nearly normal distribution with wide range of variation. A molecular map with 136 simple sequence repeat (SSR) markers was constructed using the DH population. The total map distance was 1,909 cM and the average interval of marker distance was 14 cM.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.114-122
• /
• 2010

The Probabilistic Traveling Salesman Problem (PTSP) is an important topic in the study of traveling salesman problem and stochastic routing problem. The goal of PTSP is to find a priori tour visiting all customers with a minimum expected length, which simply skips customers not requiring a visit in the tour. There are many existing researches for the homogeneous version of the problem, where all customers have an identical visiting probability. Otherwise, the researches for the heterogeneous version of the problem are insufficient and most of them have focused on search base algorithms. In this paper, we propose a simple construction algorithm to solve the heterogeneous PTSP. The Minimum Expected Length Insertion (MELI) algorithm is a construction algorithm and consists of processes to decide a sequence of visiting customers by inserting the one, with the minimum expected length between two customers already in the sequence. Compared with optimal solutions, the MELI algorithm generates better solutions when the average probability is low and the customers have different visiting probabilities. We also suggest a local search method which improves the initial solution generated by the MELI algorithm.