• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.29 no.6 s.237
• /
• pp.703-710
• /
• 2005

A finite element discretization of the advection and redistancing equations of level set method has been studied. It has been shown that Galerkin spatial discretization combined with Crank-Nicolson temporal discretization of the advection equation of level set yields a good result and that consistent streamline upwind Petrov-Galerkin(CSUPG) discretization of the redistancing equation gives satisfactory solutions for two test problems while the solutions of streamline upwind Petrov-Galerkin(SUPG) discretization are dissipated by the numerical diffusion added for the stability of a hyperbolic system. Furthermore, it has been found that the solutions obtained by CSUPG method are comparable to those by second order ENO method.

• Communications for Statistical Applications and Methods
• /
• v.18 no.1
• /
• pp.147-153
• /
• 2011

In this paper a new sampling procedure for estimating the population mean is introduced. The performance of the new population mean estimator is discussed, along with its properties, and it is shown that the proposed method generates an unbiased estimator. The relative efficiency of the suggested estimator is computed, in regards to the simple random sample(SRS), and comparisons are made to the ranked set sampling(RSS) and extreme ranked set sampling(ERSS) estimators used for asymmetric distributions. The results indicate that the proposed estimator is more efficient than the estimators based on the ERSS. In addition, the folded ranked set sampling(FRSS) procedure has an advantage over the RSS and ERSS in that it reduces the number of unused sampling units.

• Journal of Korea Game Society
• /
• v.14 no.6
• /
• pp.109-118
• /
• 2014

We studied the creation of fractal images with polygonal rotation symmetry. As in Loocke's method[13] we start with IFS of affine functions that create polygonal fractals and extends the IFS by adding functions that create Julia sets instead of adding square root functions. The resulting images are rotationally symmetric and Julia set shaped. Also we can improve fractal images by modifying probabilistic IFS algorithm, and we suggest a method of deforming Julia set by changing exponent value.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.339-350
• /
• 2006

The bifurcation point where a satellite component buds from another component is characterized by the existence of the common tangent line between the two osculating components appearing in the degree-n bifurcation set. We investigate the existence, location and number of bifurcation points for satellite components budding from the main component in the degree-n bifurcation set as well as a parametric boundary equation of the main component of the degree-n bifurcation set. Cusp points are also located on the boundary of the main component. Typical degree-n bifurcation sets and their components are illustrated with some computational results.

• 한국전산유체공학회:학술대회논문집
• /
• 2011.05a
• /
• pp.259-260
• /
• 2011

Using modern techniques from scientific computing and numerical analysis, natural phenomena or scientific experiment can be simulated effectively with a computer and used for computer graphics, for example as special effects for the film industry, manufacturing the thin film, multi-phase simulation and image processing. The Level Set method can make those things happen without a lot of difficulties. This method was devised by Osher and Sethian(1988) to represent dynamically moving interfaces as the zero level set of a scalar function that evolves in time. Since then, many researchers have worked on many applications using a Level Set Method. I will give a talk about the applications of the Level Set Method.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.565-567
• /
• 2008

In the present study, a least square/level set based two-phase flow code has been developed using finite element discretization, which can be utilized for the analysis of a free surface flow problem in a complex geometry. Since the finite element method is employed for the spatial discretization of governing equations, an unstructured mesh can be naturally adopted for the level set simulation of a bubble-in-liquid flow without an additional load for the code development except that solution methods of the hyperbolic type redistancing and advection equations of the level set function should be devised in order to give a bounded solution on the unstructured mesh. For the discretization of hyperbolic type redistancing and advection equations, least square method is adopted. From the numerical experiments of the present study, it is shown that the proposed method is both robust and accurate.

• Information Systems Review
• /
• v.1 no.2
• /
• pp.41-54
• /
• 1999

지금까지 메타-몰에서의 지불처리 보안 방안을 살펴보았다. 사실상의 표준인 SET이 1인의 상인만을 대상으로 하고 있으므로, 여러 하부 몰을 거느리고 원-스톱 지불을 지원하는 메타-몰에는 그대로 적용할 수 없었다. 따라서, 메타-몰에서는 지불대표자의 개념을 도입하여 Meta-Malls Coordinator가 SET에서의 상인 역할을 하면서 Mall Operator들에 대해 주문정보를 전달하도록 하였다. 고객, Meta-Malls Coordinator, 금융기관 간에는 SET 규정을 따름으로써, 메시지의 기밀성, 인증, 무결성, 연결성을 확보하였다. 그리고, Meta-Malls Coordinator와 Mall Operator 간의 주문정보에 대한 인증과 무결성을 위하여 주문정보에 전자서명을 하도록 하였으며, 전자서명의 Refreshness를 위하여 Challenge를 주고 받을 수 있도록 주문확인과 주문통지의 두 번의 메시지 전달단계를 정의하였다. 동시에, 주문확인 메시지는 재고확인 등의 판매 가능성 여부를 확인하는 절차를 겸하도록 하였다. 본 방법론은 SET을 메타-몰에 적용하는 방안으로서 구현 되었으나, SET이외의 지불방법론에 대해서도 동일하게 적용될 수 있다. 현재 (주)메타랜드(http://www.metaland.com)가 실제 고객들을 대상으로 이러한 지불정보 보안체계를 갖는 메타-몰 구조의 전자쇼핑몰을 운영 중에 있다.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.2
• /
• pp.415-420
• /
• 2005

Let $IB_n$ be the set of all irreducible matrices in $B_n$ and let $SIB_n$ be the set of all symmetric matrices in $IB_n$. Finding an upper bound for the set of indices of matrices in $IB_n$ and $SIB_n$ and determining gaps in the set of indices of matrices in $IB_n$ and $SIB_n$ has been studied by many researchers. In this paper, we establish a best upper bound for the set of weak exponents of indecomposability of matrices in $SIB_n\;and\;IB_n$, and show that there does not exist a gap in the set of weak exponents of indecomposability for any of class $SIB_n\;and\;class\;IB_n$.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.291-294
• /
• 1995

본논문은 POW algorithm과 알고리즘을 통해 수행된 결과인 large scale word recognizer를 위한 POW set에 대하여 설명하겠다. Large scale word recognizer를 위한 speech database를 구축하기 위해서는 모든 가능한 phonological phenomenon이 POW set에 포함 되어얗 ks다. 또한 POW set의 음운 현상들의 분포는 추출하고자 하는 모집단의 음운현상들의 분포와 유사해야 한다. 위와 같은 목적으로 다음과 같이 3가지 성질을 갖는 POW set을 추출하기 위한 새로운 algorithm을 제안한다. 1. 모집단에서 발생하는 모든 음운현상을 포함해야 한다. 2, 최소한의 단어 집합으로 구성되어야 한다. 3. POW set과 모집단의 음운현상의 분포가 유사해야 한다. 우리는 약 300만 어절의 한국어 text corpus로부터 5천 단어의 고빈도 어절을 추출하고 이로부터 한국어 POW set을 추출하였다.

• Communications of the Korean Mathematical Society
• /
• v.28 no.3
• /
• pp.589-596
• /
• 2013

This paper is an attempt to study and introduce the notion of ${\omega}$-dense set in weak structures and the notion of m-dense set in minimal structures. We have also investigate the relationships between ${\omega}$-dense sets, $m$-dense sets, ${\sigma}({\omega})$ sets, ${\pi}({\omega})$ sets, $r({\omega})$ sets, ${\beta}({\omega})$ sets, m-semiopen sets and $m$-preopen sets. Further we give some representations of the above generalized sets in minimal structures as well as in weak structures.