• 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.

• Journal of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.223-233
• /
• 2012

In this paper we establish some limsup results and a generalized uniform law of the iterated logarithm (LIL) for the increments of partial sums of a strictly stationary and linearly positive quadrant dependent (LPQD) sequence of random variables.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.554-561
• /
• 2001

Wavelet transformation method which has special qualities of frequency domain and spatial domain is used for watermarking. We have compared the decree of similarity to find a robust watermarking sequence for different attacks, using random number, gaussian sequence, chaos sequence and sobel sequence. The experimental results show that chaos sequence is an effective sequence for robust watermarking.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.21-29
• /
• 2001

We show that image make converts of multiplex resolution using wavelet transform algorithm. To evaluate the robustness. we have measured comparison or similarity using various sequences which is inserted important coefficient of middle frequency band. The wavelet transform is advantage that it has a special quality of frequency domain and a special quality of spatial domain. Watermark is used pseudo random number, gaussian sequence, chaos sequence and sobel sequence. As result of experiments, it is to certify that The chaos sequence similarity is higher than other sequence. So the chaos sequence will be used for watermark sequence.

• Molecules and Cells
• /
• v.26 no.3
• /
• pp.250-257
• /
• 2008

Microsatellites or simple sequence repeats (SSR) are widely distributed in eukaryotic genomes and are informative genetic markers. Despite many advantages of SSR markers such as a high degree of allelic polymorphisms, co-dominant inheritance, multi-allelism, and genome-wide coverage in various plant species, they also have shortcomings such as low polymorphic rates between genetically close lines, especially in Capsicum annuum. We developed an alternative technique to SSR by normalizing and alternating anchored primers in random amplified microsatellite polymorphisms (RAMP). This technique, designated reverse random amplified microsatellite polymorphism (rRAMP), allows the detection of nucleotide variation in the 3' region flanking an SSR using normalized anchored and random primer combinations. The reproducibility and frequency of polymorphic loci in rRAMP was vigorously enhanced by translocation of the 5' anchor of repeat sequences to the 3' end position and selective use of moderate arbitrary primers. In our study, the PCR banding pattern of rRAMP was highly dependent on the frequency of repeat motifs and primer combinations with random primers. Linkage analysis showed that rRAMP markers were well scattered on an intra-specific pepper map. Based on these results, we suggest that this technique is useful for studying genetic diversity, molecular fingerprinting, and rapidly constructing molecular maps for diverse plant species.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.5
• /
• pp.25-36
• /
• 2022

This paper proposes a random sign reversal technique in space frequency block code for single carrier modulation. The traditional space time and frequency block coding technique may be confronted with radio environments openly, severe radio hijacking problems are to be overcome. In order to avoid such an open radio issue, random coded data protection technique for space-time block code was proposed, but this algorithm can change channel combination per an Orthogonal Frequency Division Multiplexing block. This kind of slow switching increases the probability that nearby receivers will detect the transmitted data. This paper proposes a fast switching algorithm per data symbols' basis which is a random sign reversal technique in space frequency block code for Single Carrier Modulation. It is shown in simulation that the proposed one has a superior performance in comparison with the performance of the receiver which do not know the random timing sequence of sign reversal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.630-637
• /
• 2003

This paper proposed a new watermarking algorithm using chaotic sequence instead of conventional M-sequence for protecting copyright to the author. Robustness and security is very important for watermarking process. We use multi-threshold value according to the human visual system for improving robustness of watermarking to each subband images coefficient differently after wavelet transform. And then, we embedded watermark image to original image by multi-watermark weights which are made by random sequence generator. We detect watermark image from the difference data which is made from each wavelet subband images. We also simulate the efficiency from the various possible attacks. Chaotic sequence is better than M-sequence, because the one is very easy to make sequence and the chaotic sequence is changed easy according to the initial value. So, the chaotic sequence has the better security than the conventional M-sequence.

• Proceedings of the Korean Society for Applied Microbiology Conference
• /
• 2001.06a
• /
• pp.77-80
• /
• 2001

A variety of different methods to generate diverse proteins, including random mutagenesis and recombination, are currently available, and most of them accumulate the mutations on the target gene of a protein, whose sequence space remains unchanged. On the other hand, a pool of diverse genes, which is generated by random insertions, deletions, and exchange of the homologous domains with different lengths in the target gene, would present the protein lineages resulting in new fitness landscapes. Here we report a method to generate a pool of protein variants with different sequence spaces by employing green fluorescent protein (GFP) as a model protein. This process, designated functional salvage screen (FSS), comprises the following procedures： a defective GFP template expressing no fluorescence is firstly constructed by genetically disrupting a predetermined region(s) of the protein, and a library of GFP variants is generated from the defective template by incorporating the randomly fragmented genomic DNA from E. coli into the defined region(s) of the target gene, followed by screening of the functionally salvaged, fluorescence-emitting GFPs. Two approaches, sequence-directed and PCR-coupled methods, were attempted to generate the library of GFP variants with new sequences derived from the genomic segments of E. coli. The functionally salvaged GFPs were selected and analyzed in terms of the sequence space and functional property. The results demonstrate that the functional salvage process not only can be a simple and effective method to create protein lineages with new sequence spaces, but also can be useful in elucidating the involvement of a specific region(s) or domain(s) in the structure and function of protein.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.55-60
• /
• 2014

In this paper, we will obtain Marcinkiewicz's type limit laws for fuzzy random sets as follows : Let {$X_n{\mid}n{\geq}1$} be a sequence of independent identically distributed fuzzy random sets and $E{\parallel}X_i{\parallel}^r_{{\rho_p}}$ < ${\infty}$ with $1{\leq}r{\leq}2$. Then the following are equivalent: $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ a.s. in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in probability in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_1$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_r$ where $S_n={\Sigma}^n_{i=1}\;X_i$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.207-210
• /
• 2000

지금까지 인간이나 다른 생물체의 전체 유전체 염기서열을 밝혀내는 작업은 크게 세가지 방법으로 진행되었다. Clone-by-clone approach, sequence tagged connector approach, random shotgun approach(1)가 그것인데 마지막의 random shotgun approach는 fragment assembly problem을 비롯한 여러 가지 전산학적인 문제들을 수반한다. 이 논문은 저자들의 국내 최초로 미생물체의 전체 염기서열을 random shotgun approach를 이용하여 밝혀낸 경험을 바탕으로 그에 따르는 문제인 fragment assembly problem에 대해 소개하고 그에 수반되는 몇 가지 전산학적인 문제와 몇 가지 해결책에 대해 설명하려 한다.