The finishing operation of the electrochemical finishing technology (ECF) for tube of steel was investigated In this study. Experimental procedures included qualitative
and quantitative analyses for surface roughness and material removal. Qualitative analyses utilized finishing optimization of a specific specimen in various design and operating conditions; value of gap from 0.2 to 10mm, flow rate of electrolytes from 5 to 15liter/min, finishing time from 1 to 4min and the applied voltage from 6 to 12v, to find out the value of surface roughness and material removal at each electrochemical state. From the measured material removal for each process state was used to verify the relationship with finishing time of work piece. Electrochemi

The calculation of the oil density is more complex due to a wide range of pressuresand temperatures, which are always determined by specific conditions, pressure andtemperature. Therefore, the calculations that depend on oil components are moreaccurate and easier in finding such kind of requirements. The analyses of twenty liveoil samples are utilized. The three parameters Peng Robinson equation of state istuned to get match between measured and calculated oil viscosity. The Lohrenz-Bray-Clark (LBC) viscosity calculation technique is adopted to calculate the viscosity of oilfrom the given composition, pressure and temperature for 20 samples. The tunedequation of state is used to generate oil viscosity values for a range of temperatu

Several correlations have been proposed for bubble point pressure, however, the correlations could not predict bubble point pressure accurately over the wide range of operating conditions. This study presents Artificial Neural Network (ANN) model for predicting the bubble point pressure especially for oil fields in Iraq. The most affecting parameters were used as the input layer to the network. Those were reservoir temperature, oil gravity, solution gas-oil ratio and gas relative density. The model was developed using 104 real data points collected from Iraqi reservoirs. The data was divided into two groups: the first was used to train the ANN model, and the second was used to test the model to evaluate their accuracy and trend stability

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

In data mining, classification is a form of data analysis that can be used to extract models describing important data classes. Two of the well known algorithms used in data mining classification are Backpropagation Neural Network (BNN) and Naïve Bayesian (NB). This paper investigates the performance of these two classification methods using the Car Evaluation dataset. Two models were built for both algorithms and the results were compared. Our experimental results indicated that the BNN classifier yield higher accuracy as compared to the NB classifier but it is less efficient because it is time-consuming and difficult to analyze due to its black-box implementation.

Mobile ad hoc network security is a new area for research that it has been faced many difficulties to implement. These difficulties are due to the absence of central authentication server, the dynamically movement of the nodes (mobility), limited capacity of the wireless medium and the various types of vulnerability attacks. All these factor combine to make mobile ad hoc a great challenge to the researcher. Mobile ad hoc has been used in different applications networks range from military operations and emergency disaster relief to community networking and interaction among meeting attendees or students during a lecture. In these and other ad hoc networking applications, security in the routing protocol is necessary to protect against malic

Imitation learning is an effective method for training an autonomous agent to accomplish a task by imitating expert behaviors in their demonstrations. However, traditional imitation learning methods require a large number of expert demonstrations in order to learn a complex behavior. Such a disadvantage has limited the potential of imitation learning in complex tasks where the expert demonstrations are not sufficient. In order to address the problem, we propose a Generative Adversarial Network-based model which is designed to learn optimal policies using only a single demonstration. The proposed model is evaluated on two simulated tasks in comparison with other methods. The results show that our proposed model is capable of completing co