In this paper, we characterize normal composition operators induced by holomorphic self-map , when and .Moreover, we study other related classes of operators, and then we generalize these results to polynomials of degree n.

The primary objective of this paper is to introduce a new concept of fibrewise topological spaces on D is named fibrewise multi- topological spaces on D. Also, we entroduce the concepts of multi-proper, fibrewise multi-compact, fibrewise locally multi-compact spaces, Moreover, we study relationships between fibrewise multi-compact (resp., locally multi-compac) space and some fibrewise multi-separation axioms.

In this paper a nonlinear adaptive control method is presented for a pH process, which is difficult to control due to the nonlinear and uncertainties. A theoretical and experimental investigation was conducted of the dynamic behavior of neutralization process in a continuous stirred tank reactor (CSTR). The process control was implemented using different control strategies, velocity form of PI control and nonlinear adaptive control. Through simulation studies it has been shown that the estimated parameters are in good agreement with the actual values and that the proposed adaptive controller has excellent tracking and regulation performance.

A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

In this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin

The demand for electronic -passport photo ( frontal facial) images has grown rapidly. It now extends to Electronic Government (E-Gov) applications such as social benefits driver's license, e-passport, and e-visa . With the COVID 19 (coronavirus disease ), facial (formal) images are becoming more widely used and spreading quickly, and are being used to verify an individual's identity, but unfortunately that comes with insignificant details of constant background which leads to huge byte consumption that affects storage space and transmission, where the optimal solution that aims to curtail data size using compression techniques that based on exploiting image redundancy(s) efficiently.

Compressing the speech reduces the data storage requirements, leading to reducing the time of transmitting the digitized speech over long-haul links like internet. To obtain best performance in speech compression, wavelet transforms require filters that combine a number of desirable properties, such as orthogonality and symmetry.The MCT bases functions are derived from GHM bases function using 2D linear convolution .The fast computation algorithm methods introduced here added desirable features to the current transform. We further assess the performance of the MCT in speech compression application. This paper discusses the effect of using DWT and MCT (one and two dimension) on speech compression. DWT and MCT performances in terms of comp

In this paper, an algorithm through which we can embed more data than the
regular methods under spatial domain is introduced. We compressed the secret data
using Huffman coding and then this compressed data is embedded using laplacian
sharpening method.
We used Laplace filters to determine the effective hiding places, then based on
threshold value we found the places with the highest values acquired from these filters
for embedding the watermark. In this work our aim is increasing the capacity of
information which is to be embedded by using Huffman code and at the same time
increasing the security of the algorithm by hiding data in the places that have highest
values of edges and less noticeable.
The perform

Median filter is adopted to match the noise statistics of the degradation seeking good quality smoothing images. Two methods are suggested in this paper(Pentagonal-Hexagonal mask and Scan Window Mask), the study involved modified median filter for improving noise suppression, the modification is considered toward more reliable results. Modification median filter (Pentagonal-Hexagonal mask) was found gave better results (qualitatively and quantitatively ) than classical median filters and another suggested method (Scan Window Mask), but this will be on the account of the time required. But sometimes when the noise is line type the cross 3x3 filter preferred to another one Pentagonal-Hexagonal with few variation. Scan Window Mask gave bett

This paper studies the adaptive coded modulation for coded OFDM system using punctured convolutional code, channel estimation, equalization and SNR estimation. The channel estimation based on block type pilot arrangement is performed by sending pilots at every sub carrier and using this estimation for a specific number of following symbols. Signal to noise ratio is estimated at receiver and then transmitted to the transmitter through feedback channel ,the transmitter according to the estimated SNR select appropriate modulation scheme and coding rate which maintain constant bit error rate
lower than the requested BER. Simulation results show that better performance is confirmed for target bit error rate (BER) of (10-3) as compared to c