Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results based on MSE were compared with those obtained from the moments method and showed that the Canonical GA and compact GA can give good estimator of θ for the MA(1) model. Another comparison has been conducted to show that the cGA method has less number of function evaluations, minimum searched space percentage, faster convergence speed and has a higher optimal precision than that of the Canonical GA.
The research aimed to identify “The impact of an instructional-learning design based on the brain- compatible model in systemic thinking among first intermediate grade female students in Mathematics”, in the day schools of the second Karkh Educational directorate.In order to achieve the research objective, the following null hypothesis was formulated:There is no statistically significant difference at the significance level (0.05) among the average scores of the experimental group students who will be taught by applying an (instructional- learning) design based to on the brain–compatible model and the average scores of the control group students who will be taught through the traditional method in the systemic thinking test.The resear
... Show MoreTexture synthesis using genetic algorithms is one way; proposed in the previous research, to synthesis texture in a fast and easy way. In genetic texture synthesis algorithms ,the chromosome consist of random blocks selected manually by the user .However ,this method of selection is highly dependent on the experience of user .Hence, wrong selection of blocks will greatly affect the synthesized texture result. In this paper a new method is suggested for selecting the blocks automatically without the participation of user .The results show that this method of selection eliminates some blending caused from the previous manual method of selection.
This paper presents new modification of HPM to solve system of 3 rd order PDEs with initial condition, for finding suitable accurate solutions in a wider domain.
In this study, a brand-new double transform known as the double INEM transform is introduced. Combined with the definition and essential features of the proposed double transform, new findings on partial derivatives, Heaviside function, are also presented. Additionally, we solve several symmetric applications to show how effective the provided transform is at resolving partial differential equation.
The research aimed mainly to discover the effectiveness of the (PEOE) model in teaching science to develop the skills of generating and evaluating information and the emotional side of the scientific sense of the intermediate first grade students. An experimental approach with a quasi-experimental design called pre-test and post-test control design was used. The research sample consisted of (60) students, who were selected in a random cluster method, (30) students in the experimental group studied the unit "The Nature of Material" using the (PEOE) model, and (30) students in the control group studied according to the prevailing method of teaching. The research materials and tools were represented in: a teacher's guide for teaching the un
... Show MoreThe proposed design of neural network in this article is based on new accurate approach for training by unconstrained optimization, especially update quasi-Newton methods are perhaps the most popular general-purpose algorithms. A limited memory BFGS algorithm is presented for solving large-scale symmetric nonlinear equations, where a line search technique without derivative information is used. On each iteration, the updated approximations of Hessian matrix satisfy the quasi-Newton form, which traditionally served as the basis for quasi-Newton methods. On the basis of the quadratic model used in this article, we add a new update of quasi-Newton form. One innovative features of this form's is its ability to estimate the energy functio
... Show MoreBackground/objectives: To study the motion equation under all perturbations effect for Low Earth Orbit (LEO) satellite. Predicting a satellite’s orbit is an important part of mission exploration. Methodology: Using 4th order Runge–Kutta’s method this equation was integrated numerically. In this study, the accurate perturbed value of orbital elements was calculated by using sub-steps number m during one revolution, also different step numbers nnn during 400 revolutions. The predication algorithm was applied and orbital elements changing were analyzed. The satellite in LEO influences by drag more than other perturbations regardless nnn through semi-major axis and eccentricity reducing. Findings and novelty/improvement: The results demo
... Show More