• Journal of the Korea Society of Computer and Information
• /
• v.27 no.6
• /
• pp.167-174
• /
• 2022

In this paper we investigate the permutation test for the equality of correlation coefficients in several independent populations. Permutation test is a non-parametric testing methodology based upon the exchangeability of observations. Exchangeability is a generalization of the concept of independent, identically distributed random variables. Using permutation method, we may construct asymptotically exact test. This method is asymptotically as powerful as standard parametric tests and is a valuable tool when the sample sizes are small and normality assumption cannot be met. We first review existing parametric approaches to test the equality of correlation coefficients and compare them with the permutation test. At the end, all the approaches are illustrated using Iris data example.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.4
• /
• pp.899-910
• /
• 2016

Asymptotic tests are often not suitable for the analysis of sparse ordered contingency tables as asymptotic p-values may either overestimate or underestimate the true pvalues. In this pater, we describe permutation procedures in which we compute exact or resampling p-values for a weighted specific-category agreement in ordered $k{\times}k$ contingency tables. We use the weighted specific-category kappa proposed by $Kv{\dot{a}}lseth$ to measure the extent to which two independent raters agree on the specific categories. We carried out comparison studies between exact p-values, resampling p-values and asymptotic p-values using $3{\times}3$ contingency data (real and artificial data sets) and $4{\times}4$ artificial contingency data.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.8
• /
• pp.157-164
• /
• 2021

Regression analysis is a well-known statistical technique useful to explain the relationship between response variable and predictor variables. In particular, Researchers are interested in comparing the regression coefficients(intercepts and slopes) of the models in two independent populations. The Chow test, proposed by Gregory Chow, is one of the most commonly used methods for comparing regression models and for testing the presence of a structural break in linear models. In this study, we propose the use of permutation method and compare it with Chow test analysis for testing the equality of two independent linear regression models. Then simulation study is conducted to examine the powers of permutation test and Chow test.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.5
• /
• pp.179-187
• /
• 2023

In this paper, we studied the impact of outliers on the power of the significance tests for Cronbach alpha reliability coefficient. Four variables were varied: sample size, the number of items, the number of outliers and population Cronbach Alpha levels. We simulated data using multivariate normal distribution and used outliers sampled from uniform distribution. To test the significance of Cronbach Alpha Reliability, parametric approach(F statistic) and permutation method were used. Consequently, we observed that the powers of permutation test are equal to or greater than those of F test under all conditions, and also both F test and permutation test lose the power as the number of outliers increases, and that these effects of outliers on the power are enhanced for increasing population alpha levels.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.7
• /
• pp.175-182
• /
• 2020

Fisher's classical method for combining independent p-values from continuous distributions is widely used but it is known to be inadequate for combining p-values from discrete probability distributions. Instead, the discrete analog of Fisher's classical method is used as an alternative for combining p-values from discrete distributions. In this paper, firstly we obtain p-values from discrete probability distributions associated with multi-sample location test data (Fisher-Pitman test and Kruskall-Wallis test data) by permutation method, and secondly combine the permutaion p-values by the discrete analog of Fisher's classical method. And we finally compare the combined p-values from both the discrete analog of Fisher's classical method and Fisher's classical method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.6
• /
• pp.869-879
• /
• 2023

Sparkle is one of the finalists in the Lightweight Cryptography Standardization Process conducted by NIST. It is a nonlinear permutation and serves as a core component for the authenticated encryption algorithm Schwaemm and the hash function Esch. In this paper, we provide specific forms of input and output differences for 6 rounds of Sparkle384 and 7 rounds of Sparkle512, and make formulas for the complexity of finding input pairs that satisfy these differentials. Due to the significantly lower complexity compared to similar tasks for random permutations with the same input and output sizes, they can be valid distinguishing attacks. The numbers(6 and 7) of attacked rounds are very close to the minimum numbers(7 and 8) of really used rounds.

• The Korean Journal of Applied Statistics
• /
• v.7 no.2
• /
• pp.289-297
• /
• 1994

A block design will be said to have Property C if the concordance matrix can be expressed as a linear combination of Kronecker product of permutation matrices. No matrix inversions are necessary for the intrablock analysis of the block designs which possesses the Property C(Paik, 1985). In this paper, in order to show the Li type PBIB designs possesses the Property C, we suggest the structure of the concordance matrices of Li type PBIB designs are multi-nested block circulant pattern.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.40-48
• /
• 1998

Linear size expanders have been studied in many fields for the practical use, which make it possible to connect large numbers of device chips in both parallel communication systems and parallel computers. One major limitation on the efficiency of parallel computer designs has been the highly cost of parallel communication between processors and memories. Linear order concentrators can be used to construct theoretically optimal interconnection network schemes. Existing explicitly defined constructions are based on expanders, which have large constant factors, thereby rendering them impractical for reasonable sized networks. For these objectives, we use the more detailed matching points in permutation functions, to find out the bigger expansion constant from an equation, $\mid\Gamma_x\mid\geq[1+d(1-\midX\mid/n)]\midX\mid$. This paper presents an improvement of expansion constant on constructing concentrators using expanders, which realizes the reduction of the size in a superconcentrator by a constant factor. As a result, this paper shows an explicit construction of (n, 5, $1-\sqrt{3/2}$) expander. Thus, superconcentrators with 209n edges can be obtained by applying to the expanders of Gabber and Galil's construction.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1842-1850
• /
• 1997

This paper proposes a new rearrangeable algorithm in multistage reverse shuffle/exchange network. The best known lower bound of stages for rearrangeability in symmetric network is 2logN-1 stages. However, it has never been proved for nonsymmetric networks before. Currently, the best upper bound for the rearrangeability of a shuffle/exchange network in nonsymmetric network is 3logN-3 stages. We describe the rearrangeability of reverse shuffle/exchange multistage interconnection network on every arbitrary permutation with $N{\le}16$. This rearrangeability can be established by setting one more stages in the middle stage of the network to allow the reduced network to be topological equivalent to a class of rearrangeable networks. The results in this paper enable us to establish an upper bound, 2logN stages for rearrangeable reverse shuffle/exchange network with $N{\le}16$, and leads to the possibility of this bound when $N{\le}16$.