In this work, Elzaki transform (ET) introduced by Tarig Elzaki is applied to solve linear Volterra fractional integro-differential equations (LVFIDE). The fractional derivative is considered in the Riemman-Liouville sense. The procedure is based on the application of (ET) to (LVFIDE) and using properties of (ET) and its inverse. Finally, some examples are solved to show that this is computationally efficient and accurate.

Often phenomena suffer from disturbances in their data as well as the difficulty of formulation, especially with a lack of clarity in the response, or the large number of essential differences plaguing the experimental units that have been taking this data from them. Thus emerged the need to include an estimation method implicit rating of these experimental units using the method of discrimination or create blocks for each item of these experimental units in the hope of controlling their responses and make it more homogeneous. Because of the development in the field of computers and taking the principle of the integration of sciences it has been found that modern algorithms used in the field of Computer Science genetic algorithm or ant colo

Various speech enhancement Algorithms (SEA) have been developed in the last few decades. Each algorithm has its advantages and disadvantages because the speech signal is affected by environmental situations. Distortion of speech results in the loss of important features that make this signal challenging to understand. SEA aims to improve the intelligibility and quality of speech that different types of noise have degraded. In most applications, quality improvement is highly desirable as it can reduce listener fatigue, especially when the listener is exposed to high noise levels for extended periods (e.g., manufacturing). SEA reduces or suppresses the background noise to some degree, sometimes called noise suppression alg

       In this work, Elzaki transform (ET) introduced by Tarig Elzaki is applied to solve linear Volterra fractional integro-differential equations (LVFIDE). The fractional derivative is considered in the Riemman-Liouville sense. The procedure is based on the application of (ET) to (LVFIDE) and using properties of (ET) and its inverse. Finally, some examples are solved to show that this is computationally efficient and accurate.

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

This work presents a symmetric cryptography coupled with Chaotic NN , the encryption algorithm process the data as a blocks and it consists of multilevel( coding of character, generates array of keys (weights),coding of text and chaotic NN ) , also the decryption process consists of multilevel (generates array of keys (weights),chaotic NN, decoding of text and decoding of character).Chaotic neural network is used as a part of the proposed system with modifying on it ,the keys that are used in chaotic sequence are formed by proposed key generation algorithm .The proposed algorithm appears efficiency during the execution time where it can encryption and decryption long messages by short time and small memory (chaotic NN offer capacity of m

Image compression is one of the data compression types applied to digital images in order to reduce their high cost for storage and/or transmission. Image compression algorithms may take the benefit of visual sensitivity and statistical properties of image data to deliver superior results in comparison with generic data compression schemes, which are used for other digital data. In the first approach, the input image is divided into blocks, each of which is 16 x 16, 32 x 32, or 64 x 64 pixels. The blocks are converted first into a string; then, encoded by using a lossless and dictionary-based algorithm known as arithmetic coding. The more occurrence of the pixels values is codded in few bits compare with pixel values of less occurre