In 2010, Long and Zeng introduced a new generalization of the Bernstein polynomials that depends on a parameter  and called -Bernstein polynomials. After that, in 2018, Lain and Zhou studied the uniform convergence for these -polynomials and obtained a Voronovaskaja-type asymptotic formula in ordinary approximation. This paper studies the convergence theorem and gives two Voronovaskaja-type asymptotic formulas of the sequence of -Bernstein polynomials in both ordinary and simultaneous approximations. For this purpose, we discuss the possibility of finding the recurrence relations of the -th order moment for these polynomials and evaluate the values of -Bernstein for the functions ,  is a non-negative integer

During the two last decades ago, audio compression becomes the topic of many types of research due to the importance of this field which reflecting on the storage capacity and the transmission requirement. The rapid development of the computer industry increases the demand for audio data with high quality and accordingly, there is great importance for the development of audio compression technologies, lossy and lossless are the two categories of compression. This paper aims to review the techniques of the lossy audio compression methods, summarize the importance and the uses of each method.

The idea of a homomorphism of a cubic set of a KU-semigroup is studied and the concept of the product between two cubic sets is defined. And then, a new cubic bipolar fuzzy set in this structure is discussed, and some important results are achieved. Also, the product of cubic subsets is discussed and some theorems are proved. 2010 AMS Classification: 06F35, 03G25, 08A72.

The aim of this paper is to prove some results for equivalence of moduli of smoothnes in approximation theory , we used a"non uniform" modulus of smoothness and the weighted Ditzian –Totik moduli of smoothness in by spline functions ,several results are obtained .For example , it shown that ,for any the inequality , is satisfied ,finally, similar result for chebyshev partition and weighted Ditzian –Totik moduli of smoothness are also obtained.

Segmentation of real world images considered as one of the most challenging tasks in the computer vision field due to several issues that associated with this kind of images such as high interference between object foreground and background, complicated objects and the pixels intensities of the object and background are almost similar in some cases. This research has introduced a modified adaptive segmentation process with image contrast stretching namely Gamma Stretching to improve the segmentation problem. The iterative segmentation process based on the proposed criteria has given the flexibility to the segmentation process in finding the suitable region of interest. As well as, the using of Gamma stretching will help in separating the

Information security in data storage and transmission is increasingly important. On the other hand, images are used in many procedures. Therefore, preventing unauthorized access to image data is crucial by encrypting images to protect sensitive data or privacy. The methods and algorithms for masking or encoding images vary from simple spatial-domain methods to frequency-domain methods, which are the most complex and reliable. In this paper, a new cryptographic system based on the random key generator hybridization methodology by taking advantage of the properties of Discrete Cosine Transform (DCT) to generate an indefinite set of random keys and taking advantage of the low-frequency region coefficients after the DCT stage to pass them to