In the present investigation, bed porosity and solid holdup in viscous three-phase inverse fluidized bed (TPIFB) are determined for aqueous solutions of carboxy methyl cellulose (CMC) system using polyethylene and polypropylene as  a particles with low-density and diameter (5 mm) in a (9.2 cm) inner diameter with height (200 cm) of vertical perspex column. The effectiveness of gas velocity U_g , liquid velocity U_L, liquid viscosity μ_L, and particle density ρ_s on bed porosity B_P and solid holdups ε_g were determined. The bed porosity increases with "increasing gas velocity", "liquid velocity", and "liquid viscosity". Solid holdup decreases with increasing gas, liquid

In this paper, we investigate the automatic recognition of emotion in text. We perform experiments with a new method of classification based on the PPM character-based text compression scheme. These experiments involve both coarse-grained classification (whether a text is emotional or not) and also fine-grained classification such as recognising Ekman’s six basic emotions (Anger, Disgust, Fear, Happiness, Sadness, Surprise). Experimental results with three datasets show that the new method significantly outperforms the traditional word-based text classification methods. The results show that the PPM compression based classification method is able to distinguish between emotional and nonemotional text with high accuracy, between texts invo

In many oil fields only the BHC logs (borehole compensated sonic tool) are available to provide interval transit time (Δtp), the reciprocal of compressional wave velocity VP.

   To calculate the rock elastic or inelastic properties, to detect gas-bearing formations, the shear wave velocity VS is needed. Also VS is useful in fluid identification and matrix mineral identification.

   Because of the lack of wells with shear wave velocity data, so many empirical models have been developed to predict the shear wave velocity from compressional wave velocity. Some are mathematical models others used the multiple regression method and neural network technique.

   In this study a number of em

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

The health of Roadway pavement surface is considered as one of the major issues for safe driving. Pavement surface condition is usually referred to micro and macro textures which enhances the friction between the pavement surface and vehicular tires, while it provides a proper drainage for heavy rainfall water. Measurement of the surface texture is not yet standardized, and many different techniques are implemented by various road agencies around the world based on the availability of equipment’s, skilled technicians’ and funds. An attempt has been made in this investigation to model the surface macro texture measured from sand patch method (SPM), and the surface micro texture measured from out flow time (OFT) and British pendul

NEACADEMY's JOURNALS

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

Many industrial systems involve multiple criteria and objectives, and they are very complex problems in computational science, such as task scheduling. We propose bi-criteria and bi-objective scheduling problems, which are solved by two nature-inspired evolutionary algorithms, such as Simulated Annealing (SA) and Bee Algorithm (BA). This problem is characterized by scheduling a batch of tasks on multiple machines, and it is fundamental because the solution should focus on the simultaneous optimization of two conflicting objectives: the makespan minimization and the total tardiness minimization. This problem is NP-Hard, and therefore, two evolutionary methods were used to search for solutions intelligently in this huge, very complex