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.
Near-ideal p-CdS/n-Si heterojunction band edge lineup has been investigated for the first time with aid of I-V and C-V measurements. The heterojunction was manufactured by deposition of CdS films prepared by chemical spray pyrolysis technique (CSP) on monocrystalline n-type silicon. The experimental data of the conduction band offset Ec and valence band offset Ec were compared with theoretical values. The band offset Ec=530meV and Ev=770meV obtained at 300K. The energy band diagram of p-CdS/n-Si HJ was constructed. C-V measurements depict that the junction was an abrupt type and the built-in voltage was determined from C-2-V plot
The aim of this paper is to study the nonlinear delay second order eigenvalue problems which consists of delay ordinary differential equations, in fact one of the expansion methods that is called the least square method which will be developed to solve this kind of problems.
Traditionally, 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 paper, we present an approximate analytical and numerical solutions for the differential equations with multiple delay using the extend differential transform method (DTM). This method is used to solve many linear and non linear problems.
The information required for construction quantities surveying is not only generated by various participants in different construction phases but also stored in different forms including graphics, text, tables, or various combinations of the three. To report a bill of quantities (BOQ), the project manager has to continuously excerpt information from various resources and record it on papers. Without adequate staff and time, this repetitive and tedious process is difficult for the project manager to handle properly and thus reduces the effectiveness and the accuracy of the quantities surveying process which creates problems during the design, tender, and construction supervision of construction projects for designers and contractors pract
... 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.
In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11), n = 2,3,…,10,11 by geometric method, with the related blocking sets and projective codes.
In the current study, the researchers have been obtained Bayes estimators for the shape and scale parameters of Gamma distribution under the precautionary loss function, assuming the priors, represented by Gamma and Exponential priors for the shape and scale parameters respectively. Moment, Maximum likelihood estimators and Lindley’s approximation have been used effectively in Bayesian estimation.
Based on Monte Carlo simulation method, those estimators are compared depending on the mean squared errors (MSE’s). The results show that, the performance of Bayes estimator under precautionary loss function with Gamma and Exponential priors is better than other estimates in all cases.