Desalination is a process where fresh water produces from high salinity solutions, many ways used for this purpose and one of the most important processes is membrane distillation (MD). Direct contact membrane distillation (DCMD) can be considered as the most prominent type from MD types according to ease of design and modus operandi. This work studies the efficiency of using DCMD operation for desalination brine with different concentration (1.75, 3.5, 5 wt. % NaCl). Frame and plate cell was used with flat sheet PTFE hydrophobic type membrane. The study proves that MD is an effective process for desalination brines with feed temperature less than 60˚C especially for feed with low TDS. 37˚C, 47˚C, and 57˚C was feed t

A general velocity profile for a laminar flow over a flat plate with zero incidence is obtained by employing a new boundary condition to the other available boundary conditions. The general velocity profile is mathematically simple and nearest to the exact solution. Also other related values, boundary layer thickness, displacement thickness, momentum thickness and coefficient of friction are nearest to the exact solution compared with other corresponding values for other researchers.

      In this study, different methods were used for estimating location parameter  and scale parameter for extreme value distribution, such as maximum likelihood estimation (MLE) , method of moment  estimation (ME),and approximation  estimators based on percentiles which is called white method in estimation, as the extreme value distribution is one of exponential distributions. Least squares estimation (OLS) was used, weighted least squares estimation (WLS), ridge regression estimation (Rig), and adjusted ridge regression estimation (ARig) were used. Two parameters for expected value to the percentile  as estimation for distribution f

This paper provides a four-stage Trigonometrically Fitted Improved Runge-Kutta (TFIRK4) method of four orders to solve oscillatory problems, which contains an oscillatory character in the solutions. Compared to the traditional Runge-Kutta method, the Improved Runge-Kutta (IRK) method is a natural two-step method requiring fewer steps. The suggested method extends the fourth-order Improved Runge-Kutta (IRK4) method with trigonometric calculations. This approach is intended to integrate problems with particular initial value problems (IVPs) using the set functions  and   for trigonometrically fitted. To improve the method's accuracy, the problem primary frequency  is used. The novel method is more accurate than the conventional Runge-Ku

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

    In this paper, we introduce new conditions to prove that the existence and boundedness of the solution by convergent sequences and convergent series. The theorem of Krasnoselskii, Lebesgue’s dominated convergence theorem and fixed point theorem are used to get some sufficient conditions for the existence of solutions. Furthermore, we get sufficient conditions to guarantee the oscillatory property for all solutions in this class of equations. An illustrative example is included as an application to the main results.

Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele