• Land and Housing Review
• /
• v.1 no.1
• /
• pp.51-57
• /
• 2010

The importance of seismic design is greatly emphasized recently in Korea, resulting in an increase in the number of dynamic analysis being performed. One of the most important input parameters for the dynamic seismic analysis is input ground motion. However, it is common practice to use recorded motions from U.S. or Japan without considering the seismic environment of Korea or synthetic motions generated in the frequency domain. The recorded motions are not suitable for the seismic environment of Korea since the variation in the duration and energy with the earthquake magnitude cannot be considered. The artificial motions generated in frequency domain used to generated design response spectrum compatible ground motion has the problem of generating motions that have different frequency characteristics compared to real recordings. In this study, an algorithm that generates target response spectrum compatible ground motions in time domain is used to generate a suite of input ground motions. The generated motions are shown to preserve the non-stationary characteristics of the real ground motion and at the same, almost perfectly match the design response spectrum.

• The KIPS Transactions:PartB
• /
• v.13B no.2 s.105
• /
• pp.133-138
• /
• 2006

Learning with Attribute Value Taxonomies (AVT) has shown that it is possible to construct accurate, compact and robust classifiers from a partially missing dataset (dataset that contains attribute values specified with different level of precision). Yet, in many cases AVTs are generated from experts or people with specialized knowledge in their domain. Unfortunately these user-provided AVTs can be time-consuming to construct and misguided during the AVT building process. Moreover experts are occasionally unavailable to provide an AVT for a particular domain. Against these backgrounds, this paper introduces an AVT generating method called GA-AVT-Learner, which finds a near optimal AVT with a given training dataset using a genetic algorithm. This paper conducted experiments generating AVTs through GA-AVT-Learner with a variety of real world datasets. We compared these AVTs with other types of AVTs such as HAC-AVTs and user-provided AVTs. Through the experiments we have proved that GA-AVT-Learner provides AVTs that yield more accurate and compact classifiers and improve performance in learning missing data.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.17 no.10
• /
• pp.938-946
• /
• 2005

Shape optimization of internally finned circular tube has been peformed for periodically fully developed turbulent flow and heat transfer. The physical domain considered in this study is very complicated due to periodic boundary conditions both streamwise and circumferential directions. Therefore, Pareto frontier sets of a heat exchanger can be acquired by coupling the CFD and the multi-objective genetic algorithm, which is a global optimization technique. The optimal values of fin widths $(d_1,\;d_2)$ and fin height (H) are numerically obtained by minimizing the pressure loss and maximizing the heat transfer rate within ranges of $d_1=0.2\sim1.5\;mm,\;d_2=0.2\sun1.5\;mm,\;and\;H=0.2\sim1.5\;mm$. The optimal values of the design variables are acquired after the fifth generation and also compared to those of a local optimization algorithm for the same geometry and conditions.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.480-488
• /
• 2016

Search-Based Software Testing (SBST) is an effective technique for test data generation on large domain size. Although the performance of SBST seems to be affected by the structural characteristics of Software Under Test (SUT), studies for the comparison of SBST techniques considering structural characteristics are rare. In addition to the comparison study for SBST, we analyzed the best algorithm with different structural characteristics of SUT. For the generalization of experimental results, we automatically generated 19,800 SUTs by combining four metrics, which are expected to affect the performance of SBST. According to the experiment results, Genetic algorithm showed the best performance for SUTs with high complexity and test data evaluation with count ${\leq}20,000$. On the other hand, the genetic simulated annealing and the simulated annealing showed relatively better performance for SUTs with high complexity and test data evaluation with count ${\geq}50,000$. Genetic simulated annealing, simulated annealing and hill climbing showed better performance for SUTs with low complexity.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.56-64
• /
• 1996

A quadrilateral-triangular mixed grid method for the solution of incompressible viscous flow is presented. The solution domain near the body surface is meshed using elliptic grid geneator to acculately simulate the viscous flow. On the other hand, we used unstructured triangular grid system generated by advancing front technique of a simple automatic grid generation algorithm in the rest of the computational domain. The present method thus is capable of not only handling complex geometries but providing accurate solutions near body surface. The numerical technique adopted here is PISO type finite element method which was developed by the present author. Investigations have been made of two-dimensional unsteady flow of Re=550 past a circular cylinder. In the case of use of the unstructured grid only, there exists a considerable amount of difference with the existing results in drag coefficient and vorticity at the cylinder surface; this may be because of the lack of the grid clustering to the surface that is a inevitable requirement to resolve the viscous flow. However, numerical results on the mixed grid show good agreements with the earlier computations and experimental data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.600-607
• /
• 2007

