• KSCI Review
• /
• v.14 no.2
• /
• pp.177-183
• /
• 2006

Today, corporation's business support system is intending web environment. However difficulty by elements of tool that Hyeoneop can support web program development efficiently standing be and is. Specially, is suffering difficulty relation data base system and development of wormed web connection program. Because using candidate key attribute of database at web program development in this research hereupon, wish to computerize web development process, and present algorithm that can develop web program efficiently.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.137-140
• /
• 2000

In this paper, we propose as new algorithm for the selection of key frames in a given video. For the selected key frames to be well defined, the selected key frames need to spread out on the whole temporal domain of the given video and guaranteed not to be duplicate. For this purpose, we take the first frame of each shot of the video as the candidate key frame to represent the video. To reduce the overall processing time, we eliminate some candidate key frames which are visually indistinct in the histogram difference. The key frames are then selected using a clustering processing based on the singly linked hierarchical tree. To make the selected key frames be distributed evenly on the whole video, the deviation and time difference between the selected key frames are used. The simulation results demonstrate that our method provides the better performance compared with previous methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.137-143
• /
• 2003

Key frame extraction has been recognized as one of tile important research issues in video information retrieval. Although progress has been made in key frame extraction, the existing approaches do not evaluate the importance of extracted frame Quantitatively, and Dey are computationally expensive or ineffective. In this Paper, we introduce a new 미해rithm for key frame extraction using shot coverage and distortion. The algorithm finds significant key frames from candidate key frames. When selecting the candidate frames, the coverage rate to the total frames from each frame is computed by using the difference between the adjacent frames in tile shot. The frames within 10$\%$ from the top are selected as the candidates. Then, by comfuting the distortion rate of the candidates against all frames, pick the frames which arc most representative are selected. The performance of the proposed algorithm has been verified by a statistical test. Experiments show that more than 13-50$\%$ improvement has been obtained by the proposed algorithm compared to the existing methods.

• Proceedings of the Korean Society of Sericultural Science Conference
• /
• 2003.10a
• /
• pp.23-23
• /
• 2003

We made use of 81, 635 expressed sequence tags (ESTs) derived from 12 different cDNA libraries of Bombyx mori to identify high-quality candidate single nucleotide polymorphisms (SNPs). By PHRAP assembling, we obtained 12, 980 contigs containing 11, 531 contigs assembled by more than one reads. From 117 contig sequences, which were assembled by 1, 576 high-quality reads base-called with PHRED, we identified 101 candidate SNPs and 27 single base insertions/deletions based on a neighborhood quality standard(NQS) of SNP. (omitted)

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.1047-1062
• /
• 2022

Differential power analysis (DPA) is disturbed by ghost peaks. There is a phenomenon that the mean absolute difference (MAD) value of the wrong key is higher than the correct key. We propose a compressed key guessing space (CKGS) scheme to solve this problem and analyze the AES algorithm. The DPA based on this scheme is named CKGS-DPA. Unlike traditional DPA, the CKGS-DPA uses two power leakage points for a combined attack. The first power leakage point is used to determine the key candidate interval, and the second is used for the final attack. First, we study the law of MAD values distribution when the attack point is AddRoundKey and explain why this point is not suitable for DPA. According to this law, we modify the selection function to change the distribution of MAD values. Then a key-related value screening algorithm is proposed to obtain key information. Finally, we construct two key candidate intervals of size 16 and reduce the key guessing space of the SubBytes attack from 256 to 32. Simulation experimental results show that CKGS-DPA reduces the power traces demand by 25% compared with DPA. Experiments performed on the ASCAD dataset show that CKGS-DPA reduces the power traces demand by at least 41% compared with DPA.

• Asian-Australasian Journal of Animal Sciences
• /
• v.18 no.11
• /
• pp.1542-1547
• /
• 2005

The Melanocortin-4 Receptor (MC4R) and Insulin-like Growth Factor 2 (IGF2) are two important candidate genes related to fat deposition and carcass traits. MC4R was found on study on human obesity and then was studied as candidate gene affecting food intake and fat deposition traits in mice and pigs. Insulin-like Growth Factor 2 (IGF2) gene plays an important role on tumor cell proliferation and muscle growth. It also affects fat traits and live weight in pigs. In this paper, MC4R and IGF2 were studied as two candidate genes associated with important economic traits such as fat deposition and carcass traits in five different pig populations. Taq I-PCR-RFLP and Bcn I-PCR-RFLP were respectively used to detect the polymorphism of genotypes of MC4R and IGF2 genes. Different MC4R genotype frequencies were observed in four populations. IGF2 genotype frequencies were also different in two populations. The results of association analysis show both MC4R and IGF2 genes were significantly associated with fat deposition and carcass traits in about 300 pigs. This work will add new evidence of MC4R and IGF2 affecting fat deposition and carcass traits in pigs and show that two genes can be used as important candidate genes for marker assistant selection (MAS) of growth and lean meat percentage in pigs.

