Journal of Al-Qadisiyah for Computer Science and Mathematics

In the present paper we use approximation methods for the study of operator inclusions of the form , where a is a closed linear surjective operator from a Banach space onto another one, and Φ is a multimap being a composition of a multimap with ”good” values and a continuous singlevalued map. As application we consider the solvability of an integro- differential system which may be treated as a control object with an integral feedback. Key Words and Phrases: multivalued map, fixed point, coincidence point, continuous selection, operator inclusion, closed linear operator, integro-differential system.

In this paper, a tri-trophic food web model with mixed selection of functional responses is proposed and analyzed. It is assumed that, the food web system consisting of one prey and two predators, in which there is an explicit inter-specific competition between the two predators. Dynamical behavior of all possible equilibrium points has been investigated locally as well as globally. Sufficient conditions for the system to be uniformly persistent and / or extinction have been derived.

We define the statistic known as the sample correlation coefficient based on n pairs of observed values of two characters which is represented by random variables as:
The aim of this paper is to find the dist. of when :
(i) are mutually independent r.vs if .
(ii) has abivariate normal dist.

Let change its convexity finitely many times in the interval , say times at , We estimate the degree of approximation of by polynomials which change convexity exactly at the points where does.

The task of the query optimizer is to accept as input a tree of relational algebra operators and to produce a query execution plan. This plan specifies exactly which operations should be performed, in which order. Algebra space can express the solution space, whereas a good search algorithm can finding an optimal solution. In this work a genetic algorithm with two crossover strategies will be tested on a B+ tree sorted database example and nested loop join strategy. The results show that using M2S crossover with left-deep strategy will give better solutions.

In this work , we introduce and study a new type of continuous functions, which we call α - continuous function , these are the functions in which the inverse image of α- open set is also α- open. Several properties of these functions are proved

Abstract: This paper introduces and studies a generalization of Baskakov-Beta operators, denotes it by , where ( the set of nonnegative integers). First, we show that is an approximate process for as where . Next, we discuss a Voronovaskaja-type asymptotic formula for . Finally, we present a theorem which gives us an estimate of the degree of approximation by the operator .

The classic Traveling Salesman Problem (TSP) has been frequently used as a test bed for the study of new local search techniques developed for general circuit-based permutation problems, local search heuristics for the traveling salesman problem (TSP) is chiefly based on algorithms using the classical Lin-Kernighan (L-K) procedure, La Lena simple genetic algorithm. This work give a detailed description of the three genetic solutions for this problem and found that genetic algorithms different in behavior according to the tour length.