؛ ١٨his study male and female albino mice werdministr^d doses of alkaloid and phenolic extracts of Allium cepa at doses of( 25 ,50,100, 200) mg / kg of( body weight). males and females were divided into four groups and each croup comprised mice were injected intra^ritonially daily for one week and orally ٢٠٢ one month . After which animals were killed and the serum was separated for biochemical analysis (total blood suger, total protein , otal cholesterol). Results showed significant decrease ( p< 0,05) in the total blood suger and total cholesterol on the serum of both males and females and significant increase( p< 0,05) in the total serum protein of both males and females of the two types of injection and oral administr

In this article, the notions  are introduced by using soft ideal and soft semi-open sets, which are - - - -closed sets " -closed" where many of the properties of these sets are clarified. Some games by using soft- -semi, soft separation axioms: like ( ₀   ( ₀  Using many figures and proposition to study the relationships among these kinds of games with some examples are explained.

This research is trying to study the Intellectual political structures of the Open Society according to British Thinker –with Austrian origin- Karl Popper (1902-1994). In First Axe we dealt with the context of Open and Closed society in the Popper's thought. While in the Second Axe we studied the Utopian and graduated Engineering. Finally in the third Axe  for the Rationalism, Freedom, Individualism, and the Democracy of Equality. 

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

 This paper is concerned with preliminary test single stage shrinkage estimators for the mean (q) of normal distribution with known variance s2 when a prior estimate (q0) of the actule value (q) is available, using specifying shrinkage weight factor y( ) as well as pre-test region (R).         Expressions for the Bias, Mean Squared Error [MSE( )] and Relative Efficiency [R.Eff.( )] of proposed estimators are derived. Numerical results and conclusions are drawn about selection different constants including in these expressions. Comparisons between suggested estimators with respect to usual estimators in the sense of Relative Efficiency are given. Furthermore, comparisons with the earlier existi

Establishing coverage of the target sensing field and extending the network’s lifetime, together known as Coverage-lifetime is the key issue in wireless sensor networks (WSNs). Recent studies realize the important role of nature-inspired algorithms in handling coverage-lifetime problem with different optimization aspects. One of the main formulations is to define coverage-lifetime problem as a disjoint set covers problem. In this paper, we propose an evolutionary algorithm for solving coverage-lifetime problem as a disjoint set covers function. The main interest in this paper is to reflect both models of sensing: Boolean and probabilistic. Moreover, a heuristic operator is proposed as a local refinement operator to improve the quality

Systematic Reviews in Pharmacy is a monthly Peer-review open access Journal,different scientists involved in Pharmaceutical research and development

The research demonstrates new species of the games by applying separation axioms via  sets, where the relationships between the various species that were specified and the strategy of winning and losing to any one of the players, and their relationship with the concepts of separation axioms via  sets have been studied.

This paper is concerned with introducing and studying the new approximation operators based on a finite family of d. g. 'swhich are the core concept in this paper. In addition, we study generalization of some Pawlak's concepts and we offer generalize the definition of accuracy measure of approximations by using a finite family of d. g. 's.