Beneficial effect of Hordeum vulgare extract against aluminum chloride induced neurotoxicity in Wistar rats

Aluminum is present in medicines and food.  Its toxicity induces deleterious effects in various living organisms. At the same time, Hordeum vulgare a cereal known as an important nutritional source and also endowed with bioactive molecules. The objective of this study was to evaluate, on the one hand, the modifications induced by aluminum chloride in Wistar rats at the cerebral level and, on the other hand, to test the efficacy of the barley extract, Hordeum vulgare, (HEV) to restore the harmful effects of this studied metal with a concentration of 13 ml HEV/kg/day for a period of 21 days. The extraction of HEV by maceration resulted in an aqueous extract with a yield of 10.70%. Exposure to AlCl3 at a concentration of 100mg/kg, permitted to observe that the concentration of aluminium at the brain level is significantly high (p<0.05) in the intoxicated rats compared to the control rats. On the other hand, the activity of alkaline phosphatase (PAL), superoxide dismutase (SOD), catalase (CAT), and glutathione peroxidase (GPx) indicated a decrease in the intoxicated rats. Indeed, the histological study showed very pronounced lesions in the brains of the poisoned rats resulting in necrosis and cellular spongiosis. In addition, the administration of HEV restored the activity of the various antioxidant enzymes with an improvement in brain tissue architecture in intoxicated rats treated with HEV which justifies the therapeutic virtues of H. vulgare in protecting against aluminium chloride-induced neurotoxicity

Saturated boundary k-alliances in graphs

International audienceIn this paper, we introduce a new concept of saturated vertices for the alliances. For a given graph G=(V,E)G=(V,E) and S⊂VS⊂V, a vertex v∈Vv∈V is said to be SS-saturated , if the number of its defenders is equal to the number of its attackers for SS. We define new parameters |λ(S)||λ(S)| and View the MathML source|λ̄(S)| as the number of SS-saturated vertices and not SS-saturated vertices of SS, respectively. We study mathematical properties of (global) saturated boundary defensive, offensive and powerful kk-alliances and theoretical results are obtained by giving in particular some tight bounds and exact values on the cardinality of such alliances. As a main result, we give tight bounds for the cardinality of every minimal global boundary powerful (−1)(−1)-alliance (MGBPA) in terms only of the order and the size of graph. Furthermore, we establish two algorithms which generate graphs containing (connected) MGBPA from a given complete graph K2nK2n

Fritz John type optimality and duality in nonlinear programming under weak pseudo-invexity

In this paper, we use a generalized Fritz John condition to derive optimality conditions and duality results for a nonlinear programming with inequality constraints, under weak invexity with respect to different (ηi)i assumption. The equivalence between saddle points and optima, and a characterization of optimal solutions are established under suitable generalized invexity requirements. Moreover, we prove weak, strong, converse and strict duality results for a Mond-Weir type dual. It is shown in this study, with examples, that the introduced generalized Fritz John condition combining with the invexity with respect to different (ηi)i are especially easy in application and useful in the sense of sufficient optimality conditions and of characterization of solutions

Multiobjective Fractional Programming Involving Generalized Semilocally V-Type I-Preinvex and Related Functions

We study a nonlinear multiple objective fractional programming with inequality constraints where each component of functions occurring in the problem is considered semidifferentiable along its own direction instead of the same direction. New Fritz John type necessary and Karush-Kuhn-Tucker type necessary and sufficient efficiency conditions are obtained for a feasible point to be weakly efficient or efficient. Furthermore, a general Mond-Weir dual is formulated and weak and strong duality results are proved using concepts of generalized semilocally V-type I-preinvex functions. This contribution extends earlier results of Pred

Weak Pseudo-Invexity and Characterizations of Solutions in Multiobjective Programming

In this paper, we study Fritz John type optimality for nonlinear multiobjective programming problems under new classes of generalized invex vector functions. Relationships between these classes of vector functions are established by giving several examples. Furthermore, optimality conditions and characterizations of efficient and weakly efficient solutions are obtained under weak pseudoinvexity and by using a concept of generalized Fritz John vector critical point. We have illustrated through various non-trivial examples that the results obtained in this paper extend many previously known results in this area

Multiobjective Fractional Programming Involving Generalized Semilocally V-Type I-Preinvex and Related Functions

We study a nonlinear multiple objective fractional programming with inequality constraints where each component of functions occurring in the problem is considered semidifferentiable along its own direction instead of the same direction. New Fritz John type necessary and Karush-Kuhn-Tucker type necessary and sufficient efficiency conditions are obtained for a feasible point to be weakly efficient or efficient. Furthermore, a general Mond-Weir dual is formulated and weak and strong duality results are proved using concepts of generalized semilocally V-type I-preinvex functions. This contribution extends earlier results of Preda (2003), Mishra et al. (2005), Niculescu (2007), and Mishra and Rautela (2009), and generalizes results obtained in the literature on this topic

Nondifferentiable multiobjective programming under generalized dI-invexity

In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce new concepts of dI-invexity and generalized dI-invexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di. New Fritz-John type necessary and Karush-Kuhn-Tucker type necessary and sufficient optimality conditions are obtained for a feasible point to be weakly efficient, efficient or properly efficient. Moreover, we prove weak, strong, converse and strict duality results for a Mond-Weir type dual under various types of generalized dI-invexity assumptions.Multiobjective programming Semi-directionally differentiable functions Generalized dI-invexity Optimality Duality (Weakly or properly) efficient point

Graph grammars according to the type of input and manipulated data: A survey.

International audienc