In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.
The research aims to know the availability of supra-cognitive thinking skills in the questions and activities of the computer book for the fifth grade preparatory scientific and literary branches in Iraq for the academic year 2018/2019, as the researcher has prepared a list of supra-cognitive thinking skills included two areas and (6) key skills and (27) A sub - skill, where by the questions and activities of the aforementioned authors were analyzed. The researcher followed the descriptive analytical approach "method of content analysis", and adopted the explicit and implicit unit of analysis, as was verified the validity and stability of the analysis, and the results showed unevenness and imbalance in the distribution of supra-cognitive th
... Show MoreEffect of Using Computer in Getting and Remaining Information at Students of First Stage in Biology Subject MIAAD NATHIM RASHEED LECTURER Abstract The recent research goal is to know the influence of computer use to earn and fulfillment information for students of first class in biology material and to achieve that put many of the zeroing hypothesis by researcher as follow: There were no differences between statistical signs at level (0,05) between the average students' marks who they were study by using computer and between the average student ' marks who they were study in classical method of earning and fulfillment. The researcher chose the intentional of the medical technical institute that included of two branches the first class (A
... Show MoreThe purpose of this work is to determine the points and planes of 3-dimensional projective space PG(3,2) over Galois field GF(q), q=2,3 and 5 by designing a computer program.
In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.
Degenerate parabolic partial differential equations (PDEs) with vanishing or unbounded leading coefficient make the PDE non-uniformly parabolic, and new theories need to be developed in the context of practical applications of such rather unstudied mathematical models arising in porous media, population dynamics, financial mathematics, etc. With this new challenge in mind, this paper considers investigating newly formulated direct and inverse problems associated with non-uniform parabolic PDEs where the leading space- and time-dependent coefficient is allowed to vanish on a non-empty, but zero measure, kernel set. In the context of inverse analysis, we consider the linear but ill-pose
Acquires this research importance of addressing the subject (environmental problems) with
age group task, a category that children pre-school, and also reflected the importance of
research, because the (environmental problems) constitute a major threat to the continuation
of human life, particularly the children, so the environment is Bmchkladtha within
kindergarten programs represent the basis of a hub of learning where the axis, where the
kindergarten took into account included in the programs in order to help the development of
environmental awareness among children and get them used to the sound practices and
behaviors since childhood .
The research also detected problem-solving skills creative with kids Riyad
In this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi
... Show More