• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.563-569
• /
• 2004

A set of Zernike moments has been successfully used for object recognition or content-based image retrieval systems. Real time applications using Zernike moments, however, have been limited due to its complicated definition. Conventional methods to compute Zernike moments fast have focused mainly on the radial components of the moments. In this paper, utilizing symmetric/anti-symmetric properties of Zernike basis functions, we propose a fast and efficient method for Zernike moments. By reducing the number of operations to one quarter of the conventional methods in the proposed method, the computation time to generate Zernike basis functions was reduced to about 20% compared with conventional methods. In addition, the amount of memory required for efficient computation of the moments is also reduced to a quarter. We also showed that the algorithm can be extended to compute the similar classes of rotational moments, such as pseudo-Zernike moments, and ART descriptors in same manner.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.323-330
• /
• 2021

Recently, the advantages of high-speed arithmetic in quantum computers have been known, and interest in quantum circuits utilizing qubits has increased. The Grover algorithm is a quantum algorithm that can reduce n-bit security level symmetric key cryptography and hash functions to n/2-bit security level. Since the Grover algorithm work on quantum computers, the symmetric cryptographic technique and hash function to be applied must be implemented in a quantum circuit. This is the motivation for these studies, and recently, research on implementing symmetric cryptographic technique and hash functions in quantum circuits has been actively conducted. However, at present, in a situation where the number of qubits is limited, we are interested in implementing with the minimum number of qubits and aim for efficient implementation. In this paper, the domestic hash function LSH is efficiently implemented using qubits recycling and pre-computation. Also, major operations such as Mix and Final were efficiently implemented as quantum circuits using ProjectQ, a quantum programming tool provided by IBM, and the quantum resources required for this were evaluated.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.117-124
• /
• 2009

The p-convergent boundary element method has been proposed to analyze two-dimensional potential problem on the basis of high order Legendre shape functions that have different property comparing with the shape functions in conventional boundary element method. The location of nodes corresponding to high order shape function are not defined along the boundary, called by nodeless node, similar to the p-convergent finite element method. As the order of shape function increases, the collocation point method is used to solve linear simultaneous equations. The collocation patterns of p-convergent boundary element method consist of non-symmetric hierarchial or symmetric non-hierarchical. As the order of shape function increases, the number of collocation point increases. The singular integral that appears in p-convergent boundary element has been calculated by special numeric quadrature technique and semi-analytical integration technique. The L-shape domain problem including singularity in the vicinity of reentrant comer is analyzed and the numerical results show that the relative error is smaller than $10^{-2}%$ range as compared with other results in literatures. In case of same condition, the symmetric p-collocation point pattern shows high accuracy of solution.

• Structural Engineering and Mechanics
• /
• v.85 no.3
• /
• pp.419-432
• /
• 2023

This paper studies the effects of porosity distributions on buckling and post-buckling behaviors of a functionally graded saturated porous (FGSP) circular plate. The plate is under the uniformly distributed radial loading and simply supported and clamped boundary conditions. Pores are saturated with compressible fluid (e.g., gases) that cannot escape from the porous solid. Elastic modulus is assumed to vary continuously through the thickness according to three different functions corresponding to three different cases of porosity distributions, including monotonous, symmetric, and asymmetric cases. Governing equations are derived utilizing the classical plate theory and Sanders nonlinear strain-displacement relations, and they are solved numerically via shooting method. Results are verified with the known results in the literature. The obtained results for the monotonous and symmetric cases with the asymmetric case presented in the literature are shown in comparative figures. Effects of the poroelastic material parameters, boundary conditions, and thickness change on the post-buckling behavior of the plate are discussed in details. The results reveal that buckling and post-buckling behaviors of the plate in the monotonous and symmetric cases differ from the asymmetric case, especially in small deflections, that asymmetric distribution of elastic moduli can be the cause.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.5347-5356
• /
• 2011

In this paper, we compared various shear deformation functions for modelling anti-symmetric composite sandwich plates discretized by a mixed finite element method based on the Lagrangian/Hermite interpolation functions. These shear deformation theories uses polynomial, trigonometric, hyperbolic and exponential functions through the thickness direction, allowing for zero transverse shear stresses at the top and bottom surfaces of the plate. All shear deformation functions are compared with other available analytical/3D elasticity solutions, As a result, reasonable accuracy for investigated problems are predicted. Particularly, The present results show that the use of exponential shear deformation theory provides very good solutions for composite sandwich plates.

• Communications for Statistical Applications and Methods
• /
• v.22 no.1
• /
• pp.41-54
• /
• 2015

In this article, we propose nonconcave penalties on a reduced-rank regression model to select variables and estimate coefficients simultaneously. We apply HARD (hard thresholding) and SCAD (smoothly clipped absolute deviation) symmetric penalty functions with singularities at the origin, and bounded by a constant to reduce bias. In our simulation study and real data analysis, the new method is compared with an existing variable selection method using $L_1$ penalty that exhibits competitive performance in prediction and variable selection. Instead of using only one type of penalty function, we use two or three penalty functions simultaneously and take advantages of various types of penalty functions together to select relevant predictors and estimation to improve the overall performance of model fitting.

• Honam Mathematical Journal
• /
• v.33 no.2
• /
• pp.247-259
• /
• 2011

In this paper, the $(\frac{G'}{G})$-expansion method is used to construct new exact travelling wave solutions of some nonlinear evolution equations. The travelling wave solutions in general form are expressed by the hyperbolic functions, the trigonometric functions and the rational functions, as a result many previously known solitary waves are recovered as special cases. The $(\frac{G'}{G})$-expansion method is direct, concise, and effective, and can be applied to man other nonlinear evolution equations arising in mathematical physics.

• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.109-118
• /
• 2014

We studied the creation of fractal images with polygonal rotation symmetry. As in Loocke's method[13] we start with IFS of affine functions that create polygonal fractals and extends the IFS by adding functions that create Julia sets instead of adding square root functions. The resulting images are rotationally symmetric and Julia set shaped. Also we can improve fractal images by modifying probabilistic IFS algorithm, and we suggest a method of deforming Julia set by changing exponent value.

• Communications for Statistical Applications and Methods
• /
• v.24 no.6
• /
• pp.641-649
• /
• 2017

Multivariate confidence regions were defined using a chi-square distribution function under a normal assumption and were represented with ellipse and ellipsoid types of bivariate and trivariate normal distribution functions. In this work, an alternative confidence region using the multivariate quantile vectors is proposed to define the normal distribution as well as any other distributions. These lower and upper bounds could be obtained using quantile vectors, and then the appropriate region between two bounds is referred to as the quantile confidence region. It notes that the upper and lower bounds of the bivariate and trivariate quantile confidence regions are represented as a curve and surface shapes, respectively. The quantile confidence region is obtained for various types of distribution functions that are both symmetric and asymmetric distribution functions. Then, its coverage rate is also calculated and compared. Therefore, we conclude that the quantile confidence region will be useful for the analysis of multivariate data, since it is found to have better coverage rates, even for asymmetric distributions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.43.3-43
• /
• 2001

In conventional RBF network, the activation functions of hidden layers generally are symmetric functions like gaussian function. This has been considered to be one of the limiting factors for the network to speed up learning of actuately describing a given function. To avoid this criticism, we propose a pseudo gaussian function (PGF) whose deviation is changed according to the direction of incoming pattern. This property helps to estimate the given function more effectively with a minimal number of centers because of its flexibility of functional representation. A level set method is used to describe the asymmetric shape of deviation of the pseudo gaussian function. To demonstrate the performance of the proposed network ...