Trimethoprim derivative Schiff bases are versatile ligands synthesized with carbonyl groups from the condensation of primary amines (amino acids). Because of their broad range of biological activity, these compounds are very important in the medical and pharmaceutical fields. Biological activities such as antibacterial, antifungal and antitumor activity are often seen. Transition metal complexes derived from biological activity Schiff base ligands have been commonly used.

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 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

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.

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.

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

The purpose of this paper is to introduce and study the concepts of fuzzy generalized open sets, fuzzy generalized closed sets, generalized continuous fuzzy proper functions and prove results about these concepts.

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.

In this paper we proposes the philosophy of the Darwinian selection as synthesis method called Genetic algorithm ( GA ), and include new merit function with simple form then its uses in other works for designing one of the kinds of multilayer optical filters called high reflection mirror. Here we intend to investigate solutions for many practical problems. This work appears designed high reflection mirror that have good performance with reduction the number of layers, which can enable one to controlling the errors effect of the thickness layers on the final product, where in this work we can yield such a solution in a very shorter time by controlling the length of the chromosome and optimal genetic operators . Res