• Korean Journal of Computational Design and Engineering
• /
• v.8 no.4
• /
• pp.262-269
• /
• 2003

An approach to compute characteristic curves such as section curves, reflection characteristic lines, and asymptotic curves on a surface is introduced. Each problem is formulated as a surface-plane inter-section problem. A single-valued function that represents the characteristics of a problem constructs a property surface on parametric space. Using a contouring algorithm, the property surface is intersected with a horizontal plane. The solution of the intersection yields a series of points which are mapped into object space to become characteristic curves. The approach proposed in this paper eliminates the use of traditional searching methods or non-linear differential equation solvers. Since the contouring algorithm has been known to be very robust and rapid, most of the problems are solved efficiently in realtime for the purpose of visualization. This approach can be extended to any geometric problem, if used with an appropriate formulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.864-867
• /
• 1990

In this paper, a state space solution to the discete time H$_{\infty}$ control problem is presented. It is shown that there exist LQ game problem corresponding to H$_{\infty}$ control problems and the H$_{\infty}$ controller can be obtained by solving the LQ game problem. Explicit state space formulae are given for the state feedback H$_{\infty}$ controller and output feedback H$_{\infty}$ controllers.lers. state feedback $H_{\infty}$ controller and output feedback $H_{\infty}$ controllers.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.527-530
• /
• 2003

In this paper, we implemented the voxel coloring method to reconstruct 3D object from synthetic input Images. Then compare the result between using standard voxel coloring and using coarse-to-fine method. We compared using different voxel space site to see the difference of time processing and the result of 3D object. Photorealistic 3D object reconstruction is a challenging problem in computer graphics. Vexel coloring considered the reconstruction problem as a color reconstruction problem, instead of shape reconstruction problem. This method works by discretizing scene space into yokels, then traversed and colored those in special order. Also there is an extension of voxel coloring method far decreasing the amount of processing time called coarse-to-fine method. This. method works using low resolution instead of high resolution as input and after processing finish, apply some kind of search strategy.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.397-406
• /
• 2007

The problem of finding an optimal alignment between sequence A and B can be solved by dynamic programming algorithm(DPA) efficiently. But, if the length of string was longer, the problem might not be solvable because it requires O(m*n) time and space complexity.(where, $m={\mid}A{\mid},\;n={\mid}B{\mid}$) For space, Hirschberg developed a linear space and quadratic time algorithm, so computer memory was no longer a limiting factor for long sequences. As computers's processor and memory become faster and larger, a method is needed to speed processing up, although which uses more space. For this purpose, we present an algorithm which will solve the problem in quadratic time and linear space. By using division method, It computes optimal alignment faster than LSA, although requires more memory. We generalized the algorithm about division problem for not being divided into integer and pruned additional space by entry/exit node concept. Through the proofness and experiment, we identified that our algorithm uses d*(m+n) space and a little more (m*n) time faster than LSA.

• Bulletin of the Korean Space Science Society
• /
• 2009.04a
• /
• pp.39.2-39.2
• /
• 2009

• The Korean Journal of Air & Space Law and Policy
• /
• v.17
• /
• pp.153-161
• /
• 2003

• The Pure and Applied Mathematics
• /
• v.15 no.1
• /
• pp.19-34
• /
• 2008

A new algorithm for the solution of an inverse problem of determining unknown source parameter in a parabolic equation in reproducing kernel space is considered. Numerical experiments are presented to demonstrate the accuracy and the efficiency of the proposed algorithm.

• Korean Journal of Mathematics
• /
• v.17 no.1
• /
• pp.53-66
• /
• 2009

We show the existence of a nontrivial periodic solution for the superquadratic parabolic equation with Dirichlet boundary condition and periodic condition with a superquadratic nonlinear term at infinity which have continuous derivatives. We use the critical point theory on the real Hilbert space $L_2({\Omega}{\times}(0 2{\pi}))$. We also use the variational linking theorem which is a generalization of the mountain pass theorem.

• Journal of the Korean Mathematical Society
• /
• v.37 no.6
• /
• pp.1007-1019
• /
• 2000

In this paper, we discuss a uniqueness problem for the Cauchy problem of the Euler equation. W give a sufficient condition on the vorticity to show the uniqueness of a class of generalized solution in terms of the generalized solution in terms o the generalized Besov space. The condition allows the iterated logarithmic singularity to the vorticity of the solution. We also discuss the break down (or blow up) condition for a smooth solution to the Euler equation under the related assumption.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.237-260
• /
• 2001

The approximation properties for $L^2$-projection, Raviart-Thomas projection, and inverse inequality have been derived in 3 dimensional space. h-p-mixed finite element methods for strongly nonlinear second order elliptic problems are proposed and analyzed in 3D. Solvability and convergence of the linearized problem have been shown through duality argument and fixed point argument. The analysis is carried out in detail using Raviart-Thomas-Nedelec spaces as an example.