In the next generation mobile multimedia communications, the broad band shot-burst transmissions are used to reduce end-to-end transmission delay, and to limit the time variation of wireless channels over a burst. However, training overhead is very significant for such short burst formats. So, the availability of the short training sequence and the fast converging adaptive algorithm is essential in the system adopting the symbol-by-symbol adaptive equalizer. In this paper, we propose an adaptive equalizer using the DWMT (discrete multi-wavelet transform) and LMS (least mean square) adaptation. The proposed equalizer has a faster convergence rate than that of the existing transform-domain equalizers, while the increase of computational complexity is very small.

• Journal of Ocean Engineering and Technology
• /
• v.38 no.2
• /
• pp.53-63
• /
• 2024

Submerged breakwaters can be installed underneath floating structures to reduce the external wave loads acting on the structure. The objective of this study was to establish an optimization analysis framework to determine the corresponding shape and position of the submerged breakwater that can minimize or maximize the external forces acting on the floating structure. A two-dimensional frequency-domain boundary element method (FD-BEM) based on the linear potential theory was developed to perform the hydrodynamic analysis. A metaheuristic algorithm, the advanced particle swarm optimization, was newly coupled to the FD-BEM to perform the optimization analysis. The optimization analysis process was performed by calling FD-BEM for each generation, performing a numerical analysis of the design variables of each particle, and updating the design variables using the collected results. The results of the optimization analysis showed that the height of the submerged breakwater has a significant effect on the surface piercing body and that there is a specific area and position with an optimal value. In this study, the optimal values of the shape and position of a single submerged breakwater were determined and analyzed so that the external force acting on a surface piercing body was minimum or maximum.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.3 no.4
• /
• pp.95-107
• /
• 1983

The general purpose programs are in their fixed algorithm and theory of mechanics which can not be altered without painful program modifications. Users are usually guided by user's manual for data input. The several symbolic manipulation programs for structural analysis are introduced recently. These programs allow users to include a wide class of solution algorithm and to specify, by means of some symbolic manipulation, a combination of analytical steps to suit a particular problem. As they can solve a single domain problem, a large computer is usually needed. The scope of this study is to develop an efficient symbolic manipulation program with space beam element, plate bending element and eigen value routines. The incorporated Substructure capability and generation capability of finite element characteristic arrays (e.g., stiffness matrix, mass matrix) enables users to analyse multidomain problem with small computer. The program consists of modulized independent processors, each having its own specific function and is easily modified, eliminated and added. The processors are efficiently handling data by the Data base approach which is the concept of integrated program network(IPN).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.180-191
• /
• 2008

An Adaptive Random Testing (ART) is one of test case generation algorithms that are designed to detect common failure patterns within input domain. The ART algorithm shows better performance than that of pure Random Testing (RT). Distance-bases ART (D-ART) and Restriction Random Testing (RRT) are well known examples of ART algorithms which are reported to have good performances. But significant drawbacks are observed as quadratic runtime and non-uniform distribution of test case. They are mainly caused by a huge amount of distance computations to generate test case which are distance based method. ART through Iterative Partitioning (IP-ART) significantly reduces the amount of computation of D-ART and RRT with iterative partitioning of input domain. However, non-uniform distribution of test case still exists, which play a role of obstacle to develop a scalable algerian. In this paper we propose a new ART method which mitigates the drawback of IP-ART while achieving improved fault-detection capability. Simulation results show that the proposed one has about 9 percent of improved F-measures with respect to other algorithms.

• Nuclear Engineering and Technology
• /
• v.51 no.6
• /
• pp.1487-1503
• /
• 2019

The methods and performance of a pin-level nuclear reactor core thermal-hydraulics (T/H) code ESCOT employing the drift-flux model are presented. This code aims at providing an accurate yet fast core thermal-hydraulics solution capability to high-fidelity multiphysics core analysis systems targeting massively parallel computing platforms. The four equation drift-flux model is adopted for two-phase calculations, and numerical solutions are obtained by applying the Finite Volume Method (FVM) and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE)-like algorithm in a staggered grid system. Constitutive models involving turbulent mixing, pressure drop, and vapor generation are employed to simulate key phenomena in subchannel-scale analyses. ESCOT is parallelized by a domain decomposition scheme that involves both radial and axial decomposition to enable highly parallelized execution. The ESCOT solutions are validated through the applications to various experiments which include CNEN $4{\times}4$, Weiss et al. two assemblies, PNNL $2{\times}6$, RPI $2{\times}2$ air-water, and PSBT covering single/two-phase and unheated/heated conditions. The parameters of interest for validation include various flow characteristics such as turbulent mixing, spacer grid pressure drop, cross-flow, reverse flow, buoyancy effect, void drift, and bubble generation. For all the validation tests, ESCOT shows good agreements with measured data in the extent comparable to those of other subchannel-scale codes: COBRA-TF, MATRA and/or CUPID. The execution performance is examined with a mini-sized whole core consisting of 89 fuel assemblies and for an OPR1000 core. It turns out that it is about 1.5 times faster than a subchannel code based on the two-fluid three field model and the axial domain decomposition scheme works as well as the radial one yielding a steady-state solution for the OPR1000 core within 30 s with 104 processors.