Three isolated bacteria were examined to remove heavy metals from the industrial wastewater of the Diala State Company of Electrical Industries, Diyala-Iraq. The isolated bacteria were identified as Pseudomonas aeruginosa, Escherichia coli and Sulfate Reducing Bacteria (SRB). The three isolates were used as an adsorption factor for different concentrations of Lead and Copper (100, 150, and 200 ppm.), in order to examine the adsorption efficiency of these isolates. In addition, the effect of three factors on heavy metals adsorption were examined; temperature (25, 30, and 37 ?C), pH (3 and 4.5) and contact time (2 and 24 hrs). The results showed that the highest level of lead adsorption was obtained at 37 ?C by E. coli, P, aerugenosa and SRB with percentage of 95, 95.3 and 99.7 % respectively, whereas, E. coli, P. Aerugenosa and SRB gave a copper adsorption percentage of (40.63, 50.51 and 80.57%) respectively at 37 ?C. Moreover, E.coli showed different percentage of metal adsorption ranged from 6.4% to 95 % with lead concentration of 100 and 200 ppm at pH4.5 and for each of 2 and 24 hrs contact time, whereas, it exerts percentage of copper adsorption ranged from 3.5 % to 40.63 % at 100 and 200 ppm and pH value of 4.5 for similar contact time. P. aerugenosa was also shown to be involved in metal adsorption with percentage ranged from 1.39 % for lead concentration of 150 ppm to 97.9 % for 200ppm under pH of 3 and contact times of 2 and 24 hrs. Interestingly, SRB exhibits significant differences in metal absorption values ranged from 14.97 % for lead (100 ppm) to 99.32 % at 200 ppm with a pH value of 3 and contact times of 2 and 24 hrs and under different temperatures.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm). And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr
... Show MoreIn this work the Aluminum plasma in Air produced by Nd: YAG pulsed laser, (λ = 1064 nm, τ = 6 ns) has been studied with a repletion rate of 10 Hz. The laser interaction in Al target (99.99%) under air atmosphere generates plasma, which is produced at room temperature; with variation in the energy laser from 600-900 mJ. The electron temperature and the electron density have been determined by optical emission spectroscopy and by assuming a local thermodynamic equilibrium (LTE) of the emitting species. Finally the electron temperature was calculated by the Boltzmann plot from the relative intensities of spectral lines and electron density was calculated by the Stark-broadening of emission line.
In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.
Refuse derived fuel (RDF) is considered one of the most important types of low cost thermal energy which can be tapped in the industry, especially the cement industry in particular being the need of high thermal energy during the production processes, and in this paper we have implemented the use of a derivative of the fuel RDF as a substitute for gasoline , to reduce production costs and thereby achieve production efficiency, and the methodology used in this research statistical analysis as well as the use of the cost of kaizen target for the purpose of reducing costs and achieve production efficiency, and this has reduced the cost total cement production by which led to reduce total costs of cement production by 8.4% and an incre
... Show MoreIn this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show MoreThis paper aims to study the quaternary classical continuous optimal control problem consisting of the quaternary nonlinear parabolic boundary value problem, the cost function, and the equality and inequality constraints on the state and the control. Under appropriate hypotheses, it is demonstrated that the quaternary classical continuous optimal control ruling by the quaternary nonlinear parabolic boundary value problem has a quaternary classical continuous optimal control vector that satisfies the equality constraint and inequality state and control constraint. Moreover, mathematical formulation of the quaternary adjoint equations related to the quaternary state equations is discovered, and then the weak form of the quaternary adjoint
... Show MoreIn this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.