The optimum separators operating pressure is determined by using flash calculations and equilibrium ratios. In this study, the optimum separator size for Jambur field is calculated by using equations introduced by Arnold and Stewart and API12J Specification [1]. Because Jambur field has a high production rate two conditions are taken in the study to determine separator size, first based on production rate 80,000 bbl/day and second based on split the production between two banks A and B (40,000 bbl/day for each bank). The calculation resulted in optimum separator pressure for the first stage of 700 psi, and the second stage of 300 psi, and the third stage of 120 psi. The results show that as the number of stages increased above three-stag

The research seeks to study the subject (Media separation: the Relationship of Arab Immigrants with the Media of the Countries of Diaspora/ Sweden as a model). Where this phenomenon, "problem" has not been subjected to an in-depth study to find out the causes of this media separation and its repercussions on the immigrant, whether in the problem of integration, or his opportunity to work, or adapt to live in the new society.

Separation is a kind of word that is rarely used in Arabic media studies, relevant, sometimes, to the meaning of “refraining from watching TV or listening to the radio or reading newspapers”. Sometimes, it means “not tuning to or using any form of media like radios or newspapers to be updated about what

<span>Digital audio is required to transmit large sizes of audio information through the most common communication systems; in turn this leads to more challenges in both storage and archieving. In this paper, an efficient audio compressive scheme is proposed, it depends on combined transform coding scheme; it is consist of i) bi-orthogonal (tab 9/7) wavelet transform to decompose the audio signal into low &amp; multi high sub-bands, ii) then the produced sub-bands passed through DCT to de-correlate the signal, iii) the product of the combined transform stage is passed through progressive hierarchical quantization, then traditional run-length encoding (RLE), iv) and finally LZW coding to generate the output mate bitstream.

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

The purpose of this paper is to consider fibrewise near versions of the more important separation axioms of ordinary topology namely fibrewise near T0 spaces, fibrewise near T1 spaces, fibrewise near R0 spaces, fibrewise near Hausdorff spaces, fibrewise near functionally Hausdorff spaces, fibrewise near regular spaces, fibrewise near completely regular spaces, fibrewise near normal spaces and fibrewise near functionally normal spaces. Also we give several results concerning it.

The aim of the research is to apply fibrewise multi-emisssions of the paramount separation axioms of normally topology namely fibrewise multi-T0. spaces, fibrewise multi-T1 spaces, fibrewise multi-R0 spaces, fibrewise multi-Hausdorff spaces, fibrewise multi-functionally Hausdorff spaces, fibrewise multi-regular spaces, fibrewise multi-completely regular spaces, fibrewise multi-normal spaces and fibrewise multi-functionally normal spaces. Also we give many score regarding it.