In this study, two types of mixes were adopted by using two grading of coarse aggregate. The practical side of this study was to produce no-fine aggregate concrete by using crushed clay brick aggregates. The durability of the produced concrete and internal sulfate attack was studied.      For durability assessment, it is found that the no-fine concrete made with crushed brick aggregate lost about (15-25) % of its compressive strength after being subjected to 60 cycles of wetting and drying with age 120 days. The curing condition showed that the water curing improved the compressive strength with a rate higher than that when sealed or air dry curing were used. The crushed brick no-fine concrete de

ABSTRUCT

In This Paper, some semi- parametric spatial models were estimated, these models are, the semi – parametric spatial error model (SPSEM), which suffer from the problem of spatial errors dependence, and the semi – parametric spatial auto regressive model (SPSAR). Where the method of maximum likelihood was used in estimating the parameter of spatial error          ( λ ) in the model (SPSEM), estimated  the parameter of spatial dependence ( ρ ) in the model ( SPSAR ), and using the non-parametric method in estimating the smoothing function m(x) for these two models, these non-parametric methods are; the local linear estimator (LLE) which require finding the smoo

Unconfined compressive strength (UCS) of rock is the most critical geomechanical property widely used as input parameters for designing fractures, analyzing wellbore stability, drilling programming and carrying out various petroleum engineering projects. The USC regulates rock deformation by measuring its strength and load-bearing capacity. The determination of UCS in the laboratory is a time-consuming and costly process. The current study aims to develop empirical equations to predict UCS using regression analysis by JMP software for the Khasib Formation in the Buzurgan oil fields, in southeastern Iraq using well-log data. The proposed equation accuracy was tested using the coefficient of determination (R²), the average absolute

     Binary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin

Leap Motion Controller (LMC) is a gesture sensor consists of three infrared light emitters and two infrared stereo cameras as tracking sensors. LMC translates hand movements into graphical data that are used in a variety of applications such as virtual/augmented reality and object movements control. In this work, we intend to control the movements of a prosthetic hand via (LMC) in which fingers are flexed or extended in response to hand movements. This will be carried out by passing in the data from the Leap Motion to a processing unit that processes the raw data by an open-source package (Processing i3) in order to control five servo motors using a micro-controller board. In addition, haptic setup is proposed using force sensors (F

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi