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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.4
• /
• pp.157-164
• /
• 2023

This paper suggests O(n²) polynomial time heuristic algorithm for corporate tax structure optimization problem that has been classified as NP-complete problem. The proposed algorithm constructs tax tree levels that the target holding company is located at root node of Level 1, and the tax code categories(T_e) 1,4,3,2 are located in each level 2,3,4,5 sequentially. To find the maximum tax-relief path from source(S) to target(T), firstly we connect the minimum witholding tax rate _minr_w(u, v) arc of node u point of view for transfer the profit from u to v node. As a result we construct the spanning tree from all of the source nodes to a target node, and find the initial feasible solution. Nextly, we find the alternate path with minimum foreign tax rate _minr_fi(u, v) of v point of view. Finally we choose the minimum tax-relief path from of this two paths. The proposed heuristic algorithm performs better optimal results than linear programming and Tabu search method that is a kind of metaheuristic method.

• Journal of Korean Society of Steel Construction
• /
• v.26 no.3
• /
• pp.143-154
• /
• 2014

An improved method for evaluating effective buckling length of semi-rigid frame with inelastic behavior is newly proposed. Also, generalized exact tangential stiffness matrix with rotationally semi-rigid connections is adopted in previous studies. Therefore, the system buckling load of structure with inelastic behaviors can be exactly obtained by only one element per one straight member for inelastic problems. And the linearized elastic stiffness matrix and the geometric stiffness matrix of semi-rigid frame are utilized by taking into account 4th terms of taylor series from the exact tangent stiffness matrix. On the other hands, two inelastic analysis programs(M1, M2) are newly formulated. Where, M1 based on exact tangent stiffness matrix is programmed by iterative determinant search method and M2 is using linear algorithm with elastic and geometric matrices. Finally, in order to verify this present theory, various numerical examples are introduced and the effective buckling length of semi-rigid frames with inelastic materials are investigated.

• Korean Journal of Remote Sensing
• /
• v.33 no.4
• /
• pp.423-436
• /
• 2017

This paper presents a deep learning-based road segmentation framework from very high-resolution orthophotos. The proposed method uses Deep Convolutional Autoencoders for end-to-end mapping of orthophotos to road segmentations. In addition, a set of post-processing steps were applied to make the model outputs GIS-ready data that could be useful for various applications. The optimization of the model's parameters is explained which was conducted via grid search method. The model was trained and implemented in Keras, a high-level deep learning framework run on top of Tensorflow. The results show that the proposed model with the best-obtained hyperparameters could segment road objects from orthophotos at an average accuracy of 88.5%. The results of optimization revealed that the best optimization algorithm and activation function for the studied task are Stochastic Gradient Descent (SGD) and Exponential Linear Unit (ELU), respectively. In addition, the best numbers of convolutional filters were found to be 8 for the first and second layers and 128 for the third and fourth layers of the proposed network architecture. Moreover, the analysis on the time complexity of the model showed that the model could be trained in 4 hours and 50 minutes on 1024 high-resolution images of size $106{\times}106pixels$, and segment road objects from similar size and resolution images in around 14 minutes. The results show that the deep learning models such as Convolutional Autoencoders could be a best alternative to traditional machine learning models for road segmentation from aerial photographs.

• Journal of Korean Society of Steel Construction
• /
• v.16 no.1 s.68
• /
• pp.123-134
• /
• 2004

In this research, a multilevel decomposition technique to enhance the efficiency of the configuration optimization of truss structures was proposed. On the first level, the nonlinear programming problem was formulated considering cross-sectional areas as design variables, weight, or volume as objective function and behavior under multiloading condition as design constraint. Said nonlinear programming problem was transformed into a sequential linear programming problem. which was effective in calculation through the approximation of member forces using behavior space approach. Such approach has proven to be efficient in sensitivity analysis and different form existing shape optimization studies. The modified method of feasible direction (MMFD) was used for the optimization process. On the second level, by treating only shape design variables, the optimum problem was transformed into and unconstrained optimal design problem. A unidirectional search technique was used. As numerical examples, some truss structures were applied to illustrate the applicability. and validity of the formulated algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.3
• /
• pp.68-74
• /
• 2001

A lane detection based on a road model or feature all needs correct acquirement of information on the lane in an image. It is inefficient to implement a lane detection algorithm through the full range of an image when it is applied to a real road in real time because of the calculating time. This paper defines two (other proper terms including"modes") for detecting lanes on a road. First is searching mode that is searching the lane without any prior information of a road. Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It allows to extract accurately and efficiently the edge candidate points of a lane without any unnecessary searching. By means of inverse perspective transform which removes the perspective effect on the edge candidate points, we transform the edge candidate information in the Image Coordinate System(ICS) into the plan-view image in the World Coordinate System(WCS). We define a linear approximation filter and remove faulty edge candidate points by using it. This paper aims at approximating more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.e fitting.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.585-594
• /
• 2009

Efficient filtering is an important factor in RFID system performance. Because of huge volume of tag data in future ubiquitous environment, if RFID readers transmit tag data without filtering to upper-layer applications, which results in a significant system performance degradation. In this paper, we provide an efficient filtering technique which operates on RFID air protocol. RFID air protocol filtering between tags and a reader has some advantages over filtering in readers and middleware, because air protocol filtering reduces the volume of filtering work before readers and middleware start filtering. Exploiting the air protocol filtering advantage, we introduce a geometrical algorithm for generating air protocol filters and verify their performance through simulation with analytical time models. Results of dense RFID reader environment show that air protocol filtering algorithms reduce almost a half of the total filtering time when compared to the results of linear search.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2843-2845
• /
• 2000

A lane detection based on a road model or feature all need correct acquirement of information on the lane in a image, It is inefficient to implement a lane detection algorithm through the full range of a image when being applied to a real road in real time because of the calculating time. This paper defines two searching range of detecting lane in a road, First is searching mode that is searching the lane without any prior information of a road, Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It is allow to extract accurately and efficiently the edge candidates points of a lane as not conducting an unnecessary searching. By means of removing the perspective effect of the edge candidate points which are acquired by using the inverse perspective transformation, we transform the edge candidate information in the Image Coordinate System(ICS) into the plane-view image in the World Coordinate System(WCS). We define linear approximation filter and remove the fault edge candidate points by using it This paper aims to approximate more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.