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

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.2D
• /
• pp.311-318
• /
• 2009

Interactive terrain visualization is an important research area with applications in GIS, games, virtual reality, scientific visualization and flight simulators, besides having military use. This is a complex and challenging problem considering that some applications require precise visualizations of huge data sets at real-time rates. In general, the size of data sets makes rendering at real-time difficult since the terrain data cannot fit entirely in memory. In this paper, we suggest the effective Real-time LOD(level-of-detail) algorithm for displaying the huge terrain data and processing mass geometry. We used a hierarchy structure with $4{\times}4$ and $2{\times}2$ tiles for real-time rendering of mass volume DEM which acquired from Digital map, LiDAR, DTM and DSM. Moreover, texture mapping is performed to visualize realistically while displaying height data of normalized Giga Byte level with user oriented terrain information and creating hill shade map using height data to hierarchy tile structure of file type. Large volume of terrain data was transformed to LOD data for real time visualization. This paper show the new LOD algorithm for seamless visualization, high quality, minimize the data loss and maximize the frame speed.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.06a
• /
• pp.383-384
• /
• 2022

Following the development of technologies such as digital twin, IoT, and AI after the 4th industrial revolution, decision-making problems are being solved based on high-dimensional data analysis. This has recently been applied to the port logistics sector, and a number of studies on big data analysis, deep learning predictions, and simulations have been conducted on container terminals to improve port productivity. These high-dimensional data analysis techniques generally require a large number of data. However, the global port environment has changed due to the COVID-19 pandemic in 2020. It is not appropriate to apply data before the COVID-19 outbreak to the current port environment, and the data after the outbreak was not sufficiently collected to apply it to data analysis such as deep learning. Therefore, this study intends to present a port data augmentation method for data analysis as one of these problem-solving methods. To this end, we generate the container stowage situation of the yard through a generative adversarial neural network model in terms of container terminal operation, and verify similarity through statistical distribution verification between real and augmented data.

• Journal of Internet of Things and Convergence
• /
• v.9 no.6
• /
• pp.57-62
• /
• 2023

This research is a comparative analysis of the U.S. S&P 500 index using the volatility breakout strategy against the Buy and Hold approach. The volatility breakout strategy is a trading method that exploits price movements after periods of relative market stability or concentration. Specifically, it is observed that large price movements tend to occur more frequently after periods of low volatility. When a stock moves within a narrow price range for a while and then suddenly rises or falls, it is expected to continue moving in that direction. To capitalize on these movements, traders adopt the volatility breakout strategy. The 'k' value is used as a multiplier applied to a measure of recent market volatility. One method of measuring volatility is the Average True Range (ATR), which represents the difference between the highest and lowest prices of recent trading days. The 'k' value plays a crucial role for traders in setting their trade threshold. This study calculated the 'k' value at a general level and compared its returns with the Buy and Hold strategy, finding that algorithmic trading using the volatility breakout strategy achieved slightly higher returns. In the future, we plan to present simulation results for maximizing returns by determining the optimal 'k' value for automated trading of the S&P 500 index using artificial intelligence deep learning techniques.

• Korean Journal of Remote Sensing
• /
• v.39 no.5_2
• /
• pp.827-835
• /
• 2023

Drone light detection and ranging (LiDAR) is a state-of-the-art surveying technology that enables close investigation of the top of the mountain slope or the inaccessible slope, and is being used for field surveys in mountainous terrain. To build topographic information using Drone LiDAR, a preprocessing process is required to effectively separate ground and non-ground points from the acquired point cloud. Therefore, in this study, the point group data of the mountain topography was acquired using an aerial LiDAR mounted on a commercial drone, and the application and accuracy of the cloth simulation filtering algorithm, one of the ground separation techniques, was verified. As a result of applying the algorithm, the separation accuracy of the ground and the non-ground was 84.3%, and the kappa coefficient was 0.71, and drone LiDAR data could be effectively used for landslide field surveys in mountainous terrain.

• Tunnel and Underground Space
• /
• v.33 no.5
• /
• pp.399-413
• /
• 2023

