• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1039-1055
• /
• 2014

The distribution of a test statistic under a null hypothesis depends on the unknown distribution of the data and thus is unknown as well. Conditional tests replace the unknown null distribution by the conditional null distribution, that is, the distribution of the test statistic given the observed data. This approach is known as permutation tests and was developed by Fisher (Fisher, 1935). Theoretical framework for permutation tests was given by Strasser and Weber(1999). The coin package developed by Hothon et al. (2006, 2008) implements a unified approach for conditional inference via the generic independence test. Because convenient functions for the most prominent problems are available, users will not have to use the extremely flexible procedure. In this article we briefly review the underlying theory from Strasser and Weber (1999) and explain how to transform the data to perform the generic function independence test. Finally it was illustrated with a few real data sets.

• Communications for Statistical Applications and Methods
• /
• v.21 no.1
• /
• pp.11-22
• /
• 2014

In this study, we propose a simultaneous test procedure based on the individual - values for each sub-null hypothesis with several well-known combining functions. We then compare the efficiency of our procedure with existing tests by obtaining empirical powers through a simulation study. Finally, we discuss some interesting features related to simultaneous test and point out a misconduct for the simulation study published in the previous work.

• Communications for Statistical Applications and Methods
• /
• v.19 no.1
• /
• pp.129-134
• /
• 2012

In this paper we review a bi-aspect nonparametric test for the two-sample problem under the location translation model and propose a new one to accommodate a more broad class of underlying distributions. Then we compare the performance of our proposed test with other existing ones by obtaining empirical powers through a simulation study. Then we discuss some interesting features related to the bi-aspect test with a comment on a possible expansion for the proposed test as concluding remarks.

• Communications for Statistical Applications and Methods
• /
• v.20 no.4
• /
• pp.241-246
• /
• 2013

In this study, we propose a nonparametric simultaneous test procedure for the location translation and scale parameters. We consider the Wilcoxon rank sum test for the location translation parameter and the Mood test for the scale parameter with the quadratic and maximal types of combining functions. Then we derive the limiting null distributions of the combining functions. We illustrate our procedure with an example and compare efficiency by obtaining the empirical powers through a simulation study. Finally, we discuss some interesting features related to the nonparametric simultaneous tests.

• The Korean Journal of Applied Statistics
• /
• v.25 no.5
• /
• pp.821-827
• /
• 2012

In this study, we propose a new nonparametric test procedure for the multivariate data. In order to accommodate the generalized alternatives for the multivariate case, we construct test statistics via-values with some useful combining functions. Then we illustrate our procedure with an example and compare efficiency among the combining functions through a simulation study. Finally we discuss some interesting features related with the new nonparametric test as concluding remarks.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.195-197
• /
• 1987

A new method of model reduction, based on the differentiation of polynomials, is Introduced by Gutman(1982). Without the reciprocal transformation, and the differentiation of the numerator and denominator polynomials of the transfer function, used by Gutman, the lower-order system can be obtained by the permutation of the order of numerator and denominator and the number of differentiation.

• ETRI Journal
• /
• v.23 no.4
• /
• pp.158-167
• /
• 2001

We examine the diffusion layers of some block ciphers referred to as substitution-permutation networks. We investigate the practical and provable security of these diffusion layers against differential and linear cryptanalysis. First, in terms of practical security, we show that the minimum number of differentially active S-boxes and that of linearly active S-boxes are generally not identical and propose some special conditions in which those are identical. We also study the optimal diffusion effect for some diffusion layers according to their constraints. Second, we obtain the results that the consecutive two rounds of SPN structure provide provable security against differential and linear cryptanalysis, i.e., we prove that the probability of each differential (resp. linear hull) of the consecutive two rounds of SPN structure with a maximal diffusion layer is bounded by $p^n(resp.q^n)$ and that of each differential (resp. linear hull) of the SDS function with a semi-maximal diffusion layer is bounded by $p^{n-1}(resp. q^{n-1})$, where p and q are maximum differential and linear probabilities of the substitution layer, respectively.

• Industrial Engineering and Management Systems
• /
• v.10 no.2
• /
• pp.134-139
• /
• 2011

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

• International Journal of Contents
• /
• v.11 no.4
• /
• pp.56-69
• /
• 2015

This paper proposes an efficient image encryption scheme based on quintuple encryption using two chaotic maps. The encryption process is realized with quintuple encryption by calling the encrypt(E) and decrypt(D) functions five times with five different keys in the form EDEEE. The decryption process is accomplished in the reverse direction by invoking the encrypt and decrypt functions in the form DDDED. The keys for the quintuple encryption/decryption processes are generated by using a Tent map. The chaotic values for the encrypt/decrypt operations are generated by using a Gumowski-Mira map. The encrypt function E is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage scrambles all the rows and columns to chaotically generated positions. This stage reduces the correlation radically among the neighboring pixels. The pixel value rotation stage circularly rotates all the pixels either left or right, and the amount of rotation is based on chaotic values. The last stage performs the diffusion four times by scanning the image in four different directions: Horizontally, Vertically, Principal diagonally and Secondary diagonally. Each of the four diffusion steps performs the diffusion in two directions (forward and backward) with two previously diffused pixels and two chaotic values. This stage ensures the resistance against the differential attacks. The security and performance of the proposed method is investigated thoroughly by using key space, statistical, differential, entropy and performance analysis. The experimental results confirm that the proposed scheme is computationally fast with security intact.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.79-88
• /
• 2008

In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.