Anemia is one of the common types of blood diseases, it lead to lack of number of RBCs (Red Blood Cell) and amount hemoglobin level in the blood is lower than normal.
In this paper a new algorithm is presented to recognize Anemia in digital images based on moment variant. The algorithm is accomplished using the following phases: preprocessing, segmentation, feature extraction and classification (using Decision Tree), the extracted features that are used for classification are Moment Invariant and Geometric Feature.
The Best obtained classification rates was 84% is obtained when using Moment Invariants features and 74 % is obtained when using Geometric Feature. Results indicate that the proposed algorithm is very effective in detect

This paper study two stratified quantile regression models of the marginal and the conditional varieties. We estimate the quantile functions of these models by using two nonparametric methods of smoothing spline (B-spline) and kernel regression (Nadaraya-Watson). The estimates can be obtained by solve nonparametric quantile regression problem which means minimizing the quantile regression objective functions and using the approach of varying coefficient models. The main goal is discussing the comparison between the estimators of the two nonparametric methods and adopting the best one between them

    The search included a comparison between two etchands for etch CR-39 nuclear track detector, by the calculation of bulk etch rate (Vb) which is one of the track etching parameters, by two measuring methods (thichness and change mass). The first type, is the solution prepared  from solving NaOH in Ethanol (NaOH/Ethanol) by varied normalities  under temperature(55ËšC)and etching time (30 min) then comparated with the second type the solution prepared from solving NaOH in water (NaOH/Water) by varied normalities with (70ËšC) and etching time (60 min) . All detectors were irradiated with (5.48 Mev) α-Particles from an 241Am source in during (10 min). The results that Vb would increase with the increase of

     The aim of this paper is to study the quaternary classical continuous optimal control for a quaternary linear parabolic boundary value problems(QLPBVPs). The existence and uniqueness theorem of the continuous quaternary state vector solution  for the weak form of the QLPBVPs with given quaternary classical continuous control vector (QCCCV)  is stated and proved via the Galerkin Method. In addition, the existence theorem of a quaternary classical continuous optimal control vector governinig by the QLPBVPs is stated and demonstrated. The Fréchet derivative for the cost function is derived. Finally, the necessary conditions for the optimality theorem  of the proposed problem is stated and  demonstrated.

     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

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

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a