This study was achieved to satisfy two goals, the first of which is to treat an environmental problem represented by the disposal of date seeds, and the second is the use of these wastes to improve some mechanical and thermal properties of poly methyl methacrylate PMMA through strengthening different proportions of the powder of date seeds.

Particles of date seeds were used as a natural strengthening material for PMMA polymer, by mixing the matrix material (resin) with the hardener while still stirring continuously for a period of 10 min. After that, the samples of the reinforced material were prepared by adding the powder of date seeds, which is the reinforcing substance, with different percentages of weight fraction (0, 0.5, 1,

Abstract

       The grey system model GM(1,1) is the model of the prediction of the time series and the basis of the grey theory. This research presents the methods for estimating parameters of the grey model GM(1,1) is the accumulative method (ACC), the exponential method (EXP), modified exponential method (Mod EXP) and the Particle Swarm Optimization method (PSO). These methods were compared based on the Mean square error (MSE) and the Mean Absolute percentage error (MAPE) as a basis comparator and the simulation method was adopted for the best of the four methods, The best method was obtained and then applied to real data. This data represents the consumption rate of two types of oils a he

    Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the proble

Acquires this research importance of addressing the subject (environmental problems) with
age group task, a category that children pre-school, and also reflected the importance of
research, because the (environmental problems) constitute a major threat to the continuation
of human life, particularly the children, so the environment is Bmchkladtha within
kindergarten programs represent the basis of a hub of learning where the axis, where the
kindergarten took into account included in the programs in order to help the development of
environmental awareness among children and get them used to the sound practices and
behaviors since childhood .
The research also detected problem-solving skills creative with kids Riyad

The aim of this article is to study the solution of  Elliptic Euler-Poisson-Darboux equation, by using the symmetry of Lie Algebra of orders two and three, as a contribution in partial differential equations and their solutions.

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

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi