• Geophysics and Geophysical Exploration
• /
• v.12 no.1
• /
• pp.99-104
• /
• 2009

We propose a waveform inversion method for SH-wave data obtained in a shallow seismic refraction survey, to determine a 2D inhomogeneous S-wave profile of shallow soils. In this method, a 2.5D equation is used to simulate SH-wave propagation in 2D media. The equation is solved with the staggered grid finite-difference approximation to the 4th-order in space and 2nd-order in time, to compute a synthetic wave. The misfit, defined using differences between calculated and observed waveforms, is minimised with a hybrid heuristic search method. We parameterise a 2D subsurface structural model with blocks with different depth boundaries, and S-wave velocities in each block. Numerical experiments were conducted using synthetic SH-wave data with white noise for a model having a blind layer and irregular interfaces. We could reconstruct a structure including a blind layer with reasonable computation time from surface seismic refraction data.

• KEPCO Journal on Electric Power and Energy
• /
• v.2 no.2
• /
• pp.311-316
• /
• 2016

Network intrusion detection system based on machine learning method such as artificial neural network is quite dependent on the selected features in terms of accuracy and efficiency. Nevertheless, choosing the optimal combination of features, which guarantees accuracy and efficienty, from generally used many features to detect network intrusion requires extensive computing resources. In this paper, we deal with a optimal feature selection problem to determine 6 denial service attacks and normal usage provided by NSL-KDD data. We propose a optimal feature selection algorithm. Proposed algorithm is based on the multi-start local search algorithm, one of representative meta-heuristic algorithm for solving optimization problem. In order to evaluate the performance of our proposed algorithm, comparison with a case of all 41 features used against NSL-KDD data is conducted. In addtion, comparisons between 3 well-known machine learning methods (multi-layer perceptron., Bayes classifier, and Support vector machine) are performed to find a machine learning method which shows the best performance combined with the proposed feature selection method.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.13-16
• /
• 2001

In reinforcement teaming, Q-learning converges quite slowly to a good policy. Its because searching for the goal state takes very long time in a large stochastic domain. So I propose the speedup method using the Q-value initialization for model-free reinforcement learning. In the speedup method, it learns a naive model of a domain and makes boundaries around the goal state. By using these boundaries, it assigns the initial Q-values to the state-action pairs and does Q-learning with the initial Q-values. The initial Q-values guide the agent to the goal state in the early states of learning, so that Q-teaming updates Q-values efficiently. Therefore it saves exploration time to search for the goal state and has better performance than Q-learning. 1 present Speedup Q-learning algorithm to implement the speedup method. This algorithm is evaluated. in a grid-world domain and compared to Q-teaming.

• Journal of Integrative Natural Science
• /
• v.12 no.1
• /
• pp.20-23
• /
• 2019

Demand response is usually operated through using the power rates and incentives. Demand management based on power charges is the most rational and efficient demand management method, and such methods include rolling base charges with peak time, sliding scaling charges depending on time, sliding scaling charges depending on seasons, and nighttime power charges. Search for other methods to stimulate resources on demand by actively deriving the demand reaction of loads to increase the energy efficiency of loads. In this paper, ESS algorithm for saving energy based on predicting the amount of solar power generation that can be used for buildings with small loads not under electrical grid.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1939-1944
• /
• 2003

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.7
• /
• pp.53-59
• /
• 2005

In this paper, we proposed the 2-dimensional inspection algorithm for micro-BGA(Ball Grid Array) device using a vision system. The reposed method uses the subpixel algorithm for high precision. The proposed algorithm preferentially extracts the package area of device in the input image. After the extraction of package area, each ball areas are extracted by ball search window method. The parameters for inspection are calculated for the extracted ball area. In the simulation results, we have the average error within 17[${\mu}m$].

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.370-379
• /
• 2006

Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.

• Geomechanics and Engineering
• /
• v.35 no.2
• /
• pp.121-133
• /
• 2023

The demand for cement and limestone crushed materials has increased many folds due to the tremendous increase in construction activities in Pakistan during the past few decades. The number of cement production industries has increased correspondingly, and so the rock-blasting operations at the limestone quarry sites. However, the safety procedures warranted at these sites for the blast-induced ground vibrations (BIGV) have not been adequately developed and/or implemented. Proper prediction and monitoring of BIGV are necessary to ensure the safety of structures in the vicinity of these quarry sites. In this paper, an attempt has been made to predict BIGV using artificial neural network (ANN) at three selected limestone quarries of Pakistan. The ANN has been developed in Python using Keras with sequential model and dense layers. The hyper parameters and neurons in each of the activation layers has been optimized using randomized and grid search method. The input parameters for the model include distance, a maximum charge per delay (MCPD), depth of hole, burden, spacing, and number of blast holes, whereas, peak particle velocity (PPV) is taken as the only output parameter. A total of 110 blast vibrations datasets were recorded from three different limestone quarries. The dataset has been divided into 85% for neural network training, and 15% for testing of the network. A five-layer ANN is trained with Rectified Linear Unit (ReLU) activation function, Adam optimization algorithm with a learning rate of 0.001, and batch size of 32 with the topology of 6-32-32-256-1. The blast datasets were utilized to compare the performance of ANN, multivariate regression analysis (MVRA), and empirical predictors. The performance was evaluated using the coefficient of determination (R²), mean absolute error (MAE), mean squared error (MSE), mean absolute percentage error (MAPE), and root mean squared error (RMSE)for predicted and measured PPV. To determine the relative influence of each parameter on the PPV, sensitivity analyses were performed for all input parameters. The analyses reveal that ANN performs superior than MVRA and other empirical predictors, andthat83% PPV is affected by distance and MCPD while hole depth, number of blast holes, burden and spacing contribute for the remaining 17%. This research provides valuable insights into improving safety measures and ensuring the structural integrity of buildings near limestone quarry sites.

• Earthquakes and Structures
• /
• v.27 no.3
• /
• pp.177-189
• /
• 2024

Accurately predicting the failure modes of reinforced concrete (RC) columns is essential for structural design and assessment. In this study, the challenges of imbalanced datasets and complex feature selection in machine learning (ML) methods were addressed through an optimized ML approach. By combining feature selection and oversampling techniques, the prediction of seismic failure modes in rectangular RC columns was improved. Two feature selection methods were used to identify six input parameters. To tackle class imbalance, the Borderline-SMOTE1 algorithm was employed, enhancing the learning capabilities of the models for minority classes. Eight ML algorithms were trained and fine-tuned using k-fold shuffle split cross-validation and grid search. The results showed that the artificial neural network model achieved 96.77% accuracy, while k-nearest neighbor, support vector machine, and random forest models each achieved 95.16% accuracy. The balanced dataset led to significant improvements, particularly in predicting the flexure-shear failure mode, with accuracy increasing by 6%, recall by 8%, and F1 scores by 7%. The use of the Borderline-SMOTE1 algorithm significantly improved the recognition of samples at failure mode boundaries, enhancing the classification performance of models like k-nearest neighbor and decision tree, which are highly sensitive to data distribution and decision boundaries. This method effectively addressed class imbalance and selected relevant features without requiring complex simulations like traditional methods, proving applicable for discerning failure modes in various concrete members under seismic action.