• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.113-119
• /
• 2009

The training sequence with the appropriate length for equalization and initial synchronization is necessary before sending the pure data in the burst transmission type DS-UWB system. The length of the training sequence is one of the factors which make throughput decreased. The noble structure with the variable length of the training sequence whose length can be adaptively tailored according to the channel conditions (CM1,CM2,CM3,CM4) in the DS-USB systems is proposed. This structure can increase the throughput without sacrificing the performance than the method with fixed length of training sequence considering the worst case channel conditions. Simulation results under IEEE 802.15.3a channel model show that the proposed scheme can achieve higher throughput than a conventional one with the slight loss of BER performance. And this structure can reduce the computation complexity and power consumption with selecting the short length of the training sequence.

• The Plant Pathology Journal
• /
• v.18 no.4
• /
• pp.187-191
• /
• 2002

This paper describes the cloning and sequence analysis of the 5'-terminal region and full-length cDNA production of genomic RNA of Lily symptomless virus (LSV), a Species Of the genus Carlavirus. A sing1e DNA band about 600 bp harboring the 5'-end of genomic RNA of the virus was successfully amplified by reverse transcription-polymerase chain reaction (RT-PCR) and rapid amplification of cDNA ends (RACE), and was cloned for nucleotide sequence determination. Sequence analysis of selected RACE cDNA clones revealed that the LSV 5'non-translated region consists of 67 nucleotides long of AT rich stretch followed GC rich from the 5'-end. To produce full-length cDNA products for the viral genomic RNA, a set of LSV-specific primers could be designed based on the obtained sequence in this study and the known sequences of 3'-terminal region for the virus. Full-length cDNA copies of LSV, an 8.4 kb long, were directly amplified by the long-template RT-PCR technique from the purified viral genomic RNA samples. This full-length cDNA copies were analyzed by restriction mapping. The molecules produced in this study can be useful for the production of in vitro infectious cDNA clone, as well as, for the completion of genomic RNA sequence and genome structure for the virus.

• Communications of the Korean Mathematical Society
• /
• v.35 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1193-1199
• /
• 1996

This paper introduces an algorithm which uses MUIO and the shortest paths to minimize the length of test sequence. The length of test sequence is equal to the total number of the edges in a symmetric test graph $G^{*}$. Therefore, it is important to make a $G^{*}$ with the least number of the edges. This algorithm is based on the one proposed Shen[2]. It needs the complexity to make shortest paths but reduces the thest sequence by 1.0~9.8% over the Shen's algorithm. and this technique, directly, derives a symmetric test graph from an FMS.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.230-236
• /
• 2012

Based on the known binary sequence sets and Gray mapping, a new method for constructing quaternary sequence sets is presented and the resulting sequence sets' properties are investigated. As three direct applications of the proposed method, when we choose the binary aperiodic, periodic, and Z-complementary sequence sets as the known binary sequence sets, the resultant quaternary sequence sets are the quaternary aperiodic, periodic, and Z-complementary sequence sets, respectively. In comparison with themethod proposed by Jang et al., the new method can cope with either both the aperiodic and periodic cases or both even and odd lengths of sub-sequences, whereas the former is only fit for the periodic case with even length of sub-sequences. As a consequence, by both our and Jang et al.'s methods, an arbitrary binary aperiodic, periodic, or Z-complementary sequence set can be transformed into a quaternary one no matter its length of sub-sequences is odd or even. Finally, a table on the existing quaternary periodic complementary sequence sets is given as well.

• Journal of Internet Computing and Services
• /
• v.25 no.4
• /
• pp.47-56
• /
• 2024

This paper proposes a method for fine-tuning BERT-based natural language processing models to perform sentiment analysis on Korean review data. By varying the input sequence length during this process and comparing the performance, we aim to explore the optimal performance according to the input sequence length. For this purpose, text review data collected from the clothing shopping platform M was utilized. Through web scraping, review data was collected. During the data preprocessing stage, positive and negative satisfaction scores were recalibrated to improve the accuracy of the analysis. Specifically, the GPT-4 API was used to reset the labels to reflect the actual sentiment of the review texts, and data imbalance issues were addressed by adjusting the data to 6:4 ratio. The reviews on the clothing shopping platform averaged about 12 tokens in length, and to provide the optimal model suitable for this, five BERT-based pre-trained models were used in the modeling stage, focusing on input sequence length and memory usage for performance comparison. The experimental results indicated that an input sequence length of 64 generally exhibited the most appropriate performance and memory usage. In particular, the KcELECTRA model showed optimal performance and memory usage at an input sequence length of 64, achieving higher than 92% accuracy and reliability in sentiment analysis of Korean review data. Furthermore, by utilizing BERTopic, we provide a Korean review sentiment analysis process that classifies new incoming review data by category and extracts sentiment scores for each category using the final constructed model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2357-2363
• /
• 1997

In this paepr, we show that the length of the test sequence can be reduced using non-minimal multiple UIO instead of minimal multiple UIO. Our test sequence generation method starts from the observation that Shen's approach cannot optimize the length of the test sequence whtn the difference between the number of incoming edge and that of outgoing edge is large. Usig the property, we propse a more efficient method to generate a UIO-based test sequence in terms of the length, and compares our method with other existing methods in terms of execution time for comformancetesting and time for generation of test sequence.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.4
• /
• pp.287-294
• /
• 2021

A Python-based LSTM model was constructed using a Tensorflow backend to estimate the amount of outflow during floods in the Gokgyo-cheon basin flowing into the Sapgyo Lake. To understand the effects of the length of input data used for learning, i.e., the sequence length, on the performance of the model, the model was implemented by increasing the sequence length to three, five, and seven hours. Consequently, when the sequence length was three hours, the prediction performance was excellent over the entire period. As a result of predicting three extreme rainfall events in the model verification, it was confirmed that an average NSE of 0.96 or higher was obtained for one hour in the leading time, and the accuracy decreased gradually for more than two hours in the leading time. In conclusion, the flood level at the Gangcheong station of Gokgyo-cheon can be predicted with high accuracy if the prediction is performed for one hour of leading time with a sequence length of three hours.

• Journal of the Korean Mathematical Society
• /
• v.39 no.6
• /
• pp.963-973
• /
• 2002

We study torsion phenomena in the integral cohomology of finite if-spaces X through the Eilenberg-Moore spectral sequence converging to H＊($\Omega$X; Z$_{p}$). We also investigate how the difference between the Z$_{p}$-filtration length f$_{p}$(X) and the Z$_{p}$-cup length c$_{p}$(X) on a simply connected finite H-space X is reflected in the Eilenberg-Moore spectral sequence converging to H＊($\Omega$X;Z$_{p}$). Finally we get the following result: Let p be an odd prime and X an n-connected finite H-space with dim QH＊ (X;Z$_{p}$) $\leq$ m. Then H＊(X;Z) is p-torsion free if (equation omitted).tion omitted).

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.109-112
• /
• 2002

In this paper, we propose the efficient digital watermarking scheme to transmit effectively the compressed medical image that embedded with watermarking data in mobile Internet access channel. The wireless channel error based on multiple access interference (MAI) is closely related to the length of spreading sequence in CDMA system. Also, the fixed length coded medical image with watermark bit stream can be classified by significance of source image. In the simulation, we compare the peak signal to noise ratio (PSNR) performance when the watermarked image with a simple symbol and when the watermarked image with a text file is transmitted using variable length of spreading sequences in case of limited length of spread sequence.