• Asian-Australasian Journal of Animal Sciences
• /
• v.30 no.8
• /
• pp.1066-1073
• /
• 2017

Objective: Growth-related traits are important economic traits in the swine industry. However, the genetic mechanism of growth-related traits is little known. The aim of this study was to screen the candidate genes and molecular markers associated with body dimension and body weight traits in pigs. Methods: A genome-wide association study (GWAS) on body dimension and body weight traits was performed in a White $Duroc{\times}Erhualian$ $F_2$ intercross by the illumina PorcineSNP60K Beadchip. A mixed linear model was used to assess the association between single nucleotide polymorphisms (SNPs) and the phenotypes. Results: In total, 611 and 79 SNPs were identified significantly associated with body dimension traits and body weight respectively. All SNPs but 62 were located into 23 genomic regions (quantitative trait loci, QTLs) on 14 autosomal and X chromosomes in Sus scrofa Build 10.2 assembly. Out of the 23 QTLs with the suggestive significance level ($5{\times}10^{-4}$), three QTLs exceeded the genome-wide significance threshold ($1.15{\times}10^{-6}$). Except the one on Sus scrofa chromosome (SSC) 7 which was reported previously all the QTLs are novel. In addition, we identified 5 promising candidate genes, including cell division cycle 7 for abdominal circumference, pleiomorphic adenoma gene 1 and neuropeptides B/W receptor 1 for both body weight and cannon bone circumference on SSC4, phosphoenolpyruvate carboxykinase 1, and bone morphogenetic protein 7 for hip circumference on SSC17. Conclusion: The results have not only demonstrated a number of potential genes/loci associated with the growth-related traits in pigs, but also laid a foundation for studying the genes' role and further identifying causative variants underlying these loci.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.3018-3038
• /
• 2020

In the stereoscopic or multiview display, the depth video illustrates visual distances between objects and camera. To promote the computational efficiency of depth video encoder, we exploit the intra prediction of depth videos under Versatile Video Coding (VVC) and observe a diverse distribution of intra prediction modes with different coding unit sizes. We propose a hybrid scheme to further boost fast depth video coding. In the first stage, we adaptively predict the HADamard (HAD) costs of intra prediction modes and initialize a candidate list according to the HAD costs. Then, the candidate list is further improved by considering the probability distribution of candidate modes with different CU sizes. Finally, early termination of CU splitting is performed at each CU depth level based on the Bayesian theorem. Our proposed method is incorporated into VVC intra prediction for fast coding of depth videos. Experiments with 7 standard sequences and 4 Quantization parameters (Qps) validate the efficiency of our method.

• The Journal of the Korea Contents Association
• /
• v.14 no.9
• /
• pp.24-44
• /
• 2014

This study explores the political meaning of candidate's speech and statement who run for the 18th presidential election in the viewpoint of communication. The visibility of the words and the connectivity between the words are analyzed in the viewpoint of structural aspect and the vision, policy. The visibility of the words is analyzed based on the frequency of the words mentioned in the speech or the statement. The connectivity between the words are analyzed based on the network analysis and expressed by graph. In the case of candidate Park, the key word is the happiness of the people and appointment. The key word for candidate Moon is regime change and the Korean Peninsula and the key word for candidate Ahn is the people and change. This study contributes positively to the study of candidate's discourse in the viewpoint of methodology by using network analysis and exploring scientifically the connectivity of the words. In the theoretical aspect this study uses the results of network analysis for revealing what is the leadership components in the speech and the statement. In conclusion, this study highlights the extension of the communication studies.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.5
• /
• pp.1089-1097
• /
• 2016

It is well-known that, if additional information other than a plaintext-ciphertext pair is available, breaking the RSA cryptosystem may be much easier than factorizing the RSA modulus. For example, Coppersmith showed that, given the 1/2 fraction of the least or most significant bits of one of two RSA primes, the RSA modulus can be factorized in a polynomial time. More recently, Henecka et. al showed that the RSA private key of the form (p, q, d, $d_p$, $d_q$) can efficiently be recovered whenever the bits of the private key are erroneous with error rate less than 23.7%. It is notable that their algorithm is based on counting the matching bits between the candidate key bit string and the given decayed RSA private key bit string. And, extending the algorithm, this paper proposes a new RSA private key recovery algorithm using a generalized probabilistic measure for measuring the consistency between the candidate key bits and the given decayed RSA private key bits.