In this study, the feasibility of Forward–Reverse osmosis processes was investigated for treating the oily wastewater. The first stage was applied forward osmosis process to recover pure water from oily wastewater. Sodium chloride (NaCl) and magnesium chloride (MgCl2) salts were used as draw solutions and the membrane that was used in forward osmosis (FO) process was cellulose triacetate (CTA) membrane. The operating parameters studied were: draw solution concentrations (0.25 – 0.75 M), oil concentration in feed solution (FS) (100-1000 ppm), the temperature of FS and draw solution (DS) (30 - 45 °C), pH of FS (4-10) and the flow rate of both DS and FS (20 - 60 l/h). It was found that the water flux and oil concentration in FS increas

The GPS navigation measurements become more widely used in many civilian and scientific application. All GPS navigation data holds many errors, the main error sources arise from the geodetic Datum variation when user apply the GPS measurements with the map. Geodetic datums define the size and shape of the earth and the origin and orientation of the coordinate systems used to map the earth surface. In this paper, the Datum transformation was evaluated in two mathematical methods to overcome the errors due to the difference between the WGS-84 and our country Datum Clarck-1880. The results was evaluated and investigated using Carmin GPS device for GCPs comparison, topographic map for Hilla city, mid Iraq 1:100000 scale, and two georefrencing

 The aim of this paper, is to discuss several high performance training algorithms fall into two main categories. The first category uses heuristic techniques, which were developed from an analysis of the performance of the standard gradient descent algorithm. The second category of fast algorithms uses standard numerical optimization techniques such as: quasi-Newton . Other aim is to solve the drawbacks related with these training algorithms and propose an efficient training algorithm for FFNN

The population density of the insect on Alorat and fruits located in the lower part of the tree more than the middle part of the plant and insect in one place and demonstrates that there is a nest there were conducted laboratory and field studies on citrus Hsasahanwaa and the Alvdaúaa distribution of cortical insect yellow ....

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

Abstract 

For sparse system identification,recent suggested algorithms are  -norm Least Mean Square (  -LMS), Zero-Attracting LMS (ZA-LMS), Reweighted Zero-Attracting LMS (RZA-LMS), and p-norm LMS (p-LMS) algorithms, that have modified the cost function of the conventional LMS algorithm by adding a constraint of coefficients sparsity. And so, the proposed algorithms are named  -ZA-LMS, 

An analytical form of the ground state charge density distributions
for the low mass fp shell nuclei ( 40  A  56 ) is derived from a
simple method based on the use of the single particle wave functions
of the harmonic oscillator potential and the occupation numbers of
the states, which are determined from the comparison between theory
and experiment.
For investigating the inelastic longitudinal electron scattering form
factors, an expression for the transition charge density is studied
where the deformation in nuclear collective modes is taken into
consideration besides the shell model space transition density. The
core polarization transition density is evaluated by adopting the
shape of Tassie mod

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm

  We study one example of hyperbolic problems it's Initial-boundary string problem with two ends. In fact we look for the solution in weak sense in some sobolev spaces. Also we use energy technic with Galerkin's method to study some properties for our problem as existence and uniqueness