The research tackled to solve Sudoku grid problem 9 ×9 , one of artificial intelligence problems. This problem has many of solutions in search space to generate Sudoku grid by using magic square of odd order as 3. This research concludes solution by proposed heuristic algorithm from magic square of odd order as 3 and no given numbers (from 1 to 9) in each cell of nine Sudoku grid cells in starting of problem solution, this is not similar the solution in old classic methods to generate all sub grids in Sudoku grid. The experimental results in this paper show the easily implementation to solve the problem to manage without manual method, additional to position of numbers (1, 2,..9) in center of each sub grid in Sudoku grid

  Manufacturing systems of the future foresee the use of intelligent vehicles, optimizing and navigating. The navigational problem is an important and challenging problem in the field of robotics. The robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. On-line navigation is a set of algorithms that plans and executes a trajectory at the same time.         The system adopted in this research searches for a robot collision-free trajectory in a dynamic environment in which obstacles can move while the robot was moving toward the target. So, the ro

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

Mixture experiments are response variables based on the proportions of component for this mixture. In our research we will compare the scheffʼe model with the kronecker model for the mixture experiments, especially when the experimental area is restricted.

     Because of the experience of the mixture of high correlation problem and the problem of multicollinearity between the explanatory variables, which has an effect on the calculation of the Fisher information matrix of the regression model.

     to estimate the parameters of the mixture model, we used the (generalized inverse ) And the Stepwise Regression procedure

    This paper deals with finding the approximation solution of a nonlinear parabolic boundary value problem (NLPBVP) by using the Galekin finite element method (GFEM) in space and Crank Nicolson (CN) scheme in time, the problem then reduce to solve a Galerkin nonlinear algebraic system(GNLAS). The predictor and the corrector technique (PCT) is applied here to solve the GNLAS, by transforms it to a Galerkin linear algebraic system (GLAS). This GLAS is solved once using the Cholesky method (CHM) as it appear in the matlab package and once again using the Cholesky reduction order technique (CHROT) which we employ it here to save a massive time. The results, for CHROT are given by tables and figures and show

Shadow detection and removal is an important task when dealing with color outdoor images. Shadows are generated by a local and relative absence of light. Shadows are, first of all, a local decrease in the amount of light that reaches a surface. Secondly, they are a local change in the amount of light rejected by a surface toward the observer. Most shadow detection and segmentation methods are based on image analysis. However, some factors will affect the detection result due to the complexity of the circumstances. In this paper a method of segmentation test present to detect shadows from an image and a function concept is used to remove the shadow from an image.

  Thin films of zinc selenide ZnSe have been prepared by using thermal evaporation method in vacuum with different thickness (1000 – 4000) Ao and a deposited on glass substrate and studying some electrical properties including the determination of A.C conductivity and real, imaginary parts of dielectric constant and tangent of loss angle. The result shows that increasing value of A.C conductivity with increasing thickness and temperature, and increasing capacitance value with increasing the temperature and decrease with increasing frequency . Real and imaginary parts of dielectric constant and tangent of loss angle decrease with increasing frequency

CD-nanosponges were prepared by crosslinking B-CD with diphenylcarbonate (DPC) using ultrasound assisted technique. 5-FU was incorporated with NS by freeze drying, and the phase solubility study, complexation efficiency (CE) entrapment efficiency were performed. Also, the particle morphology was studied using SEM and AFM. The in-vitro release of 5-FU from the prepared nanosponges was carried out in 0.1N HCl.

5-FU nanosponges particle size was in the nano size. The optimum formula showed a particle size of (405.46±30) nm, with a polydispersity index (PDI) (0.328±0.002) and a negative zeta potential (-18.75±1.8). Also the drug entrapment efficiency varied with the CD: DPC molar ratio from 15.6 % to 30%. The SEM an