• 호남수학학술지
• /
• 제27권2호
• /
• pp.183-194
• /
• 2005

A permutation graph is the graph of inversions in a permutation. Here we determine whether a given labelled graph is a permutation graph or not and when a graph is a permutation graph we find the associated permutation. We also characterize all the 2-regular permutation graphs.

• 대한수학회논문집
• /
• 제10권4호
• /
• pp.831-837
• /
• 1995

In this paper, we introduce a permutation graph over a graph G as a generalization of both a graph bundle over G and a standard permutation graph, and study a characterization of a natural isomorphism and an automorphism of permutation graphs over a graph.

• 호남수학학술지
• /
• 제27권4호
• /
• pp.551-559
• /
• 2005

A permutation graph over a graph G is a generalization of both a graph bundle and a graph covering over G. In this paper, we characterize the F-permutation graphs over a graph whose chromatic numbers are 2. We determine the chromatic numbers of $C_n$-permutation graphs over a tree and the $K_m$-permutation graphs over a cycle.

• Journal of the Korean Data and Information Science Society
• /
• 제18권4호
• /
• pp.1145-1155
• /
• 2007

In this paper, we consider the permutation tests for the multivariate data under the two-sample problem setting. We review some testing procedures, which are parametric and nonparametric and compare them with the permutation ones. Then we consider to try to apply the permutation tests to the multivariate data having the continuous and discrete components together by choosing some suitable combining function through the partial testing. Finally we discuss more aspects for the permutation tests as concluding remarks.

• 정보보호학회논문지
• /
• 제9권4호
• /
• pp.37-48
• /
• 1999

현대암호방식은 종래의 선형 대수와 수리이론을 적용한 암호통신을 벗어난 유사 잡음성을 띠는 카오스 신호를 이용한 암호통신을 적용해 오고 있다,[1-2] 본 논문은 1차 permutation 알고 리즘을 이용 하여 변환된 정보를 2차 이산 카오스 변환 함수를 이용해 암호화하는 광영상 암호시스템을 제안하여UT 다. 제안된 시스템은 키수열 발생기의 출력을 통해 영상정보를 permutation 하는 알고리즘 을 설계하였고 이에 대한 검정을 수행하였다. 또한 본 논문에서는 permutation 알고리즘을 통해 제한적인 카오스 함수 의 적용시 발생하는 문제점을 해결하고 비도를 증가시킴으로써 광영상 암호시스템에 적용 시 그 타당성 을 검정하였다. Current encryption methods have been applied to secure communication using discrete chaotic system whose output is a noise-like signal which differs from the conventional encryption methods that employ algebra and number theory[1-2] We propose an optical encryption method that transforms the primary pattern into the image pattern of discrete chaotic function first a primary pattern is encoded using permutation algorithm, In the proposed system we suggest the permutation algorithm using the output of key steam generator and its security level is analyzed. In this paper we worked out problem of the application about few discrete chaos function through a permutation algorithm and enhanced the security level. Experimental results with image signal demonstrate the proper of the implemented optical encryption system.

• 한국컴퓨터정보학회논문지
• /
• 제20권12호
• /
• pp.169-174
• /
• 2015

Permutation p-values are provided for the agreement measures for multivariate interval data among many raters. Three agreement measures, Berry and Mielke's measure, Janson and Olsson's measure, and Um's measure are described and compared. Exact and resampling permutation methods are utilized to compute p-values and empirical quantile limits for three measures. Comparisons of p-values demonstrate that resampling permutation methods provide close approximations to exact p-values, and Berry and Mielke's measure and Um's measure show similar performance in terms of measuring agreement.

• East Asian mathematical journal
• /
• 제25권3호
• /
• pp.247-262
• /
• 2009

Permutation and combination are the part of mathematics which can be introduced the pliability and diversity of thought. In prior studies of permutation and combination, there treated difficulties of learning, strategy of problem solving, and errors that students might come up with. This paper provides the method so that meaningful teaching and learning might occur through the systematic approach of permutation and combination. But there were little prior studies treated counting numbers that basic of mathematics' action. Therefore this paper tries to help the understanding of permutation and combination with the process of changing from informal knowledge to formal knowledge.

• 대한수학회지
• /
• 제34권2호
• /
• pp.453-467
• /
• 1997

A transitive permutation representation of a group G is said to be multiplicity-free if all of its irreducible constituents are distinct. The character corresponding to the action is called the permutation character, given by $(1_H)^G$, where H is the stabilizer of a point. Multiplicity-free permutation characters are of interest in the study of centralizer algebras and distance-transitive graphs, and all finite simple groups are known to have such characters. In this article, we extend to the alternating groups the result of J. Saxl who determined the multiplicity-free permutation representations of the symmetric groups. We classify all subgroups H for which $(1_H)^An, n > 18$, is multiplicity-free.

• 말소리와 음성과학
• /
• 제5권4호
• /
• pp.211-216
• /
• 2013

The IVA(Independent Vector Analysis) is a well-known FD-ICA method used to solve the frequency permutation problem. It generally works quite well for blind source separation problems, but still needs some improvements in the frequency bin permutation problem. This paper proposes a post-processing method which can improve the source separation performance with the IVA by fixing the remaining frequency permutation problem. The proposed method makes use of the correlation coefficient of power ratio between frequency bins for separated signals with the IVA-based 2-channel source separation. Experimental results verified that the proposed method could fix the remaining frequency permutation problem in the IVA and improve the speech quality of the separated signals.

• 전자공학회논문지B
• /
• 제33B권9호
• /
• pp.37-48
• /
• 1996

In this paper, for the single s-a-E fault detected in a triangular cellular permutation network (TCPN), we propose a method which can tolerate a fault by reconfiguring the netowrk and analyze the possibilities of the reconfiguration. The network is set up through iterative decomposition of a permutation into the right or left coset. For the s-a-E fault of a cell which is to be transpositioned for an increasing order mapping, we cna reconfigure it merely by switching te decomposition scheme from right coset to left coset or vice versa. Also for a decreasing order mapping, we make a detour around the faulty cell. Reconfiguring with the redundant connectivity of a TCPN, we could realize form 17% to 90% of the permutation for the number of inputs from 4 to 40. REconfiguration of the network by exchanging the first input with the last input and the first output with the last output resulted in more than 99% realization of the permutation. Also with the exchange of all inputs and outputs with neighboring cells, we could have 100% realization of the permutation.