• Computers and Concrete
• /
• v.28 no.6
• /
• pp.533-547
• /
• 2021

Calculating the shear capacity of slender reinforced concrete beams without shear reinforcement was the subject of numerous studies, where the eternal problem of developing a single relationship that will be able to predict the expected shear capacity is still present. Using experimental results to extrapolate formulae was so far the main approach for solving this problem, whereas in the last two decades different research studies attempted to use artificial intelligence algorithms and available data sets of experimentally tested beams to develop new models that would demonstrate improved prediction capabilities. Given the limited number of available experimental databases, these studies were numerically restrained, unable to holistically address this problem. In this manuscript, a new approach is proposed where a numerically generated database is used to train machine-learning algorithms and develop an improved model for predicting the shear capacity of slender concrete beams reinforced only with longitudinal rebars. Finally, the proposed predictive model was validated through the use of an available ACI database that was developed by using experimental results on physical reinforced concrete beam specimens without shear and compressive reinforcement. For the first time, a numerically generated database was used to train a model for computing the shear capacity of slender concrete beams without stirrups and was found to have improved predictive abilities compared to the corresponding ACI equations. According to the analysis performed in this research work, it is deemed necessary to further enrich the current numerically generated database with additional data to further improve the dataset used for training and extrapolation. Finally, future research work foresees the study of beams with stirrups and deep beams for the development of improved predictive models.

• Journal of Korean Society of Water and Wastewater
• /
• v.34 no.4
• /
• pp.277-288
• /
• 2020

In this study, we performed algorithms to predict algae of Chlorophyll-a (Chl-a). Water quality and quantity data of the middle Nakdong River area were used. At first, the correlation analysis between Chl-a and water quality and quantity data was studied. We extracted ten factors of high importance for water quality and quantity data about the two weirs. Algorithms predicted how ten factors affected Chl-a occurrence. We performed algorithms about decision tree, random forest, elastic net, gradient boosting with Python. The root mean square error (RMSE) value was used to evaluate excellent algorithms. The gradient boosting showed 10.55 of RMSE value for the Gangjeonggoryeong (GG) site and 11.43 of RMSE value for the Dalsung (DS) site. The gradient boosting algorithm showed excellent results for GG and DS sites. Prediction value for the four algorithms was also evaluated through the Receiver operating characteristic (ROC) curve and Area under curve (AUC). As a result of the evaluation, the AUC value was 0.877 at GG site and the AUC value was 0.951 at DS site. So the algorithm's ability to interpret seemed to be excellent.

• Architectural research
• /
• v.2 no.1
• /
• pp.41-46
• /
• 2000

The sawtooth skylight is an excellent daylighting concept for the uniform interior illuminance over large working areas. In computer simulation, it is difficult for an architect to get accurate daylight illuminances for the spaces where sawtooth apertures are applied. In this study, daylight prediction algorithms for sawtooth apertures are developed. The flux transfer method is applied for this study to predict daylight illuminances. The simplified equations from this study can be used effectively for preliminary prediction of daylight in sawtooth spaces.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1379-1382
• /
• 1987

IN ADAPTIVE LINEAR PREDICTION, AN ADAPTIVE CAPABILITY IS BUILT INTO THE PROCESSOR SUCH THAT AS THE IMAGE STATISTICS CHANGE, THE PREDICTION FILTER COEFFICIENTS THEMSELVES CHANGE, PRODUCING A NEW FILTER MORE CLOSELY OPTIMIZED TO THE NEW SET OF IMAGES STATISTICS. THE LMS ALGORITHM MAY BE USED TO ADAPT THE COEFFICIENT OF AN ADAPTIVE PREDICTION FILTER FOR IMAGE SOURCE ENCODING. IN THIS PAPER, TWO CODING SYSTEMS USING DPCM AND LMS ALGORITHMS RESPECTIVELY FOR OBTAINING THE FIRST TRANSFORMED COEFFICIENT IN HYBRID CODING ARE COMPARED.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.85-88
• /
• 1996

We develop an efficient technique of controlling chaos using M-step ahead prediction with the OGY method. It has smaller transient time than the OGY method, and prevents burst phenomena that occur in noisy environment. This technique is very simple and needs small memory compared with targeting algorithms. Numerical examples show that the proposed algorithm has good performance, especially in noisy environment.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.4
• /
• pp.999-1012
• /
• 2005

We compare two popular algorithms in current machine learning and statistical learning areas, boosting method represented by AdaBoost and kernel based SVM (Support Vector Machine) using 13 real data sets. This comparative study shows that boosting method has smaller prediction error in data with heavy noise, whereas SVM has smaller prediction error in the data with little noise.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1463-1466
• /
• 2002

This paper suggests the effective channel assignment scheme for mobility prediction handover. For maintaining required quality of service (QoS) during handover, there are handover algorithms these reserve the channel where the movement is predicted. But channel assignment schemes these have been studied are not considered mobility prediction handover. This paper suggests the channel assignment scheme that considers mobility predicted handover. The suggested algorithm maintains dropping probability of handover calls, decreases blocking probability of new calls and increases channel utilization.

• Journal of KIISE
• /
• v.42 no.2
• /
• pp.145-154
• /
• 2015

This paper proposes an enhanced projection candidate selection algorithm to improve the performance of the existing path prediction algorithm. Various user path prediction algorithms have previously been developed, but those algorithms are inappropriate for a real-time and close user path prediction environment. To resolve this issue, a new prediction algorithm has been proposed, but several problems still remain. In particular, this algorithm should be enhanced to provide much faster processing performance. The major cause of the high processing time of the previous path prediction algorithm is the high time complexity of its projection candidate selection. Therefore, this paper proposes a new path fragment management structure and an improved projection candidate selection algorithm to improve the processing speed of the existing projection candidate selection algorithm. This paper also shows the effectiveness of the algorithm herein proposed through a comparative performance evaluation.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.436-446
• /
• 2014

The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and costly. The most efficient way to increase efficiency is to adopt parallel principles. Purpose of this paper is to present the issue of parallel computing with emphasis on the analysis of parallel systems, the impact of communication delays on their efficiency and on overall execution time. Paper focuses is on finite algorithms for solving systems of linear equations, namely the matrix manipulation (Gauss elimination method, GEM). Algorithms are designed for architectures with shared memory (open multiprocessing, openMP), distributed-memory (message passing interface, MPI) and for their combination (MPI + openMP). The properties of the algorithms were analytically determined and they were experimentally verified. The conclusions are drawn for theory and practice.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1522-1531
• /
• 1988

The purpose of this paper is to explain eigenstructure based spatial spectrum estimation algorithms computing better estimates than the other approaches. Also, as an approach to overcome performance degradations in a multipath environments, the notion of forward and backwark spatial smoothing is discussed. Intensive simulation results,which include the comparisons of the eigenbased spatial spectral estimation algorithms in the situations of faulty estimation of the number of signals, are presented. The simulation results have shown that overestimation of the number of signals is more desirable than underestimation in using EV (Eigen Vector) and MUSIC (Multiple Signal Classification) algorithms and that underestimation of the number of signals is better strategy than overestimation in using eigenstructure based LP(Linear Prediction) algorithms.