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

The main objective of the present work is to find a method increases the efficiency of the airfoil that is used for blade in wind turbine, wing in aircraft, propeller and helicopter (like NACA 4412). By overcoming the separation of flow at high angle of attacks, a slotted airfoil had been used and solved numerically through connecting the pressure side in the bottom surface with the suction side in the top surface of the airfoil to energize the separated flow. Slot exit, width and slope were considered as a parameters of slot configuration to determine the effective design of consideration. Reynolds number was taken as [1.6 x106 ] and the angle of attacks were ranged from (0o - 20o ). The numerical solution with Ansys Fluent commercial prog

The exponential growth of audio data shared over the internet and communication channels has raised significant concerns about the security and privacy of transmitted information. Due to high processing requirements, traditional encryption algorithms demand considerable computational effort for real-time audio encryption. To address these challenges, this paper presents a permutation for secure audio encryption using a combination of Tent and 1D logistic maps. The audio data is first shuffled using Tent map for the random permutation. The high random secret key with a length equal to the size of the audio data is then generated using a 1D logistic map. Finally, the Exclusive OR (XOR) operation is applied between the generated key and the sh

In the theoretical part, removal of direct yellow 8 (DY8) from water solution was accomplished using Bentonite Clay as an adsorbent. Under batch adsorption, the adsorption was observed as a function of contact time, adsorbent dosage, pH, and temperature. The equilibrium data were fitted with the Langmuir and Freundlich adsorption models, and the linear regression coefficient R2 was used to determine the best fitting isotherm model. thermodynamic parameters of the ongoing adsorption mechanism, such as Gibb's free energy, enthalpy, and entropy, have also been measured. The batch method was also used for the kinetic calculations, and the day's adsorption assumes first-order rate kinetics. The kinetic studies also show that the intrapar

In the present work, we use the Adomian Decomposition method to find the approximate solution for some cases of the Newell whitehead segel nonlinear differential equation which was solved previously with exact solution by the Homotopy perturbation and the Iteration methods, then we compared the results.

Some problems want to be solved in image compression to make the process workable and more efficient. Much work had been done in the field of lossy image compression based on wavelet and Discrete Cosine Transform (DCT). In this paper, an efficient image compression scheme is proposed, based on a common encoding transform scheme; It consists of the following steps: 1) bi-orthogonal (tab 9/7) wavelet transform to split the image data into sub-bands, 2) DCT to de-correlate the data, 3) the combined transform stage's output is subjected to scalar quantization before being mapped to positive, 4) and LZW encoding to produce the compressed data. The peak signal-to-noise (PSNR), compression ratio (CR), and compression gain (CG) measures were used t

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c