• Nuclear Engineering and Technology
• /
• v.50 no.3
• /
• pp.327-339
• /
• 2018

This article presents a new global-local hybrid coarse-mesh finite difference (HCMFD) method for efficient parallel calculation of pin-by-pin heterogeneous core analysis. In the HCMFD method, the one-node coarse-mesh finite difference (CMFD) scheme is combined with a nodal expansion method (NEM)-based two-node CMFD method in a nonlinear way. In the global-local HCMFD algorithm, the global problem is a coarse-mesh eigenvalue problem, whereas the local problems are fixed source problems with boundary conditions of incoming partial current, and they can be solved in parallel. The global problem is formulated by one-node CMFD, in which two correction factors on an interface are introduced to preserve both the surface-average flux and the net current. Meanwhile, for accurate and efficient pin-wise core analysis, the local problem is solved by the conventional NEM-based two-node CMFD method. We investigated the numerical characteristics of the HCMFD method for a few benchmark problems and compared them with the conventional two-node NEM-based CMFD algorithm. In this study, the HCMFD algorithm was also parallelized with the OpenMP parallel interface, and its numerical performances were evaluated for several benchmarks.

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.251-278
• /
• 2008

In this study, we investigate the discontinuous-derivative treatment at the gas-liquid interface in underwater explosion (UNDEX) problems by using the Moving Least Squares-Smoothed Particle Hydrodynamics (MLS-SPH) method, which is known as one of the particle methods suitable for problems where large deformation and inhomogeneity occur in the whole domain. Because the numerical oscillation of pressure arises from derivative discontinuity in the UNDEX analysis using the standard SPH method, the MLS shape function with Discontinuous-derivative Basis Function (DBF) that is able to represent the derivative discontinuity of field function is utilized in the MLS-SPH formulation in order to suppress the nonphysical pressure oscillation. The effectiveness of the MLS-SPH with DBF is demonstrated in comparison with the standard SPH and conventional MLS-SPH though a shock tube problem and benchmark standard problems of UNDEX of a trinitrotoluene (TNT) charge.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.53 no.4
• /
• pp.210-215
• /
• 2004

This paper proposes an implicit method for computing the minimum cost feedback vertex set for a graph. For an arbitrary graph, a Boolean function is derived, whose satisfying assignments directly correspond to feedback vertex sets of the graph. Importantly, cycles in the graph are never explicitly enumerated, but rather, are captured implicitly in this Boolean function. This function is then used to determine the minimum cost feedback vertex set. Even though computing the minimum cost satisfying assignment for a Boolean function remains an NP-hard problem, it is possible to exploit the advances made in the area of Boolean function representation in logic synthesis to tackle this problem efficiently in practice for even reasonably large sized graphs. The algorithm has obvious application in flip-flop selection for partial scan. The algorithm proposed in this paper is the first to obtain the MFVS solutions for many benchmark circuits.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.85-88
• /
• 2003

In case that any jobs in a Job Shop can be scheduled on more than one machine and may have flexible operation sequences, with considering such case it is very difficult and complex to make the optimal process plans and scheduling. But they should be considered for an integrated model to perform more effective process planning and scheduling in this job shop problem. In this paper, we propose GA-based scheduling method to integrate effectively the problem of alternative machines, alternative operation sequences and scheduling. The performance of proposed GA is evaluated through comparing integrated scheduling with not integrated scheduling in molding company with alternative machines and operation sequences. Also, we use benchmark problems to evaluate performance. The scheduling method in this research will apply usefully to real world scheduling problems.

• Korean Management Science Review
• /
• v.20 no.1
• /
• pp.51-64
• /
• 2003

The JSSP (Job Shop Scheduling Problem) Is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetic algorithm to address JSSP. we design scheduling method based on SGA (Single Genetic Algorithm) and PGA (Parallel Genetic Algorithm). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, initial population is generated through integrating representation and G&T algorithm, the new genetic operators and selection method are designed to better transmit the temporal relationships in the chromosome, and island model PGA are proposed. The scheduling method based on genetic algorithm are tested on five standard benchmark JSSPs. The results were compared with other proposed approaches. Compared to traditional genetic algorithm, the proposed approach yields significant improvement at a solution. The superior results indicate the successful Incorporation of generating method of initial population into the genetic operators.

• 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.

• International Journal of Safety
• /
• v.11 no.2
• /
• pp.22-25
• /
• 2012

This paper deals with the problem of fault diagnosis for identifying a single fault when the number of assumed faults is larger than that of predictive variables. Principal component analysis (PCA) is employed to isolate and identify a single fault. PCA is a method to extract important information as reducing the number of large dimension in a process. The patterns of all assumed faults can be recognized by PCA and these can be employed whether a new fault is one of predefined faults or not. Through PCA, empirical models for analyzing patterns can be trained. When a single fault occurs, the pattern generated by PCA can be obtained and this is used to identify a fault. The performance of the proposed approach is illustrated in the actuator benchmark problem.

• Journal of the Korea Society for Simulation
• /
• v.5 no.2
• /
• pp.73-84
• /
• 1996

As circuits are larger and more complicated, logic simulation is playing a very important role in design verification. A good simulator should be fast and accurate, but unknown values in 3 value simulator may generate X-propagation problem which makes inaccurate output values. In this paper, a new partitioning method is devised to deal with X-propagation problem efficiently and an efficient algorithm is developed which is able to optimize time and accuracy by controlling partition depths. The results prove the effectiveness of the new simulation algorithm using some benchmark circuits.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.10
• /
• pp.8-18
• /
• 1997

In FPGAs, we may use the property of the routing architecture for their routing compared to the routing in the conventional layout style. Especially, the Xilinx XC4000 series FPGAs have very special routing architecture in which the routing problem is equivalent to the two dimensional track assignment problem. In this paper, we propose a new FPgA detailed routing method by developing a two dimensional trackassigment heuristic algorithm. The proposed routing mehtod accept a global routing result as an input and obtain a detailed routing such that the number of necessary wire segments in each connection block is minimized. For all benchmark circuits tested, our routing methd complete routing results. The number of used tracks are also similar to the results by thedirect routing methods.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.9
• /
• pp.1230-1243
• /
• 1997

A numerical technique for simulating incompressible viscous flow with free surface is presented. The flow field is obtained by penalty finite element formulation. In this work, a modified volume of fluid (VOF) method which is compatible with 4-node element is proposed to track the moving free surface. This scheme can be applied to irregular mesh system, and can be easily extended to three dimensional geometries. Numerical analyses were done for two benchmark examples, namely the broken dam problem and the solitary wave propagation problem. The numerical results were in close agreement with the existing data. Illustrative examples were studied to show the effectiveness of the proposed numerical scheme.