• Proceedings of the KSAR Conference
• /
• 2002.06a
• /
• pp.90-90
• /
• 2002

In this study, we report the cloning of the porcine UPII genomic DNA, which contains a putative full-length open reading frame encoding the UPII protein. A comparison of the porcine UPII gene coding sequence with the previously published mouse UPII sequence demonstrates that only the exon sequences are partially conserved. Northern and immunohistochemical analyses show that the porcine UPII gene is expressed only in the urothelium and that the protein specifically localizes to urothelial superficial cells. (omitted)

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.13-27
• /
• 1996

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1901-1904
• /
• 2002

A good performance on communication systems is obtained by decreasing the length of training sequence In the initial stage of adaptive equalization. This paper presents a new approach to accomplish this, with the use of a training adaptive equalizer. The approach is based on combining the training and tracking modes, in which the training equalizer is updated by the LMS algorithm with the training sequence and then updated by a blind algorithm. By computer simulations, it is shown that a class of the proposed equalizers provides better performance than the conventional training equalizer.

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.299-310
• /
• 2009

In this paper, we proposed a new method to correct the zoom lens distortion for the video sequence captured by the zoom lens. First, we defined the nonlinear zoom lens distortion model which is represented by the focal length and the lens distortion using the characteristic that lens distortion parameters are nonlinearly and monotonically changed while the focal length is increased. Then, we chose some sample images from the video sequence and estimated a focal length and a lens distortion parameter for each sample image. Using these estimated parameters, we were able to optimize the zoom lens distortion model. Once the zoom lens distortion model was obtained, lens distortion parameters of other images were able to be computed as their focal lengths were input. The proposed method has been made experiments with many real images and videos. As a result, accurate distortion parameters were estimated from the zoom lens distortion model and distorted images were well corrected without any visual artifacts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.669-677
• /
• 2003

In spite of many advantages of Meteor Burst Communications(MBC) on its transmission channel, the fact that its duty rate is less than10 percents is a considerable deficiency of MBC. To overcome with this deficiency without paying large cost, we use a direct sequence(DS)-spread spectrum(SS) method applying a reference code to improve the duty rate on the transmission channel. This method doesn't need to add the components for acquisition or tracking the signal so that it keeps the cost efficiency the MBC has as well as improves the duty rate on the transmission channel. The improvement by this method is more significant when the received signal is weak. Simulation results show that if we increases the process gain (Gp) by 10 dB when the average burst length is 50ms, the burst length tends to be extended more than 220% of its average length, 160ms, and the frequency of generating this phenomenon increases 3.1 times more.

• Asian-Australasian Journal of Animal Sciences
• /
• v.17 no.7
• /
• pp.897-902
• /
• 2004

PSMC5 subunit, which belongs to the 26S proteasomal subunit family, plays an important role in the antigen presentation mediated by MHC class I molecular. Full-length cDNA of porcine PSMC5 was isolated using the in silico cloning and rapid amplification of cDNA ends (RACE). Amino acid was deduced and the primary structure was analyzed. Results revealed that the porcine PSMC5 gene shares the high degree of sequence similarity with its mammalian counterparts at both the nucleotide level and the amino acid level. The RT-PCR was performed to detect the porcine PSMC5 expression pattern in seven tissues and the result showed that high express level was observed in spleen, lung, marrow and liver while the low express level was in muscle. The full-length genomic DNA sequence of porcine PSMC5 gene was amplified by PCR and the genomic structure revealed that this gene was comprised by 12 exons and 11 introns. Best alignment of the cDNA and genomic exon DNA sequence presents 4 mismatches and this information potentially bears further study in gene polymorphisms.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.168-175
• /
• 2003

Until now, substring selectivities have been estimated by two steps. First step is to build up a count-suffix tree, which has statistical information about substrings, and second step is to estimate substring selectivity using it. However, it's actually impossible to build up a count-suffix tree from biological sequences because their lengths are too long. So, this paper proposes a novel data structure, count q-gram tree, consisting of fixed length substrings. The Count q-gram tree retains the exact counts of all substrings whose lengths are equal to or less than q and this tree is generated in 0(N) time and in site not subject to total length of all sequences, N. This paper also presents an estimation technique, k-MO. k-MO can choose overlapping length of splitted substrings from a query string, and this choice will affect accuracy of selectivity and query processing time. Experiments show k-MO can estimate very accurately.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.1-10
• /
• 1975

This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

• Genomics & Informatics
• /
• v.7 no.2
• /
• pp.65-84
• /
• 2009

Sequences from the clones of full-length enriched cDNA libraries serve as valuable resources for functional genomics related studies, genome annotation and SNP discovery. We analyzed 7,392 high-quality chromatograms (Phred value ${\geq}$30) obtained from sequencing the 5' ends of clones derived from full-length enriched cDNA libraries of Korean native pigs including brainstem, liver, cerebellum, neocortex and spleen libraries. In addition, 50,000 EST sequence trace files obtained from GenBank were combined with our sequences to identify cSNPs in silico. The process generated 11,324 contigs, of which 2,895 contigs contained at least one SNP and among them 610 contigs had a minimum of one sequence from Korean native pigs. Of 610 contigs, we randomly selected 262 contigs and performed in silico analysis for the identification of cSNPs. From the results, we identified 1,531 putative coding single nucleotide polymorphisms (cSNPs) and the SNP detection frequency was one SNP per 465 bp. A large-scale sequencing result of clones from full-length enriched cDNA libraries and identified cSNPs will serve as a useful resource to functional genomics related projects such as a pig HapMap project in the near future.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.345-354
• /
• 2005

Subsequence matching is one of the most important operations in the field of data mining. The existing subsequence matching algorithms use only one index, and their performance gets worse as the difference between the length of a query sequence and the site of windows, which are subsequences of a same length extracted from data sequences to construct the index, increases. In this paper, we propose a new subsequence matching method based on index interpolation to overcome such a problem. An index interpolation method constructs two or more indexes, and performs search ing by selecting the most appropriate index among them according to the given query sequence length. In this paper, we first examine the performance trend with the difference between the query sequence length and the window size through preliminary experiments, and formulate a search cost model that reflects the distribution of query sequence lengths in the view point of the physical database design. Next, we propose a new subsequence matching method based on the index interpolation to improve search performance. We also present an algorithm based on the search cost formula mentioned above to construct optimal indexes to get better search performance. Finally, we verify the superiority of the proposed method through a series of experiments using real and synthesized data sets.