In this work, we introduce Fibonacci– Halpern iterative scheme ( FH scheme) in partial ordered Banach space (POB space) for monotone total asymptotically non-expansive mapping (, MTAN mapping) that defined on weakly compact convex subset.  We also  discuss the results of weak and strong convergence for this scheme.

 Throughout  this work, compactness condition of m-th iterate  of the mapping for some natural m is necessary to ensure strong convergence, while Opial's condition has been employed to show weak convergence. Stability of FH scheme is also  studied. A numerical comparison is provided by an example to show that FH scheme is faster than Mann and Halpern iterative

The Next-generation networks, such as 5G and 6G, need capacity and requirements for low latency, and high dependability. According to experts, one of the most important features of (5 and 6) G networks is network slicing. To enhance the Quality of Service (QoS), network operators may now operate many instances on the same infrastructure due to configuring able slicing QoS. Each virtualized network resource, such as connection bandwidth, buffer size, and computing functions, may have a varied number of virtualized network resources. Because network resources are limited, virtual resources of the slices must be carefully coordinated to meet the different QoS requirements of users and services. These networks may be modifie

This paper presents designing an adaptive state feedback controller (ASFC) for a magnetic levitation system (MLS), which is an unstable system and has high nonlinearity and represents a challenging control problem. First, a nonadaptive state feedback controller (SFC) is designed by linearization about a selected equilibrium point and designing a SFC by pole-placement method to achieve maximum overshoot of 1.5% and settling time of 1s (5% criterion). When the operating point changes, the designed controller can no longer achieve the design specifications, since it is designed based on a linearization about a different operating point. This gives rise to utilizing the adaptive control scheme to parameterize the state feedback controll

In this paper, the goal of proposed method is to protect data against different types of attacks by unauthorized parties. The basic idea of proposed method is generating a private key from a specific features of digital color image such as color (Red, Green and Blue); the generating process of private key from colors of digital color image performed via the computing process of color frequencies for blue color of an image then computing the maximum frequency of blue color, multiplying it by its number and adding process will performed to produce a generated key. After that the private key is generated, must be converting it into the binary representation form. The generated key is extracted from blue color of keyed image then we selects a c

 Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved.  In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)

The security of multimedia data becoming important spatial data of monitoring systems that contain videos prone to attack or escape via the internet, so to protect these videos used proposed method combined between encryption algorithm and sign algorithm to get on authenticated video. The proposed encryption algorithm applied to secure the video transmission by encrypt it to become unclear. This done by extract video to frames and each frame separate to three frames are Red, Green, and Blue, this frames encrypt by using three different random keys that generated by a function for generating random numbers, as for sign algorithm applied for authentication purpose that enable the receiver from sure of the identity of the sender and provide

This paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al