• The Korean Journal of Applied Statistics
• /
• v.34 no.6
• /
• pp.863-874
• /
• 2021

In this paper, we propose a post-selection inference procedure for the fused lasso signal approximator (FLSA). The FLSA finds underlying sparse piecewise constant mean structure by applying total variation (TV) semi-norm as a penalty term. However, it is widely known that this convex relaxation can cause asymptotic inconsistency in change points detection. As a result, there can remain false change points even though we try to find the best subset of change points via a tuning procedure. To remove these false change points, we propose a post-selection inference for the FLSA. The proposed procedure applies a permutation test based on CUSUM statistic. Our post-selection inference procedure is an extension of the permutation test of Antoch and Hušková (2001) which deals with single change point problems, to multiple change points detection problems in combination with the FLSA. Numerical study results show that the proposed procedure is better than naïve z-tests and tests based on the limiting distribution of CUSUM statistics.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.6
• /
• pp.37-46
• /
• 2006

It is known to be hard to apply cryptographic one-way functions to the recognition system using bio-information directly. As one of the solutions about that problem there is a permutation transformation scheme. However, they did not show my algorithmic behavior or any performance analysis of the transformation by experiment. In this paper, by showing the recognition ratio of the transformed scheme by experiment, we prove that that scheme is sound. Also, we adopt their transformation to LDA(Linear Discriminant Analysis) to show the experimental results. In the negative side, we introduce a new type of attack against the permutation transformation schemes. finally, we briefly mention a generalization of the permutation transformation for countermeasure of the attack at the end of this paper.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.133-142
• /
• 2021

Travel pattern recognition is widely used in many aspects such as user trajectory query, user behavior prediction, interest recommendation based on user location, user privacy protection and municipal transportation planning. Because the current recognition accuracy cannot meet the application requirements, the study of travel pattern recognition is the focus of trajectory data research. With the popularization of GPS navigation technology and intelligent mobile devices, a large amount of user mobile data information can be obtained from it, and many meaningful researches can be carried out based on this information. In the current travel pattern research method, the feature extraction of trajectory is limited to the basic attributes of trajectory (speed, angle, acceleration, etc.). In this paper, permutation entropy was used as an eigenvalue of trajectory to participate in the research of trajectory classification, and also used as an attribute to measure the complexity of time series. Velocity permutation entropy and angle permutation entropy were used as characteristics of trajectory to participate in the classification of travel patterns, and the accuracy of attribute classification based on permutation entropy used in this paper reached 81.47%.

• 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 Korea Society of Industrial Information Systems
• /
• v.17 no.6
• /
• pp.1-9
• /
• 2012

Low-cost RFID tags are used in many applications. However, since it has very limited power of computation and storage, it's not easy to make a RFID mutual authentication protocol which can resist from the various security attacks. Quite recently, Tian et al. proposed a new ultralightweight authentication protocol (RAPP) for low-cost RFID tags using the low computation cost operations; XOR, rotation, and permutation operations, which is able to resist from the various security attacks. In this paper, we show that RAPP is vulnerable to the de-synchronization attack and present an improved RAPP which overcomes the vulnerability of RAPP.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.1-8
• /
• 2008

Low Density Parity Check codes(LDPC) are recently focused on communication systems due to its good performance. The standard of WiBro has also included LDPC codes as a channel coding. The weak point of implementation for LDPC encoder is that conventional binary Matrix Vector Multiplier has many clock cycles which limit throughput. In this paper, we propose semi-parallel architecture by using cyclic shift registers and exclusive-OR without conventional Matrix Vector Multipliers over the standard parity check matrices with Circulant Permutation Matrices(CPM). Furthermore, multi-rate encoder is designed by using proposed architecture. Our encoder with multi-rate for IEEE 802.16e LDPC has lower clock cycles and higher throughput.

• Journal of Ocean Engineering and Technology
• /
• v.13 no.1 s.31
• /
• pp.23-28
• /
• 1999

For offshore structures, dynamic analysis becomes increasingly important as water depth increases and structural configuration becomes more slender. In the case of dynamic analysis of frame structures, much computer time and high cost are required due to many degrees of freedom, In this paper, a new technique of permutating a segment of frame structure to a beam is developed, which is called here Beam Permutation Technique. The technique is based on definition of stiffness matrix of the beam which is obtained by defining the actions(or forces) required to obtain unit translation or rotation for each degree of freedom wiht al other degree of freedom restrained to zero displacement or rotation. In the technique, an assumption is made that relative positions of nodes in the ends of the segment are not variable, The technique can significantly reduce the degrees of freedom of frame structures and thus the computiong time in dynamic analysis. The natural frequencies and static displacements of the permutated beam are obtained and compared to those of ANSYS with a good agreement.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.12 no.2
• /
• pp.81-86
• /
• 2000

For on-shore structures, dynamic analysis becomes increasingly important as the water depth increases and the structural configuration becoines slenderer. In this study, an estimation method for equivalent three dimensional (30) hydrodynamic coefficients is introduced as a part of beam permutation technique development. The beam pemlUtation technique is being developed for obtaining an equivalent beam to a frame structure in order to reduce the degrees of freedom and thus the analysis time significantly. Two 3D structures are used in order to verify the obtained equivalent 3D hydrodynamic coefficients. Two commercial softwares, ANSYS and SACS, are used for the verification. The results of the present analysis are found to be satisfactory in comparison with those by the two softwares.

• Journal of the Korean School Mathematics Society
• /
• v.24 no.1
• /
• pp.19-38
• /
• 2021

The purpose of this study is to examine pre-service teachers' noticing when evaluating peers' mathematical problem posing tasks. To this end, 46 secondary pre-service teachers were asked to create real-world problems related to permutation and combination and randomly assigned to evaluate peers' problems. As a result, the pre-service teachers were most likely to notice the difficulty of their peers' mathematics problems. In particular, the pre-service teachers tended to notice particular conditions in order to increase the difficulty of a problem. In addition, the pre-service teachers noticed the clarity of a question and its solution, novelty of the problem, the natural connection between real-world contexts and mathematical concepts, and the convergence between mathematical concepts.

• Communications for Statistical Applications and Methods
• /
• v.31 no.5
• /
• pp.571-584
• /
• 2024

To identify differentially expressed genes (DEGs), researchers use a testing method for each gene. However, microarray data are often characterized by large dimensionality and a small sample size, which lead to problems such as reduced analytical power and increased number of tests. Therefore, we propose a clustering method. In this method, genes with similar expression patterns are clustered, and tests are conducted for each cluster. This method increased the sample size for each test and reduced the number of tests. In this case, we used a nonparametric permutation test in the proposed method because independence between samples cannot be assumed if there is a relationship between genes. We compared the accuracy of the proposed method with that of conventional methods. In the simulations, each method was applied to the data generated under a positive correlation between genes, and the area under the curve, power, and type-one error were calculated. The results show that the proposed method outperforms the conventional method in all cases under the simulated conditions. We also found that when independence between samples cannot be assumed, the non-parametric permutation test controls the type-one error better than the t-test.