• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2002.02a
• /
• pp.274-284
• /
• 2002

Deep drawing process for rectangular drawn section is different with that for axisymmetric circular one. Therefore deep drawing process for rectangular drawn section requires several intermediate steps to generate the final configuration without any significant defect. In this study, finite element analysis for multi-stage deep drawing process for high precision rectangular cases is carried out especially for an extreme aspect ratio. The analysis is performed using rigid-plastic finite element method with an explicit time integration scheme of the commercial program, LS-DYNA3D. The sheet blank is modeled using eight-node continuum brick elements. The results of analysis show that the irregular contact condition between blank and die affects the occurrence of failure, and the difference of aspect ratio in the drawn section leads to non-uniform metal flow, which may cause failure. A series of experiments for multi-stage deep drawing process for the rectangular cases are conducted, and the deformation configuration and the thickness distribution of the drawn rectangular cases are investigated by comparing with the results of the numerical analysis. The numerical analysis with an explicit time integration scheme shows good agreement with the experimental observation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2008.05a
• /
• pp.235-237
• /
• 2008

A unified hydrocode, ExLO, in which Largrangian, ALE and Eulerian solvers are incorporated into a single framework, has recently been developed in Korea. It is based on the three dimensional explicit finite element method and written in C++. ExLO is mainly designed for the calculation of structural responses to highly transient loading conditions, such as high-speed impacts, high-speed machining, high speed forming and explosions. In this paper the numerical schemes are described. Some improvements of the material interface and advection scheme are included. Details and issues of the momentum advection scheme are provided. In this paper the modeling capability of ExLO has been described for two extreme loading events; high-speed impacts and explosions. Numerical predictions are in good agreement with the existing experimental data. Specific applications of the code are discussed in a separate paper in this journal. Eventually ExLO will be providing an optimum simulation environment to engineering problems including the fluid-structure interaction problems, since it allows regions of a problem to be modeled with Lagrangian, ALE or Eulerian schemes in a single framework.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.1
• /
• pp.39-48
• /
• 2013

This paper develops a 2-D moving least squares(MLS) difference method for Stefan problem by extending the 1-D version of the conventional method. Unlike to 1-D interfacial modeling, the complex topology change in 2-D domain due to arbitrarily moving boundary is successfully modelled. The MLS derivative approximation that drives the kinetics of moving boundary is derived while the strong merit of MLS Difference Method that utilizes only nodal computation is effectively conserved. The governing equations are differentiated by an implicit scheme for achieving numerical stability and the moving boundary is updated by an explicit scheme for maximizing numerical efficiency. Numerical experiments prove that the MLS Difference Method shows very good accuracy and efficiency in solving complex 2-D Stefan problems.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.38-44
• /
• 2001

An efficient Gauss-Seidel time integration scheme is developed for solving the Euler and Navier-Stokes equations on unstructured meshes. Roe's FDS is used for the explicit residual computations and van Leer's FVS for evaluating implicit flux Jacobian. To reduce the memory requirement to a minimum level, off-diagonal flux Jacobian contributions are repeatedly calculated during the Gauss-Seidel sub-iteration process. Computational results based on the present scheme show that approximately $15\%$ of CPU time reduction is achieved while maintaining the memory requirement level to $50-60\%$ of the original Gauss-Seidel scheme.

• Journal of the Korean Statistical Society
• /
• v.35 no.3
• /
• pp.281-303
• /
• 2006

In an earlier work, we investigated the problem of using linear programming to bound performance measures in a discrete time Jackson network. There it was assumed that the system evolution is controlled by the early arrival scheme. This assumption implies that the system can't be modelled by a Markov chain. This problem was resolved and performance bounds were calculated. In the present work, we use a modification of the early arrival scheme (without corrupting it) in order to make the system evolves as a Markov chain. This modification enables us to obtain explicit expressions for certain moments that could not be calculated explicitly in the pure early arrival scheme setting. Moreover, this feature implies a reduction in the linear program size as well as the computation time. In addition, we obtained tighter bounds than those appeared before due to the new setting.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1359-1371
• /
• 1999

In this paper, we propose an efficient explicit rate (ER) feedback switch algorithm for available bit rate (ABR) flow control. In order to improve the disadvantages of existing ER feedback switch algorithms with congestion avoidance, the proposed scheme adjusts the target utilization dynamically according to the queue length and its growth rate. also, we investigate the performance of the proposed switch algorithm and compare it with ERICA and NIST switches using simulation. Simulation results show that the proposed switch algorithm can control the cell emission rate of a source rapidly according to variations of available link bandwidth by using dynamic adaptation of target utilization. It also exhibits a better performance than the existing ER feedback switches in terms of queue length and link utilization.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.25 no.3
• /
• pp.322-329
• /
• 2001

A study of the shock wave turbulent boundary layer interaction is presented. The focus of the study is the interactions of the shock waves with the turbulent boundary layer on the falt plate. Three examples are investigated. The computations are performed, using mixed explicit-implicit generalized Galerkin finite element method. The linear equations at each time step are solved by a preconditioned GMRES algorithm. Numerical results indicate that the implicit scheme converges to the asymptotic steady state much faster than the explicit counterpart. The computed surface pressures and skin friction coefficients display good agreement with experimental data. The flowfield manifests a complex shock wave system and a pair of counter-rotating vortices.

• IE interfaces
• /
• v.20 no.2
• /
• pp.186-194
• /
• 2007

Recent deregulation of Korean electricity industry has made each power generation company pay more attention to maximizing its own profit instead of minimizing the overall system operation cost while guaranteeing system security. Electricity power generation problem is typically defined as the problem of determining both the on and off status and the power generation level of each generator under the given fuel constraints, which has been known as Profit-Based Unit Commitment (PBUC) problem. To solve the PBUC problem, the previous research mostly focused on devising Lagrangian Relaxation (LR) based heuristic algorithms due to the complexity of the problem and the nonlinearity of constraints and objectives. However, these heuristic approaches have been reported as less practical in real world applications since the computational run time is usually quite high and it may take a while to implement the devised heuristic algorithms as software applications. Especially when considering long-term planning problem which spans at least one year, the complexity becomes higher. Therefore, this paper proposes an explicit column generation algorithm using power generation patterns and the proposed algorithm is successfully applied to a Korean power generation company. The proposed scheme has a robust structure so that it is expected to extend general PBUC problems.

• ETRI Journal
• /
• v.23 no.4
• /
• pp.202-204
• /
• 2001

In this letter, we propose a new multicast scheme, named Xcast+, which is an extension of Explicit Multicast (Xcast) for an efficient delivery of multicast packets. The mechanism incorporates the host group model and a new control plane into existing Xcast, and not only does it provide the transparency of traditional multicast schemes to senders and receivers, but it also enhances the routing efficiency in networks. Since intermediate routers do not have to maintain any multicast states, it results in a more efficient and scalable mechanism to deliver multicast packets. Our simulation results show distinct performance improvements of our approach compared to Xcast, particularly as the number of receivers in a subnet increases.