This paper presents an analytical study for the magnetohydrodynamic (MHD) flow of a generalized Burgers’ fluid in an annular pipe. Closed from solutions for velocity is obtained by using finite Hankel transform and discrete Laplace transform of the sequential fractional derivatives. Finally, the figures are plotted to show the effects of different parameters on the velocity profile.

This paper presents a cognition path planning with control algorithm design for a nonholonomic wheeled mobile robot based on Particle Swarm Optimization (PSO) algorithm. The aim of this work is to propose the circular roadmap (CRM) method to plan and generate optimal path with free navigation as well as to propose a nonlinear MIMO-PID-MENN controller in order to track the wheeled mobile robot on the reference path. The PSO is used to find an online tune the control parameters of the proposed controller to get the best torques actions for the wheeled mobile robot. The numerical simulation results based on the Matlab package show that the proposed structure has a precise and highly accurate distance of the generated refere

     The problem in the design of a cam is the analyzing of the mechanisms and dynamic forces that effect on the family of parametric polynomials for describing the motion curve. In present method, two ways have been taken for optimization of the cam size, first the high dynamic loading (such that impact and elastic stress waves propagation) from marine machine tool which translate by the roller follower to the cam surface and varies with time causes large contact loads and second it must include the factors of kinematics features including the acceleration, velocity, boundary condition and the unsymmetrical curvature of the cam profile for the motion curve.

     In the theoretical solution

The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola

The extracting of personal sprite from the whole image faced many problems in separating the sprite edge from the unneeded parts, some image software try to automate this process, but usually they couldn't find the edge or have false result. In this paper, the authors have made an enhancement on the use of Canny edge detection to locate the sprite from the whole image by adding some enhancement steps by using MATLAB. Moreover, remove all the non-relevant information from the image by selecting only the sprite and place it in a transparent background. The results of comparing the Canny edge detection with the proposed method shows improvement in the edge detection.

 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)

Neural cryptography deals with the problem of “key exchange” between two neural networks by using the mutual learning concept. The two networks exchange their outputs (in bits) and the key between two communicating parties ar eventually represented in the final learned weights, when the two networks are said to be synchronized. Security of neural synchronization is put at risk if an attacker is capable of synchronizing with any of the two parties during the training process.

Home Computer and Information Science 2009 Chapter The Stochastic Network Calculus Methodology Deah J. Kadhim, Saba Q. Jobbar, Wei Liu & Wenqing Cheng Chapter 568 Accesses 1 Citations Part of the Studies in Computational Intelligence book series (SCI,volume 208) Abstract The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochastic network calculus by deriving a network service curve, which expresses the service given to a flow by the network as a whole in terms of a probabilistic bound. The presented network service curve permits the calculation of statistical end-to-end delay and backlog bounds for broad

Power switches require snubbing networks for driving single – phase industrial heaters. Designing these networks, for controlling the maximum allowable rate of rise of anode current (di/dt) and excessive anode – cathode voltage rise (dv/dt) of power switching devices as thyristors and Triacs, is usually achieved using conventional methods like Time Constant Method (TCM), resonance Method (RM), and Runge-Kutta Method (RKM). In this paper an alternative design methodology using Fuzzy Logic Method (FLM) is proposed for designing the snubber network to control the voltage and current changes. Results of FLM, with fewer rules requirements, show the close similarity with those of conventional design methods in such a network of a Triac drivin