The aims of the paper are to present a modified symmetric fuzzy approach to find the best workable compromise solution for quadratic fractional programming problems (QFPP) with fuzzy crisp in both the objective functions and the constraints. We introduced a modified symmetric fuzzy by proposing a procedure, that starts first by converting the quadratic fractional programming problems that exist in the objective functions to crisp numbers and then converts the linear function that exists in the constraints to crisp numbers. After that, we applied the fuzzy approach to determine the optimal solution for our quadratic fractional programming problem which is supported theoretically and practically. The computer application for the algo

Simulation  of  the  Linguistic  Fuzzy Trust  Model  (LFTM)  over  oscillating  Wireless  Sensor Networks (WSNs) where the goodness of the servers belonging to them could change along the time is presented in this paper, and the comparison between the outcomes achieved with LFTM model over oscillating WSNs with the outcomes obtained by applying the model over static WSNs where the servers maintaining always the same goodness, in terms of the selection percentage of trustworthy servers (the accuracy of the model) and the average path length are also presented here. Also in this paper the comparison between the LFTM and the Bio-inspired Trust and Reputation Model for Wireless Sensor Network

     In 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

In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H

This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

In this paper, we present an approximate analytical and numerical solutions for the differential equations with multiple delay using the extend differential transform method (DTM). This method is used to solve many linear and non linear problems.

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n ＋ 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro

The aim of this study to identify the effect of using two strategies for active learning ( Jigsaw Strategy & Problems Solving) in learning some balanced beam's skills in artistic gymnastics for women , as well as to identify the best of the three methods (jigsaw strategy , problems solving and the traditional method) in learning some skills balance beam , the research has used the experimental methodology, and the subject included the students of the college of Physical Education and Sports Sciences / University of Baghdad / third grade and by the lot was selected (10) students for each group of groups Search three and The statistical package for social sciences (SPSS) was used means, the standard deviation and the (T.test), the one way a n

In the present article, we implement the new iterative method proposed by Daftardar-Gejji and Jafari (NIM) [V. Daftardar-Gejji, H. Jafari, An iterative method for solving nonlinear functional equations, J. Math. Anal. Appl. 316 (2006) 753-763] to solve two problems; the first one is the problem of spread of a non-fatal disease in a population which is assumed to have constant size over the period of the epidemic, and the other one is the problem of the prey and predator. The results demonstrate that the method has many merits such as being derivative-free, overcome the difficulty arising in calculating Adomian polynomials to handle the nonlinear terms in Adomian Decomposition Method (ADM), does not require to calculate Lagrange multiplier a