The problem of the research lies in choosing agility tests suitable to the test taker to observe the relative changes in some players. In addition to that, there are a lot of agility tests that lack special test models that coordinate gender and age. This means the youth basketball player on one hand and time and distance in applying the tests on the other. The importance of the research lies in designing agility tests for youth basketball players to achieve variations in tests a matter that will benefit coaches in their training. The subjects of the research were (30) youth basketball players from the specialized school of the National Center that sponsor gifted basketball players in Baghdad for the season 2014 – 2015. The data was collected and treated using proper statistical methods. The researchers concluded that agility tests were first applied in Iraqi environment thus they are qualified to be used along other tests in selecting basketball players. Finally the researchers recommended using agility tests in the continuous evaluation as well as using proper criteria as a reference during the selection process.
The purpose of this paper is to show that for a holomorphic and univalent function in class S, an omitted –value transformation yields a class of starlike functions as a rotation transformation of the Koebe function, allowing both the image and rotation of the function
to be connected. Furthermore, these functions have several properties that are not far from a convexity properties. We also show that Pre- Schwarzian derivative is not invariant since the convexity property of the function is so weak.
Through this study, the following has been proven, if is an algebraically paranormal operator acting on separable Hilbert space, then satisfies the ( ) property and is also satisfies the ( ) property for all . These results are also achieved for ( ) property.
In addition, we prove that for a polaroid operator with finite ascent then after the property ( ) holds for for all .
(1)
In this paper we introduce and study the concepts of semisimple gamma modules , regular gamma modules and fully idempotent gamma modules as a generalization of semisimple ring. An module is called fully idempotent (semisimple , regular) if for all submodule of (every submodule is a direct summand, for each , there exists and such that . We study some properties and relationships between them.
In this paper we define and study new concepts of functions on fibrewise topological spaces over B namely, fibrewise weakly (resp., closure, strongly) continuoac; funttions which are analogous of weakly
(resp., closure, strongly) continuous functions and the main result is : Let <p : XY be a fibrewise closure (resp., weakly, closure, strongly, strongly) continuous function, where Y is fibrewise topological space over B and X is a fibrewise set which has the
in
... Show MoreThroughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.
The family Ormyridae has been very much neglected by workers and only two species has been recorded so far from Iraq. The present study, based mainly on my collection, deals with five species, of which one is new to science. The new species is described together with notes on locality data, host records, distribution and taxonomical remarks for all the species.
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show More
In this paper we give many connections between essentially quasi-Dedekind (quasi-
Dedekind) modules and other modules such that Baer modules, retractable modules,
essentially retractable modules, compressible modules and essentially compressible
modules where an R-module M is called essentially quasi-Dedekind (resp. quasi-
Dedekind) if, Hom(M N ,M ) 0 for all N ≤e M (resp. N ≤ M). Equivalently, a
module M is essentially quasi-Dedekind (resp. quasi-Dedekind) if, for each
f End (M) R , Kerf ≤ e M implies f = 0 (resp. f 0 implies ker f 0 ).
Reacts compound C6H5PO2Cl2 with Secretary secondary R2NH at room temperature by Mulet 2:1 and using chloroform as a solvent in dry conditions to form composite 2HCl and the interaction of compound solution of sodium hydroxide and potassium by Mulet 3:1 salt was prepared
Let be a connected graph with vertices set and edges set . The ordinary distance between any two vertices of is a mapping from into a nonnegative integer number such that is the length of a shortest path. The maximum distance between two subsets and of is the maximum distance between any two vertices and such that belong to and belong to . In this paper, we take a special case of maximum distance when consists of one vertex and consists of vertices, . This distance is defined by: where is the order of a graph .
In this paper, we defined – polynomials based on
... Show More
(5)
(1)