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.

Let M be ,-ring and X be ,M-module, Bresar and Vukman studied orthogonal
derivations on semiprime rings. Ashraf and Jamal defined the orthogonal derivations
on -rings M. This research defines and studies the concepts of orthogonal
derivation and orthogonal generalized derivations on ,M -Module X and introduces
the relation between the products of generalized derivations and orthogonality on
,M -module.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

The Internet of Things (IoT) is an information network that connects gadgets and sensors to allow new autonomous tasks. The Industrial Internet of Things (IIoT) refers to the integration of IoT with industrial applications. Some vital infrastructures, such as water delivery networks, use IIoT. The scattered topology of IIoT and resource limits of edge computing provide new difficulties to traditional data storage, transport, and security protection with the rapid expansion of the IIoT. In this paper, a recovery mechanism to recover the edge network failure is proposed by considering repair cost and computational demands. The NP-hard problem was divided into interdependent major and minor problems that could be solved in polynomial t

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

Diabetic retinopathy is an eye disease, because of pressure in eye nerve fiber. It is a major cause of blindness in middle as well as older age groups; therefore it is essential to diagnose it earlier. Some of the challenges are in the diagnosis of the disease is detection edges of the image, may be some important edges are missed outcome the noise around the corners.
Wherefore, in order to reduce these effects in this paper, we proposed a new technique for edge detection using traditional operators in combination with fuzzy logic based on fuzzy inference system. The results show that the proposed fuzzy edge detection technique better than of traditional techniques, where vascular are markedly detected over the original.

In this research, an analysis for the standard Hueckel edge detection algorithm behaviour by using three dimensional representations for the edge goodness criterion is presents after applying it on a real high texture satellite image, where the edge goodness criterion is analysis statistically. The Hueckel edge detection algorithm showed a forward exponential relationship between the execution time with the used disk radius. Hueckel restrictions that mentioned in his papers are adopted in this research. A discussion for the resultant edge shape and malformation is presented, since this is the first practical study of applying Hueckel edge detection algorithm on a real high texture image containing ramp edges (satellite image).