This paper proposes a self organizing fuzzy controller as an enhancement level of the fuzzy controller. The adjustment mechanism provides explicit adaptation to tune and update the position of the output membership functions of the fuzzy controller. Simulation results show that this controller is capable of controlling a non-linear time varying system so that the performance of the system improves so as to reach the desired state in a less number of samples.

In modern years, internet and computers were used by many nations all overhead the world in different domains. So the number of Intruders is growing day-by-day posing a critical problem in recognizing among normal and abnormal manner of users in the network. Researchers have discussed the security concerns from different perspectives. Network Intrusion detection system which essentially analyzes, predicts the network traffic and the actions of users, then these behaviors will be examined either anomaly or normal manner. This paper suggested Deep analyzing system of NIDS to construct network intrusion detection system and detecting the type of intrusions in traditional network. The performance of the proposed system was evaluated by using

In this paper, a self-tuning adaptive neural controller strategy for unknown nonlinear system is presented. The system considered is described by an unknown NARMA-L2 model and a feedforward neural network is used to learn the model with two stages. The first stage is learned off-line with two configuration serial-parallel model & parallel model to ensure that model output is equal to actual output of the system & to find the jacobain of the system. Which appears to be of critical importance parameter as it is used for the feedback controller and the second stage is learned on-line to modify the weights of the model in order to control the variable parameters that will occur to the system. A back propagation neural network is appl

This article will introduce a new iteration method called the zenali iteration method for the approximation of fixed points. We show that our iteration process is faster than the current leading iterations  like Mann, Ishikawa, oor, D- iterations, and *-  iteration for new contraction mappings called  quasi contraction mappings. And we  proved that all these iterations (Mann, Ishikawa, oor, D- iterations and *-  iteration) equivalent to approximate fixed points of  quasi contraction. We support our analytic proof by a numerical example, data dependence result for contraction mappings type  by employing zenali iteration also discussed.

      In this paper, we introduced module that satisfying strongly -condition modules and strongly -type modules as generalizations of t-extending. A module  is said strongly -condition if for every submodule of  has a complement which is fully invariant direct summand. A module   is said to be strongly -type modules if every t-closed submodule has a complement which is a fully invariant direct summand. Many characterizations for modules with strongly -condition for strongly -type module are given. Also many connections between these types of module and some related types of modules are investigated.

In this paper, we present an approximate method for solving integro-differential equations of multi-fractional order by using the variational iteration method.
First, we derive the variational iteration formula related to the considered problem, then prove its convergence to the exact solution. Also we give some illustrative examples of linear and nonlinear equations.

This article investigates how an appropriate chaotic map (Logistic, Tent, Henon, Sine...) should be selected taking into consideration its advantages and disadvantages in regard to a picture encipherment. Does the selection of an appropriate map depend on the image properties? The proposed system shows relevant properties of the image influence in the evaluation process of the selected chaotic map. The first chapter discusses the main principles of chaos theory, its applicability to image encryption including various sorts of chaotic maps and their math. Also this research explores the factors that determine security and efficiency of such a map. Hence the approach presents practical standpoint to the extent that certain chaos maps will bec

A submoduleA of amodule M is said to be strongly pure , if for each finite subset {ai} in A , (equivalently, for each a ?A) there exists ahomomorphism f : M ?A such that f(ai) = ai, ?i(f(a)=a).A module M is said to be strongly F–regular if each submodule of M is strongly pure .The main purpose of this paper is to develop the properties of strongly F–regular modules and study modules with the property that the intersection of any two strongly pure submodules is strongly pure .

              -convex sets and -convex functions, which are considered as an important class of generalized convex sets and convex functions, have been introduced and studied by Youness [5] and other researchers. This class has recently extended, by Youness, to strongly -convex sets and strongly -convex functions. In these generalized classes, the definitions of the classical convex sets and convex functions are relaxed and introduced with respect to a mapping . In this paper, new properties of strongly -convex sets are presented. We define strongly -convex hull, strongly -convex cone, and strongly -convex cone hull and we proof some of their properties.  Some examples to illustrate the aforementioned concepts and to cl