The goal of this study is to provide a new explicit iterative process method  approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing a finite family of different types of  mappings as( nonexpansive mappings,resolvent mappings and projection mappings. The findings given in this research strengthen and extend key previous findings in the literature. Then, utilizing various structural conditions in Hilbert space and variational inequality problems, we examine the strong convergence to nearest point projection for these explicit iterative process methods Under the presence of two important conditions for convergence, namely closure and convexity. The findings reported in this research strengthen and extend

The Asphalt cement is produced as a by-product from the oil industry; the asphalt must practice further processing to control the percentage of its different ingredients so that it will be suitable for paving process. The objective of this work is to prepare different types of modified Asphalt cement using locally available additives, and subjecting the prepared modified Asphalt cement to testing procedures usually adopted for Asphalt cement, and compare the test results with the specification requirements for the modified Asphalt cement to fulfill the paving process requirements. An attempt was made to prepare the modified Asphalt cement for pavement construction in the laboratory by digesting each of the two penetration grade Asphalt c

     The main aim of this work is to investigate the existence and approximate controllability of mild solutions of impulsive fractional nonlinear control system with a nonsingular kernel in infinite dimensional space. Firstly, we set sufficient conditions to demonstrate the existence and uniqueness of the mild solution of the control system using the Banach fixed point theorem. Further, we prove the approximate controllability of the control system using the sequence method.

Abstract

Hexapod robot is a flexible mechanical robot with six legs. It has the ability to walk over terrain. The hexapod robot look likes the insect so it has the same gaits. These gaits are tripod, wave and ripple gaits. Hexapod robot needs to stay statically stable at all the times during each gait in order not to fall with three or more legs continuously contacts with the ground. The safety static stability walking is called (the stability margin). In this paper, the forward and inverse kinematics are derived for each hexapod’s leg in order to simulate the hexapod robot model walking using MATLAB R2010a for all gaits and the geometry in order to derive the equations of the sub-constraint workspaces for each

    Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the proble

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

Solid waste is a major issue in today's world. Which can be a contributing factor to pollution and the spread of vector-borne diseases. Because of its complicated nonlinear processes, this problem is difficult to model and optimize using traditional methods. In this study, a mathematical model was developed to optimize the cost of solid waste recycling and management. In the optimization phase, the salp swarm algorithm (SSA) is utilized to determine the level of discarded solid waste and reclaimed solid waste. An optimization technique SSA is a new method of finding the ideal solution for a mathematical relationship based on leaders and followers. It takes a lot of random solutions, as well as their outward or inward fluctuations, t

More than 95% of the industrial controllers in use today are PID or modified PID controllers. However, the PID is manually tuning to be responsive so that the Process Variable is rapidly and steady moved to track the set point with minimize overshoot and stable output. The paper presents generic teal-time PID controller architecture. The developed architecture is based on the adaption of each of the three controller parameters (PID) to be self- learning using individual least mean square algorithm (LMS). The adaptive PID is verified and compared with the classical PID. The rapid realization of the adaptive PID architecture allows the readily fabrication into a hardware version either ASIC or reconfigurable.

Enhancing quality image fusion was proposed using new algorithms in auto-focus image fusion. The first algorithm is based on determining the standard deviation to combine two images. The second algorithm concentrates on the contrast at edge points and correlation method as the criteria parameter for the resulted image quality. This algorithm considers three blocks with different sizes at the homogenous region and moves it 10 pixels within the same homogenous region. These blocks examine the statistical properties of the block and decide automatically the next step. The resulted combined image is better in the contras

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