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

The enhancement of heat exchanger performance was investigated using dimpled tubes tested at different Reynolds numbers, in the present work four types of dimpled tubes with a specified configuration manufactured, tested and then compared performance with the smooth tube and other passive techniques performance. Two dimpled arrangements along the tube were investigated, these are inline and staggered at constant pitch ratio X/d=4, the test results showed that Nusselts number (heat transfer) of the staggered array is higher than the inline array by 13%.  The effect of different depths of the dimple (14.5 mm and 18.5 mm) has been also investigated; a tube with large dimple diameter enhanced the Nusselts number by about 25% for the ran

Background and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si