Convergence prop erties of Jackson polynomials have been considered by Zugmund
[1,ch.X] in (1959) and J.Szbados [2], (p =ï‚¥) while in (1983) V.A.Popov and J.Szabados [3]
(1 ï‚£p ï‚£ ï‚¥) have proved a direct inequality for Jackson polynomials in L
p-sp ace of 2-periodic bounded Riemann integrable functions (f R) in terms of some modulus of
continuity .
In 1991 S.K.Jassim proved direct and inverse inequality for Jackson polynomials in
locally global norms (L
,p) of 2-p eriodic bounded measurable functions (f L) in terms of
suitable Peetre K-functional [4].
Now the aim of our paper is to proved direct and inverse inequalities for Jackson
polynomials

In this article, we define and study a family of modified Baskakov type operators based on a parameter . This family is a generalization of the classical Baskakov sequence. First, we prove that it converges to the function being approximated. Then, we find a Voronovsky-type formula and obtain that the order of approximation of this family is . This order is better than the order of the classical Baskakov sequence  whenever . Finally, we apply our sequence to approximate two test functions and analyze the numerical results obtained.

Recently, in 2014 [1] the authors introduced a general family of summation integral Baskakov-type operators ( ) . In this paper, we investigate approximation properties of partial sums for this general family.

     Graceful labeling of a graph  with q edges is assigned the labels for its vertices by some integers from the set such that no two vertices received the same label, where each edge is assigned the absolute value of the difference between the labels of its end vertices and the resulting edge labeling running from 1 to  inclusive. An edge labeling of a graph G is called vertex anntimagic, if all vertex weights are pairwise distinct, where the vertex weight of a vertex under an edge labeling is the sum of the label of all edges incident with that vertex.  In this paper, we address the problem of finding graceful antimagic labelin for split of the star graph ,  graph,  graph, jellyfish graph , Dragon graph , ki

     In this work, we introduce  a new convergence formula. We also define cluster point , δ-Cauchy sequence, δ-convergent, δ-completeness , and define sequentially contraction  in approach space. In addition, we prove the contraction condition is necessary and sufficient to get the  function is sequentially contraction  as well as we put a new structure for the norm in the approach space which is called approach –Banach space, we discuss the normed approach space with uniform condition is a Hausdorff space. Also, we prove a normed approach space is complete if and only if the metric generated from approach space is complete as well as prove every finite –dimensional approach normed space is δ-complete. We prove several r

    The Ozone Monitoring Instrument (OMI) measures the reflected solar radiation in the ultraviolet and visible part in the spectral range that is between 270 and 500 nm, using two channels with a spectral resolution of about 0.5 nm. Ground-level tropospheric ozone is one of the air pollutants of most concern. In the troposphere, near the Earth's surface, human activities lead to ozone concentrations several times higher than the natural background level. To evaluate the ozone distribution over Iraq, the ozone data from OMI were analyzed using geostatistical techniques. Theoretical spherical models provided the best fit for all monthly experimental variograms. The parameters of these variograms (sill, range and nugget) wer

Mobile ad-hoc networks (MANETs) are composed of mobile nodes communicating through wireless medium, without any fixed centralized infrastructure. Providing quality of service (QoS) support to multimedia streaming applications over MANETs is vital. This paper focuses on QoS support, provided by the stream control transmission protocol (SCTP) and the TCP-friendly rate control (TFRC) protocol to multimedia streaming applications over MANETs. In this study, three QoS parameters were considered jointly: (1) packet delivery ratio (PDR), (2) end-to-end delay, (3) and throughput. Specifically, the authors analyzed and compared the simulated performance of the SCTP and TFRC transport protocols for delivering multimedia streaming over MANETs.

Many approaches of different complexity already exist to edge detection in
color images. Nevertheless, the question remains of how different are the results
when employing computational costly techniques instead of simple ones. This
paper presents a comparative study on two approaches to color edge detection to
reduce noise in image. The approaches are based on the Sobel operator and the
Laplace operator. Furthermore, an efficient algorithm for implementing the two
operators is presented. The operators have been applied to real images. The results
are presented in this paper. It is shown that the quality of the results increases by
using second derivative operator (Laplace operator). And noise reduced in a good