• 대한수학회논문집
• /
• 제13권3호
• /
• pp.445-459
• /
• 1998

Let λ be a partition with all distinct parts. In this paper we give a bijection between the set $\Gamma$$_{λ}$(X) of pairs (equation omitted) satisfying a certain condition and the set $\pi_{λ}$(X) of circled permutation tableaux of shape λ on the set X, where P$\frac{1}{2}$ is a tail circled shifted rim hook tableaux of shape λ and (equation omitted) is a barred permutation on X. Specializing to the partition λ with one part, this bijection gives a combinatorial proof of the Schur identity: $\Sigma$2$\ell$(type($\sigma$)) = 2n! summed over all permutation $\sigma$ $\in$ $S_{n}$ with type($\sigma$) $\in$ O $P_{n}$ . .

• Communications for Statistical Applications and Methods
• /
• 제22권3호
• /
• pp.285-294
• /
• 2015

A permutation test is the popular and attractive alternative to derive asymptotic distributions of dimension test statistics in sufficient dimension reduction methodologies; however, recent studies show that a bootstrapping technique also can be used. We consider two types of bootstrapping dimension determination, which are partial and whole bootstrapping procedures. Numerical studies compare the permutation test and the two bootstrapping procedures; subsequently, real data application is presented. Considering two additional bootstrapping procedures to the existing permutation test, one has more supporting evidence for the dimension estimation of the central subspace that allow it to be determined more convincingly.

• Communications for Statistical Applications and Methods
• /
• 제8권1호
• /
• pp.137-145
• /
• 2001

There are many situations in which the well-known tests such as log-rank test and Gehan-Wilcoxon test fail to detect the survival differences. Assuming large samples, these tests are developed asymptotically normal properties. Thus, they shall be called asymptotic tests in this paper, Several asymptotic tests sensitive to some specific types of survival differences have been recently proposed. This paper compares by simulations the test levels and the powers of the conventional asymptotic tests and their random permutation versions. Simulation studies show that the random permutation tests possess competitive powers compared to the corresponding asymptotic tests, keeping exact test levels even in the small sample case. It also provides the guidelines for choosing the valid and most powerful test under the given situation.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 B
• /
• pp.616-619
• /
• 1997

The spectrum-recovery scheme in Hadamard transform spectroscopy is commonly implemented with a fast Hadamard transform (FHT). When the Hadamard or simplex matrix corresponding to the mask does not have the same ordering as the Hadamard matrix corresponding to the FHT, a modification is required. When the two Hadamard matrices are in the same equivalence class, this modification can be implemented as a permutation scheme. This paper investigates permutation schemes for this application. This paper is to relieve the confusion about the applicability of existing techniques, reveals a new, more efficient method: and leads to an extension that allows a permutation scheme to be applied to any Hadamard or simplex matrix in the appropriate equivalence class.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.157-161
• /
• 2015

A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes.

• 한국전자통신학회논문지
• /
• 제7권1호
• /
• pp.117-124
• /
• 2012

본 논문에서는 cycle-4를 쉽게 피하고 가변 부호율과 길이로 접근할 수 있게 하는 순환 치환 행렬(CPM; circulant permutation matrix)을 토대로 한 간단한 패리티 검사 행렬의 구성 방법을 제안한다. 결과적으로 부행렬 연산은 여러 CPM들의 곱셈으로 처리될 수 있으며 LDPC 부호화 계산은 매우 간단하게 수행된다. 또한 LDPC 부호의 고속 부호화 문제를 고려한다. 제안한 설계는 정규, 비정규 LDPC 부호 둘 다를 위한 간단한 행렬 연산에 근거한 고속 부호화를 가능하게 한다.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.679-684
• /
• 2005

In this paper, we characterize a permutation property of a certain type of binomials over the field through the use of Hermite's criterion.

• 응용통계연구
• /
• 제22권5호
• /
• pp.1059-1072
• /
• 2009

마이크로어레이 극소수 샘플(array) 자료의 분석에서는 유의한 발현수치를 나타내는 유전자를 검정통계량에 의해 결정하는 것이 주요과제이다. 이 때 수 천 또는 수 만개인 유전자의 발현수치로부터 귀무분포(null distribution)의 생성이 필수적이며, 극소수 샘플 자료의 경우에는 순열방법(permutation methods)에 의해 귀무분포를 생성하는 것이 가장 바람직하다. 본 논문에서는 귀무분포 생성에 사용될 수 있는 매우 단순한 검정통계량을 제시하면서 더불어 귀무분포 생성에 적절한 순열방법도 제안한다. 모의실험으로 기존의 검정통계량으로 생성된 귀무분포와 본 논문에서 제안하는 검정통계량의 귀무분포를 비교하며, 실제 자료에 적용하여 유의 유전자를 탐색한다.

• 호남수학학술지
• /
• 제26권3호
• /
• pp.257-268
• /
• 2004

In this paper, we give a proof of the Robinson-Schensted-Knuth correspondence by using the geometric. construction. We represent a generalized permutation in the first quadrant of the Cartesian plane and find a corresponding pair of semi-standard tableaux of same shape. This work extends the classical geometric construction of Viennot [10] for Robinson-Schensted correspondence.

• 대한수학회지
• /
• 제58권4호
• /
• pp.921-948
• /
• 2021

We continue the investigations in [6] extending the Bruhat order on n × n alternating sign matrices to our more general setting. We show that the resulting partially ordered set is a graded lattice with a well-define rank function. Many illustrative examples are given.