• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.1 no.1
• /
• pp.8-14
• /
• 1989

A mathematical model for computing the bed friction of combined wave-current flow has been developed based on the Prandtl's mixing length theory. Using various approximate expressions, solutions are obtained explicitly. The computational results are compared and found in reasonable agreements with the data of field measurements.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.1
• /
• pp.29-45
• /
• 2013

Central schemes offer a simple and versatile approach for computing approximate solutions of nonlinear systems of hyperbolic conservation laws. However, there are large numerical dissipation in case of contact discontinuity. We study semi-discrete central upwind scheme by changing flux functions to reduce the numerical dissipation and we perform numerical computations for various problems in case of contact discontinuity.

• The Pure and Applied Mathematics
• /
• v.29 no.4
• /
• pp.255-275
• /
• 2022

In this paper, we introduce a new system of set-valued variational inclusion problems in semi-inner product spaces. We use resolvent operator technique to propose an iterative algorithm for computing the approximate solution of the system of set-valued variational inclusion problems. The results presented in this paper generalize, improve and unify many previously known results in the literature.

• Nuclear Engineering and Technology
• /
• v.54 no.7
• /
• pp.2572-2578
• /
• 2022

An approximate method for calculating the cadmium ratio of a cyclotron-based thermal neutron radiography system was developed. In this method, the Monte-Carlo code, MCNP6.2, was employed to calculate the neutron capture rates of Au-197, and the cadmium ratio was obtained by computing the ratio of neutron capture rates. From the simulation results, the computed cadmium ratio is reasonably acceptable, and the assumption of ignoring the fast neutron contribution to the cadmium ratio is valid.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1311-1325
• /
• 2011

In this paper the Milstein method is proposed to approximate the solution of a linear stochastic differential equation with Poisson-driven jumps. The strong Milstein method and the weak Milstein method are shown to capture the mean square stability of the system. Furthermore using some technique, our result shows that these two kinds of Milstein methods can well reproduce the stochastically asymptotical stability of the system for all sufficiently small time-steps. Some numerical experiments are given to demonstrate the conclusions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.187-189
• /
• 2001

이동 컴퓨팅(Mobile Computing)의 상업적인 응용분야로서, 지능형 교통정보시스템(ITS)에서의 첨단 여행자 정보시스템(ATIS)이 있다. ATIS에서 가장 중요한 이동 컴퓨팅 태스크는 현재 위치에서 목적지까지의 최단 경로를 계산하는 일이다. 본 논문에서는 최단 경로 재 계산 문제에 대해서 연구하였다. 이 문제는 전자 수치 지도(topological digital road map)상의 간선(edge) 비용이 동적인 교통 상태에 따라 빈번하게 갱신되고 있는 ATIS의 동적 경로 안내 시스템(URGS)에서 발생한다. 지금까지 제안된 방법들은 처음부터 최단 경로를 재계산하거나, 또는 단지 비용의 변화가 일어난 간건 상에 있는 양 끝 노드 사이에 대해서 최단 경로를 재계산할 뿐이다. 본 논문에서는 앞서 계산된 최단 경로에 대한 정보를 이용하는 효율적인 적응형 슬라이딩 윈도우 기반의 근접 최단 경로 재 계산 방법을 제안한다.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.130-136
• /
• 1998

This paper develops an efficient algorithm for the minimum distance calculation between two general polyhedra(convex and/or concave) in three-dimensional space. The polyhedra approximate objects using flat polygons which composed of more than three vertices. The algorithm developed in this paper basically computes minimum distance between two polygons(one polygon per object) and finds a set of two polygons which makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that the minimum distance computing time is rapidly increased with the number of polygons which used to approximate an object. This paper develops a method to eliminate sets of two polygons which have no possibility of minimum distance occurrence, and an efficient algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. The correctness of the algorithm is verified not only comparing analytically calculated exact minimum distance with one calculated using the developed algorithm but also watching a line which connects two points making a global minimum distance of a convex object and/or a concave object. The algorithm efficiently finds minimum distance between two convex objects made of 224 polygons respectively with a computation time of about 0.1 second.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.1
• /
• pp.63-70
• /
• 1994

The three-dimensional incompressible clavier-Stokes equations are solved to simulate the flow field around a Wigley model with free-surface. The IAF(Implicit Approximate Factorization) method is used to show a good success in reducing the computing time. The CPU time is almost an half of that if the IAF method were used. The present method adopts the local linearization and Euler implicit scheme without the pressure-gradient terms for the artificial viscosity. Calculations are carried out at the Reynolds number of $10^6$ and the Froude numbers are 0.25, 0.289 and 0.316. For the approximations of turbulence, the Baldwin-Lomax model is used. The resulting free-surface wave configurations and the velocity vectors are compared with those by the explicit method and experiments.

• The Korean Journal of Applied Statistics
• /
• v.37 no.1
• /
• pp.103-118
• /
• 2024

The horseshoe prior is notably one of the most popular priors in sparse regression models, where only a small fraction of coefficients are nonzero. The parameter space of the horseshoe prior is much smaller than that of the spike and slab prior, so it enables us to efficiently explore the parameter space even in high-dimensions. However, on the other hand, the horseshoe prior has a high computational cost for each iteration in the Gibbs sampler. To overcome this issue, various MCMC algorithms for the horseshoe prior have been proposed to reduce the computational burden. Especially, Johndrow et al. (2020) recently proposes an approximate algorithm that can significantly improve the mixing and speed of the MCMC algorithm. In this paper, we compare (1) the traditional MCMC algorithm, (2) the approximate MCMC algorithm proposed by Johndrow et al. (2020) and (3) its variant in terms of computing times, estimation and variable selection performance. For the variable selection, we adopt the sequential clustering-based method suggested by Li and Pati (2017). Practical performances of the MCMC methods are demonstrated via numerical studies.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.