• Journal of the Korea Society of Computer and Information
• /
• v.25 no.9
• /
• pp.11-20
• /
• 2020

In this paper, we propose the possibility of using containers in the HPC ecosystem and the criteria for selecting a proper PMI library. Although demand for container has been growing rapidly in the HPC ecosystem, Docker container which is the most widely used has a potential security problem and is not suitable for the HPC. Therefore, several HPC containers have appeared to solve this problem and the chance of performance differences also emerged. For this reason, we measured the performance difference between each HPC container and Docker container through NAS Parallel Benchmark experiment and checked the effect of the type of PMI library. As a result, the HPC container and the Docker container showed almost the same performance as native, or in some cases, rather better performance was observed. In the result of comparison between PMI libraries showed that PMIx was not superior to PMI-2 in all conditions.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2000.10a
• /
• pp.79-83
• /
• 2000

A sliding mode fuzzy control (SMFC) with disturbance estimator is applied to design a controller for the third generation benchmark problem on an wind-excited building. A distinctive feature in vibration control of large civil infrastructure is the existence of large disturbances, such as wind, earthquake, and sea wave forces. Those disturbances govern the behavior of the structure, however, they cannot be precisely measured, especially for the case of wind-induced vibration control. Since the structural accelerations are measured only at a limited number of locations without the measurement of the wind forces, the structure of the conventional control may have the feed-back loop only. General structure of the SMFC is composed of a compensation part and a convergent part. The compensation part prevents the system diverge, and the convergent part makes the system converge to the sliding surface. The compensation part uses not only the structural response measurement but also the disturbance measurement, so the SMFC has a feed-back loop and a feed-forward loop. To realize the virtual feed-forward loop for the wind-induced vibration control, disturbance estimation filter is introduced. the structure of the filter is constructed based on an auto regressive model for the stochastic wind force. This filter estimates the wind force at each time instance based on the measured structural responses and the stochastic information of the wind force. For the verification of the proposed algorithm, a numerical simulation is carried out on the benchmark problem of a wind-excited building. The results indicate that the present control algorithm is very efficient for reducing the wind-induced vibration and that the performance indices improve as the filter for wind force estimation is employed.

• The Korean Journal of Financial Management
• /
• v.26 no.1
• /
• pp.189-220
• /
• 2009

This study tests the significance of momentum and contrarian strategy which challenge the weak efficient market hypothesis (EMH). If momentum and contrarian strategy can make extra return above the market, this can be a significant critics to the weak EMH. By using Monte Carlo simulation we have found that many existing returature, which test the significance of momentum and contrarian strategy, have a significance distortion problem. We test the significance of momentum and contrarian strategy by using reality check test of White(2000) which solve the problem of data snooping bias. The results are following. When we use the KOSPI index as the benchmark portfolio, we can get the best strategy of momentum strategy in the case of mean return. But in the case of Sharp ratio which is the performance measure adjusting risk, we find that the best strategy in the momentum and contrarian strategy can not dominate the performance of benchmark portfolio. Therefore we argue that weak EMH can not be rejected because of superior performance of momentum and contrarian strategy when we consider risk.

• Journal of Mechanical Science and Technology
• /
• v.20 no.12
• /
• pp.2230-2241
• /
• 2006

This paper presents a sole application of boundary element method to the conjugate heat transfer problem of thermally developing laminar flow in a thick walled pipe when the fluid velocities are fully developed. Due to the coupled mechanism of heat conduction in the solid region and heat convection in the fluid region, two separate solutions in the solid and fluid regions are sought to match the solid-fluid interface continuity condition. In this method, the dual reciprocity boundary element method (DRBEM) with the axial direction marching scheme is used to solve the heat convection problem and the conventional boundary element method (BEM) of axisymmetric model is applied to solve the heat conduction problem. An iterative and numerically stable BEM solution algorithm is presented, which uses the coupled interface conditions explicitly instead of uncoupled conditions. Both the local convective heat transfer coefficient at solid-fluid interface and the local mean fluid temperature are initially guessed and updated as the unknown interface thermal conditions in the iterative solution procedure. Two examples imposing uniform temperature and heat flux boundary conditions are tested in thermally developing region and compared with analytic solutions where available. The benchmark test results are shown to be in good agreement with the analytic solutions for both examples with different boundary conditions.

• Industrial Engineering and Management Systems
• /
• v.10 no.2
• /
• pp.134-139
• /
• 2011

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.4
• /
• pp.469-479
• /
• 2007

