in this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.
This paper proposes improving the structure of the 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. Two learning algorithms are used to adjust the parameters weight of the hybrid neural structure with its serial-parallel configuration; the first one is supervised learning algorithm based Back Propagation Algorithm (BPA) and the second one is an intelligent algorithm n
... Show MoreIn this work, linear and nonlinear optical properties of two types of Iraqi heavy crude oil extracted from fields in southern Iraq were determined. The nonlinear optical properties were measured utilizing Z-scan technology with He-Ne laser at 632.8 nm. It was found that nonlinear refractive index (NLR) values for the Basra and Kut heavy crude oil samples are 6.34381×10-4 and 8.25108×10-4 cm2/mW, respectively, while those for the nonlinear absorption coefficient (NLA) are 2.68942×10-5 and 2.58874×10-5 , respectively. These results showed that the two samples with linear and nonlinear optical properties can be used in optics field applications as
... Show MoreIn this work, the switching nonlinear dynamics of a Fabry-Perot etalon are studied. The method used to complete the solution of the differential equations for the nonlinear medium. The Debye relaxation equations solved numerically to predict the behavior of the cavity for modulated input power. The response of the cavity filled with materials of different response time is depicted. For a material with a response time equal to = 50 ns, the cavity switches after about (100 ns). Notice that there is always a finite time delay before the cavity switches. The switch up time is much longer than the cavity build-up time of the corresponding linear cavity which was found to be of the order of a few round-trip ti
... Show MoreMany of the dynamic processes in different sciences are described by models of differential equations. These models explain the change in the behavior of the studied process over time by linking the behavior of the process under study with its derivatives. These models often contain constant and time-varying parameters that vary according to the nature of the process under study in this We will estimate the constant and time-varying parameters in a sequential method in several stages. In the first stage, the state variables and their derivatives are estimated in the method of penalized splines(p- splines) . In the second stage we use pseudo lest square to estimate constant parameters, For the third stage, the rem
... Show MoreThe aim of this paper is to study the quaternary classical continuous optimal control for a quaternary linear parabolic boundary value problems(QLPBVPs). The existence and uniqueness theorem of the continuous quaternary state vector solution for the weak form of the QLPBVPs with given quaternary classical continuous control vector (QCCCV) is stated and proved via the Galerkin Method. In addition, the existence theorem of a quaternary classical continuous optimal control vector governinig by the QLPBVPs is stated and demonstrated. The Fréchet derivative for the cost function is derived. Finally, the necessary conditions for the optimality theorem of the proposed problem is stated and demonstrated.
In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show MoreMeerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a
... Show More