• 한국전산유체공학회:학술대회논문집
• /
• 2009.11a
• /
• pp.1-1
• /
• 2009

In this presentation, I talk about various fluid simulation methods that have been developed for computer graphics special effects since 1996. They are all based on CFD but sacrifice physical reality for visual plausability and time. But as the speed of computer increases rapidly and the capability of GPU (graphics processing unit) improves, methods for more physical realism have been tried. In this talk, I will focus on four aspects of fluid simulation methods for computer graphics: (1) particle level-set methods, (2) particle-based simulation, (3) methods for exact satisfaction of incompressibility constraint, and (4) GPU-based simulation. (1) Particle level-set methods evolve the surface of fluid by means of the zero-level set and a band of massless marker particles on both sides of it. The evolution of the zero-level set captures the surface in an approximate manner and the evolution of marker particles captures the fine details of the surface, and the zero-level set is modified based on the particle positions in each step of evolution. (2) Recently the particle-based Lagrangian approach to fluid simulation gains some popularity, because it automatically respects mass conservation and the difficulty of tracking the surface geometry has been somewhat addressed. (3) Until recently fluid simulation algorithm was dominated by approximate fractional step methods. They split the Navier-Stoke equation into two, so that the first one solves the equation without considering the incompressibility constraint and the second finds the pressure which satisfies the constraint. In this approach, the first step introduces error inevitably, producing numerical diffusion in solution. But recently exact fractional step methods without error have been developed by fluid mechanics scholars), and another method was introduced which satisfies the incompressibility constraint by formulating fluid in terms of vorticity field rather than velocity field (by computer graphics scholars). (4) Finally, I want to mention GPU implementation of fluid simulation, which takes advantage of the fact that discrete fluid equations can be solved in parallel.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.61-65
• /
• 2010

The twisted cube has received great attention because it has several superior properties to the hypercube that is widely known as a versatile parallel processing system. In this paper, we show that node-disjoint $2^{n-1}$ meshes of size $2^n{\times}2^m$ can be embedded into a twisted cube with dilation 1 where $1{\leq}n{\leq}m$. The expansion is 1 for even m and 2 for odd m.

• Atmosphere
• /
• v.23 no.2
• /
• pp.231-235
• /
• 2013

We parallelized WRF major physics routines for Nvidia GP-GPUs with CUDA Fortran. GP-GPUs are originally designed for graphic processing, but show high performance with low electricity for calculating numerical models. In the CUDA environment, a data domain is allocated into thread blocks and threads in each thread block are computing in parallel. We parallelized the WRF program to use of thread blocks efficiently. We validated the GP-GPU program with the original CPU program, and the WRF model using GP-GPUs shows efficient speedup.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.11
• /
• pp.70-77
• /
• 1992

Generally, the conventional tracking algorithms are very limited in the practical applications because of that the computation load is exponentially increased as the number of targets being tracked is increase. Recently, to overcome this kind of limitation, some new tracking methods based on neural network algorithms which have learning and parallel processing capabilities are introduced. By application of neural networks to multi-target tracking problems, the tracking system can be made computationally independent of the number of objects being tracked, through their characteristics of massive parallelism and dense interconnectivity. In this paper, a new neural network tracking algorithm, which has capability of adaptive target tracking with little increase of the amount of calculation under the clutter and noisy environments, is suggested and the possibility of real-time multi-target tracking system based on neural networks is also demonstrated through some good computer simulation results.

• The KSFM Journal of Fluid Machinery
• /
• v.1 no.1 s.1
• /
• pp.72-80
• /
• 1998

Computational analysis of incompressible flows by numerically solving Navier-Stokes equations using multi-block finite volume method is conducted on a parallel computing system. Numerical algorithms adopted in this study $include^{(1)}$ QUICK upwinding scheme for convective $terms,^{(2)}$ central differencing for other terms $and^{(3)}$ the second-order Euler differencing for time-marching procedure. Structured grids are used on the body-fitted coordinate with multi-block concept which uses overlaid grids on the block-interfacing boundaries. Computational code is parallelized on the MPI environment. Numerical accuracy of the computational method is verified by solving a benchmark test case of the flow inside two-dimensional rectangular cavity. Computation in the axial compressor cascade is conducted by using 4 PE's md, as results, no numerical instabilities are observed and it is expected that the present computational method can be applied to the turbomachinery flow problems without major difficulties.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.11
• /
• pp.278-281
• /
• 1995

In this paper, we have developed EEG (electroencephalography) analyzer for monitoring the condition of brain in neurological surgery. This system is composed of EEG amplifier. personal-computer and BSP (Digital Signal Processor). By parallel processing of DSP, this system can analysis the power spectral density change of EEG in real-time and display the CSA(Compressed Spectral Array) and CDSA(Color Density Spectral array) of EEG. This system was tested by real EEG and showed the change of EEG.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1338-1340
• /
• 1987

This paper describes the design of ECG data preprocess module for the ECG signals. This module process the data obtained from two channels. It is composed of the AID converter, QRS detector, one chip micro-computer and memory. This module performs the following functions;digital filtering, R wave detection and determination of reference point for the ST segment. The measured points are transfered to the next data module by the interrupt process. This preprocessor data module is available to the basis for the parallel data processing for the real time automatic diagnosis.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.866-871
• /
• 1991

The multi-layer neural network possesses the desirable characteristics of parallel distributed processing and learning capacity, by which the uncertain variation of the parameters in the dynamically complex system can be handled adoptively. However the error back propagation algorithm that has been utilized popularly in the learning procedure of the mulfi-Jayer neural network has the significant limitations in the real application because of its slow convergence speed. In this paper, an approach to improve the convergence speed is proposed using the fuzzy logic that can effectively handle the uncertain and fuzzy informations by linguistic level. The effectiveness of the proposed algorithm is demonstrated by computer simulation of PUMA 560 robot manipulator.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.632-637
• /
• 1992

Recently many dynamics control algorithms using robot dynamic equation have been proposed. One of them, Kawato's feedback error learning scheme requires neither an accurate model nor parameter estimation and makes the robot motion closer to the desired trajectory by repeating operation. In this paper, the feedback error learning algorithm is implemented to control a robot system, 5 DOF revolute type movemaster. For this purpose, an actuator dynamic model is constructed considering equivalent robot dynamics model with respect to actuator as well as friction model. The command input acquired from the actuator dynamic model is the sum of products of unknown parameters and known functions. To compute the control algorithm, a parallel processing computer, transputer, is used and real-time computing is achieved. The experiment is done for the three major link of movemaster and its result is presented.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.27-34
• /
• 2008

In this paper, We propose a new parallel computer topology, called the Postorder Fibonacci Circulants and analyze its properties. It is compared with Fibonacci cubes, when its number of nodes is kept the same of comparable one. Its diameter is improved from n-2 to $[\frac{n}{3}]$ and its topology is changed from asymmetric to symmetric. It includes Fibonacci cube as a spanning graph.