• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.168-180
• /
• 2002

This paper proposes a novel method to detect unauthorized copies of digital images. This copy detection scheme can be used as either an alternative approach or a complementary approach to watermarking. A test image is reduced to 8$\times$8 sub-image by intensity averaging, and the AC coefficients of its discrete cosine transform (DCT) are used to compute distance from those generated from the query image, of which a user wants to find copies. Copies may be Processed to avoid copy detection or enhance image quality. We show ordinal measure of DCT coefficients, which is based on relative ordering of AC magnitude values and using distance metrics between two rank permutations, are robust to various modifications of the original image. The optimal threshold selection scheme using the maximum a posteriori (MAP) criterion is also addressed.

• International Journal of Concrete Structures and Materials
• /
• v.18 no.2E
• /
• pp.89-95
• /
• 2006

This paper proposes a modified method of Latin Hypercube sampling to reduce the variance of statistical parameters in uncertainty analysis of concrete structures. The proposed method is a modification of Latin Hypercube sampling method. This analysis method uses specifically modified tables of random permutations of ranked numbers. In addition, 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. Statistical parameters obtained from modified Latin Hypercube sampling method and conventional Latin Hypercube sampling method are compared and evaluated by a numeric analysis. The results show that the proposed method results in a decrease in the variance of statistical parameters. This indicates the method is efficient and effective in the uncertainty analysis of complex structural system such as prestressed concrete bridges.

• The Korean Journal of Applied Statistics
• /
• v.23 no.6
• /
• pp.1209-1216
• /
• 2010

We describe shuffling process of 48 HwaTu(Flower) cards from a mathematical aspect and give the number of shuffles that are needed to arrive at a state of randomness. We observe that the cards are shuffled much less times in usual plays, that results in much riskier outcomes.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.777-786
• /
• 2006

Two factorial designs with quantitative factors are called geometrically equivalent if the design matrix of one can be transformed into the design matrix of the other by row and column permutations, and reversal of symbol order in one or more columns. Clark and Dean (2001) gave a sufficient and necessary condition (which we call the 'gCD condition') for two symmetric factorial designs with quantitative factors to be geometrically equivalent. This condition is based on the absolute value of the Euclidean(or Hamming) distance between pairs of design points. In this paper we extend the gCD condition to asymmetric designs. In addition, a modified algorithm is applied for checking the equivalence of two designs.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.1
• /
• pp.161-166
• /
• 2007

In this paper, two 4$\times$4 rectangular patch array antennas operating at 20 GHz are implemented for the satellite communication. The sixteen patch antennas and microstrip feeding line are printed on a single-layered substrate. The design goal is to achieve high directivity and gain by optimizing design parameters through permutations in element spacing. The spacing between the array elements is chosen to be 0.736$\lambda$. Numerical simulation results indicate that the HPBW(Half-Power Beam Width) of the 4$\times$4 patch array antenna is 18.78 degrees in the E-plane and 18.48 degrees in the H-plane with a gain of 17.18 dBi. Numerical simulations of a 4$\times$4 recessed patch array antenna yield a HPBW of 18.71 degrees in the E-plane and 17.82 degrees in the H-plane with a gain of 19.43 dBi.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.337-344
• /
• 1997

In this paper, we study the isomorphism problem of Cayley permutation graphs. We obtain a necessary and sufficient condition that two Cayley permutation graphs are isomrphic by a direction-preserving and color-preserving (positive/negative) natural isomorphism. The result says that if a graph G is the Cayley graph for a group $\Gamma$ then the number of direction-preserving and color-preserving positive natural isomorphism classes of Cayley permutation graphs of G is the number of double cosets of $\Gamma^\ell$ in $S_\Gamma$, where $S_\Gamma$ is the group of permutations on the elements of $\Gamma and \Gamma^\ell$ is the group of left translations by the elements of $\Gamma$. We obtain the number of the isomorphism classes by counting the double cosets.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2006.10a
• /
• pp.22-25
• /
• 2006

Long lasting phosphor materials are in great demand for their applications in the area of light emitting diodes (LEDs), commercial displays and warning signals. After glow longevity, brightness, photo-resistance and chemical and environment stability are most important qualities that are desired for these materials. Alumina as host lattice with various rare earth elements has been found to be good at the same time inexpensive material for the synthesis of the phosphor materials. This communication explored the effect of mixed rare earth metal on the luminescence properties of these materials for the first time. Various permutations and combinations of $Sr^{2+}$ and $Ba^{2+}$ have been investigated in order to achieve robust and high luminescence characteristics in the tailored phosphor materials.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.313-316
• /
• 2002

(Korea Information Security Agency) is designed by using VHDL to Implement hardware architecture It has been adopted by most of the security systems in Korea SEED Is designed to utilize the S-boxes and permutations that balance with the current computing technology It has the Feistel structure with 16 rounds The same procedure for data encryption and decryption makes possible an easy and practical hardware implementation. The primary functions used In SEED are F function and G function. This paper proposes an Iterative architecture of F function, a modified architecture of G function and an Iterative architecture of key scheduling algorithm. The designed SEED encrypts and decrypts exactly the test vectors It is expected to extend to various application fields If the design of control blocks Is added.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.108-115
• /
• 2017

ARIA is a 128-bit block cipher that has been selected as a Korean encryption standard. Similar to AES, it is robust against differential cryptanalysis and linear cryptanalysis. In this study, we analyze the security of ARIA against differential-linear cryptanalysis. We present five rounds of differential-linear distinguishers for ARIA, which can distinguish five rounds of ARIA from random permutations using only 284.8 chosen plaintexts. Moreover, we develop differential-linear attacks based on six rounds of ARIA-128 and seven rounds of ARIA-256. This is the first multidimensional differential-linear cryptanalysis of ARIA and it has lower data complexity than all previous results. This is a preliminary study and further research may obtain better results in the future.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.859-866
• /
• 1999

In Eucliden k-space the cone of vectors x=($\chi$1, $\chi$2, ...,$\chi$k) satisfying $\chi$1$\leq$$\chi$ 2, $\leq$...$\leq$$\chi$k and {{{{ SUM { }`_{j } ^{k } }}= 1 $\chi$j=0 is generated by the vectors vj=(j-k,...j-k...j) having j-k's in its first j coordinates and j's for the remaining k-j coordinates for 1$\leq$j$\leq$i