In the last years of the twentieth century, scholars solidly focused on paradiplomacy as a study subject, linking it to federalism and decentralised systems. In the Arab world, which has 22 countries, a few states have adopted federalism or decentralisation. Only five countries, i.e., 22.7%, have adopted federalism and decentralised experience. Therefore, limited research and academic work has been conducted regarding paradiplomacy. This paper aims to research the relationship between federalism and paradiplomacy conceptually and practically and then analyse the Arab experiences in federalism and whether they applied paradiplomacy and succeeded in doing so. To explore that, the paper studies and compares the related articles of constitution

In the last years of the twentieth century, scholars solidly focused on paradiplomacy as a study subject, linking it to federalism and decentralised systems. In the Arab world, which has 22 countries, a few states have adopted federalism or decentralisation. Only five countries, i.e., 22.7%, have adopted federalism and decentralised experience. Therefore, limited research and academic work has been conducted regarding paradiplomacy. This paper aims to research the relationship between federalism and paradiplomacy conceptually and practically and then analyse the Arab experiences in federalism and whether they applied paradiplomacy and succeeded in doing so. To explore that, the paper studies and compares the related articles of constitution

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

In this paper, we derive and prove the stability bounds of the momentum coefficient µ and the learning rate ? of the back propagation updating rule in Artificial Neural Networks .The theoretical upper bound of learning rate ? is derived and its practical approximation is obtained

The speech recognition system has been widely used by many researchers using different
methods to fulfill a fast and accurate system. Speech signal recognition is a typical
classification problem, which generally includes two main parts: feature extraction and
classification. In this paper, a new approach to achieve speech recognition task is proposed by
using transformation techniques for feature extraction methods; namely, slantlet transform
(SLT), discrete wavelet transforms (DWT) type Daubechies Db1 and Db4. Furthermore, a
modified artificial neural network (ANN) with dynamic time warping (DTW) algorithm is
developed to train a speech recognition system to be used for classification and recognition
purposes. T

Artificial Neural Networks (ANN) is one of the important statistical methods that are widely used in a range of applications in various fields, which simulates the work of the human brain in terms of receiving a signal, processing data in a human cell and sending to the next cell. It is a system consisting of a number of modules (layers) linked together (input, hidden, output). A comparison was made between three types of neural networks (Feed Forward Neural Network (FFNN), Back propagation network (BPL), Recurrent Neural Network (RNN). he study found that the lowest false prediction rate was for the recurrentt network architecture and using the Data on graduate students at the College of Administration and Economics, Univer

: The need for means of transmitting data in a confidential and secure manner has become one of the most important subjects in the world of communications. Therefore, the search began for what would achieve not only the confidentiality of information sent through means of communication, but also high speed of transmission and minimal energy consumption, Thus, the encryption technology using DNA was developed which fulfills all these requirements [1]. The system proposes to achieve high protection of data sent over the Internet by applying the following objectives: 1. The message is encrypted using one of the DNA methods with a key generated by the Diffie-Hellman Ephemeral algorithm, part of this key is secret and this makes the pro

The main objective of this paper is to designed algorithms and implemented in the construction of the main program designated for the determination the tenser product of representation for the special linear group.