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 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

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, 

Portable devices such as smartphones, tablet PCs, and PDAs are a useful combination of hardware and software turned toward the mobile workers. While they present the ability to review documents, communicate via electronic mail,  appointments management, meetings, etc. They usually lack a variety of essential security features. To address the security concerns of sensitive data, many individuals and organizations, knowing the associated threats mitigate them through improving authentication of users, encryption of content, protection from malware, firewalls,  intrusion prevention, etc. However, no standards have been developed yet to determine whether such mobile data management systems adequately provide the fu

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

  This paper studies the existence of  positive solutions for the following boundary value problem :-
 
 y(b) 0 α y(a) - β y(a) 0     bta             f(y) g(t) λy    
 
 
The solution procedure follows using the Fixed point theorem and obtains that this problem has at least one positive solution .Also,it determines (  ) Eigenvalue which would be needed to find the positive solution .

This work presents an approach to deal with modelling a decision support system framework to introduce an application for decisions in medical knowledge system analysis. First aid is extremely important worldwide and, hence, a decision support framework, know as First Aid Decision Support System (FADSS), was designed and implemented to access experimental cases exerting danger to the general population, offering advanced conditions for testing abilities in research and arranging an emergency treatment through the graphical user interface (UI). The design of first aid treatment in FADSS depends on the general cases in first aid. We presented a strategy to manage first aid treatment  by modelling an application (FADSS) that assists pe