• Proceedings of the KWS Conference
• /
• 2002.10a
• /
• pp.205-210
• /
• 2002

This article presents an integrated modeling approach for coupled analysis of heat transfer and microstructure evolution in welding carbon steel. The modeling procedure utilizes commercial [mite element code ABAQUS/Standard as the platform for solving the equation of heat conduction. User subroutines that implement computational thermodynamics and kinetics models are integrated with the FEA code to compute the transient microstructure evolution. In this study, the integrated models are applied to simulate the hot-tap repair welding of carbon steel pipeline. Microstructural components are treated as user output variables. Based on the predicted microstructure and cooling rates, hardness distributions in the welds were also predicted. The predicted microstructure and hardness distribution were found in good agreement with metallographic examinations and hardness measurements. This study demonstrates the applicability of computational models for the development of welding procedure for in-service pipeline repair.

• International Journal of Korean Welding Society
• /
• v.2 no.2
• /
• pp.1-6
• /
• 2002

This article presents an integrated modeling approach for coupled analysis of heat transfer and microstructure evolution in welding carbon steel. The modeling procedure utilizes commercial finite element code ABAQUS/Standard as the platform for solving the equation of heat conduction. User subroutines that Implement computational thermodynamics and kinetics models are integrated with the FEA code to compute the transient microstructure evolution. In this study, the integrated models are applied to simulate the hot-tap repair welding of carbon steel pipeline. Microstructural components are treated as user output variables. Based on the predicted microstructure and cooling rates, hardness distributions in the welds were also predicted. The predicted microstructure and hardness distribution were found in good agreement with metallographic examinations and hardness measurements. This study demonstrates the applicability of computational models for the development of welding procedure for in-service pipeline repair.

• Journal of The Korean Astronomical Society
• /
• v.28 no.1
• /
• pp.71-75
• /
• 1995

In the previous work we made a long term evolution code for the central black hole in an active galactic nucleus under the assumption that the Blandford-Znajek process is the source of the emission. Using our code we get the evolution of the angular velocity of the precession for a supermassive black hole. We consider a hole at the center of an axisymmetric, ellipsoidal galactic nucleus. Our numerical results show that, only for the cases such that the stellar density or the mass of the black hole is large enough, the precession of the black hole - presumably the precession of the galactic jet - is interestingly large.

• The Bulletin of The Korean Astronomical Society
• /
• v.38 no.2
• /
• pp.101.2-101.2
• /
• 2013

We present a new computational fluid dynamic (CFD) simulation code. The code employs the moving and polyhedral unstructured mesh scheme, which is known as a superior approach to the conventional SPH (smoothed particle hydrodynamics) and AMR (adaptive mesh refinement) schemes. The code first generates unstructured meshes by the Voronoi tessellation at every time step, and then solves the Riemann problem for surfaces of every Voronoi cell to update the hydrodynamic states as well as to move former generated meshes. For the second-order accuracy, the MUSCL-Hancock scheme is implemented. To increase efficiency for generating Voronoi tessellation we also develop the incremental expanding method, by which the CPU time is turned out to be just proportional to the number of particles, i.e., O(N). We will discuss the applications of our code in the context of cosmological simulations as well as numerical experiments for galaxy formation.

• The Bulletin of The Korean Astronomical Society
• /
• v.39 no.2
• /
• pp.65.2-65.2
• /
• 2014

We present a new hydrodynamic simulation code based on the Voronoi tessellation for estimating the density precisely. The code employs both of Lagrangian and Eulerian description by adopting the movable mesh scheme, which is superior to the conventional SPH (smoothed particle hydrodynamics) and AMR (adaptive mesh refinement) schemes. The code first generates unstructured meshes by the Voronoi tessellation at every time step, and then solves the Riemann problem for all surfaces of each Voronoi cell so as to update the hydrodynamic states as well as to move current meshes. Besides, the IEM (incremental expanding method) is devised to compute the Voronoi tessellation to desired degree of speed, thereby the CPU time is turned out to be just proportional to the number of particles, i.e., O(N). We discuss the applications of our code in the context of cosmological simulations as well as numerical experiments for galaxy formation.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.809-817
• /
• 2008

Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.20-25
• /
• 2006

In this paper, the performance of Tree-LDPC code is presented based on the min-sum algorithm with scaling and the asymptotic performance in the water fall region is shown by density evolution. We presents that the Tree-LDPC code show a significant performance gain by scaling with the optimal scaling factor which is obtained by density evolution methods. We also show that the performance of min-sum with scaling is as good as the performance of sum-product while the decoding complexity of min-sum algorithm is much lower than that of sum-product algorithm. The Tree-LDPC decoder is implemented on a FPGA chip with a small interleaver size.

• Publications of The Korean Astronomical Society
• /
• v.32 no.1
• /
• pp.205-208
• /
• 2017

Modelling and fitting the spectral energy distribution (SED) of galaxies or regions of galaxies is one of the most useful methods available to the astronomer nowadays. By modelling the SEDs and comparing the models to the observations, we can collect important information on the physical processes at play in the formation and evolution of galaxies. The models allow to follow the evolution of the galaxies from their formation on. The versatility of code is crucial because of the diversity of galaxies. The analysis is only relevant and useful if the models can correctly reproduce this diversity now and across (as best as possible) all redshifts. On the other hand, the code needs to run fast to compare several million or tens of millions of models and to select the best (on a probabilistic basis) one that best resembles the observations. With this important point in mind, it seems logical that we should efficiently make use of the computer power available to the average astronomer. For instance, it seems difficult, today, to model and fit SEDs without a parallelized code. We present the new Python version of CIGALE SED fitting code and its characteristics. CIGALE comes in two main flavours: CIGALE Classic to fit SEDs and CIGALE Model to create spectra and SEDs of galaxies at all redshifts. The latest can potentially be used in conjunction with galaxy evolution models of galaxy formation and evolution such as semi-analytic ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.324-330
• /
• 2006

The next generation mobile communication systems require error correcting schemes that can be adaptable to various code rates and lengths with negligible performance degradation. Serial concatenated convolutional codes can be a good candidate satisfying these requirements. In this paper, we propose new rate-compatible punctured serial concatenated convolutional code (RCPSCCC) which performs better than the RCPSCCC proposed by Chandran and Valenti in the sense of the rate compatibility. These codes are evaluated and analyzed by using computer simulation and SNR evolution technique. As their application, Type-II hybrid automatic repeat request (HARQ) schemes using both RCPSCCCs are constructed and new RCPSCCC is shown to have better throughput.

• Nuclear Engineering and Technology
• /
• v.53 no.6
• /
• pp.1893-1908
• /
• 2021

In light of the importance of helium production in influencing the behaviour of fast reactor fuels, in this work we present a burn-up module with the objective to calculate the production of helium in both in-pile and out-of-pile conditions tracking the evolution of 23 alpha-decaying actinides. This burn-up module relies on average microscopic cross-section look-up tables generated via SERPENT high-fidelity calculations and involves the solution of the system of Bateman equations for the selected set of actinide nuclides. The results of the burn-up module are verified in terms of evolution of actinide and helium concentrations by comparing them with the high-fidelity ones from SERPENT, considering two representative test cases of (U,Pu)O₂ fuel in fast reactor conditions. In addition, a code-to-code comparison is made with the independent state-of-the-art module TUBRNP (implemented in the TRANSURANUS fuel performance code) for the same test cases. The herein presented burn-up module is available in the SCIANTIX code, designed for coupling with fuel performance codes.