• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2003.05a
• /
• pp.331-334
• /
• 2003

In the finite element simulation of hot forging processes using hexahedron, remeshing of a flash is very difficult. The mesh compression method is a remeshing technique to construct an effective hexahedral mesh. However, because mesh is distorted during the compression procedure or the mesh compression method, mesh smoothing is necessary to improve the mesh Qualify. in this study, several geometric mesh smoothing techniques and a matrix norm optimization technique are applied and compared which is more adaptive to the mesh compression method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.04b
• /
• pp.359-364
• /
• 1993

As advanced method for the automatic generation of parametric models in computer-aided design systems is required for most of two-dimensional model which is represented as a set of geometric elements, and constr- aining scheme formulas. The development system uses geometirc constrainis and topology parameters which are derived from feature recognition and grouping the design entities into optimal ones from pre-designed drawings. The aim of this paper is to present guidelines for the application and development of parametric design modules for the standard parts in mechaniscal system, the basic constitutional part of mold base, and other 2D features.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.92.3-92
• /
• 2002

A lot of localization algorithms have been developed in order to achieve autonomous navigation. However, most of localization algorithms are restricted to certain conditions. In this paper, Monte Carlo localization scheme with a map-matching algorithm is suggested as a robust localization method for the Public Service Robot to accomplish its tasks autonomously. Monte Carlo localization can be applied to local, global and kidnapping localization problems. A range image based measure function and a geometric pattern matching measure function are applied for map matching algorithm. This map matching method can be applied to both polygonal environments and un-polygonal environments and achieves...

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

This paper presents a method for the automatic generation of assembly sequences based on the recursive extraction of a preferred part along with the verification of its disassemblability. To verify the disassemblability of the part we inference the geometric precedence constraints using a method of extracting separable directions for the part and determine the disassemblability cost by the separability and stability cost. The proosed method provides a local optimal solution of finding a cost effective assembly plan, and the feasibility of calculating robot motion programs by evaluating separable directions in flexible manufacturing application. A case study is given to illustrate the concepts and procedure of the proposed scheme.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.235-246
• /
• 2005

We present an interpolating, univariate subdivision scheme which preserves the discrete curvature and tangent direction at each step of subdivision. Since the polygon have a geometric information of some original(in some sense) curve as a discrete curvature, we can expect that the limit curve has the same curvature at each vertex as the control polygon. We estimate the curvature bound of odd vertices and give an error estimate for restoring a curve from sampled vertices on curves.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.207-207
• /
• 2000

This paper presents an observer for nonlinear systems using approximate observer form. It is shown that if a nonlinear system is approximately error linearizable, then there exists a local nonlinear observer whose estimation error converges exponentially to zero. Since the proposed method relaxes strong geometric conditions of previous works, it improves the existing results for a nonlinear observer design. Finally, some examples are given to show the effectiveness of this scheme.

• Communications for Statistical Applications and Methods
• /
• v.20 no.6
• /
• pp.491-498
• /
• 2013

We consider support vector machines(SVM) to predict Y with p numerical variables $X_1$, ${\ldots}$, $X_p$. This paper aims to build a biplot of p explanatory variables, in which the first dimension indicates the direction of SVM classification and/or regression fits. We use the geometric scheme of kernel principal component analysis adapted to map n observations on the two-dimensional projection plane of which one axis is determined by a SVM model a priori.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.647-650
• /
• 1988

This paper proposes and sketches out a new parallel architecture of transputer-based pyramidal parallel array computer (TPPAC) used to process computationally intensive problems for geometric processing applications such as computer vision, image processing etc. It explores how efficiently the pyramid computer architecture is designed using transputer chips, and poses a new interconnection scheme for TPPAC without using additional transputers.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.04a
• /
• pp.17-27
• /
• 1995

For the post-buckling and elasto-plastic analysis of shell structures, the total Lagrangian formulation is presented based upon the degenerated shell element. Geometrically correct formulation is developed by updating the direction of normal vectors in the iteration process and evaluating the total Green-Lagrange stain corresponding U total displacements. In the calculation of the stiffness matrix, the element formulation takes into account the effect of finite rotation increments by retaining second order rotation terms in the incremental displacement field. The selective or reduced integration scheme using the heterosis element is applied in order to overcome both shear locking phenomena and the zero energy mode. The load/displacement incremental scheme is adopted for geometric non-linear F .E. analysis. Based on such methodology, the computer program is developed and numerical examples to demonstrate the accuracy and the effectiveness of the proposed shell element are presented and compared with references's results.

• Journal of The Korean Astronomical Society
• /
• v.27 no.1
• /
• pp.13-29
• /
• 1994

We have constructed a 3-dim hydrodynamics code called BTSPH. The fluid dynamics part of the code is based on the smoothed particle hydrodynamics (SPH), and for its Poisson solver the binary tree (BT) scheme is employed. We let the smoothing length in the SPH algorithm vary with space and time, so that resolution of the calculation is considerably enhanced over the version of SPH with fixed smoothing length. The binary tree scheme calculates the gravitational force at a point by collecting the monopole forces from neighboring particles and the multipole forces from aggregates of distant particles. The BTSPH is free from geometric constraints, does not rely on grids, and needs arrays of moderate size. With the code we have run the following set of test calculations: one-dim shock tube, adiabatic collapse of an isothermal cloud, small oscillation of an equilibrium polytrope of index 3/2, and tidal encounter of the polytrope and a point mass perturber. Results of the tests confirmed the code performance.