In this paper, we introduce an approximate method for solving fractional order delay variational problems using fractional Euler polynomials operational matrices. For this purpose, the operational matrices of fractional integrals and derivatives are designed for Euler polynomials. Furthermore, the delay term in the considered functional is also decomposed in terms of the operational matrix of the fractional Euler polynomials. It is applied and substituted together with the other matrices of the fractional integral and derivative into the suggested functional. The main equations are then reduced to a system of algebraic equations. Therefore, the desired solution to the original variational problem is obtained by solving the resul

Steganography is an important class of security which is widely used in computer and network security nowadays. In this research, a new proposed algorithm was introduced with a new concept of dealing with steganography as an algorithmic secret key technique similar to stream cipher cryptographic system. The proposed algorithm is a secret key system suggested to be used in communications for messages transmission steganography

Huge number of medical images are generated and needs for more storage capacity and bandwidth for transferring over the networks. Hybrid DWT-DCT compression algorithm is applied to compress the medical images by exploiting the features of both techniques. Discrete Wavelet Transform (DWT) coding is applied to image YCbCr color model which decompose image bands into four subbands (LL, HL, LH and HH). The LL subband is transformed into low and high frequency components using Discrete Cosine Transform (DCT) to be quantize by scalar quantization that was applied on all image bands, the quantization parameters where reduced by half for the luminance band while it is the same for the chrominance bands to preserve the image quality, the zig

In this paper, we proposed a hybrid control methodology using improved artificial potential field with modify cat swarm algorithm to path planning of decoupled multi-mobile robot in dynamic environment. The proposed method consists of two phase: in the first phase, Artificial Potential Field method (APF) is used to generate path for each one of robots and avoided static obstacles in environment, and improved this method to solve the local minimum problem by using A* algorithm with B-Spline curve while in the second phase, modify Cat Swarm Algorithm (CSA) is used to control collision that occurs among robots or between robot with movable obstacles by using two behaviour modes: seek mode and track mode. Experimental results show that the p

In this paper, the proposed phase fitted and amplification fitted of the Runge-Kutta-Fehlberg method were derived on the basis of existing method of 4(5) order to solve ordinary differential equations with oscillatory solutions. The recent method has null phase-lag and zero dissipation properties. The phase-lag or dispersion error is the angle between the real solution and the approximate solution. While the dissipation is the distance of the numerical solution from the basic periodic solution. Many of problems are tested over a long interval, and the numerical results have shown that the present method is more precise than the 4(5) Runge-Kutta-Fehlberg method.

Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterizes the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is a

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a