<p class="0abstract">The rapidly growing 3D content exchange over the internet makes securing 3D content became a very important issue. The solution for this issue is to encrypting data of 3D content, which included two main parts texture map and 3D models. The standard encryption methods such as AES and DES are not a suitable solution for 3D applications due to the structure of 3D content, which must maintain dimensionality and spatial stability. So, these problems are overcome by using chaotic maps in cryptography, which provide confusion and diffusion by providing uncorrelated numbers and randomness. Various works have been applied in the field of 3D content-encryption based on the chaotic system. This survey will attempt t

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

This paper derives the EDITRK4 technique, which is an exponentially fitted diagonally implicit RK method for solving ODEs . This approach is intended to integrate exactly initial value problems (IVPs), their solutions consist of linear combinations of the group functions  and  for exponentially fitting  problems, with  being the problem’s major frequency utilized to improve the precision of the method. The modified  method EDITRK4 is a new three-stage fourth-order exponentially-fitted diagonally implicit approach for solving IVPs with functions that are exponential as solutions. Different forms of -order ODEs must be derived using the modified system, and when the same issue is reduced to a  framework of equations that can be sol

     In this article, a new efficient approach is presented to solve a type of partial differential equations, such (2+1)-dimensional differential equations non-linear, and nonhomogeneous. The procedure of the new approach is suggested to solve important types of differential equations and get accurate analytic solutions i.e., exact solutions. The effectiveness of the suggested approach based on its properties compared with other approaches has been used to solve this type of differential equations such as the Adomain decomposition method, homotopy perturbation method, homotopy analysis method, and variation iteration method. The advantage of the present method has been illustrated by some examples.

The main work of this paper is devoted to a new technique of constructing approximated solutions for linear delay differential equations using the basis functions power series functions with the aid of Weighted residual methods (collocations method, Galerkin’s method and least square method).

In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low

A comprehensive review focuses on 3D network-on-chip (NoC) simulators and plugins while paying attention to the 2D simulators as the baseline is presented. Discussions include the programming languages, installation configuration, platforms and operating systems for the respective simulators. In addition, the simulator’s properties and plugins for design metrics evaluations are addressed. This review is intended for the early career researchers starting in 3D NoC, offering selection guidelines on the right tools for the targeted NoC architecture, design, and requirements.

A remarkable correlation between chaotic systems and cryptography has been established with sensitivity to initial states, unpredictability, and complex behaviors. In one development, stages of a chaotic stream cipher are applied to a discrete chaotic dynamic system for the generation of pseudorandom bits. Some of these generators are based on 1D chaotic map and others on 2D ones. In the current study, a pseudorandom bit generator (PRBG) based on a new 2D chaotic logistic map is proposed that runs side-by-side and commences from random independent initial states. The structure of the proposed model consists of the three components of a mouse input device, the proposed 2D chaotic system, and an initial permutation (IP) table. Statist