• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2695-2701
• /
• 2012

We need privacy protection protocols, that satisfy three essential security requirements; confidentiality, indistinguishability and forward security, in order to protect user's privacy in RFID system. The hash-chain based protocol that Ohkubo et. al proposed is the most secure protocol, that satisfies all of the essential security requirements, among existing protocols. But, this protocol has a disadvantage that it takes very long time to identify a tag in the back-end server. In this paper, we propose a scheme to keep security just as it is and to reduce computation time for identifying a tag in back-end server. The proposed scheme shows the results that the identification time in back-end server is reduced considerably compared to the hash-chain based protocol.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.15 no.4
• /
• pp.629-638
• /
• 2002

This paper deals with the free vibration analysis of compressive tapered members resting on elastic foundation using the Differential Quadrature Method. Based on the differential equation subjected to the boundary conditions, adopted from the open literature, which governs the free vibrations of such member, this equation is applied to the Differential Quadrature Method. For computing natural frequencies, the numerical procedures are developed by QR Algorithm, in which the Chebyshev-Gauss-Lobatto method is used for choosing the grid points. The numerical methods developed herein for computing natural frequencies are programmed in FORTRAN code, and all solutions obtained in this study are quite agreed with those in the open literature.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.45-55
• /
• 1996

This paper presents a new approach to non-parametric modeling of cutter swept surface (CSS) for cutting simulation. Instead of explicitly modeling cutter swept volumes, silhouette curves of the cutter surface are utilized in computing the z-value of the CSS at a grid point on the x,y-plane. The non-parametric evaluation of the CSS constitutes the integral part of 3-axis cutting simulation. The proposed method is more efficient than the existing ones in the case of conventional cutters (i.e., ball-end mills and flat-end mills), and more importantly, it enables the non-parametric modeling of the CSS for the round-end mills which was not possible with the existing methods.

• Journal of computational fluids engineering
• /
• v.20 no.4
• /
• pp.51-57
• /
• 2015

In the present study, two-dimensional numerical investigation of flow past a square cylinder beneath the free surface has been performed to identify the effects of presence of the free surface. An immersed boundary method was adopted for implementation of the cylinder cross-section in a Cartesian grid system. Also, a level-set method was used to capture the interface of two fluids. To prevent transition to three-dimensional flow, Reynolds number chosen for this simulation was 150. The cases for Froude number 0.2 and gap ratio(h/D) between 0.25 and 5.00 were examined. At the specific Reynolds number, we study the effects of gap ratio on flow characteristics around a square cylinder by computing flow fields, force coefficients and Strouhal number.

• 한국전산유체공학회:학술대회논문집
• /
• 2007.04a
• /
• pp.23-29
• /
• 2007

We present an improved immersed boundary method for computing incompressible viscous flow around an arbitrarily moving body on a fixed computational grid The main idea is to incorporate feedback forcing scheme of virtual boundary method with Peskin's regularized delta function approach in order to use large CFL number and transfer quantities between Eulerian and Lagrangian domain effectively. From the analysis of stability limits and effects of feedback forcing gains, optimum regions of the feedback forcing are suggested.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.411-417
• /
• 2016

Since the development of Graphic Processing Unit (GPU) in 1999, the development speed of GPUs has become much faster than that of CPUs and currently, the computational power of GPUs exceeds CPUs dozens and hundreds times in terms of decimal calculations and costs much less. Owing to recent technological development of hardwares, general-purpose computing and utilization using GPUs are on the rise. Thus, in this paper, we have identified the elements to be considered for the Smart Grid Security. Focusing on a Performance Improvement of the Basic Algorithm for the Stateful Inspection to Detect DDoS Attacks using CUDA. In the program, we compared the search speeds of GPU against CPU while they search for the suffix trees. For the computation, the system constraints and specifications were made identical during the experiment. We were able to understand from the results of the experiment that the problem-solving capability improves when GPU is used. The other finding was that performance of the system had been enhanced when shared memory was used explicitly instead of a global memory as the volume of data became larger.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.1
• /
• pp.81-87
• /
• 2009

Recently RFID system has been adopted in various fields rapidly. However, we ought to solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system To solve the problems, it is Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of increasing numbers of Tag. Therefore, in this paper we apply the previous method into the grid environment by analyzing Hash-Chain scheme in order to reduce processing time when Tags are identified. We'll implement the process by offering Tag Identification Process Model to divide SPs evenly by node.

• Journal of the Society of Naval Architects of Korea
• /
• v.44 no.1 s.151
• /
• pp.8-15
• /
• 2007

In this paper, numerical calculations are performed to analyze the unsteady flow of NACA airfoil sections. In order to ease the flow computation for the fluid region changing in time, improve the quality of solution and simplify the grid generation for the oscillating foil flow, the computational method adopts a moving and deforming mesh with the multi-block grid topology. The multi-block, structured-unstructured hybrid grid is generated using the commercial meshing software Gridgen V15. The MDM (Moving & Deforming Mesh) and the UDF (User Define function) function of FLUENT 6 are adopted for computing turbulent flows of the foil in pitching motion. Computed unsteady lift and drag forces are compared with experimental data. in general, the characteristics of unsteady lift and drag of the experiments are reproduced well in the numerical analysis.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.1
• /
• pp.75-80
• /
• 2016

Numerical modeling based on the finite difference method has been widely used with improved computer technology. However, high-capacity computing resources are required for this technique. To overcome this limitation, we propose an algorithm the employs a logarithmic grid in conjunction with the expanding domain method. The proposed algorithm was verified through comparison with numerical results obtained with a conventional method. The results confirmed that our algorithm can improve computational efficiency.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.511-516
• /
• 2006

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used) LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The results of the simulation show that the proposed policy performs better than traditional policies.