The design and implementation of an active router architecture that enables flexible network programmability based on so-called "user components" will be presents. This active router is designed to provide maximum flexibility for the development of future network functionality and services. The designed router concentrated mainly on the use of Windows Operating System, enhancing the Active Network Encapsulating Protocol (ANEP). Enhancing ANEP gains a service composition scheme which enables flexible programmability through integration of user components into the router's data path. Also an extended program that creates and then injects data packets into the network stack of the testing machine will be proposed, we will call this program

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order

In the present paper, the concepts of a quasi-metric space, quasi-Banach space
have been introduced. We prove some facts which are defined on these spaces and
define some polynomials on quasi-Banach spaces and studied their dynamics, such
as, quasi cyclic and quasi hypercyclic. We show the existence of quasi chaotic in the
sense of Devaney (quasi D-chaotic) polynomials on quasi Banach space of qsummable
sequences lq , 0<q<1 such polynomials P is defined by P((xi)i)=(p(xi+m))i
where p:CC, p(0) = 0. In general we also prove that P is quasi chaotic in the sense
of Auslander and Yorke (quasi AY-chaotic) if and only if 0 belong to the Julia set of
p, mN. And then we prove that if the above polynomial P o

Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.

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

     This paper introduced a hybrid technique for lossless image compression of natural and medical images; it is based on integrating the bit plane slicing and Wavelet transform along with a mixed polynomial of linear and non linear base. The experiments showed high compression performance with fully grunted reconstruction.