Anchusa strigosa L.: Hardy annual biennial or perennial herb, with hairs especially on the leaves., flowers generally regular. Commonly named (Lisan Althour) in Iraq, from Boraginaceae family. The plant contains phenolic acids, flavonoids, alkaloids, sterols, and terpenoids. The Whole plant part defatted with n-hexane for 24 hours. The defatted plant material extracted using absolute methanol by Soxhlet apparatus for 24 hours, the extract fractionated by solvents of different polarity: petroleum ether- chloroform - ethylacetate- and n-butanol respectively. The n-butanol fraction hydrolyzed with 10% HCl for 5 hours by reflex to break down the glycosidic linkage. Rosmarinic acid, caffeic acid, genistein, and silybin were isolated

Current research included preparation, characterization of some new chitosan- hydroxy benzaldehyde-Schiff bases with maleic anhydride. The present study aimed to the synthesis and characterization of novel chitosan Schiff base compounds using para- hydroxy benzaldeh and maleic anhydride. The  derivative of the  schiff-chitosan base, which is associated with different drugs, has been replaced with   different  amino  and  hydroxy  drugs.  The derivative is characterized by different analytical techniques. The results of FT-IR studies clearly indicate construction of the chief amine group in chitosan and the emergence of new bands that correspond to the association of maleic anhydride with the chitosan base. TGA, ¹

In this study, the antimicrobial properties of newly synthesized Schiff bases (4a-4e) and thiazolidinone compounds (5a-5e) generated from 3,5-dinitrobenzoic acid were assessed. These compounds were obtained by reacting 3,5-dinitrobenzoic acid (1) with ethanol in a few drops of concentrated H2SO4 to produce the ester (2). The acid hydrazide (3), which was produced by treating the ester with hydrazine hydrate, reacted with the proper aldehydes, including 4-bromobenzaldehyde, 4-chlorobenzaldehyde, 4-hydroxybenzaldehyde, 4-methoxybenzaldehyde, and 4-hydroxy-3-methoxybenzaldehyde, respectively, to form Schiff bases (4a-4e). The thiazolidinone compounds (5a-5e) were produced by the cyclocondensation reaction of compounds (4a-4e) with thio

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 presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

The significance fore supra topological spaces as a subject of study cannot be overstated, as they represent a broader framework than traditional topological spaces. Numerous scholars have proposed extension to supra open sets, including supra semi open sets, supra per open and others. In this research, a notion for ⱨ-supra open created within the generalizations of the supra topology of sets. Our investigation involves harnessing this style of sets to introduce modern notions in these spaces, specifically supra ⱨ - interior, supra ⱨ - closure, supra ⱨ - limit points, supra ⱨ - boundary points and supra ⱨ - exterior of sets. It has been examining the relationship with supra open. The research was also enriched with many

Let R be a commutative ring with identity 1 and M be a unitary left R-module. A submodule N of an R-module M is said to be pure relative to submodule T of M (Simply T-pure) if for each ideal A of R, N?AM=AN+T?(N?AM). In this paper, the properties of the following concepts were studied: Pure essential submodules relative to submodule T of M (Simply T-pure essential),Pure closed submodules relative to submodule T of M (Simply T-pure closed) and relative pure complement submodule relative to submodule T of M (Simply T-pure complement) and T-purely extending. We prove that; Let M be a T-purely extending module and let N be a T-pure submodule of M. If M has the T-PIP, then N is T-purely extending.

Throughout this paper we introduce the notion of coextending module as a dual of the class of extending modules. Various properties of this class of modules are given, and some relationships between these modules and other related modules are introduced.