Abstract:

                In light of the development in the banking environment and the increasing reliance on electronic systems in providing banking services and due to the intense competition witnessed by the banking sector, the need has emerged to apply the comprehensive electronic banking system, which works on the Internet in providing new and diverse banking services regardless of time and place by linking all branches to one central database, and despite the advantages achieved from the application of the comprehensive system, there is a set of risks that accompany the use of that system, What requires the auditors to develop the audit method in line with the size of the development in the

Diesel engine oil was subjected to thermal oxidization (TO) for six periods of time (0 h, 24 h, 48 h, 72 h, 96 h, and 120 h) and was subsequently characterized by terahertz time domain spectroscopy (THz-TDS). The THz refractive index generally increased with oxidation time. The measurement method illustrated the potential of THz-TDS when a fixed setup with a single cuvette is used. A future miniaturized setup installed in an engine would be an example of a fixed setup. For the refractive index, there were highly significant differences among the oxidation times across most of the 0.3–1.7 THz range.

In this paper, an algorithm is suggested to train a single layer feedforward neural network to function as a heteroassociative memory. This algorithm enhances the ability of the memory to recall the stored patterns when partially described noisy inputs patterns are presented. The algorithm relies on adapting the standard delta rule by introducing new terms, first order term and second order term to it. Results show that the heteroassociative neural network trained with this algorithm perfectly recalls the desired stored pattern when 1.6% and 3.2% special partially described noisy inputs patterns are presented.

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

In this research the results of applying Artificial Neural Networks with modified activation function to
perform the online and offline identification of four Degrees of Freedom (4-DOF) Selective Compliance
Assembly Robot Arm (SCARA) manipulator robot will be described. The proposed model of
identification strategy consists of a feed-forward neural network with a modified activation function that
operates in parallel with the SCARA robot model. Feed-Forward Neural Networks (FFNN) which have
been trained online and offline have been used, without requiring any previous knowledge about the
system to be identified. The activation function that is used in the hidden layer in FFNN is a modified
version of the wavelet func

In this research the results of applying Artificial Neural Networks with modified activation function to perform the online and offline identification of four Degrees of Freedom (4-DOF) Selective Compliance Assembly Robot Arm (SCARA) manipulator robot will be described. The proposed model of identification strategy consists of a feed-forward neural network with a modified activation function that operates in parallel with the SCARA robot model. Feed-Forward Neural Networks (FFNN) which have been trained online and offline have been used, without requiring any previous knowledge about the system to be identified. The activation function that is used in the hidden layer in FFNN is a modified version of the wavelet function. This approach ha