The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. This work modernize the feedforward neural network, so the secret message will be encrypted by unsupervised neural network method to get the cipher text that can be decrypted using the same network to get the original text. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding lengths. In this work, the key is the final weights

Began the process of re-engineering processes in the private sector as a way to assist organizations in re-thinking how to run the business in order to improve production processes and reduce operational cost, to get to compete on a global level. That was a major restructuring by further evolution in the use of technology to support innovative operations.

 Entered the technology in all areas of life and different regulations, This led to use as a change in all aspects The companies achieved success and progress today through the use of resources so as to ensure the wishes of the customers and their needs, and the requirements of the market primarily, Which is reflected on the basis of building strate

An adaptive nonlinear neural controller to reduce the nonlinear flutter in 2-D wing is proposed in the paper. The nonlinearities in the system come from the quasi steady aerodynamic model and torsional spring in pitch direction. Time domain simulations are used to examine the dynamic aero elastic instabilities of the system (e.g. the onset of flutter and limit cycle oscillation, LCO). The structure of the controller consists of two models :the modified Elman neural network (MENN) and the feed forward multi-layer Perceptron (MLP). The MENN model is trained with off-line and on-line stages to guarantee that the outputs of the model accurately represent the plunge and pitch motion of the wing and this neural model acts as the identifier. Th

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica^®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

Moment invariants have wide applications in image recognition since they were proposed.

The multiple linear regression model is an important regression model that has attracted many researchers in different fields including applied mathematics, business, medicine, and social sciences , Linear regression models involving a large number of independent variables are poorly performing due to large variation and lead to inaccurate conclusions , One of the most important problems in the regression analysis is the multicollinearity Problem, which is considered one of the most important problems that has become known to many researchers  , As well as their effects on the multiple linear regression model, In addition to multicollinearity, the problem of outliers in data is one of the difficulties in constructing the reg

In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex.