Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best

<p>Vehicular ad-hoc networks (VANET) suffer from dynamic network environment and topological instability that caused by high mobility feature and varying vehicles density. Emerging 5G mobile technologies offer new opportunities to design improved VANET architecture for future intelligent transportation system. However, current software defined networking (SDN) based handover schemes face poor handover performance in VANET environment with notable issues in connection establishment and ongoing communication sessions. These poor connectivity and inflexibility challenges appear at high vehicles speed and high data rate services. Therefore, this paper proposes a flexible handover solution for VANET networks by integrating SDN and

A number of compression schemes were put forward to achieve high compression factors with high image quality at a low computational time. In this paper, a combined transform coding scheme is proposed which is based on discrete wavelet (DWT) and discrete cosine (DCT) transforms with an added new enhancement method, which is the sliding run length encoding (SRLE) technique, to further improve compression. The advantages of the wavelet and the discrete cosine transforms were utilized to encode the image. This first step involves transforming the color components of the image from RGB to YUV planes to acquire the advantage of the existing spectral correlation and consequently gaining more compression. DWT is then applied to the Y, U and V col

     Copyright hacking and piracy have increased as the Internet has grown in popularity and access to multimedia material has increased. Security, property protection, and authentication have all been achieved via watermarking techniques. This paper presents a summary of some recent efforts on video watermarking techniques, with an emphasis on studies from 2018 to 2022, as well as the various approaches, achievements, and attacks utilized as testing measures against these watermarking systems. According to the findings of this study, frequency-domain watermarking techniques are more popular and reliable than spatial domain watermarking approaches. Hybrid DCT and DWT are the two most used techniques and achieve good results in the fi

In this paper a new technique based on dynamic stream cipher algorithm is introduced. The mathematical model of dynamic stream cipher algorithm is based on the idea of changing the structure of the combined Linear Feedback Shift Registers (LFSR's) with each change in basic and message keys to get more complicated encryption algorithm, and this is done by use a bank of LFSR's stored in protected file and we select a collection of LFSR's randomly that are used in algorithm to generate the encryption (decryption) key.

We implement Basic Efficient Criteria on the suggested Key Generator (KG) to test the output key results. The results of applying BEC prove the robustness and efficiency of the proposed stream cipher cryptosystem.

     In this paper, we study some cases of a common fixed point theorem for classes of firmly nonexpansive and generalized nonexpansive maps. In addition, we establish that the Picard-Mann iteration is faster than Noor iteration and we used Noor iteration to find the solution of delay differential equation.

The focus of this article, reviewed a generalized  of contraction mapping and nonexpansive maps and recall some theorems about the existence and uniqueness of common fixed point and coincidence fixed-point for such maps under some conditions. Moreover, some schemes of different types as one-step schemes ,two-step schemes and three step schemes (Mann scheme algorithm, Ishukawa scheme algorithm, noor scheme algorithm, .scheme algorithm,  scheme algorithm Modified  scheme algorithm arahan scheme algorithm and others. The convergence of these schemes has been studied .On the other hands, We also reviewed the convergence, valence and stability theories of different types of near-plots in convex metric space.

We develop the previously published results of Arab by using the function  under certain conditions and using G-α-general admissible and triangular α-general admissible to prove coincidence fixed point and common fixed point theorems for two weakly compatible self –mappings in complete b-metric spaces.

      Strong and ∆-convergence for a two-step iteration process utilizing asymptotically nonexpansive and total asymptotically nonexpansive noneslf mappings in the CAT(0) spaces have been studied. As well, several strong convergence theorems under semi-compact and condition (M) have been proved. Our results improve and extend numerous familiar results from the existing literature.