New types of hydrodesulfurization (HDS) catalyst Re-Ni-Mo/ γ-Al₂O₃ was prepared and tested separately with two prepared conventional HDS catalysts (Ni-Mo/ γ-Al₂O₃ and Co-Mo//γ-Al₂O₃) by using a pilot plant hydrotreatment unit. Activities of three prepared hydrodesulfurization catalysts were examined in hydrodesulfurization (HDS) of atmospheric gas oil at different temperatures 275 to 350 °C and LHSV 1 to 4 h^-1, the reactions conducted under constant pressure 40 bar and H₂/HC ratio 500 ml/ml .Moreover, the hydrogenation of aromatic (HAD) in gas oil has been studied. HDS was much improved by adding promoter Re to the Ni-Mo/Al₂O₃

New types of hydrodesulfurization (HDS) catalyst Re-Ni-Mo/ γ-Al2O3 was prepared and tested separately with two prepared conventional HDS catalysts (Ni-Mo/ γ-Al2O3 and Co-Mo//γ-Al2O3) by using a pilot plant hydrotreatment unit. Activities of three prepared hydrodesulfurization catalysts were examined in hydrodesulfurization (HDS) of atmospheric gas oil at different temperatures 275 to 350 °C and LHSV 1 to 4 h-1, the reactions conducted under constant pressure 40 bar and H2/HC ratio 500 ml/ml .Moreover, the hydrogenation of aromatic (HAD) in gas oil has been studied. HDS was much improved by adding promoter Re to the Ni-Mo/Al2O3 catalyst. The results showed that Re-Ni-Mo/ γ-Al2O3 have more activity in desulfurization than Ni-Mo//γ-Al2O3

The Optical Fiber sensor based on the Surface Plasmon Resonance (SPR) technology has
been a successful performance sensing and presents high sensitivity. This thesis investigates the
performance of several structure of SPR sensor in field of refractive index and chemical
applications. A structure of Multi-Mode Fiber- Single Mode Fiber- Multi Mode Fiber (MMFSMF-MMF)

Routing is the process of delivering a packet from a source to a destination in the network using a routing algorithm that tries to create an efficient path. The path should be created with minimum overhead and bandwidth consumption. In literature, routing protocols in VANET were categorized in many ways, according to different aspects. In the present study, we prefer the classification based on the number of hops to reach the destination node. In literature, these are single-hop and multi-hops protocols. We first discuss the two types and then compare the MDDV (multi-hops protocol) with VADD (single-hop protocol). The comparison is theoretically and experimentally implemented by providing a network environment consisting of SUMO, VIENS and

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a

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

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

The method of solving volterra integral equation by using numerical solution is a simple operation but to require many memory space to compute and save the operation. The importance of this equation appeares new direction to solve the equation by using new methods to avoid obstacles. One of these methods employ neural network for obtaining the solution.

This paper presents a proposed method by using cascade-forward neural network to simulate volterra integral equations solutions. This method depends on training cascade-forward neural network by inputs which represent the mean of volterra integral equations solutions, the target of cascade-forward neural network is to get the desired output of this network. Cascade-forward neural