In the last two decades, networks had been changed according to the rapid changing in its requirements. The current Data Center Networks have large number of hosts (tens or thousands) with special needs of bandwidth as the cloud network and the multimedia content computing is increased. The conventional Data Center Networks (DCNs) are highlighted by the increased number of users and bandwidth requirements which in turn have many implementation limitations. The current networking devices with its control and forwarding planes coupling result in network architectures are not suitable for dynamic computing and storage needs. Software Defined networking (SDN) is introduced to change this notion of traditional networks by decoupling control and

Cognitive radio technology is used to improve spectrum efficiency by having the cognitive radios act as secondary users to access primary frequency bands when they are not currently being used. In general conditions, cognitive secondary users are mobile nodes powered by battery and consuming power is one of the most important problem that facing cognitive networks; therefore, the power consumption is considered as a main constraint. In this paper, we study the performance of cognitive radio networks considering the sensing parameters as well as power constraint. The power constraint is integrated into the objective function named power efficiency which is a combination of the main system parameters of the cognitive network. We prove the exi

Due to the high mobility and dynamic topology of the FANET network, maintaining communication links between UAVs is a challenging task. The topology of these networks is more dynamic than traditional mobile networks, which raises challenges for the routing protocol. The existing routing protocols for these networks partly fail to detect network topology changes. Few methods have recently been proposed to overcome this problem due to the rapid changes of network topology. We try to solve this problem by designing a new dynamic routing method for a group of UAVs using Hybrid SDN technology (SDN and a distributed routing protocol) with a highly dynamic topology. Comparison of the proposed method performance and two other algorithms is simula

Tor (The Onion Routing) network was designed to enable users to browse the Internet anonymously. It is known for its anonymity and privacy security feature against many agents who desire to observe the area of users or chase users’ browsing conventions. This anonymity stems from the encryption and decryption of Tor traffic. That is, the client’s traffic should be subject to encryption and decryption before the sending and receiving process, which leads to delay and even interruption in data flow. The exchange of cryptographic keys between network devices plays a pivotal and critical role in facilitating secure communication and ensuring the integrity of cryptographic procedures. This essential process is time-consuming, which causes del

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

Perhaps masculinity and femininity in our Arabic language are among the linguistic issues that have occupied the attention of researchers, ancient and modern. Many books, works, and research have been written on this subject, but there is still something in it that must be revealed, clarified, and established, as the ancients did not classify the feminine and masculine into real, metaphorical, auditory, analogical,

This paper provides a four-stage Trigonometrically Fitted Improved Runge-Kutta (TFIRK4) method of four orders to solve oscillatory problems, which contains an oscillatory character in the solutions. Compared to the traditional Runge-Kutta method, the Improved Runge-Kutta (IRK) method is a natural two-step method requiring fewer steps. The suggested method extends the fourth-order Improved Runge-Kutta (IRK4) method with trigonometric calculations. This approach is intended to integrate problems with particular initial value problems (IVPs) using the set functions  and   for trigonometrically fitted. To improve the method's accuracy, the problem primary frequency  is used. The novel method is more accurate than the conventional Runge-Ku

This paper is concerned with the quaternary nonlinear hyperbolic boundary value problem (QNLHBVP) studding constraints quaternary optimal classical continuous control vector (CQOCCCV), the cost function (CF), and the equality and inequality quaternary state and control constraints vector (EIQSCCV). The existence of a CQOCCCV dominating by the QNLHBVP is stated and demonstrated using the Aubin compactness theorem (ACTH) under appropriate hypotheses (HYPs). Furthermore, mathematical formulation of the quaternary adjoint equations (QAEs) related to the quaternary state equations (QSE) are discovere  so as its weak form (WF) . The directional derivative (DD) of the Hamiltonian (Ham) is calculated. The necessary and sufficient conditions for

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