• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.1
• /
• pp.37-44
• /
• 2019

A bond-based peridynamic model has been reported dynamic fracture characteristic of brittle materials through a simple constitutive model. In the model, each bond is assumed to be a simple spring operating independently. As a result, this simple bond interaction modeling restricts the material behavior having a fixed Poisson's ratio of 1/4 and not being capable of expressing shear deformation. We consider a state-based peridynamics as a generalized peridynamic model. Constitutive models in the state-based peridynamics are corresponding to those in continuum theory. In state-based peridynamics, thus, the response of a material particle depends collectively on deformation of all bonds connected to other particles. So, a state-based peridynamic theory can represent the volume and shear changes of the material. In this paper, the perfect plasticity is considered to express plastic deformation of material by the state-based peridynamic constitutive model with perfect plastic flow rule. The elastic-plastic behavior of the material is verified through the stress-strain curves of the flat plate example. Furthermore, we simulate the high-speed impact on 3D granite model with a nonlocal contact modeling. It is observed that the damage patterns obtained by peridynamics are similar to experimental observations.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.35 no.5
• /
• pp.249-257
• /
• 2022

This paper presents an improved computational framework for the direct-solution-based finite element tearing and interconnecting (FETI) algorithm. The FETI-local algorithm is further improved herein, and localized Lagrange multipliers are used to define the interface among its subdomains. Selective inverse entry computation, using a property of the Boolean matrix, is employed for the computation of the subdomain interface stiffness and load, in which the original FETI-local algorithm requires a full matrix inverse computation of a high computational cost. In the global interface computation step, the original serial computation is replaced by a parallel multi-frontal method. The performance of the improved FETI-local algorithm was evaluated using a numerical example with 64 million degrees of freedom (DOFs). The computational time was reduced by up to 97.8% compared to that of the original algorithm. In addition, further stable and improved scalability was obtained in terms of a speed-up indicator. Furthermore, a performance comparison was conducted to evaluate the differences between the proposed algorithm and commercial software ANSYS using a large-scale computation with 432 million DOFs. Although ANSYS is superior in terms of computational time, the proposed algorithm has an advantage in terms of the speed-up increase per processor increase.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.12
• /
• pp.889-898
• /
• 2022

In this paper, parallel computing method on the three-dimensional electromagnetic field is proposed. The present electromagnetic scattering analysis is conducted based on the time-harmonic vector wave equation and the finite element method. The edge-based element and 2^nd -order absorbing boundary condition are used. Parallelization of the elemental numerical integration and the matrix assemblage is accomplished by allocating the partitioned finite element subdomain for each processor. The graph partitioning library, METIS, is employed for the subdomain generation. The large sparse matrix computation is conducted by MUMPS, which is the parallel computing library based on the multi-frontal method. The accuracy of the present program is validated by the comparison against the Mie-series analytical solution and the results by ANSYS HFSS. In addition, the scalability is verified by measuring the speed-up in terms of the number of processors used. The present electromagnetic scattering analysis is performed for a perfect electric conductor sphere, isotropic/anisotropic dielectric sphere, and the missile configuration. The algorithm of the present program will be applied to the finite element and tearing method, aiming for the further extended parallel computing performance.

• Geophysics and Geophysical Exploration
• /
• v.26 no.2
• /
• pp.37-51
• /
• 2023

The ground roll is the most common coherent noise in land seismic data and has an amplitude much larger than the reflection event we usually want to obtain. Therefore, ground roll suppression is a crucial step in seismic data processing. Several techniques, such as f-k filtering and curvelet transform, have been developed to suppress the ground roll. However, the existing methods still require improvements in suppression performance and efficiency. Various studies on the suppression of ground roll in seismic data have recently been conducted using deep learning methods developed for image processing. In this paper, we introduce three models (DnCNN (De-noiseCNN), pix2pix, and CycleGAN), based on convolutional neural network (CNN) or conditional generative adversarial network (cGAN), for ground roll suppression and explain them in detail through numerical examples. Common shot gathers from the same field were divided into training and test datasets to compare the algorithms. We trained the models using the training data and evaluated their performances using the test data. When training these models with field data, ground roll removed data are required; therefore, the ground roll is suppressed by f-k filtering and used as the ground-truth data. To evaluate the performance of the deep learning models and compare the training results, we utilized quantitative indicators such as the correlation coefficient and structural similarity index measure (SSIM) based on the similarity to the ground-truth data. The DnCNN model exhibited the best performance, and we confirmed that other models could also be applied to suppress the ground roll.

