• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1997년도 춘계학술대회논문집
• /
• pp.217-221
• /
• 1997

In this study, 3D sheet metal forming analysis program is developed by explicit finite element method. In this program, analysis flow just follows the real engineering process to provide the user intuitive understanding and smooth contact alorithm improves the accuracy of stress prediction. The capability of this program are demonstrated by various examples.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1999년도 춘계학술대회논문집
• /
• pp.245-248
• /
• 1999

Explicit dynamic finite element analysis has been used widely in the field of sheet metal forming. However in using the analysis technique there are some parameters which are not clearly defined so that engineers may obtain inaccurate solutions In the present study parameters such as time step damping ratio penalty constant and punch speed were investigated on their influence to the solution behavior. Considered forming processes are plane stain bending by a punch and axisymmetric deep drawing.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.379-382
• /
• 2001

In this paper, a new enhanced early fair rate allocation(EFRA＋) algorithm is proposed for ATM switches supporting ABR service. The central issue of explicit rate control algorithms for ABR service is the computation of max-min fair rates for every connection. The EFRA＋ inherits the main feature of the EFRA, uses the connection control information during the connection setup to prevent potential congestion in switches, and enhances the computation method of the max-min fair rate.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.105-125
• /
• 2005

Motivated by the field experimental designs in agriculture, the theory of block designs has been applied to several areas such as statistics, combinatorics, communication networks, distributed systems, cryptography, etc. An explicit formula and its fast computational algorithm for a class of symmetric balanced incomplete block designs are presented. Based on the formula and the careful investigation of the modulus multiplication table, the algorithm is developed. The computational costs of the algorithm is superior to those of the conventional ones.

• 대한수학회지
• /
• 제46권2호
• /
• pp.237-248
• /
• 2009

We give an explicit formula for the Mordell-Weil rank of an abelian fibered variety and some of its applications for an abelian fibered $hyperk{\ddot{a}}hler$ manifold. As a byproduct, we also give an explicit example of an abelian fibered variety in which the Picard number of the generic fiber in the sense of scheme is different from the Picard number of generic closed fibers.

• East Asian mathematical journal
• /
• 제26권3호
• /
• pp.337-350
• /
• 2010

Strong convergence theorem of the explicit viscosity iterative scheme involving the sunny nonexpansive retraction for nonexpansive nonself-mappings is established in a reflexive and strictly convex Banach spaces having a weakly sequentially continuous duality mapping. The main result improves the corresponding result of [19] to the more general class of mappings together with certain different control conditions.

• 대한수학회지
• /
• 제45권1호
• /
• pp.121-136
• /
• 2008

Some new explicit bounds on the solutions to a class of new nonlinear retarded Volterra-Fredholm type integral inequalities in two independent variables are established, which can be used as effective tools in the study of certain integral equations. Some examples of application are also indicated.

• 대한수학회지
• /
• 제49권1호
• /
• pp.69-83
• /
• 2012

In this note, we present certain circular domain, named Forelli-Rudin construction or Hua construction, which is built on Cartan domains. We compute the explicit Bergman kernel for it and get the corresponding weighted Bergman kernel on its base.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.211-218
• /
• 2003

Let H be a Hilbert space, X be a real Banach space, A : H \longrightarrow X be an operator with D(A) dense in H, G： H \longrightarrow H be positive definite, $\chi$ $\in$ D(A) and b $\in$ H. Consider the quadratic programming problem: QP： Minimize $\frac{1}{2}$〈p, $\chi$〉 + 〈$\chi$, G$\chi$〉 subject to A$\chi$= b In this paper, we obtain an explicit solution to the above problem using generalized inverses.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.715-723
• /
• 2009

The aim of this paper is to present an explicit iteration method for finding a common fixed point of a finite family of strictly pseudocon-tractive mappings defined on q-uniformly smooth and uniformly convex Banach spaces.