The Hopfield network is one of the easiest types, and its architecture is such that each neuron in the network connects to the other, thus called a fully connected neural network. In addition, this type is considered auto-associative memory, because the network returns the pattern immediately upon recognition, this network has many limitations, including memory capacity, discrepancy, orthogonally between patterns, weight symmetry, and local minimum. This paper proposes a new strategy for designing Hopfield based on XOR operation; A new strategy is proposed to solve these limitations by suggesting a new algorithm in the Hopfield network design, this strategy will increase the performance of Hopfield by modifying the architecture of t

   Let M is a Г-ring. In this paper the concept of orthogonal symmetric higher bi-derivations on semiprime Г-ring is presented and studied and the relations of two symmetric higher bi-derivations on Г-ring are introduced.

MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

The enhancement of heat exchanger performance was investigated using dimpled tubes tested at different Reynolds numbers, in the present work four types of dimpled tubes with a specified configuration manufactured, tested and then compared performance with the smooth tube and other passive techniques performance. Two dimpled arrangements along the tube were investigated, these are inline and staggered at constant pitch ratio X/d=4, the test results showed that Nusselts number (heat transfer) of the staggered array is higher than the inline array by 13%.  The effect of different depths of the dimple (14.5 mm and 18.5 mm) has been also investigated; a tube with large dimple diameter enhanced the Nusselts number by about 25% for the ran

This paper aims to propose a hybrid approach of two powerful methods, namely the differential transform and finite difference methods, to obtain the solution of the coupled Whitham-Broer-Kaup-Like equations which arises in shallow-water wave theory. The capability of the method to such problems is verified by taking different parameters and initial conditions. The numerical simulations are depicted in 2D and 3D graphs. It is shown that the used approach returns accurate solutions for this type of problems in comparison with the analytic ones.

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

Merging biometrics with cryptography has become more familiar and a great scientific field was born for researchers. Biometrics adds distinctive property to the security systems, due biometrics is unique and individual features for every person. In this study, a new method is presented for ciphering data based on fingerprint features. This research is done by addressing plaintext message based on positions of extracted minutiae from fingerprint into a generated random text file regardless the size of data. The proposed method can be explained in three scenarios. In the first scenario the message was used inside random text directly at positions of minutiae in the second scenario the message was encrypted with a choosen word before ciphering

This paper is concerned with combining two different transforms to present a new joint transform FHET and its inverse transform IFHET. Also, the most important property of FHET was concluded and proved, which is called the finite Hankel – Elzaki transforms of the Bessel differential operator property, this property was discussed for two different boundary conditions, Dirichlet and Robin. Where the importance of this property is shown by solving axisymmetric partial differential equations and transitioning to an algebraic equation directly. Also, the joint Finite Hankel-Elzaki transform method was applied in solving a mathematical-physical problem, which is the Hotdog Problem. A steady state which does not depend on time was discussed f