• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.05a
• /
• pp.94-97
• /
• 2001

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. For multi-stage deep-drawing processes, numerical analysis is extremely difficult to carry out due to its complexities and convergence problem as well as tremendous computation time. In this paper, multi-stage finite element inverse analysis is applied to multi-stage rectangular cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. Deformation history of the previous stage is considered in the computation. Finite element patches are used to describe arbitrary intermediate sliding constraint surfaces.

• Journal of Mechanical Science and Technology
• /
• v.18 no.4
• /
• pp.671-680
• /
• 2004

We present numerical and experimental results of the periodic flows inside a rectangular container under a background rotation. In numerical computation, a parallel-computation technique with MPI is implemented. Flow visualization and PIV measurement are also performed to obtain velocity fields at the free surface. Through a series of numerical and experimental works, we aim to clarify the fundamental reasons of discrepancy between the two-dimensional computation and the experimental measurement, which was detected in the previous study for the same flow model. Specifically, we check if the various assumptions prerequisite for the validity of the classical Ekman pumping law are satisfied for periodic flows under a background rotation.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1998.12a
• /
• pp.317-328
• /
• 1998

Matsumoto, Kato, 그리고 Imai가 [1]에서 제안한 SASC(Server-Aided Secret Computation) 프로토콜은 스마트 카드와 같이 계산능력이 현저히 부족한 장치로 하여금 서버의 도움을 받아 효율적으로 서명생성을 할 수 있도록 하는 유용한 프로토콜이다. 그러나, 그 과정에서 유출되는 정보를 통해 스마트 카드의 비밀정보를 알아낼 수 있는 많은 공격방법들이 제안되었다. Crypto'95에서 Beguin과 Quisquater는 기존의 모든 공격방법들에 대해 안전하면서도 효율적으로 RSA 서명을 수행할 수 있는 SASC 프로토콜을 제안하였다. 본 논문에서는 Beguin과 Quisquater의 프로토콜을 공격할 수 있는 능동적 공격(active attack) 방법을 제안한다. 본 논문에서 제안하는 공격방법은 0

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.119-131
• /
• 2008

The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

• Computers and Concrete
• /
• v.6 no.6
• /
• pp.505-521
• /
• 2009

The analysis of prismatic members made of reinforced concrete under inclined bending, especially the computation of ultimate loads, is a pronounced non-linear problem which is frequently solved by discretizing the stress distribution in the cross-section using interpolation functions. In the approach described in the present contribution the exact analytical stress distribution is used instead. The obtained expressions are integrated by means of a symbolic manipulation package and automatically converted to optimized Fortran code. The direct problem-computation of ultimate internal forces given the position of the neutral axis-is first described. Subsequently, two kinds of inverse problem are treated: the computation of rupture envelops and the dimensioning of reinforcement, given design internal forces. An iterative Newton-Raphson procedure is used. Examples are presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.57-59
• /
• 2006

The purpose of search problem is to maximize the probability of target detection as limited search capability. Especially, as elapsing of time at a point of time of initial information received the target detection rate for searching an expected location due to a moving target such that wrecked ship or submarine decrease in these problems. The algorithm of search problem to a moving target having similar property of above targets should solve the search route as quickly as possible. In existing studies, they have a limit of applying in practice due to increasing computation time required by problem size (i.e., number of search area, search time). In this study, we provide that it takes more reasonable computation time than preceding studies even though extending a problem size practically using an approximate computation of probability.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.6
• /
• pp.2202-2206
• /
• 2010

In this paper, an architecture for modified Euclidean(ME) algorithm is proposed, which is using finite-state machine(FSM) instead of degree computation. Since the proposed architecture does not have degree computation circuits, it is possible to reduce the hardware complexity of RS(Reed-Solomon) decoder, so that a very high-speed RS decoder can be implemented. RS(255,239) decoder with the proposed architecture is implemented using Verilog-HDL and requires about 13% fewer gate counts than conventional one.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.2035-2051
• /
• 2013

In this paper, we study numerical schemes for solving multi-dimensional option pricing problem. We compare the direct solving method and the Operator Splitting Method(OSM) by using finite difference approximations. By varying parameters of the Black-Scholes equations for the maximum on the call option problem, we observed that there is no significant difference between the two methods on the convergence criterion except a huge difference in computation cost. Therefore, the two methods are compatible in practice and one can improve the time efficiency by combining the OSM with parallel computation technique. We show numerical examples including the Equity-Linked Security(ELS) pricing based on either two assets or three assets by using the OSM with the Monte-Carlo Simulation as the benchmark.

• Water for future
• /
• v.26 no.3
• /
• pp.103-111
• /
• 1993

The HEC(Hydrologic Engineering Center)-2 program, which utilize the standard step method, is usually adopted in the practical works for the water surface profile computation of natural channels. Water profile computation is, in general, carried upstream for subcritical flow. On the other hand, when the reference water surface si given upstream, numerous efforts and a great deal of time are necessary to compute the downstream water surface profile for subcritical flow. A simple method, computing the water surface profile from upstream to downstream for subcritical flow by HEC-2, is suggested in this paper. The applicability and the accuracy of this method are discussed by applying this method to both prismatic and natural channels.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.579-583
• /
• 2001

In the area of data clustering in high dimensional space, one of the difficulties is the time-consuming process for computing vector similarities. It becomes worse in the case of the agglomerative algorithm with the group-average link and mean centroid method, because the cluster similarity must be recomputed whenever the cluster center moves after the merging step. As a solution of this problem, we present an incremental method of similarity computation, which substitutes the scalar calculation for the time-consuming calculation of vector similarity with several measures such as the squared distance, inner product, cosine, and minimum variance. Experimental results show that it makes clustering speed significantly fast for very high dimensional data.