This paper deals with an up to date problem for oil and gas industry- separation of the gas -fluid fogs. Here is described the worked out physical model of the gas movement process in the sections of the inertial filtering (IF) gas separators. One can find the mathematical model for research of the fields of velocities and pressures in the inertial curvilinear channel. The main simplifications and assumptions are explained. This mathematical model has been made using mathematical program Maple and it is received the 3-d graphic of the distribution componential speed parts in the channel and also 2-d graphics at the channel sectional view when the flow is flat. The new method for gas - fluid systems separation is suggested.

Visualization of water flow around different bluff bodies at different Reynolds number ranging (1505 - 2492) was realized by designing and building a test rig which contains an open channel capable to ensure water velocity range (4-8cm/s) in this channel. Hydrogen bubbles generated from the ionized water using DC power supply are visualized by a light source and photographed by a digital camera. Flow pattern around a circular disk of (3.6cm) diameter and (3mm) thickness, a sphere of (3.8cm) diameter and a cylinder of
(3.2cm) diameter and (10cm) length are studied qualitatively. Parameters of the vortex ring generated in the wake region of the disk and the separation angle of water stream lines from the surface of the sphere are plott

A simple, fast, selective of a new flow injection analysis method coupled with potentiometric detection was used to determine vitamin B1 in pharmaceutical formulations via the prepared new selective membranes. Two electrodes were constructed for the determination of vitamin B1 based on the ion-pair vitamin B1-phosphotungestic acid (B1-PTA) in a poly (vinyl chloride) supported with a plasticized di-butyl phthalate (DBPH) and di-butyl phosphate (DBP). Applications of these ion selective electrodes for the determination of vitamin B1 in the pharmaceutical preparations for batch and flow injection systems were described. The ion selective membrane exhibited a near-Nernstian slope values 56.88 and 58.53 mV / decade, with the linear dy

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

Digital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le