• 제목/요약/키워드: Permutation test

검색결과 88건 처리시간 0.032초

초경량 블록암호 PRESENT-80/128의 하드웨어 구현 (A Hardware Implementation of Ultra-Lightweight Block Cipher PRESENT-80/128)

  • 조욱래;김기쁨;신경욱
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2015년도 추계학술대회
    • /
    • pp.430-432
    • /
    • 2015
  • 80/128-비트의 마스터키를 지원하는 초경량 블록암호 PRESENT-80/128의 하드웨어 구현에 대해 기술한다. PRESENT 알고리듬은 SPN (substitution and permutation network)을 기반으로 하며 31번의 라운드 변환을 갖는다. 64-비트 데이터 패스를 갖는 단일 라운드 변환 회로를 이용하여 31번의 라운드가 반복처리 되도록 하였으며, 암호화/복호화 회로가 공유되도록 설계하였다. Verilog HDL로 설계된 PRESENT 프로세서를 Virtex5 XC5VSX-95T FPGA로 구현하여 정상 동작함을 확인하였다. 최대 275 Mhz 클록으로 동작하여 550 Mbps의 성능을 갖는 것으로 예측되었다.

  • PDF

A Major DNA Marker Mining of microsatellite loci in Hanwoo Chromosome 17

  • 이용원;이제영
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2005년도 춘계학술대회
    • /
    • 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번을 선별하였다.

  • PDF

Robust Inference for Testing Order-Restricted Inference

  • Kang, Moon-Su
    • 응용통계연구
    • /
    • 제22권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)

순열검정과 부스트랩 방법에 의한 한우 6번 염색체의 ILSTS035에 대한 우수 DNA Marker 선별

  • 이용원;이제영;김문정;한초희
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2003년도 추계 학술발표회 논문집
    • /
    • 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 방법을 이용하여 신뢰구간을 구하여 검정하였다.

  • PDF

Statistical Tests for Time Course Microarray Experiments

  • 박태성;이성곤;최호식;이승연;이용성
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2002년도 춘계 학술발표회 논문집
    • /
    • 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.

  • PDF

A Two Sample Test for Functional Data

  • Lee, Jong Soo;Cox, Dennis D.;Follen, Michele
    • Communications for Statistical Applications and Methods
    • /
    • 제22권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.

돼지에 있어서 양적 형질 유전자좌(QTL) 발현 특성 분석을 위한 통계적 검정 모형 설정 (Designing of the Statistical Models for Imprinting Patterns of Quantitative Traits Loci (QTL) in Swine)

  • 윤두학;공홍식;조용민;이지웅;최익서;이학교;전광주;오성종;정일정
    • 한국수정란이식학회지
    • /
    • 제19권3호
    • /
    • pp.291-299
    • /
    • 2004
  • 요크셔종과 버크셔종 교배 실험 집단을 활용하여 양적형질 유전자좌 (QTL)의 발현 특성 관련 유전 양식을 조사하였다. 총 512두의 F$_2$ 자손이 F$_1$간의 65교배 조합으로부터 생산되었으며 표현형 조사 기록은 일당증제량(ADG), 평균 등지방 두께(ABF), 10번째 등뼈 부위 등지방 두께(TRF) 및 등심단면적(LEA), 최후 척추부위 등지방 두께 (LRF)였다. 125종의 유전자 표지 (microsatellite)에 대한 3세대 개체별 유전자형이 분석되었으며 이들 정보를 통하여 최소자승 회귀 모형을 이용한 interval mapping 방법을 적용하였다. QTL의 유전양식 여부 검정에 대한 절차를 도식화하기 위해 귀무가설인 통상의 벤델리안 모형에 근거를 두고 수행하였다. 경험적 다중 검정 통계량에 대한 임계치는 단일 개개의 염색체 수준과 게놈 전반에 걸친 실험수준으로 유도하였으며, permutation에 의해 유도된 임계치의 유효성을 검증하기 위해 본 연구에 활용된 실험축 집단 구조와 유사한 simulation 집단 구조에 의해 산출된 결과들과 비교하여 유효성이 인정되었다. 본 연구에 활용된 실험축 집단구조와 Genome 전반에 걸친 QTL imprinting 여부를 조사한 결과 13종의 QTL 에 대한 imprinting이 확인되었으며 이들 중 9종의 QTL 유전 양식은 부계로부터 전달된 자손에게만 발현되는 것으로 추론되었다.

Multiple Group Testing Procedures for Analysis of High-Dimensional Genomic Data

  • Ko, Hyoseok;Kim, Kipoong;Sun, Hokeun
    • Genomics & Informatics
    • /
    • 제14권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.

원거리 음성인식 시스템의 잡음 제거 기법에 대한 연구 (Noise removal algorithm for intelligent service robots in the high noise level environment)

  • 우성민;이상훈;정홍
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2007년도 하계종합학술대회 논문집
    • /
    • 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.

  • PDF

APPLYING ELITIST GENETIC ALGORITHM TO RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM

  • Jin-Lee Kim;Ok-Kyue Kim
    • 국제학술발표논문집
    • /
    • The 2th International Conference on Construction Engineering and Project Management
    • /
    • 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.

  • PDF