Two- dimensional numerical simulations are carried out to study the elements of observing a Dirac point source and a Dirac binary system. The essential features of this simulation are demonstrated in terms of the point spread function and the modulation transfer function. Two mathematical equations have been extracted to present, firstly the relationship between the radius of optical telescope and the distance between the central frequency and cut-off frequency of the optical telescope, secondly the relationship between the radius of the optical telescope and the average frequency components of the modulation transfer function.

To ensure fault tolerance and distributed management, distributed protocols are employed as one of the major architectural concepts underlying the Internet. However, inefficiency, instability and fragility could be potentially overcome with the help of the novel networking architecture called software-defined networking (SDN). The main property of this architecture is the separation of the control and data planes. To reduce congestion and thus improve latency and throughput, there must be homogeneous distribution of the traffic load over the different network paths. This paper presents a smart flow steering agent (SFSA) for data flow routing based on current network conditions. To enhance throughput and minimize latency, the SFSA distrib

The physical sports sector in Iraq suffers from the problem of achieving sports achievements in individual and team games in various Asian and international competitions, for many reasons, including the lack of exploitation of modern, accurate and flexible technologies and means, especially in the field of information technology, especially the technology of artificial neural networks. The main goal of this study is to build an intelligent mathematical model to predict sport achievement in pole vaulting for men, the methodology of the research included the use of five variables as inputs to the neural network, which are Avarage of Speed (m/sec in Before distance 05 meters latest and Distance 05 meters latest, The maximum speed achieved in t

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as

Simulation  of  the  Linguistic  Fuzzy Trust  Model  (LFTM)  over  oscillating  Wireless  Sensor Networks (WSNs) where the goodness of the servers belonging to them could change along the time is presented in this paper, and the comparison between the outcomes achieved with LFTM model over oscillating WSNs with the outcomes obtained by applying the model over static WSNs where the servers maintaining always the same goodness, in terms of the selection percentage of trustworthy servers (the accuracy of the model) and the average path length are also presented here. Also in this paper the comparison between the LFTM and the Bio-inspired Trust and Reputation Model for Wireless Sensor Network

In this paper, we investigate and characterize the effects of multi-channel and rendezvous protocols on the connectivity of dynamic spectrum access networks using percolation theory. In particular, we focus on the scenario where the secondary nodes have plenty of vacant channels to choose from a phenomenon which we define as channel abundance. To cope with the existence of multi-channel, we use two types of rendezvous protocols: naive ones which do not guarantee a common channel and advanced ones which do. We show that, with more channel abundance, even with the use of either type of rendezvous protocols, it becomes difficult for two nodes to agree on a common channel, thereby, potentially remaining invisible to each other. We model this in