This paper proposes improving the structure of the neural controller based on the identification model for nonlinear systems. The goal of this work is to employ the structure of the Modified Elman Neural Network (MENN) model into the NARMA-L2 structure instead of Multi-Layer Perceptron (MLP) model in order to construct a new hybrid neural structure that can be used as an identifier model and a nonlinear controller for the SISO linear or nonlinear systems. Two learning algorithms are used to adjust the parameters weight of the hybrid neural structure with its serial-parallel configuration; the first one is supervised learning algorithm based Back Propagation Algorithm (BPA) and the second one is an intelligent algorithm n

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]).

A novel design and implementation of a cognitive methodology for the on-line auto-tuning robust PID controller in a real heating system is presented in this paper. The aim of the proposed work is to construct a cognitive control methodology that gives optimal control signal to the heating system, which achieve the following objectives: fast and precise search efficiency in finding the on- line optimal PID controller parameters in order to find the optimal output temperature response for the heating system. The cognitive methodology (CM) consists of three engines: breeding engine based Routh-Hurwitz criterion stability, search engine based particle
swarm optimization (PSO) and aggregation knowledge engine based cultural algorithm (CA)

The Boltzmann transport equation is solved by using two- terms approximation for pure gases . This method of solution is used to calculate the electron energy distribution function and electric transport parameters were evaluated in the range of E/N varying from . 172152110./510.VcmENVcm
From the results we can conclude that the electron energy distribution function of CF4 gas is nearly Maxwellian at (1,2)Td, and when E/N increase the distribution function is non Maxwellian. Behavior of electrons transport parameters is nearly from the experimental results in references. The drift velocity of electron in carbon tetraflouride is large compared with other gases

The Boltzmann transport equation is solved by using two- terms approximation for pure gases and mixtures. This method of solution is used to calculate the electron energy distribution function and electric transport parameters were evaluated in the range of E/N varying from . 172152110./510.VcmENVcm
The electron energy distribution function of CF4 gas is nearly Maxwellian at (1,2)Td, and when E/N increase the distribution function is non Maxwellian. Also, the mixtures are have different energy values depending on transport energy between electron and molecule through the collisions. Behavior of electrons transport parameters is nearly from the experimental results in references. The drift velocity of electron in carbon tetraflouride i

There are large numbers of weakness in the generated keys of security algorithms. This paper includes a new algorithm to generate key of 5120 bits for a new proposed cryptography algorithm for 10 rounds that combine neural networks and chaos theory (1D logistic map). Two methods of neural networks (NN) are employed as Adaline and Hopfield and the results are combined through several sequential operation. Carefully integrating high quality random number generators from neural networks and chaos theory to obtain suitable key for randomness and complexity.

Home Computer and Information Science 2009 Chapter The Stochastic Network Calculus Methodology Deah J. Kadhim, Saba Q. Jobbar, Wei Liu & Wenqing Cheng Chapter 568 Accesses 1 Citations Part of the Studies in Computational Intelligence book series (SCI,volume 208) Abstract The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochastic network calculus by deriving a network service curve, which expresses the service given to a flow by the network as a whole in terms of a probabilistic bound. The presented network service curve permits the calculation of statistical end-to-end delay and backlog bounds for broad

Classification of network traffic is an important topic for network management, traffic routing, safe traffic discrimination, and better service delivery. Traffic examination is the entire process of examining traffic data, from intercepting traffic data to discovering patterns, relationships, misconfigurations, and anomalies in a network. Between them, traffic classification is a sub-domain of this field, the purpose of which is to classify network traffic into predefined classes such as usual or abnormal traffic and application type. Most Internet applications encrypt data during traffic, and classifying encrypted data during traffic is not possible with traditional methods. Statistical and intelligence methods can find and model traff

Abstract

          The project of balad's major sewerage system is one of the biggest projects who is still in progress in salahulddin province provincial - development plan that was approved in 2013 . This project works in two parts ; the 1st is installing the sewerage networks (both of heavy sewerage & rain sewerage) and the 2nd is installing the     life – off units (for heavy sewerage & rain sewerage , as well) . the directorate of salahuiddin is aiming that at end of construction it will be able to provide services for four residential quarters , one of the main challenges that project's  management  experience is how to achieve thes

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a