In this paper we have presented a comparison between two novel integral transformations that are of great importance in the solution of differential equations. These two transformations are the complex Sadik transform and the KAJ transform. An uncompressed forced oscillator, which is an important application, served as the basis for comparison. The application was solved and exact solutions were obtained. Therefore, in this paper, the exact solution was found based on two different integral transforms: the first integral transform complex Sadik and the second integral transform KAJ. And these exact solutions obtained from these two integral transforms were new methods with simple algebraic calculations and applied to different problems.

Fatty Acid Methyl Ester (FAME) produced from biomass offers several advantages such as renewability and sustainability. The typical production process of FAME is accompanied by various impurities such as alcohol, soap, glycerol, and the spent catalyst. Therefore, the most challenging part of the FAME production is the purification process. In this work, a novel application of bulk liquid membrane (BLM) developed from conventional solvent extraction methods was investigated for the removal of glycerol from FAME. The extraction and stripping processes are combined into a single system, allowing for simultaneous solvent recovery whereby low-cost quaternary ammonium salt-glycerol-based deep eutectic solvent (DES) is used as the membrane phase.

The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. In this work, we implement an interaction between the feedforward neural network and the stream cipher, so the secret message will be encrypted by unsupervised neural network method in addition to the first encryption process which is performed by the stream cipher method. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding le

In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .

Three-dimensional (3D) image and medical image processing, which are considered big data analysis, have attracted significant attention during the last few years. To this end, efficient 3D object recognition techniques could be beneficial to such image and medical image processing. However, to date, most of the proposed methods for 3D object recognition experience major challenges in terms of high computational complexity. This is attributed to the fact that the computational complexity and execution time are increased when the dimensions of the object are increased, which is the case in 3D object recognition. Therefore, finding an efficient method for obtaining high recognition accuracy with low computational complexity is essentia

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.