• Convergence Security Journal
• /
• v.10 no.2
• /
• pp.19-26
• /
• 2010

In this study, we try to make up for the vulnerability in steganography that it is easily revealed the hidden logo image in cover image by bit-plane extraction. For this, we apply some methods, the permutation which shift the scattered pieces of logo image to one side, bit-plane dispersion insertion method and pack-type compressor.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1357-1365
• /
• 1991

This paper proposes the generation of several classes of frequency hopping patterns. which are derived by permutation, for an asynchronous frequency hopping spread spectrum multiple accecss system (FH/SSMA). The first class of hopping patterns is obtained by using a Latin square. The second class of hopping patterns is derived by generalizing the first class which is designed by using a permutation technique. The third class of hopping patterns is designed by using a rotational base of elements. We evaluate the hit property of the proposed classes of hopping patterns when these patterns are nutually shifted in an FH/SSMA system. Compared to the Reed Slolmon sequences generated by the conventional method, the sequence obtained by the permutation technique can reduce the number of hits among hopping frequencies in asynchronous time/frequency shift.

• 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.

• Communications for Statistical Applications and Methods
• /
• v.20 no.2
• /
• pp.147-155
• /
• 2013

To determine whether each coefficient is equal to zero or not, usual $t$-tests are a popular choice (among others) in linear regression to practitioners because all statistical packages provide the statistics and their corresponding $p$-values. Under smaller samples (especially with non-normal errors) the tests often fail to correctly detect statistical significance. We propose a permutation approach by adopting a sufficient dimension reduction methodology to overcome this deficit. Numerical studies confirm that the proposed method has potential advantages over the t-tests. In addition, data analysis is also presented.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.36-42
• /
• 2010

This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.

• Korean Management Science Review
• /
• v.14 no.2
• /
• pp.47-61
• /
• 1997

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.499-514
• /
• 1996

Consider an additive regression model of Y on X = (X$_1$,X$_2$,. . .,$X_p$), Y = $sum_{j=1}^pf_j(X_j) + $\varepsilon$$, where $f_j$s are smooth functions to be estimated and $\varepsilon$ is a random error. If $X_j$s are fixed design points, we call it the fixed design additive model. Since the response variable Y is observed at fixed p-dimensional design points, the behavior of the nonparametric regression estimator depends on the design. We propose a fixed design called permutation fixed design, and fit the regression function by the kernel method. The estimator in the permutation fixed design achieves the univariate optimal rate of convergence in mean squared error for any p $\geq$ 2.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.47-47
• /
• 1989

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.115-127
• /
• 1996

Based on a job insertion method, we developed a heuristic algorithm for the mean flowtime objective in a permutation flowshop environment. The simulation experiments are implemented to evaluate the effectiveness of the proposed algorithm against the existing heuristics. The experiments reveal the superiority of the proposed algorithm to other heuristics especially when the ratio of the number of jobs and number of machines is greater than or equal to two.

• The Mathematical Education
• /
• v.48 no.2
• /
• pp.113-139
• /
• 2009

In this study, we apply the discovery method in the instruction of Permutation and Combination, and examine the effect upon the student's emotion after the instruction change. The research progressed through the instruction by the discovery method for two students of highschool Y. This research has been done for about one and half year from November 2006 to February 2008. We draw our research results through a series of processes consisted of videotaping a classroom activities, recording interview details and writing an observation diary, with the aim of the experimental instruction. In the end, we get to the conclusion that students showed a strong positive attitude on the discovery instructional method and that diverse discovery method has supplementary relation in classwork.