In this research, attempt to overcome and quantities the problem of the large number of frequency of dust storms and the areas that generated and then identifying these areas in order to be held by the agricultural areas, as has been the adoption of many of the techniques and methods of processing image in remote sensing and geographic information systems and linking them together to identify those areas in Iraq or the neighbors, especially the northern and north-west wind of the fact that Iraq is in the northern and north - western most days of the year. Research has included the use of images from the satellite (MODIS) with quality (Aqua) and (Terra) with the assembly of the amount of dust, these storms, it was determining the values of size and density of the dust and the amount (> 10μm) and (ρ = 1.58 mg/m3) respectively, note that this dust has collected from the University of Baghdad during a sandstorm brief summary on July 2010, because this month is the most higher month temperature in the year and it was about 50 thousand ton of dust in each dust storm. To extract all the results and information that obtained from the operations account amounts that the soil is expected calculated annually for these storms and to determine the threshold line density of this dust in the air. Finally, developing a system to monitor these storms, depending on the capacity of scientific instruments of modern used in the countries of the world and its establishment in Iraq.
(5)
(2)
(1)
(1)
Nonlinear regression models are important tools for solving optimization problems. As traditional techniques would fail to reach satisfactory solutions for the parameter estimation problem. Hence, in this paper, the BAT algorithm to estimate the parameters of Nonlinear Regression models is used . The simulation study is considered to investigate the performance of the proposed algorithm with the maximum likelihood (MLE) and Least square (LS) methods. The results show that the Bat algorithm provides accurate estimation and it is satisfactory for the parameter estimation of the nonlinear regression models than MLE and LS methods depend on Mean Square error.
(3)
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
... Show More
(10)
(7)
Sol-gel method was use to prepare Ag-SiO2 nanoparticles. Crystal structure of the nanocomposite was investigated by means of X-ray diffraction patterns while the color intensity was evaluated by spectrophotometry. The morphology analysis using atomic force microscopy showed that the average grain sizes were in range (68.96-75.81 nm) for all samples. The characterization of Ag-SiO2 nanoparticles were investigated by using Scanning Electron Microscopy (SEM). Ag-SiO2 NPs are highly stable and have significant effect on both Gram positive and negative bacteria. Antibacterial properties of the nanocomposite were tested with the use of Staphylococcus aureus (S. aureus) and Escherichia coli (E. coli) bacteria. The results have shown antibacteri
... Show More
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
... Show More
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.
The conjugate coefficient optimal is the very establishment of a variety of conjugate gradient methods. This paper proposes a new class coefficient of conjugate gradient (CG) methods for impulse noise removal, which is based on the quadratic model. Our proposed method ensures descent independent of the accuracy of the line search and it is globally convergent under some conditions, Numerical experiments are also presented for the impulse noise removal in images.
In this paper, we derived an estimator of reliability function for Laplace distribution with two parameters using Bayes method with square error loss function, Jeffery’s formula and conditional probability random variable of observation. The main objective of this study is to find the efficiency of the derived Bayesian estimator compared to the maximum likelihood of this function and moment method using simulation technique by Monte Carlo method under different Laplace distribution parameters and sample sizes. The consequences have shown that Bayes estimator has been more efficient than the maximum likelihood estimator and moment estimator in all samples sizes
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
... Show More
(2)