With wireless sensor network (WSN) wide applications in popularity, securing its data becomes a requirement. This can be accomplished by encrypting sensor node data. In this paper a new an efficient symmetric cryptographic algorithm is presented. This algorithm is called wireless sensor network wavelet curve ciphering system (WSN-WCCS).  The algorithm idea based on discrete wavelet transformation to generate keys for each node in WSN.  It implements on hierarchical clustering WSN using LEACH protocol. Python programming language version 2.7 was used to create the simulator of WSN framework and implement a WSN-WCCS algorithm. The simulation result of the proposed WSN-WCCS with other symmetric algorithms has show

At the level of both individuals and companies, Wireless Sensor Networks (WSNs) get a wide range of applications and uses. Sensors are used in a wide range of industries, including agriculture, transportation, health, and many more. Many technologies, such as wireless communication protocols, the Internet of Things, cloud computing, mobile computing, and other emerging technologies, are connected to the usage of sensors. In many circumstances, this contact necessitates the transmission of crucial data, necessitating the need to protect that data from potential threats. However, as the WSN components often have constrained computation and power capabilities, protecting the communication in WSNs comes at a significant performance pena

             It is the regression analysis is the foundation stone of knowledge of statistics , which mostly depends on the ordinary least square method , but as is well known that the way the above mentioned her several conditions to operate accurately and the results can be unreliable , add to that the lack of certain conditions make it impossible to complete the work and analysis method and among those conditions are the multi-co linearity problem , and we are in the process of detected that problem between the independent variables using farrar –glauber test , in addition to the requirement linearity data and the lack of the condition last has been resorting to the

The aim of this research is to construct a three-dimensional maritime transport model to transport nonhomogeneous goods (k) and different transport modes (v) from their sources (i) to their destinations (j), while limiting the optimum quantities v ijk x to be transported at the lowest possible cost v ijk c and time v ijk t using the heuristic algorithm, Transport problems have been widely studied in computer science and process research and are one of the main problems of transport problems that are usually used to reduce the cost or times of transport of goods with a number of sources and a number of destinations and by means of transport to meet the conditions of supply and demand. Transport models are a key tool in logistics an

The effect of different Ti additions on the microstructure of Al-Ti alloy prepared by powder metallurgy was investigated. A certain amount of Ti (10wt%, 15wt%, and 20wt%) were added to aluminium and the tests like microhardness, density, scanning electron microscope (SEM), optical microscope (OM) and X-Ray Diffraction (XRD) were conducted to determine the influence of different Ti additives on the Al-Ti alloy properties and microstructure. The results show that the grains of α-Al changed from large grains to roughly spherical and then to small rounded grains with increasing Ti content, the micro-hardness of the alloy increases with increasing Ti, and XRD results confirm the formation of TiAl₃ intermetallic co

Breast cancer (BC) is first of the top 10 malignancies in Iraq. Dose‐volume histograms (DVHs) are most commonly used as a plan evaluation tool. This study aimed to assess DVH statistics using three‐dimensional conformal radiotherapies in BC in an adjuvant setting.

       The most popular medium that being used by people on the internet nowadays is video streaming.  Nevertheless, streaming a video consumes much of the internet traffics. The massive quantity of internet usage goes for video streaming that disburses nearly 70% of the internet. Some constraints of interactive media might be detached; such as augmented bandwidth usage and lateness. The need for real-time transmission of video streaming while live leads to employing of Fog computing technologies which is an intermediary layer between the cloud and end user. The latter technology has been introduced to alleviate those problems by providing high real-time response and computational resources near to the

     This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type:  ,            and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.

The development of the internet of things (IoT) and the internet of robotics (IoR) are becoming more and more involved with our daily lives. It serves a variety of tasks some of them are essential to us. The main objective of SRR is to develop a surveillance system for detecting suspicious and targeted places for users without any loss of human life. This paper shows the design and implementation of a robotic surveillance platform for real-time monitoring with the help of image processing, which can explorer places of difficult access or high risk. The robotic live streaming is via two cameras, the first one is fixed straight on the road and the second one is dynamic with tilt-pan ability. All cameras have image processing capabilities t

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C