The purpose of this paper, is to study different iterations algorithms types three_steps called, new iteration,
In this article, we recalled different types of iterations as Mann, Ishikawa, Noor, CR-iteration and, Modified SP_iteration of quasi δ-contraction mappings, and we proved that all these iterations equivalent to approximate fixed points of δ-contraction mappings in Banach spaces.
I've been in this research preparation and diagnostic complexes mixed Kandat of Alcavaúan Alpiculan ion Althaaossianat with some metal ions has been reactive in ethanol solvent and distilled water by (1:1) and water complexes and lotions to the accounts of the metal in the complex
The study focuses on assessment of the quality of some image enhancement methods which were implemented on renal X-ray images. The enhancement methods included Imadjust, Histogram Equalization (HE) and Contrast Limited Adaptive Histogram Equalization (CLAHE). The images qualities were calculated to compare input images with output images from these three enhancement techniques. An eight renal x-ray images are collected to perform these methods. Generally, the x-ray images are lack of contrast and low in radiation dosage. This lack of image quality can be amended by enhancement process. Three quality image factors were done to assess the resulted images involved (Naturalness Image Quality Evaluator (NIQE), Perception based Image Qual
... Show MoreBy- products of corn starch industry were used to prepare media for propagation the lactic acid bacteria as a natural auxotroph. The by- products used were the corn steep water (S) and gluten extract (G) after a proper treatment to get them ready for media preparation. The results showed that it was possible to replace the peptone and meat extract by gluten extract in MRS medium. The growth was approximately similar to that obtained in standard MRS media. Corn steep water (S) was used as well and the growth enhanced by including Tween – 80 at 1% level. The later media named MZ, which was superior for growing standard and local strains and starters. The MZ medium modified by adding acetate and glacial acetic acid similarly to
... Show MoreIn this research investigation, a total of eighteen diverse tetra- and penta-lateral cyclic compounds were synthesized. These included 1,3,4-thiadiazole, thiazolidin-4-one (via an alternative method), 1,2,4-triazole, carbothioamide, thiazole-4-one, azetidin-2-one, and oxazole. The synthesis procedure entailed a sequence of reactions. The thiazolidine-4-one 1 was obtained by reaction p-aminobenzoic acid with thiosemicarbazide, followed by treatment with p-tolualdehyde to produce Schiff base 2. Reaction Schiff base 2 with mercaptoacetic acid in dry benzene was carried out to produce thiazolidine-4-one 3. In another synthesis pathway, the esterification of p-nitro benzoic acid with ethanol in the presence of sulfuric acid was
... Show MoreThe definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X , ï´ ) be a topological space, and let A ⊆, then A is called semi-preopen set if ⊆∘ . In this paper, we study the properties of semi-preopen sets but by another definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.
A class of hyperrings known as divisible hyperrings will be studied in this paper. It will be presented as each element in this hyperring is a divisible element. Also shows the relationship between the Jacobsen Radical, and the set of invertible elements and gets some results, and linked these results with the divisible hyperring. After going through the concept of divisible hypermodule that presented 2017, later in 2022, the concept of the divisible hyperring will be related to the concept of division hyperring, where each division hyperring is divisible and the converse is achieved under conditions that will be explained in the theorem 3.14. At the end of this paper, it will be clear that the goal of this paper is to study the concept
... Show MoreCzerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show More