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

The huge amount of documents in the internet led to the rapid need of text classification (TC). TC is used to organize these text documents. In this research paper, a new model is based on Extreme Machine learning (EML) is used. The proposed model consists of many phases including: preprocessing, feature extraction, Multiple Linear Regression (MLR) and ELM. The basic idea of the proposed model is built upon the calculation of feature weights by using MLR. These feature weights with the extracted features introduced as an input to the ELM that produced weighted Extreme Learning Machine (WELM). The results showed   a great competence of the proposed WELM compared to the ELM. 

The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution  of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.

FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic

     The messages are ancient method to exchange information between peoples. It had many ways to send it with some security.

    Encryption and steganography was oldest ways to message security, but there are still many problems in key generation, key distribution, suitable cover image and others. In this paper we present proposed algorithm to exchange security message without any encryption, or image as cover to hidden. Our proposed algorithm depends on two copies of the same collection images set (CIS), one in sender side and other in receiver side which always exchange message between them.

      To send any message text the sender converts message to ASCII c

Cryptography is a method used to mask text based on any encryption method, and the authorized user only can decrypt and read this message. An intruder tried to attack in many manners to access the communication channel, like impersonating, non-repudiation, denial of services, modification of data, threatening confidentiality and breaking availability of services. The high electronic communications between people need to ensure that transactions remain confidential. Cryptography methods give the best solution to this problem. This paper proposed a new cryptography method based on Arabic words; this method is done based on two steps. Where the first step is binary encoding generation used t