• Structural Engineering and Mechanics
• /
• v.3 no.2
• /
• pp.185-192
• /
• 1995

A numerical algorithm for plane stress and shell elasto-plasticity is presented in this paper. The proposed strain decomposition (SD) algorithm is an elastic predictor/plastic corrector algorithm, and in the context of operator splitting, is a return mapping algorithm. However, it differs significantly from other return mapping algorithms in that only the necessary response functions are used without invoking their gradients, and the stress increment is updated only at the end of the time step. This makes the proposed SD algorithm more suitable for materials with complex yield surfaces and will guard against error accumulation during the time step. Comparative analyses of structural systems using the proposed strain decomposition (SD) algorithm and the iterative radial return (IRR) algorithm are presented. The results demonstrate the accuracy and usefulness of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8A
• /
• pp.847-857
• /
• 2007

For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. A Bit-by-Bit algorithm is defined by Auto ID Class 0. In this paper, we propose a SBBB(Stack Bit-by-Bit) algorithm. The SBBB algorithm save the collision position and makes a query using the saved data. SBBB improve the efficiency of collision resolution. We show the performance of the SBBB algorithm by simulation. The performance of the proposed algorithm is higher than that of BBB algorithm. Especially, the more each tag bit streams are the duplicate, the higher performance is.

• Proceedings of the SAREK Conference
• /
• 2009.06a
• /
• pp.435-440
• /
• 2009

For the effective control of a $CO_2$ air-conditioning system, the system high-side pressure algorithm, the indoor temperature algorithm, and the outdoor fan algorithm were developed. The system high-side pressure algorithm was composed of the setpoint algorithm, the reset algorithm, and the electronic expansion valve control algorithm. The indoor temperature algorithm was composed of the compressor control algorithm and the indoor fan control algorithm. These algorithms were tested by using mathematical models developed from the previous study. Results from the setpoint step change test and the disturbance test showed good control performances. Therefore, algorithms developed in this study may practically used for the control of a $CO_2$ air-conditioning system.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.2
• /
• pp.406-414
• /
• 2002

A new approach, referred to as a successive zooming genetic algorithm (SZGA), is Proposed for identifying a global solution for continuous optimization problems. In order to improve the local fine-tuning capability of GA, we introduced a new method whereby the search space is zoomed around the design point with the best fitness per 100 generation. Furthermore, the reliability of the optimized solution is determined based on the theory of probability. To demonstrate the superiority of the proposed algorithm, a simple genetic algorithm, micro genetic algorithm, and the proposed algorithm were tested as regards for the minimization of a multiminima function as well as simple functions. The results confirmed that the proposed SZGA significantly improved the ability of the algorithm to identify a precise global minimum. As an example of structural optimization, the SZGA was applied to the optimal location of support points for weight minimization in the radial gate of a dam structure. The proposed algorithm identified a more exact optimum value than the standard genetic algorithms.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.12
• /
• pp.2009-2018
• /
• 2001

This paper presents a region offsetting algorithm for tool-path generation. The proposed region offsetting algorithm is developed by expanding the 'PWID offset algorithm [Choi and Park, 1999]'designed to offset a simple polygon. The PWID offset algorithm has three important steps; 1) remove 'local invalid ranges'by invoking a PWID test, 2) construct a raw offset owe and 3) remove 'global invalid ranges'by finding self-intersections of the raw offset cure. To develop a region offsetting algorithm, we modified the PWID offset algorithm by expanding the concept of the 'global invalid range'in the third step. The time complexity of the proposed algorithm is approximately Ο(n), where n is the number of points, and it is free of numerical errors for practical purposes. The proposed algorithm has been implemented and tested with various real regions obtained by intersecting a sculptured surface with a plane.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1523-1537
• /
• 2022

We present a new square root algorithm in finite fields which is a variant of the Pocklington-Peralta algorithm. We give the complexity of the proposed algorithm in terms of the number of operations (multiplications) in finite fields, and compare the result with other square root algorithms, the Tonelli-Shanks algorithm, the Cipolla-Lehmer algorithm, and the original Pocklington-Peralta square root algorithm. Both the theoretical estimation and the implementation result imply that our proposed algorithm performs favorably over other existing algorithms. In particular, for the NIST suggested field P-224, we show that our proposed algorithm is significantly faster than other proposed algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.29-33
• /
• 2015

This paper proposes a discrete logarithm algorithm that remarkably reduces the execution time of Pollard's Rho algorithm. Pollard's Rho algorithm computes congruence or collision of ${\alpha}^a{\beta}^b{\equiv}{\alpha}^A{\beta}^B$ (modp) from the initial value a = b = 0, only to derive ${\gamma}$ from $(a+b{\gamma})=(A+B{\gamma})$, ${\gamma}(B-b)=(a-A)$. The basic Pollard's Rho algorithm computes $x_i=(x_{i-1})^2,{\alpha}x_{i-1},{\beta}x_{i-1}$ given ${\alpha}^a{\beta}^b{\equiv}x$(modp), and the general algorithm computes $x_i=(x_{i-1})^2$, $Mx_{i-1}$, $Nx_{i-1}$ for randomly selected $M={\alpha}^m$, $N={\beta}^n$. This paper proposes 4-model Pollard Rho algorithm that seeks ${\beta}_{\gamma}={\alpha}^{\gamma},{\beta}_{\gamma}={\alpha}^{(p-1)/2+{\gamma}}$, and ${\beta}_{{\gamma}^{-1}}={\alpha}^{(p-1)-{\gamma}}$) from $m=n={\lceil}{\sqrt{n}{\rceil}$, (a,b) = (0,0), (1,1). The proposed algorithm has proven to improve the performance of the (0,0)-basic Pollard's Rho algorithm by 71.70%.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.18 no.2
• /
• pp.163-171
• /
• 2006

In order to control multi-zone temperatures, a multi-type air-conditioning system may be used. In this study, control algorithms for the compressor and the electronic expansion valve of a multi-type air-conditioning system were developed by using fuzzy logics. The compressor control algorithm was composed of a compressor pressure setpoint algorithm, a compressor pressure setpoint reset algorithm, and a compressor frequency setpoint algorithm. The electronic expansion valve control algorithm was composed of an indoor temperature control algorithm, and a superheat control algorithm. These algorithms were applied to a multi-type air-conditioning system. Test showed good results for the control of a multi-type air-conditioning system.

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.77-78
• /
• 2008

This paper proposes a new algorithm for path planning and obstacles avoidance using the ant colony optimization algorithm and the particle swarm optimization. The proposed algorithm is a new hybrid algorithm that composes of the ant colony algorithm method and the particle swarm optimization method. At first, we produce paths of a mobile robot in the static environment. And then, we find midpoints of each path using the Maklink graph. Finally, the hybrid algorithm is adopted to get a shortest path. We prove the performance of the proposed algorithm is better than that of the path planning algorithm using the ant colony optimization only through simulation.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.15-17
• /
• 2005

Recently genetic algorithm techniques have widely used in adaptive and control schemes for production systems. However, generally it costs a lot of time for learning in the case applied in control system. Furthermore, the physical meaning of genetic algorithm constructed as a result is not obvious. And this method has been used as a learning algorithm to estimate the parameter of a genetic algorithm used for identification of the process dynamics of nonlinear IIR filter and it was shown that this method offered superior capability over the genetic algorithm. A genetic algorithm is used to solve the parameter identification problem for linear and nonlinear digital filters. This paper goal estimate nonlinear IIR filter parameter using the genetic algorithm.