• 대한수학회보
• /
• 제51권4호
• /
• pp.1175-1186
• /
• 2014

We construct new binary optimal self-dual codes of length 50. We develop a construction method for binary self-dual codes with a fixed-point-free automorphism of order 2. Using this method, we find new binary optimal self-dual codes of length 52. From these codes, we obtain Lee-optimal self-dual codes over the ring $\mathbb{F}_2+u\mathbb{F}_2$ of lengths 25 and 26.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 2006년도 춘계학술발표회 논문집(I)
• /
• pp.462-465
• /
• 2006

This paper is aimed at proposing the sampling method to reduce variance of statistical parameters in uncertainty analysis of concrete structures. The proposed method is a modification of Latin Hypercube sampling method. This uses specially modified tables of random permutations of rank number. Also, the Spearman coefficient is used to make modified tables. Numerical analysis is carried out to predict the uncertainty of axial shortening in prestressed concrete bridge. The numerical results show that the method is efficient for uncertainty analysis of complex structural system such as prestressed concrete bridges.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.888-891
• /
• 2002

Banyan network is a popular and basic structure of the multistage ATM switches. This paper presents a novel approach to resolve the internal blocking of the banyan network by using Non-Blocking Permutation Generator (NBPG). The NBPG performs two functions, i.e., the first is to extract the conflict cells from the incoming cells and the second is to re-assign new input port addresses to the conflict cells. As a result, NBPG generates non-blocking I/O permutations. To estimate the performance of NBPG, we provide several simulation results.

• Journal of applied mathematics & informatics
• /
• 제6권3호
• /
• pp.901-914
• /
• 1999

In [6] Schensted constructed the Schensted algorithm giving a bijection between permutations and pairs of Young standard tableaux. After knuth generalized it to column strict tableaux in [3] various analogs of the Schensted algorithm came. In this paper we describe the bumping algorithm on the shifted rim hook tableaux which is the basic building block of the Schensted algorithm for shifted rim book tableaux.

• 충청수학회지
• /
• 제18권2호
• /
• pp.145-159
• /
• 2005

In this paper we introduced the concept of perfect folding defined on $E^2$ which equipped by perfect k-coloring of r-monohedral tillings. Then we studied the different cases of perfect foldings of 4-monohedral and 3-monohedral tillings of $E^2$. Also the permutations describe each folding are obtained.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2006년도 PROCEEDINGS OF JOINT CONFERENCEOF KDISS AND KDAS
• /
• pp.229-233
• /
• 2006

In teaching statistics in the secondary school, most math teachers do it and students enjoy it well before 11th grade. But, both of teachers and students feel statistics hard at 11th grade, which has been contained permutations, combinations, random variables, probability distributions, hypotheses and tests for normal distribution. In this study, we explore the efficient teaching methods of statistics for math teachers and also find many students enjoying it.

• 대한수학회보
• /
• 제53권5호
• /
• pp.1281-1289
• /
• 2016

Richard Stanley suggested the problem of finding combinatorial proofs of formulas for counting regions of certain hyperplane arrangements defined by hyperplanes of the form $x_i=0$, $x_i=x_j$, and $x_i=2x_j$ that were found using the finite field method. We give such proofs, using embroidered permutations and linear extensions of posets.

• 대한수학회지
• /
• 제35권1호
• /
• pp.225-234
• /
• 1998

We compute genus distributions for bouquets of dipoles by using the method concerning the cycle structure of permutations in the symmetric group. From this, we can deduce that every bouquet of dipoles is upper embeddable. We find a foumula for computing the embedding polynomials for bouquets of dipoles.

• 대한수학회보
• /
• 제60권3호
• /
• pp.733-746
• /
• 2023

Let (X, d) be a semimetric space. A permutation Φ of the set X is a combinatorial self similarity of (X, d) if there is a bijective function f : d(X × X) → d(X × X) such that d(x, y) = f(d(Φ(x), Φ(y))) for all x, y ∈ X. We describe the set of all semimetrics ρ on an arbitrary nonempty set Y for which every permutation of Y is a combinatorial self similarity of (Y, ρ).

• 융합정보논문지
• /
• 제11권2호
• /
• pp.238-242
• /
• 2021

본 연구의 목적은 건강한 모발을 유지하기 위해 트리트먼트로 모발을 유지 관리하기 위해서이다. 잦은 퍼머넌트로 인한 모발 끝에 많은 손상을 가져오는데 손상된 모발 끝을 보호하기 위해 단계별로 퍼머넌트 웨이브 전·후 처리제를 사용한다. 본 연구에 사용된 은행잎 추출물은 항균, 항산화 및 항암에 효과적이고 혈액순환과 피부보습 효과가 있다. 이 추출물을 파마지 1장과 파마지 2장에 적셔 와인딩한 후 큐티클, 인장강도 및 웨이브 형성률을 알아보고자 한다. 평균비교분석을 하였으며, 파마지 2장에 은행잎 추출물을 적용하였을 때 퍼머넌트한 모발끝이 모발개선효과가 가장 높은 것으로 나타났다.