The present work reports on the performance of three types of nanofiltration membranes in the removal of highly polluting and toxic lead (Pb²⁺) and cadmium (Cd²⁺) from single and binary salt aqueous solutions simulating real wastewaters. The effect of the operating variables (pH (5.5-6.5), types of NF membrane and initial ions concentration (10-250 ppm)) on the separation process and water flux was investigated. It was observed that the rejection efficiency increased with increasing pH of solution and decreasing the initial metal ions concentrations. While the flux decreased with increasing pH of solution and increasing initial metal ions concentrations. The maximum rejection of lead and cadmium ion

     In this study, Yogurt was dried and milled, then shaked with distilled water to remove the soluble materials, then again dried and milled. Batch experiments were carried out to remove hexavalent chromium from aqueous solutions. Different parameters were optimized such as amount of adsorbent, treatment time, pH and concentration of adsorbate. The concentrations of Cr6+ in solutions are determined by UV-Visible spectrophotometer.  Maximum percentage removal of Cr6+ was 82% at pH 2. Two equilibrium adsorption isotherms mechanisms are tested Langmuir and Freundlich, the results showed that the isotherm obeyed to Freundlich isotherm. Kinetic models were applied to the adsorption of Cr6+ ions on the adsorbents, ps

Apparent molar volume, V?, and viscosity B-coefficient of nicotinc acid in water and in aqueous NaCl solutions have been determined from density and viscosity measurements at (293.15, 298.15, 303.15 and 308.15) K. The experimental density data were evaluated by Masson equation, and the derived, apparent molar volume at infinite dilution, Vo?, and the slope Sv, were interpreted in term of solute-solvent and solute- solute interactions. Transfer apparent molar volumes at infinite dilution of nicotinic acid from water to NaCl solutions at various temperatures have been calculated.The viscosity data have been analyzed using Jones-Dole equation, and the derived parameters, Jones-Dolecoefficient, B,and Falkenhagen coefficient,A, have been also in

Environmental pollution is experiencing an alarming surge within the global ecosystem, warranting urgent attention. Among the significant challenges that demand immediate resolution, effective treatment of industrial pollutants stands out prominently, which for decades has been the focus of most researchers for sustainable industrial development aiming to remove those pollutants and recover some of them. The liquid membrane (LM) method, specifically electromembrane extraction (EME), offers promise. EME deploys an electric field, reducing extraction time and energy use while staying eco-friendly. However, there's a crucial knowledge gap. Despite strides in understanding and applying EME, optimizing it for diverse industrial pollutant

Linear regression is one of the most important statistical tools through which it is possible to know the relationship between the response variable and one variable (or more) of the independent variable(s), which is often used in various fields of science. Heteroscedastic is one of the linear regression problems, the effect of which leads to inaccurate conclusions. The problem of heteroscedastic may be accompanied by the presence of extreme outliers in the independent variables (High leverage points) (HLPs), the presence of (HLPs) in the data set result unrealistic estimates and misleading inferences. In this paper, we review some of the robust

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with