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

The aim of this paper is to construct cyclic subgroups of the projective general linear group over  from the companion matrix, and then form caps of various degrees in . Geometric properties of these caps as secant distributions and index distributions are given and determined if they are complete. Also, partitioned of  into disjoint lines is discussed.

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

The present study aimed to identify teaching problems which facing the teachers for first three grades classes, and if these problems different according to some variables teacher qualification, experience period, class grade). The study sample consist of (137 )

 female teachers who teach the first three grades in Braimy city in Oman, teachers spread in five government schools. Both researchers developed questionnaire to measure problems faced by the mentioned teachers, consist of 50 questions distributed into 4 dimensions (teacher, students, the curriculum, the evaluations), Also researchers checked questionnaire validity and stability. The results indicate to: The most common probl

The author obtain results on the asymptotic behavior of the nonoscillatory solutions of first order nonlinear neutral differential equations. Keywords. Neutral differential equations, Oscillatory and Nonoscillatory solutions.

  In this work, some of numerical methods for solving first order linear Volterra IntegroDifferential Equations are presented.      The numerical solution of these equations is obtained by using Open Newton Cotes formula.      The Open Newton Cotes formula is applied to find the optimum solution for this equation.      The computer program is written in (MATLAB) language (version 6)

In this paper, the author established some new integral conditions for the oscillation of all solutions of nonlinear first order neutral delay differential equations. Examples are inserted to illustrate the results.

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons