Survival analysis is one of the types of data analysis that describes the time period until the occurrence of an event of interest such as death or other events of importance in determining what will happen to the phenomenon studied. There may be more than one endpoint for the event, in which case it is called Competing risks. The purpose of this research is to apply the dynamic approach in the analysis of discrete survival time in order to estimate the effect of covariates over time, as well as modeling the nonlinear relationship between the covariates and the discrete hazard function through the use of the multinomial logistic model and the multivariate Cox model. For the purpose of conducting the estimation process for both the discrete

This paper deals with prediction the effect of soil remoulding (smear) on the ultimate bearing capacity of driven piles. The proposed method based on detecting the decrease in ultimate bearing capacity of the pile shaft (excluding the share of pile tip) after sliding downward. This was done via conducting an experimental study on three installed R.C piles in a sandy clayey silt soil. The piles were installed so that a gap space is left between its tip and the base of borehole. The piles were tested for ultimate bearing capacity
according to ASTM D1143 in three stages. Between each two stages the pile was jacked inside the borehole until a sliding of about 200mm is achieved to simulate the soil remoulding due to actual pile driving. T

This paper deals with prediction the effect of soil re-moulding (smear) on the ultimate bearing capacity of driven piles. The proposed method based on detecting the decrease in ultimate bearing capacity of the pile shaft (excluding the share of pile tip) after sliding downward. This was done via conducting an experimental study on three installed R.C piles in a sandy clayey silt soil. The piles were installed so that a gap space is left between its tip and the base of borehole. The piles were tested for ultimate bearing capacity according to ASTM D1143 in three stages. Between each two stages the pile was jacked inside the borehole until a sliding of about 200mm is achieved to simulate the soil re-moulding due to actual pile driving. The re

Purpose:  Providing practical knowledge of the requirements of a detailed feasibility study for selecting the investment project.

Findings:  Directing the private sector towards investing in productive projects - the pre-cast reinforced concrete project - as it achieves a financial return as well as providing Providing foreign currencies by reducing imports and exploiting available natural resources

Practical implications: The importance of a detailed feasibility study to determining whether the project can be implemented or not.

The precast concrete method is one of the best modern c

The support vector machine, also known as SVM, is a type of supervised learning model that can be used for classification or regression depending on the datasets. SVM is used to classify data points by determining the best hyperplane between two or more groups. Working with enormous datasets, on the other hand, might result in a variety of issues, including inefficient accuracy and time-consuming. SVM was updated in this research by applying some non-linear kernel transformations, which are: linear, polynomial, radial basis, and multi-layer kernels. The non-linear SVM classification model was illustrated and summarized in an algorithm using kernel tricks. The proposed method was examined using three simulation datasets with different sample

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.