In this paper, the oscillation of a Hematopoiesis model in both cases delay and non-delay are discussed. The place and are continuous pstive -rdic functions. In the nn-dlay cse, we will exhibit that a nonlinear differential equation of hematopoiesis model has a global attractor  for all different pstive solutions. Also, in the delay case, the sufficient conditions for the oscillation of all pstive solutions of it aboutare presented and we establish sufficient cnditions for the global attractive of. To illustrate the obtained results some examples are given.

The goal of this study is to provide a new explicit iterative process method  approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing a finite family of different types of  mappings as( nonexpansive mappings,resolvent mappings and projection mappings. The findings given in this research strengthen and extend key previous findings in the literature. Then, utilizing various structural conditions in Hilbert space and variational inequality problems, we examine the strong convergence to nearest point projection for these explicit iterative process methods Under the presence of two important conditions for convergence, namely closure and convexity. The findings reported in this research strengthen and extend

     The work in this paper focuses on solving numerically and analytically a  nonlinear social epidemic model that represents an initial value problem  of ordinary differential equations. A recent moking habit model from Spain is applied and studied here. The accuracy and convergence of the numerical and approximation results are investigated for various methods; for example, Adomian decomposition, variation iteration, Finite difference and Runge-Kutta. The discussion of the present results has been tabulated and graphed. Finally, the comparison between the analytic and numerical solutions from the period 2006-2009 has been obtained by absolute and difference measure error.

     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

The availability of low- cost adsorbent namely Al-Khriet ( a substance found in the legs of Typha  Domingensis) as an agricultural waste material, for the removal of lead and cadmium from aqueous solution was investigated. In the batch tests experimental parameters were studied, including adsorbent dosage between (0.2-1) g, initial metal ions concentration between (50-200) ppm (single and binary) and contact time (1/2-6) h. The removal percentage of each ion onto Al-Khriet reached equilibrium in about 4 hours. The highest adsorption capacity was for lead (96%) while for cadmium it was (90%) with 50 ppm ions concentration, 1 g dosage of adsorbent and pH 5.5. Adsorption capacity in the binary mixture were reduce at about 8% for lead a

    The problem statement discussed in this paper is a new technique for the presentation of painterly rendering that uses a K-mean segmentation to divide the input image into a set of regions (depending on the grayscale of the regions). Segmenting the input image helps users use different brush strokes and easily change the strokes' shape, size, or orientation for different regions. Every region is painted using different brush kinds. The properties of the brush strokes are chosen depending on the region's details. The brush stroke properties, such as size, color, shape, location, and orientation, are extracted from the source image using statistical tools. The number of regions is set up manually and depends on the input image. This

  In this work, we construct projectively distinct (k,3)-arcs in the projective plane PG(2,9) by applying a geometrical method. The cubic curves have been been constructed by using the general equation of the cubic.         We found that there are complete (13,3)-arcs, complete (15,3)-arcs and we found that the only (16,3)-arcs lead to maximum completeness