Free Space Optical (FSO) technology offers highly directional, high bandwidth communication channels. This technology can provide fiber-like data rate over short distances. In order to improve security associated with data transmission in FSO networks, a secure communication method based on chaotic technique is presented. In this paper, we have turned our focus on a specific class of piece wise linear one-dimensional chaotic maps. Simulation results indicate that this approach has the advantage of possessing excellent correlation property. In this paper we examine the security vulnerabilities of single FSO links and propose a solution to this problem by implementing the chaotic signal generator “reconfigurable tent map”. As synchronizat

Classification of imbalanced data is an important issue. Many algorithms have been developed for classification, such as Back Propagation (BP) neural networks, decision tree, Bayesian networks etc., and have been used repeatedly in many fields. These algorithms speak of the problem of imbalanced data, where there are situations that belong to more classes than others. Imbalanced data result in poor performance and bias to a class without other classes. In this paper, we proposed three techniques based on the Over-Sampling (O.S.) technique for processing imbalanced dataset and redistributing it and converting it into balanced dataset. These techniques are (Improved Synthetic Minority Over-Sampling Technique (Improved SMOTE),  Border

An experimental analysis was included to study and investigate the mass transport behavior of cupric ions reduction as the main reaction in the presence of 0.5M H₂SO₄ by weight difference technique (WDT). The experiments were carried out by electrochemical cell with a rotating cylinder electrode as cathode. The impacts of different operating conditions on mass transfer coefficient were analyzed such as rotation speeds 100-500 rpm, electrolyte temperatures 30-60 , and cupric ions concentration 250-750 ppm. The order of copper reduction reaction was investigated and it shows a first order reaction behavior. The mass transfer coefficient for the described system was correlated with the aid of dimensionless groups as fo

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

Discriminant between groups is one of the common procedures because of its ability to analyze many practical phenomena, and there are several methods can be used for this purpose, such as linear and quadratic discriminant functions. recently, neural networks is used as a tool to distinguish between groups.

In this paper the simulation is used to compare neural networks and classical method for classify observations to group that is belong to, in case of some variables that don’t follow the normal distribution. we use the proportion of number of misclassification observations to the all observations as a criterion of comparison.  

 This paper adapted the neural network for the estimating of the direction of arrival (DOA). It uses an unsupervised adaptive neural network with GHA algorithm to extract the principal components that in turn, are used by Capon method to estimate the DOA, where by the PCA neural network we take signal subspace only and use it in Capon (i.e. we will ignore the noise subspace, and take the signal subspace only).

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

The maintenance of the diesel engine parts in any electric power station contains many problems that lead to stopping. Several reasons lead to such problems; these reasons should be analyzed and evaluated in order to eliminate their effects. This paper is based on evaluation of the main causes that lead to diesel engine injector failure as a main part of electric power stations, using fault tree analysis (FTA). The FTA is the most broadly utilized strategies in the industrial area to perform reliability analysis of complex designing frameworks. A fault tree is a logical representation of the relationship of basic events that lead to a given unwanted event (i.e., top event).

Starting with introducing the FTA and how it could be uti