• Composites Research
• /
• v.36 no.3
• /
• pp.205-210
• /
• 2023

In this study, we developed a transfer learning framework based on homogenization data for efficient prediction of the effective mechanical properties and thermal conductivity of cellular foam structures. Mean-field homogenization (MFH) based on the Eshelby's tensor allows for efficient prediction of properties in porous structures including ellipsoidal inclusions, but accurately predicting the properties of cellular foam structures is challenging. On the other hand, finite element homogenization (FEH) is more accurate but comes with relatively high computational cost. In this paper, we propose a data-driven transfer learning framework that combines the advantages of mean-field homogenization and finite element homogenization. Specifically, we generate a large amount of mean-field homogenization data to build a pre-trained model, and then fine-tune it using a relatively small amount of finite element homogenization data. Numerical examples were conducted to validate the proposed framework and verify the accuracy of the analysis. The results of this study are expected to be applicable to the analysis of materials with various foam structures.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.1D
• /
• pp.195-202
• /
• 2006

The infiltration route analysis is a military application using geospatial information technology. The result of the analysis would present vulnerable routes for potential enemy infiltration. In order to find the susceptible routes, optimal path search algorithms (Dijkstra's and $A^*$) were used to minimize the cost function, summation of detection probability. The cost function was produced by capability of TOD (Thermal Observation Device), results of viewshed analysis using DEM (Digital Elevation Model) and two related geospatial information coverages (obstacle and vegetation) extracted from VITD (Vector product Interim Terrain Data). With respect to 50m by 50m cells, the individual cost was computed and recorded, and then the optimal infiltration routes was found while minimizing summation of the costs on the routes. The proposed algorithm was experimented in Daejeon region in South Korea. The test results show that Dijkstra's and $A^*$ algorithms do not present significant differences, but A* algorithm shows a better efficiency. This application can be used for both infiltration and surveillance. Using simulation of moving TOD, the most vulnerable routes can be detected for infiltration purpose. On the other hands, it can be inversely used for selection of the best locations of TOD. This is an example of powerful geospatial solution for military application.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.37 no.2
• /
• pp.85-93
• /
• 2024

In this paper, we propose a method for establishing a state-space equation model for the motion analysis of floating structures subjected to wave loads, by applying system-identification techniques. Traditionally, the motion of floating structures has been analyzed in the time domain by integrating the Cummins equation over time, which utilizes a convolution integral term to account for the effects of the retardation function. State-space equation models have been studied as a way to efficiently solve floating-motion equations in the time domain. The proposed approach outlines a procedure to derive the target transfer function for the load-displacement input/output relationship in the frequency domain and subsequently determine the state-space equation that closely approximates it. To obtain the state-space equation, the method employs the N4SID system-identification method and an optimization approach that treats the coefficients of the numerator and denominator polynomials as design variables. To illustrate the effectiveness of the proposed method, we applied it to the analysis of a single-degree-of-freedom model and the motion of a six-degree-of-freedom barge. Our findings demonstrate that the presented state-space equation model aligns well with the existing analysis results in both the frequency and time domains. Notably, the method ensures computational accuracy in the time-domain analysis while significantly reducing the calculation time.

• Geophysics and Geophysical Exploration
• /
• v.27 no.2
• /
• pp.91-107
• /
• 2024

Single-channel seismic exploration has proven effective in delineating subsurface geological structures using small-scale survey systems. The seismic data acquired through zero- or near-offset methods directly capture subsurface features along the vertical axis, facilitating the construction of corresponding seismic sections. However, substantial noise in single-channel seismic data hampers precise interpretation because of the low signal-to-noise ratio. This study introduces a novel approach that integrate noise reduction and signal enhancement via matrix rank optimization to address this issue. Unlike conventional rank-reduction methods, which retain selected singular values to mitigate random noise, our method optimizes the entire singular value spectrum, thus effectively tackling both random and erratic noises commonly found in environments with low signal-to-noise ratio. Additionally, to enhance the horizontal continuity of seismic events and mitigate signal loss during noise reduction, we introduced an adaptive weighting factor computed from the eigenimage of the seismic section. To access the robustness of the proposed method, we conducted numerical experiments using single-channel Sparker seismic data from the Chukchi Plateau in the Arctic Ocean. The results demonstrated that the seismic sections had significantly improved signal-to-noise ratios and minimal signal loss. These advancements hold promise for enhancing single-channel and high-resolution seismic surveys and aiding in the identification of marine development and submarine geological hazards in domestic coastal areas.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.1 s.9
• /
• pp.49-63
• /
• 2003

Recently, two international standard organizations, ISO and OGC, have done the work of standardization for GIS. Current standardization work for providing interoperability among GIS DB focuses on the design of open interfaces. But, this work has not considered procedures and methods for designing GIS DB. Eventually, GIS DB has its own model. When we share the data by open interface among heterogeneous GIS DB, differences between models result in the loss of information. Our aim in this paper is to revise the design guidelines for geographic information databases in order to make consistent spatial data models, logical structures, and semantic structure of populated geographical databases. In details, we propose standard guidelines which convert ISO abstract schema into relation model, object-relation model, object-centered model, and geometry-centered model. Furthermore, we provide sample models for applying these guidelines in commercial GIS S/Ws. Building GIS DB based on design guidelines proposed in the paper has the following advantages: the interoperability among databases, the standardization of schema definitions, and the catalogue of GIS databases through.

• Journal of Intelligence and Information Systems
• /
• v.26 no.3
• /
• pp.37-50
• /
• 2020

Information security has become an important issue in the world. Various information and communication technologies, such as the Internet of Things, big data, cloud, and artificial intelligence, are developing, and the need for information security is increasing. Although the necessity of information security is expanding according to the development of information and communication technology, interest in information security investment is insufficient. In general, measuring the effect of information security investment is difficult, so appropriate investment is not being practice, and organizations are decreasing their information security investment. In addition, since the types and specification of information security measures are diverse, it is difficult to compare and evaluate the information security countermeasures objectively, and there is a lack of decision-making methods about information security investment. To develop the organization, policies and decisions related to information security are essential, and measuring the effect of information security investment is necessary. Therefore, this study proposes a method of constructing an investment portfolio for information security measures using game theory and derives an optimal defence probability. Using the two-person game model, the information security manager and the attacker are assumed to be the game players, and the information security countermeasures and information security threats are assumed as the strategy of the players, respectively. A zero-sum game that the sum of the players' payoffs is zero is assumed, and we derive a solution of a mixed strategy game in which a strategy is selected according to probability distribution among strategies. In the real world, there are various types of information security threats exist, so multiple information security measures should be considered to maintain the appropriate information security level of information systems. We assume that the defence ratio of the information security countermeasures is known, and we derive the optimal solution of the mixed strategy game using linear programming. The contributions of this study are as follows. First, we conduct analysis using real performance data of information security measures. Information security managers of organizations can use the methodology suggested in this study to make practical decisions when establishing investment portfolio for information security countermeasures. Second, the investment weight of information security countermeasures is derived. Since we derive the weight of each information security measure, not just whether or not information security measures have been invested, it is easy to construct an information security investment portfolio in a situation where investment decisions need to be made in consideration of a number of information security countermeasures. Finally, it is possible to find the optimal defence probability after constructing an investment portfolio of information security countermeasures. The information security managers of organizations can measure the specific investment effect by drawing out information security countermeasures that fit the organization's information security investment budget. Also, numerical examples are presented and computational results are analyzed. Based on the performance of various information security countermeasures: Firewall, IPS, and Antivirus, data related to information security measures are collected to construct a portfolio of information security countermeasures. The defence ratio of the information security countermeasures is created using a uniform distribution, and a coverage of performance is derived based on the report of each information security countermeasure. According to numerical examples that considered Firewall, IPS, and Antivirus as information security countermeasures, the investment weights of Firewall, IPS, and Antivirus are optimized to 60.74%, 39.26%, and 0%, respectively. The result shows that the defence probability of the organization is maximized to 83.87%. When the methodology and examples of this study are used in practice, information security managers can consider various types of information security measures, and the appropriate investment level of each measure can be reflected in the organization's budget.