Here, we found an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to convex polynomial by means of weighted Totik-Ditzian modulus of continuity

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

Biotreatment using immobilized cells (IC) technology has proved to be the most promising and most economical approach for the removal of many toxic organic pollutants found in petroleum-refinery wastewater (PRW) such as phenol. This study was undertaken to evaluate the degradation of phenol by Pseudomonas cells individually immobilized in two different bio-carrier matrices including polyvinyl alcohol-guar gum (PVA-GG) and polyvinyl alcohol-agar agar (PVA-AA). Results of batch experiments revealed that complete removal of phenol was attained in the first cycle after 150 min using immobilized cells (IC) in both PVA-GG and PVA-AA. Additional cycles were confirmed to evaluate the validity of recycling beads of immob

This research focuses on the services provided by news websites (IMN, Youm7, Huffington Post Arabic) to its audience of Internet users, as well as materials posted through its pages, trying to monitor and explain them to identify their types & features, and it›s functions, whether informational or non-informational, to know the technical potential of each of the news sites, with the entry of the latest technology information. The research used the analysis method to achieve the research objectives within the period from 1/1 to 31/1/2017. The researchers used the content analysis tool as a research tool to analyze the news sites and to know the services they provide through their pages. The research was divided into three parts, the

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.

In light of the enquiry raised by the Economist Mary Finn in 1995 concluding that high utilization in absorptive capacity of the economy is of inflationary tendency for industrial countries due to the equality between high rates of utilization of absorptive capacity and resource – shortage conditions leading to price inflation, the same idea was used to prove that budget utilization of operational costs and elevating absorptive capacity at the expense of investment budget leads to inflationary tendency that becomes a burden on financing the step- in policy of the Central bank to control prices through its foreign currency reserves at a time when the economy turned  into an importer of non- tradable goods and being subject

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va