The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

   In this paper we give definitions, properties and examples of the notion of  type Ntopological space. Throughout this paper  N is a finite positive  number, N 2. The task of this paper is to study and investigate some properties of such spaces with the existence of a relation between this space and artificial Neural Networks (NN'S), that is we applied the definition of this space in computer field and specially in parallel processing

The aim of this paper is to design fast neural networks to approximate periodic functions, that is, design a fully connected networks contains links between all nodes in adjacent layers which can speed up the approximation times, reduce approximation failures, and increase possibility of obtaining the globally optimal approximation. We training suggested network by Levenberg-Marquardt training algorithm then speeding suggested networks by choosing most activation function (transfer function) which having a very fast convergence rate for reasonable size networks.             In all algorithms, the gradient of the performance function (energy function) is used to determine how to

The main aim of image compression is to reduce the its size to be able for transforming and storage, therefore many methods appeared to compress the image, one of these methods is "Multilayer Perceptron ". Multilayer Perceptron (MLP) method which is artificial neural network based on the Back-Propagation algorithm for compressing the image. In case this algorithm depends upon the number of neurons in the hidden layer only the above mentioned will not be quite enough to reach the desired results, then we have to take into consideration the standards which the compression process depend on to get the best results. We have trained a group of TIFF images with the size of (256*256)  in our research, compressed them by using MLP for each

The inverse kinematics of redundant manipulators has infinite solutions by using conventional methods, so that, this work presents applicability of intelligent tool (artificial neural network ANN) for finding one desired solution from these solutions. The inverse analysis and trajectory planning of a three link redundant planar robot have been studied in this work using a proposed dual neural networks model (DNNM), which shows a predictable time decreasing in the training session. The effect of the number of the training sets on the DNNM output and the number of NN layers have been studied. Several trajectories have been implemented using point to point trajectory planning algorithm with DNNM and the result shows good accuracy of the end

This paper presents a modified training method for Recurrent Neural Networks. This method depends on the Non linear Auto Regressive (NARX) model with Modified Wavelet Function as activation function (MSLOG) in the hidden layer. The modified model is known as Modified Recurrent Neural (MRN). It is used for identification Forward dynamics of four Degrees of Freedom (4-DOF) Selective Compliance Assembly Robot Arm (SCARA) manipulator robot. This model is also used in the design of Direct Inverse Control (DIC). This method is compared with Recurrent Neural Networks that used Sigmoid activation function (RS) in the hidden layer and Recurrent Neural Networks with Wavelet activation function (RW). Simulation results shows that the MRN model is bett

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

High peak to average power ration (PAPR) in orthogonal frequency division multiplexing (OFDM) is an important problem, which increase the cost and complexity of high power amplifiers. One of the techniques used to reduce the PAPR in OFDM system is the tone reservation method (TR). In our work we propose a modified tone reservation method to decrease the PAPR with low complexity compared with the conventional TR method by process the high and low amplitudes at the same time. An image of size 128×128 is used as a source of data that transmitted using OFDM system. The proposed method decrease the PAPR by 2dB compared with conventional method with keeping the performance unchanged. The performance of the proposed method is tested with