Projects suspensions are between the most insistent tasks confronted by the construction field accredited to the sector’s difficulty and its essential delay risk foundations’ interdependence. Machine learning provides a perfect group of techniques, which can attack those complex systems. The study aimed to recognize and progress a wellorganized predictive data tool to examine and learn from delay sources depend on preceding data of construction projects by using decision trees and naïve Bayesian classification algorithms. An intensive review of available data has been conducted to explore the real reasons and causes of construction project delays. The results show that the postponement of delay of interim payments is at the forefront of delay factors caused by the employer’s decision. Even the least one is to leave the job site caused by the contractor’s second part of the contract, the repeated unjustified stopping of the work at the site, without permission or notice from the client’s representatives. The developed model was applied to about 97 projects and used as a prediction model. The decision tree model shows higher accuracy in the prediction.
This article aims to establish and evaluate standards for critical equipment and materials in highway projects in Iraq. Delphi technique has been used to analyze, explore, and discover the main criteria and sub-criteria that affect equipment and materials in highway construction projects in Iraq. To determine the correct response to the criteria presented in this study, a program (IBM, SPSS/V25) was used to assess the main criteria and sub-criteria using the mean score (MS) and standard deviation (SD) technique, as well as to check reliability using Cronbach's alpha factor (α). The experts' qualifications and the extent to which the person is ready to commit are both important factors in panel selection. The design of a
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
In this work, we construct the projectively distinct (k, n)-arcs in PG (3, 4) over Galois field GF (4), where k 5, and we found that the complete (k, n)-arcs, where 3 n 21, moreover we prove geometrically that the maximum complete (k, n)-arc in PG (3, 4) is (85, 21)-arc. A (k, n)-arcs is a set of k points no n+ 1 of which are collinear. A (k, n)-arcs is complete if it is not contained in a (k+ 1, n)-arcs
Surge pressure is supplemental pressure because of the movement of the pipes downward and the swab pressure is the pressure reduction as a result of the drill string's upward movement. Bottom hole pressure is reduced because of swabbing influence. An Investigation showed that the surge pressure has great importance for the circulation loss problem produced by unstable processes in the management pressure drilling (MPD) actions. Through Trip Margin there is an increase in the hydrostatic pressure of mud that compensates for the reduction of bottom pressure due to stop pumping and/or swabbing effect while pulling the pipe out of the hole. This overview shows suggested mathematical/numerical models for simulating surge pressure problems ins
... Show MoreThis research aims to know the effectiveness of teaching with a proposed strategy according to the common Knowledge construction modelin mathematical proficiency among students of the second middle class. The researchers adopted the method of the experimental approach, as the experimental design was used for two independent and equal groups with a post-test. The experiment was applied to a sample consisting of (83) students divided into two groups: an experimental comprising (42) students and a control group, the second comprising (41) students., from Badr Shaker Al-Sayyab Intermediate School for Boys, for the first semester of the academic year (2021-2022), the two groups were rewarded in four variables: (chronological age calculated in mo
... Show MoreAbstract:
This research aims to compare Bayesian Method and Full Maximum Likelihood to estimate hierarchical Poisson regression model.
The comparison was done by simulation using different sample sizes (n = 30, 60, 120) and different Frequencies (r = 1000, 5000) for the experiments as was the adoption of the Mean Square Error to compare the preference estimation methods and then choose the best way to appreciate model and concluded that hierarchical Poisson regression model that has been appreciated Full Maximum Likelihood Full Maximum Likelihood with sample size (n = 30) is the best to represent the maternal mortality data after it has been reliance value param
... Show MoreThe method of predicting the electricity load of a home using deep learning techniques is called intelligent home load prediction based on deep convolutional neural networks. This method uses convolutional neural networks to analyze data from various sources such as weather, time of day, and other factors to accurately predict the electricity load of a home. The purpose of this method is to help optimize energy usage and reduce energy costs. The article proposes a deep learning-based approach for nonpermanent residential electrical ener-gy load forecasting that employs temporal convolutional networks (TCN) to model historic load collection with timeseries traits and to study notably dynamic patterns of variants amongst attribute par
... Show MoreA (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.