The important device in the Wireless Sensor Network (WSN) is the Sink Node (SN). That is used to store, collect and analyze data from every sensor node in the network. Thus the main role of SN in WSN makes it a big target for traffic analysis attack. Therefore, securing the SN position is a substantial issue. This study presents Security for Mobile Sink Node location using Dynamic Routing Protocol called (SMSNDRP), in order to increase complexity for adversary trying to discover mobile SN location. In addition to that, it minimizes network energy consumption. The proposed protocol which is applied on WSN framework consists of 50 nodes with static and mobile SN. The results havw shown in each round a dynamic change in the route to reach mobi

Abstract 

The catalytic cracking conversion of Iraqi vacuum gas oil was studied on large and medium pore size (HY, HX, ZSM-22 and ZSM-11) of zeolite catalysts. These catalysts were prepared locally and used in the present work. The catalytic conversion performed on a continuous fixed-bed laboratory reaction unit. Experiments were performed in the temperature range of 673 to 823K, pressure range of 3 to 15bar, and LHSV range of 0.5-3h^-1. The results show that the catalytic conversion of vacuum gas oil increases with increase in reaction temperature and decreases with increase in LHSV. The catalytic activity for the proposed catalysts arranged in the following order:

HY>H

This study presents the multi criteria single-machine model. The machine scheduling problem (MSP) for ntasks on a single machine involves minimizing a function of three criteria: total completion time (C_j),maximum earliest (E_max), and tardiness (〖ΣT〗_j), This is an NP-hard issue. Within this work's theoretical section, we present the mathematical formulation of The presented topic thenhighlights the usefulness of the dominance rule (DR), which may be used to develop effective solutions. Whilein the practical part, one of the important exact methods; The proposed MSP tricriteria are solved by applyingthe Branch and Bound (BAB) method, which finds a set of efficient solutions for 1//F(ΣC_j ,ΣT_j ,E_max) upto n=100 jobs. The BAB appro

<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi

Human posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can pre