• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.430-432
• /
• 2015

This paper describes a hardware implementation of ultra-lightweight block cipher algorithm PRESENT-80/128 that supports for two master key lengths of 80-bit and 128-bit. The PRESENT algorithm that is based on SPN (substitution and permutation network) consists of 31 round transformations. A round processing block of 64-bit data-path is used to process 31 rounds iteratively, and circuits for encryption and decryption are designed to share hardware resources. The PRESENT-80/128 crypto-processor designed in Verilog-HDL was verified using Virtex5 XC5VSX-95T FPGA and test system. The estimated throughput is about 550 Mbps with 275 MHz clock frequency.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.54-58
• /
• 2005

한우 17번 염색체 유전자 지도에서 QTL (quantitative trait loci) 분석을 실시하여 선별된 Loci 값들을 순열검정(Permutation Test)을 이용하여 유의성 검정을 실시하였다. 한편, 우수 경제형질 DNA marker들을 K-평균 군집법을 실시 파악하였다. 또한, 부스트랩 방법을 이용하여 선별된 Locus의 DNA Marker들의 신뢰구간을 구하였다. 이들 QTL과 K-평균법, 부스트랩 방법에 의해 한우의 염색체 17번 BMS941의 우수 DNA Marker 85, 105번을 선별하였다.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.1097-1102
• /
• 2009

Classification of subjects with unknown distribution in small sample size setup may involve order-restricted constraints in multivariate parameter setups. Those problems makes optimality of conventional likelihood ratio based statistical inferences not feasible. Fortunately, Roy (1953) introduced union-intersection principle(UIP) which provides an alternative avenue. Redescending M-estimator along with that principle yields a considerably appropriate robust testing procedure. Furthermore, conditionally distribution-free test based upon exact permutation theory is used to generate p-values, even in small sample. Applications of this method are illustrated in simulated data and read data example (Lobenhofer et al., 2002)

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.10a
• /
• pp.325-329
• /
• 2003

한우 6번 염색체 유전자 지도에서 QTL (quantitative trait loci) 분석을 실시하여 선별된Locus 값을 순열검정(Permutation Test)을 이용하여 유의성 검정을 실시하였다. 한편, 우수경제형질 DNA marker들을 K-평균 군집법을 실시 파악하였다. 이들 QTL과 K-평균법에 의해 한우의 염색체 6번 ILSTS035의 우수 DNA marker 235번을 선별하였다. 선별된 DNA Marker 235번을 출품우에 적용하여 Bootstrap 방법을 이용하여 신뢰구간을 구하여 검정하였다.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.05a
• /
• pp.85-90
• /
• 2002

Microarray technology allows the monitoring of expression levels for thousands of genes simultaneously. In time-course experiments in which gene expression is monitored over time we are interested in testing gene expression profiles for different experimental groups. We propose a statistical test based on the ANOVA model to identify genes that have different gene expression profiles among experimental groups in time-course experiments. Using this test, we can detect genes that have different gene expression profiles among experimental groups. The proposed model is illustrated using cDNA microarrays of 3,840 genes obtained in an experiment to search for changes in gene expression profiles during neuronal differentiation of cortical stem cells.

• Communications for Statistical Applications and Methods
• /
• v.22 no.2
• /
• pp.121-135
• /
• 2015

We consider testing equality of mean functions from two samples of functional data. A novel test based on the adaptive Neyman methodology applied to the Hotelling's T-squared statistic is proposed. Under the enlarged null hypothesis that the distributions of the two populations are the same, randomization methods are proposed to find a null distribution which gives accurate significance levels. An extensive simulation study is presented which shows that the proposed test works very well in comparison with several other methods under a variety of alternatives and is one of the best methods for all alternatives, whereas the other methods all show weak power at some alternatives. An application to a real-world data set demonstrates the applicability of the method.

• Journal of Embryo Transfer
• /
• v.19 no.3
• /
• pp.291-299
• /
• 2004

Characterization of quantitative trait loci (QTL) was investigated in the experimental cross population between Berkshire and Yorkshire breed. A total of 512 F$_2$ offspring from 65 matting of F$_1$ parents were phenotyped the carcass traits included average daily gain (ADG), average backfat thickness (ABF), tenth rip backfat thickness (TRF), loin eye area (LEA), and last rip backfat thickness (LRF). All animals were genotyped for 125 markers across the genome. Marker linkage maps were derived and used in QTL analysis based on line cross least squares regression interval mapping. A decision tree to identify QTL with imprinting effects was developed based on tests against the Mendelian mode of QTL expression. To set the evidence of QTL presence, empirical significance thresholds were derived at chromosome-wise and genome-wise levels using specialized permutation strategies. Significance thresholds derived by the permutation test were validated in the data set based on simulation of a pedigree and data structure similar to the Berkshire-Yorkshire population. Genome scan revealed significant evidences for 13 imprinted QTLs affecting growth and body compositions of which nine were identified to be QTL with paternally expressed inheritance mode. Four of QTLs in the loin eye area (LEA), and tenth rip backfat thickness (TRF), a maternally expressed QTL were found on chromosome 10 and 12. These results support the useful statistical models to analyse the imprinting far the QTLs related carcass trait.

• Genomics & Informatics
• /
• v.14 no.4
• /
• pp.187-195
• /
• 2016

In genetic association studies with high-dimensional genomic data, multiple group testing procedures are often required in order to identify disease/trait-related genes or genetic regions, where multiple genetic sites or variants are located within the same gene or genetic region. However, statistical testing procedures based on an individual test suffer from multiple testing issues such as the control of family-wise error rate and dependent tests. Moreover, detecting only a few of genes associated with a phenotype outcome among tens of thousands of genes is of main interest in genetic association studies. In this reason regularization procedures, where a phenotype outcome regresses on all genomic markers and then regression coefficients are estimated based on a penalized likelihood, have been considered as a good alternative approach to analysis of high-dimensional genomic data. But, selection performance of regularization procedures has been rarely compared with that of statistical group testing procedures. In this article, we performed extensive simulation studies where commonly used group testing procedures such as principal component analysis, Hotelling's $T^2$ test, and permutation test are compared with group lasso (least absolute selection and shrinkage operator) in terms of true positive selection. Also, we applied all methods considered in simulation studies to identify genes associated with ovarian cancer from over 20,000 genetic sites generated from Illumina Infinium HumanMethylation27K Beadchip. We found a big discrepancy of selected genes between multiple group testing procedures and group lasso.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.413-414
• /
• 2007

Successful speech recognition in noisy environments for intelligent robots depends on the performance of preprocessing elements employed. We propose an architecture that effectively combines adaptive beamforming (ABF) and blind source separation (BSS) algorithms in the spatial domain to avoid permutation ambiguity and heavy computational complexity. We evaluated the structure and assessed its performance with a DSP module. The experimental results of speech recognition test shows that the proposed combined system guarantees high speech recognition rate in the noisy environment and better performance than the ABF and BSS system.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.739-748
• /
• 2007

The objective of this research study is to develop the permutation-based genetic algorithm for solving the resource-constrained project scheduling problem in construction engineering by incorporating elitism into genetic algorithm. A key aspect of the algorithm was the development of the elitist roulette selection operator to preserve the best individual solution for the next generation so the improved solution can be obtained. Another notable characteristic is the application of the parallel schedule generation scheme to generate a feasible solution to the problem. Case studies with a standard test problem were presented to demonstrate the performance and accuracy of the algorithm. The computational results indicate that the proposed algorithm produces reasonably good solutions for the resource-constrained project scheduling problem.