Using orbit- motion limited theory, as the exact theory in calculating the ion and electron current in dusty plasma, the variations of charge number on a dust grain in Ar-plasma are studied by changing various charging parameters. Most of dependences of charge number on plasma parameters in this paper take into account the close packed effect.

(Use of models of game theory in determining the policies to maximize profits for the Pepsi Cola and Coca-Cola in the province of Baghdad)

Due to the importance of the theory of games especially theories of oligopoly in the study of the reality of competition among companies or governments and others the researcher linked theories of oligopoly to Econometrics to include all the policies used by companies after these theories were based on price and quantity only the researcher applied these theories to data taken from Pepsi Cola and Coca-Cola In Baghdad Steps of the solution where stated for the models proposed and solutions where found to be balance points is for the two companies according to the princi

  The purpose of this paper is to study a new types of compactness in bitopological spaces. We shall introduce the concepts of  L- compactness.

     . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by  which is a graph with a vertex set consisting of all column matrices  in which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .

     Let G be a finite group and X be a G-conjugacy of elements of order 3. The A4-graph of G is a simple graph with vertex set X and two vertices x,yÎX are linked if x≠ y and xy^-1 is an involution element. This paper aims to investigate  the A4-graph properties for the monster  Held group He.

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T

The  purpose  of  the  paper  is  to  tind  the  degree  of  the approximation of a functions  f be bounded , measurable and defined

in  interval   [a,h]by  Bernstein  polynomial  in  LP    space  1 $ p < oo by

using Ditzian-Totik modulus  of smootlmess  and  k 1n  average modvlus of smoothness.