This paper focuses on the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer must be visited exactly once by one vehicle starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied. The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the existing search heuristics. In particular, our algorithm incorporates the neighborhood reduction method using the proximity information of the Voronoi diagram corresponding to each problem instance. To show the performance of the Voronoi tabu search algorithm suggested in this paper, computational experiments are done on the benchmark problems and the test results are reported.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.150-159
• /
• 2009

The heterogeneous fleet vehicle routing problem(HVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs and variable costs. We propose a new conceptual HVRPCR(HVRP with customer restriction) model including additional customer restrictions in HVRP. In this paper, we develop hybrid particle swarm optimization(HPSO) algorithm with 2-opt and node exchange technique for HVRP. The solution representation is a n-dimensional particle for HVRP with N customers. The decoding method for this representation starts with the transformation of particle into a priority list of customer to enter route and limit of vehicle to serve each customer. The vehicle routes are then constructed based on the customer priority list and limit of vehicle to serve. The proposed algorithm is tested using 8 benchmark problems and it consistently produces high-quality solutions, including new best solutions. The numerical results show that the proposed algorithm is robust and efficient.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.79-89
• /
• 1998

The Error Back-Propagation(EBP) algorithm is widely applied to train a multi-layer perceptron, which is a neural network model frequently used to solve complex problems such as pattern recognition, adaptive control, and global optimization. However, the EBP is basically a gradient descent method, which may get stuck in a local minimum, leading to failure in finding the globally optimal solution. Moreover, a multi-layer perceptron suffers from locking a systematic determination of the network structure appropriate for a given problem. It is usually the case to determine the number of hidden nodes by trial and error. In this paper, we propose a new algorithm to efficiently train a multi-layer perceptron. OUr algorithm uses stochastic perturbation in the weight space to effectively escape from local minima in multi-layer perceptron learning. Stochastic perturbation probabilistically re-initializes weights associated with hidden nodes to escape a local minimum if the probabilistically re-initializes weights associated with hidden nodes to escape a local minimum if the EGP learning gets stuck to it. Addition of new hidden nodes also can be viewed asa special case of stochastic perturbation. Using stochastic perturbation we can solve the local minima problem and the network structure design in a unified way. The results of our experiments with several benchmark test problems including theparity problem, the two-spirals problem, andthe credit-screening data show that our algorithm is very efficient.

• Industrial Engineering and Management Systems
• /
• v.4 no.1
• /
• pp.94-101
• /
• 2005

This paper presents the first known application of a meta-heuristic algorithm, variable neighbourhood descent (VND), to the redundancy allocation problem (RAP). The RAP, a well-known NP-hard problem, has been the subject of much prior work, generally in a restricted form where each subsystem must consist of identical components. The newer meta-heuristic methods overcome this limitation and offer a practical way to solve large instances of the relaxed RAP where different components can be used in parallel. The variable neighbourhood descent method has not yet been used in reliability design, yet it is a method that fits perfectly in those combinatorial problems with potential neighbourhood structures, as in the case of the RAP. A variable neighbourhood descent algorithm for the RAP is developed and tested on a set of well-known benchmark problems from the literature. Results on 33 test problems ranging from less to severely constrained conditions show that the variable neighbourhood descent method provides comparable solution quality at a very moderate computational cost in comparison with the best-known heuristics. Results also indicate that the VND method performs with little variability over random number seeds.

• Nuclear Engineering and Technology
• /
• v.28 no.3
• /
• pp.311-319
• /
• 1996

We reconstruct the assembly pinwise flux using several types of boundary conditions and confirm that the reconstructed fluxes are the same with the reference flux if the boundary condition is exact. We test EPRI-9R benchmark problem with four boundary conditions, such as Dirichlet boundary condition, Neumann boundary condition, homogeneous mixed boundary condition (albedo type), and inhomogeneous mixed boundary condition. We also test reconstruction of the pinwise flux from nodal values, specifically from the AFEN [1, 2] results. From the nodal flux distribution we obtain surface flux and surface current distributions, which can be used to construct various types of boundary conditions. The result show that the Neumann boundary condition cannot be used for iterative schemes because of its ill-conditioning problem and that the other three boundary conditions give similar accuracy. The Dirichlet boundary condition requires the shortest computing time. The inhomogeneous mixed boundary condition requires only slightly longer computing time than the Dirichlet boundary condition, so that it could also be an alternative. In contrast to the fixed-source type problem resulting from the Dirichlet, Neumann, inhomogeneous mixed boundary conditions, the homogeneous mixed boundary condition constitutes an eigenvalue problem and requires longest computing time among the three (Dirichlet, inhomogeneous mixed, homogeneous mixed) boundary condition problems.