This paper proposes a new structure of the hybrid neural controller based on the identification model for nonlinear systems. The goal of this work is to employ the structure of the Modified Elman Neural Network (MENN) model into the NARMA-L2 structure instead of Multi-Layer Perceptron (MLP) model in order to construct a new hybrid neural structure that can be used as an identifier model and a nonlinear controller for the SISO linear or nonlinear systems. Weight parameters of the hybrid neural structure with its serial-parallel configuration are adapted by using the Back propagation learning algorithm. The ability of the proposed hybrid neural structure for nonlinear system has achieved a fast learning with minimum number

Solutions of dyes Rhodamine 6G (Rh6G) and Coumarin480(C480) were prepared at five concentrations (1x10-3, 5x10-4, 1x10-4, 5x10-5 and1x10-5) mol/l, the mixing was stirred to obtain on a homogenous solution, the(poly methyl-methacrylate) (PMMA) was solved by chloroform solvent with certain ratio, afterward (PMMA+Rh6G) and (PMMA+C480) thin films were prepared by casting method on glass block which has substrate with dimensions (7.5 x2.5)cm2, the prepared samples were left in dark place at room temperature for 24 hours to obtain uniform and homogenous thin films. UV-VIS absorption spectra, transmission spectra and fluorescence spectra were done to measure linear refractive index and linear absorption coefficient. The nonlinear optical proper

A huge potential from researchers was presented for enhancing the nonlinear optical response for materials that interacts by light. In this work, we study the nonlinear optical response for chemically prepared nano- fluid of silver nanoparticles in de-ionized water with TSC (Tri-sodium citrate) protecting agent. By the means of self-defocusing technique and under CW 473 nm blue laser, the reflected diffraction pattern were observed and recorded by CCD camera. The results demonstrate that, the Ag nano-fluid shows a good third order nonlinear response and the magnitude of the nonlinear refractive index was in the order of 10−7 cm2/W. We determine the maximum change of the nonlinear refractive index and the related phase shift for the mat

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

Moment invariants have wide applications in image recognition since they were proposed.

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica^®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