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 new Schiff bases derived from pyromellitic dianhydride were   synthesized  by  several  steps  reaction . A symmetrical  diamic acide  [I ]a-c  were  synthesized  by  the  reaction  of  pyromellitic  dianhydride  with  some aromatic  amines  (containing  electron  withdrawing , repulling  groups ) in dry acetone.      In the second step the  diacids were converted  to  their corresponding  diimide [II ]a-c using acetic anhydride and sodium acetate system as a dehydrating agent,    via  the  intra molecular  cyclization  steps&nbs

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

A new synthesis of Schiff (K) 6 and Mannich bases (Q) 7 had formed compound (Q) 7 by reacting compound (K) with N-methylaniline at the presence of formalin 35% to given Mannich base (Q). Additionally, new complexes were formed by reacting Schiff base (K) with metal salts CuCl2·2H2O, PdCl2·2H2O, and PtCl6·6H2O by 2:1 of M:L ratio. New ligands and their complexes were characterized, exanimated, and confirmed through several techniques, including FTIR, UV-visible, 1H-NMR, 13C-NMR spectroscopy, CHN analysis, FAA, TG, molar conductivity, and magnetic susceptibility. These compounds and their complexes were screened against breast cancer cells. It was determined that several of these compounds had a significant anti-breast cancer effec

The m-consecutive-k-out-of-n: F linear and circular system consists of n sequentially connected components; the components are ordered on a line or a circle; it fails if there are at least m non-overlapping runs of consecutive-k failed components. This paper proposes the reliability and failure probability functions for both linearly and circularly m-consecutive-k-out-of-n: F systems. More precisely, the failure states of the system components are separated into two collections (the working and the failure collections); where each one is defined as a collection of finite mutual disjoint classes of the system states. Illustrative example is provided.

      Faintly continuous (FC) functions, entitled faintly S-continuous and faintly δS-continuous functions have been introduced and investigated via a -open and -open sets. Several characterizations and properties of faintly S-continuous and faintly -Continuous functions were obtained. In addition, relationships between faintly s- Continuous and faintly S-continuous function and other forms of FC function were investigated. Also, it is shown that every faintly  S-continuous is weakly S-continuous. The Convers is shown to be satisfied only if the co-domain of the function is almost regular.

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).