• Journal of the Society of Naval Architects of Korea
• /
• v.38 no.1
• /
• pp.1-8
• /
• 2001

The computations of the turbulent flow around the ship models with the free-surface effects were carried out. Incompressible Reynolds-Averaged Navier-Stokes equations were solved by using an explicit finite-difference method with the nonstaggered grid system. The method employed second-order finite differences for the spatial discretization and a four-stage Runge-Kutta scheme for the temporal integration. For the turbulence closure, a modified Baldwin-Lomax model was exploited. The location of the free surface was determined by solving the equation of the kinematic free-surface condition using the Lax-Wendroff scheme and a free-surface conforming grid was generated at each time step so that one of the grid boundary surfaces always coincides with the free surface. An inviscid approximation of the dynamic free-surface boundary condition was applied as the boundary conditions for the velocity and pressure on the free surface. To validate the computational method developed in the present study, the computations were carried out for beth Wigley and Series 60 $C_B=0.6$ ship model and the computational results showed good agreements with the experimental data.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.4
• /
• pp.541-550
• /
• 2012

An improved method of moments using a hybrid Galerkin-interpolation technique for numerical analysis of electromagnetic wave scattering in the 3-dimensional space is presented in this paper. Basically, the EFIE(electric field integral equation) and RWG(Rao-Wilton-Glisson) basis function are used to compute a property of electromagnetic wave scattering. We propose a hybrid technique combining the existing Galerkin's method with the interpolation method to improve the efficiency of the numerical computation. Then, an index of relative distance of each cells was defined to distinguish the relatively far elements, which interpolation method can be applied. To verify the performance of the proposed technique, the analytical Mie-series solution was used to compute the theoretical RCS of a conducting sphere for the purpose of comparison. We also applied this hybrid technique to various scatterers such as trihedral/omni-directional corner-reflectors to analyze the radar backscattering properties.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.266-274
• /
• 2003

This paper considers an incremental support vector learning for the abnormality detection problems. One of the most well-known support vector learning methods for abnormality detection is the so-called SVDD(support vector data description), which seeks the strategy of utilizing balls defined on the kernel feature space in order to distinguish a set of normal data from all other possible abnormal objects. The major concern of this paper is to modify the SVDD into the direction of utilizing the relation between the optimal solution and incrementally given training data. After a thorough review about the original SVDD method, this paper establishes an incremental method for finding the optimal solution based on certain observations on the Lagrange dual problems. The applicability of the presented incremental method is illustrated via a design example.

• Journal of Korea Water Resources Association
• /
• v.51 no.10
• /
• pp.853-862
• /
• 2018

An adaptive cut-cell grid based 2D inundation analysis model, K-Flood, is developed in this study. Cut cell grid method divides a grid into a flow area and a non-flow area depending the characteristics of the flows. With adaptive mesh refinement technique cut cell method can represent complex flow area using relatively small number of cells. In recent years, the urban inundation modeling using high resolution and fine quality data is increasing to achieve more accurate flood analysis or flood forecasting. K-Flood has potential to simulate such complex urban inundation using efficient grid generation technique. A finite volume numerical scheme of second order accuracy for space and time was applied. For verification of K-Flood, 1) shockwave reflex simulation by circular cylinder, 2) urban flood experiment simulation, 3) Malpasset dam collapse simulation are performed and the results are compared with observed data and previous simulation results.

• Journal of Korea Water Resources Association
• /
• v.36 no.1
• /
• pp.1-11
• /
• 2003

This paper describes a finite volume, two-dimensional model. It adopts a recently developed essentially non-oscillatory(ENO) schemes based on the Lax-Friedrichs solver, which was modified for a finite volume grid, and employs a modified MUSCL(Monotonic Upstream centered Scheme for Conservation Law) for second-order accuracy in space. To demonstrate the applications of the model, it is applied to solve the 1-D and 2-D dam-break problems. The model in conjunction with the modified MUSCL showed a better agreement with analytical solutions than the minmod function in 1-D dam-break problems and is satisfactorily validated with documented published data in 2-D dam-break problems. The model was applied to tidal wane entering channel at one end, and the results showed a good agreement with analytical solutions. In the channel with reflective boundary conditions specified at the extremities, the model was capable of accurately simulating the wave propagation.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.12 no.5
• /
• pp.1158-1174
• /
• 1988

A numerical technique is developed for the solution of fully developed turbulent recirculating flow in the passage of variable area using the non-orthogonal coordinate transformation. In the numerical analysis, primitive pressure-velocity finite difference equations were solved by SIMPLER algorithm with 2-equation turbulence model and algebraic stress model (ASM). QUICK scheme on the differencing of convective terms which is free from the inaccuracies of numerical diffusion has been applied to the variable grids and the results compared with those from HYBRID scheme. In order to test the effect of streamline curvatures on turbulent diffusion Lee and Choi streamline curvature correction model which has been obtained by modifying the Leschziner and Rodi's model is testes. The ASM was also employed and the results are compared to those from another turbulence model. The results show that difference of convective differencing schemes and turbulence models give significant differences in the prediction of velocity fields in the expansion region and outlet region of the combustor, however show little differences in the parallel flow region.

• Journal of Radiation Protection and Research
• /
• v.4 no.1
• /
• pp.1-4
• /
• 1979

Effective multiplication factor has been calculated for one PWR fresh fuel assembly immersed in a spent fuel storage vault on the basis of the neutron transport theory. A numerical calculation has been carried out by means of Sn approximation. The method employed in this study is that the energy domain is broken into 16 groups, the angular variable is divided into four discrete direction, i.e., $S_4$, and the spatial variable which is divided into fine meshes at the interface between different materials is discretized into 27 mesh points. The calculated $K_{eff}$ value of 0.6145 seems to be far small in comparison with the value obtained by other author for an infinite array of fuel assemblies.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.29-43
• /
• 2021

In this paper, a new approach to solve the constrained dynamic programming is proposed by using the constraint programming. While the conventional dynamic programming scheme has the state space augmented with states on constraints, this approach, without state augmentation, represents states of constraints as domains in a contraining programming solver. It has a hybrid computational mechanism in its computation by combining solving the Bellman equation in the dynamic programming framework and exploiting the propagation and inference methods of the constraint programming. In order to portray the differences of the two approaches, this paper solves a simple version of the long-term car rental financing problem. In the conventional scheme, data structures for state on constraints are designed, and a simple inference borrowed from the constraint programming is used to the reduction of violation of constraints because no inference risks failure of a solution. In the hybrid approach, the architecture of interface of the dynamic programming solution method and the constraint programming solution method is shown. It finally discusses the advantages of the proposed method with the conventional method.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.127-137
• /
• 2009

A practical algorithm of generating most probable states in decreasing order of probability of the network system state is suggested for approximating the performance of multi-mode network system using algebraic structure of the system states. Most complex system having network structure with multi-mode unit state is difficult to evaluate the performance or reliability due to exponentially increasing size of state space. Hence not an exact computing method but an approximated one is reasonable approach to solve the problem. To achieve the goal we should enumerate the network system states in order as a pre-processing step. In this paper, we suggest an improved algorithm of generating most probable multi-mode states to get the ordered system states efficiently. The method is compared with the previous algorithms in respective to memory requirement and empirical computing time. From the experiment proposed method has some advantages with regard to the criterion of algorithm performance. We investigate the advantages and disadvantage by illustrating experiment examples.