The present study conducted a numerical modeling of CO₂ injection at the Janggi Basin using the TOUGH-FLAC simulator, and examined the hydro-mechanical stability of the aquifer and the fault. Based on the site investigations and a 3D geological model of the target area, we simulated the injection of 32,850 tons of CO₂ over a 3-year period. The analysis of CO₂ plume with different values of the aquifer permeability revealed that assuming a permeability of 10^-14 m² the CO₂ plume exhibited a radial flow and reached the fault after 2 years and 9 months. Conversely, a higher permeability of 10^-13 m² resulted in predominant westward flow along the reservoir, with negligible impact on the fault. The pressure changes around the injection well remained below 0.6 MPa over the period, and the influence on the hydro-mechanical stability of the reservoir and fault was found to be insignificant.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.4
• /
• pp.173-181
• /
• 2007

In this paper, we propose a moving target localization algorithm using acoustic spectrograms. A time-versus-frequency spectrogram provide a information of trajectory of the moving target in underwater. For a source at sufficiently long range from a receiver, broadband striation patterns seen in spectrogram represents the mutual interference between modes which reflected by surface and bottom. The slope of the maximum intensity striation is influenced by waveguide invariant parameter ${\beta}$ and distance between target and sensor. When more than two sensors are applied to measure the moving ship-radited noise, the slope and frequency of the maximum intensity striation are depend on distance between target and receiver. We assumed two sensors to fixed point then form a circle of apollonios which set of all points whose distances from two fixed points are in a constant ratio. In case of three sensors are applied, two circle form an intersection point so coordinates of this point can be estimated as a position of target. To evaluates a performance of the proposed localization algorithm, simulation is performed using acoustic propagation program.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.37 no.3
• /
• pp.217-224
• /
• 2024

This paper proposes an efficient dimension reduction method (DRM) that considers the nonlinearity of the performance functions in reliability-based design optimization (RBDO). The dimension reduction method evaluates the reliability more accurately than the first-order reliability method (FORM) using integration quadrature points and weights. However, its efficiency is hindered as the number of quadrature points increases owing to the need for an additional evaluation of the performance function. In this study, we assessed the nonlinearity of the performance function in RBDO and proposed criteria for determining the number of quadrature points based on the degree of nonlinearity. This approach suggests adjusting the number of quadrature points during each iteration of the RBDO process while maintaining the accuracy of theDRM while improving the computational efficiency. The nonlinearity of the performance function was evaluated using the angle between the vectors used in the maximum probable target point (MPTP) search. Numerical tests were conducted to determine the appropriate number of quadrature points according to the degree of nonlinearity. Through a 2D numerical example, it is confirmed that the proposed method improves the efficiency while maintaining the accuracy of the dimension reduction method or Monte Carlo Simulation (MCS).

• Journal of the Korean GEO-environmental Society
• /
• v.25 no.4
• /
• pp.13-20
• /
• 2024

In this paper, a parallel analysis algorithm for Smoothed Particle Hydrodynamics (SPH), one of the numerical methods for fluidic materials, is introduced. SPH, which is a meshless method, can represent the behavior of a continuum using a particle-based approach, but it demands substantial computational resources. Therefore, parallel analysis algorithms are essential for SPH simulations. The domain decomposition algorithm, which divides the computational domain into partitions to be independently analyzed, is the most representative method among parallel analysis algorithms. In Discrete Element Method (DEM) and Molecular Dynamics (MD), the Cartesian coordinate-based domain decomposition method is popularly used because it offers advantages in quickly and conveniently accessing particle positions. However, in SPH, it is important to share particle information among partitioned domains because SPH particles are defined based on information from nearby particles within the smoothing length. Additionally, maintaining CPU load balance is crucial. In this study, a highly parallel efficient algorithm is proposed to dynamically minimize the size of orthogonal domain partitions to prevent excess CPU utilization. The efficiency of the proposed method was validated through numerical analysis models. The parallel efficiency of the proposed method is evaluated for up to 30 CPUs for fluidic models, achieving 90% parallel efficiency for up to 28 physical cores.