• Structural Engineering and Mechanics
• /
• v.8 no.4
• /
• pp.325-341
• /
• 1999

A procedure for the computation of the load carrying capacity of perfectly plastic plates in bending is presented. The approach, based on the kinematic theorem of limit analysis, requires the evaluation of the minimum of a convex, but non-smooth, function under linear equality constraints. A systematic solution procedure is devised, which detects and eliminates the finite elements which are predicted as rigid in the collapse mechanism, thus reducing the problem to the search for the minimum of a smooth and essentially unconstrained function of nodal velocities. Both Kirchhoff and Mindlin plate models are considered. The effectiveness of the approach is illustrated by means of some examples.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03a
• /
• pp.340-346
• /
• 2008

A level-set method is developed for computation of drop motions in various engineering applications. Compared with the volume-of-fluid method based on a non-smooth volume-fraction function, the LS method can calculate an interface curvature more accurately by using a smooth distance function. Also, it is straightforward to implement for two-phase flows in complex geometries unlike the VOF method requiring much more complicated geometric calculations. The LS method is applied to simulation of inkjet process, thin film pattering and droplet collisions.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.340-346
• /
• 2008

A level-set method is developed for computation of drop motions in various engineering applications. Compared with the volume-of-fluid method based on a non-smooth volume-fraction function, the LS method can calculate an interface curvature more accurately by using a smooth distance function. Also, it is straightforward to implement for two-phase flows in complex geometries unlike the VOF method requiring much more complicated geometric calculations. The LS method is applied to simulation of inkjet process, thin film pattering and droplet collisions.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1355-1370
• /
• 2019

A curve $X{\subset}\mathbb{P}^r$ has maximal rank if for each $t{\in}\mathbb{N}$ the restriction map $H^0(\mathcal{O}_{\mathbb{P}r}(t)){\rightarrow}H^0(\mathcal{O}_X(t))$ is either injective or surjective. We show that for all integers $d{\geq}r+1$ there are maximal rank, but not arithmetically Cohen-Macaulay, smooth curves $X{\subset}\mathbb{P}^r$ with degree d and genus roughly $d^2/2r$, contrary to the case r = 3, where it was proved that their genus growths at most like $d^{3/2}$ (A. Dolcetti). Nevertheless there is a sector of large genera g, roughly between $d^2/(2r+2)$ and $d^2/2r$, where we prove the existence of smooth curves (even aCM ones) with degree d and genus g, but the only integral and non-degenerate maximal rank curves with degree d and arithmetic genus g are the aCM ones. For some (d, g, r) with high g we prove the existence of reducible non-degenerate maximal rank and non aCM curves $X{\subset}\mathbb{P}^r$ with degree d and arithmetic genus g, while (d, g, r) is not realized by non-degenerate maximal rank and non aCM integral curves.

• Journal of computational fluids engineering
• /
• v.12 no.2
• /
• pp.21-25
• /
• 2007

A general purpose program NUFLEX has been extended for two-phase flows with topologically complex interface and cavitation flows with liquid-vapor phase change caused by large pressure drop. In analysis of two-phase flow, the phase interfaces are tracked by employing a LS(Level Set) method. Compared with the VOF(Volume-of-Fluid) method based on a non-smooth volume-fraction function, the LS method can calculate an interfacial curvature more accurately by using a smooth distance function. Also, it is quite straightforward to implement for 3-D irregular meshes compared with the VOF method requiring much more complicated geometric calculations. Also, the cavitation process is computed by including the effects of evaporation and condensation for bubble formation and collapse as well as turbulence in flows. The volume-faction and continuity equations are adapted for cavitation models with phase change. The LS and cavitation formulation are implemented into a general purpose program for 3-D flows and verified through several test problems.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.11
• /
• pp.189-196
• /
• 2012

This paper proposes Swap algorithm for solving Dynamic Economic Dispatch (DED) problem. The proposed algorithm initially balances total load demand $P_d$ with total generation ${\Sigma}P_i$ by deactivating a generator with the highest unit generation cost $C_i^{max}/P_i^{max}$. It then swaps generation level $P_i=P_i{\pm}{\Delta}$, (${\Delta}$=1.0, 0.1, 0.01, 0.001) for $P_i=P_i-{\Delta}$, $P_j=P_j+{\Delta}$ provided that $_{max}[F(P_i)-F(P_i-{\Delta})]$ > $_{min}[F(P_j+{\Delta})-F(P_j)]$, $i{\neq}j$. This new algorithm is applied and tested to the experimental data of Dynamic Economic Dispatch problem, demonstrating a considerable reduction in the prevalent heuristic algorithm's optimal generation cost and in the maximization of economic profit.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.466-477
• /
• 2014

Many image hiding schemes based on least significant bit (LSB) transformation have been proposed. One of the LSB-based image hiding schemes that employs diamond encoding was proposed in 2008. In this scheme, the binary secret data is converted into base n representation, and the converted secret data is concealed in the cover image. Here, we show that this scheme has two vulnerabilities: noticeable spots in the stego-image, i.e., a non-smooth embedding result, and inefficiency caused by rough re-adjustment of falling-off-boundary value and impractical base translation. Moreover, we propose a new scheme that is efficient and produces a smooth and high quality embedding result by restricting n to power of 2 and using a sophisticated re-adjustment procedure. Our experimental results show that our scheme yields high quality stego-images and is secure against RS detection attack.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.525-537
• /
• 1998

In this paper we prove the inequality of subharmonic functions between a non-negative subharmonic function u and a smooth function $\upsilon$satisfying ｜$\upsilon(0)$\mid$\leq u(0), $\mid$\nabla \upsilon $\mid$ \leq$\mid$\nabla u $\mid$\leq c\Delta u $, where 0$\leq$c$\leq$1 is a constant. Here $\mu$is the harmonic measure on $\partial$D with respect to 0.

• Journal of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.85-109
• /
• 2000

In this paper, the multiplicity, stability and the structure of classical solutions of semilinear elliptic equations of the form (equation omitted) will be discussed. Here $\Omega$ is a smooth and bounded domain in $R^{n}$ (n $\geq$ 1), f(x,u) = │u│$^{\alpha}$/sgn(u)-h(x), 0 < $\alpha$ < 1, (n $\geq$ 1) and h is a ${\gamma}$- Holder continuous function on $\Omega$ for some 0 < ${\gamma}$ < 1.a}$ < 1.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.169.4-169
• /
• 2001

Conventional methods to solve the nonlinear programming problem range from augmented Lagrangian methods to sequential quadratic programming (SQP) methods. NPSOL, which is a SQP code, has been widely used to solve various optimization problems but is still subject to many numerical problems such as convergence to local optima, difficulties in initialization and in handling non-smooth cost functions. Recently, many evolutionary methods have been developed for constrained optimization. Among them, CEALM (Co-Evolutionary Augmented Lagrangian Method) shows excellent performance in the following aspects: global optimization capability, low sensitivity to the initial parameter guessing, and excellent constraint handling capability due to the benefit of the augmented Lagrangian function. This algorithm is ...