A three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

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

Density data of alum chrom in water and in aqueous solution of poly (ethylene glycol) (1500) at different temperatures (288.15, 293.15, 298.15) k have been used to estimate the apparent molar volume (Vθ), limiting apparent molar volume (Vθ˚) experimental slope (Sv) and the second derivative of limiting partial molar volume [δ2 θ v° /δ T2] p .The viscosity data have been analyzed by means of Jones –Dole equation to obtain coefficient A, and Jones –Dole coefficient B, Free activation energy of activation per mole of solvent, Δμ10* solute, Δμ20* the activation enthalpy ΔH*,and entropy, ΔS*of activation of viscous flow. These results have been discussed in terms of solute –solvent interaction and making/breaking ability of so

   Density data of  alum chrom in water and in aqueous solution of poly (ethylene glycol) (1500) at different temperatures (288.15, 293.15, 298.15) k have been used to estimate the apparent molar volume (Vθ), limiting apparent molar volume (Vθ˚) experimental slope (Sv) and the second derivative of limiting partial molar volume [δ2 θ v° /δ T2] p .The viscosity data have been analyzed by means of Jones –Dole equation to obtain coefficient A, and  Jones – Dole coefficient B, Free activation  energy of activation per mole of solvent, Δμ10* solute, Δμ20* the activation enthalpy ΔH*,and entropy, ΔS*of activation of viscous flow. These results have been discussed

Densities
 and viscosity
 of serine in 20, 40, and 60% (w/w) dimethyl sulfoxide (DMSO)-water mixtures were measured at 298.15, 303.15 and 308.15k. From these experimental data, apparent molal volume v  , limiting apparent molal volume v  o , the slop v S , transfer volume  v  o(tr), Jones-Dole coefficients A and B were calculated. The results are
v  odiscussed the solute-solvent and solute-solute interaction, and showed that serine behaves as structure-breaker in aqueous DMSO solvent

       There are many techniques for face recognition which compare the desired face image with a set of faces images stored in a database. Most of these techniques fail if faces images are exposed to high-density noise. Therefore, it is necessary to find a robust method to recognize the corrupted face image with a high density noise. In this work, face recognition algorithm was suggested by using the combination of de-noising filter and PCA. Many studies have shown that PCA has ability to solve the problem of noisy images and dimensionality reduction. However, in cases where faces images are exposed to high noise, the work of PCA in removing noise is useless, therefore adding a strong filter will help to im