Non-orthogonal Multiple Access (NOMA) is a multiple-access technique allowing multiusers to share the same communication resources, increasing spectral efficiency and throughput. NOMA has been shown to provide significant performance gains over orthogonal multiple access (OMA) regarding spectral efficiency and throughput. In this paper, two scenarios of NOMA are analyzed and simulated, involving two users and multiple users (four users) to evaluate NOMA's performance. The simulated results indicate that the achievable sum rate for the two users’ scenarios is 16.7 (bps/Hz), while for the multi-users scenario is 20.69 (bps/Hz) at transmitted power of 25 dBm. The BER for two users’ scenarios is 0.004202 and 0.001564 for

 Abstract 

The vegetative filter strips (VFS) are a useful tool used for reducing the movement of sediment and pesticide in therivers. The filter strip’s soil can help in reducing the runoff volume by infiltration. However, the characteristics of VFS (i.e., length) are not recently identified depending on the estimation of VFS modeling performance. The aim of this research is to study these characteristics and determine acorrelation between filter strip length and percent reduction (trapping efficiency) for sediment, water, and pesticide. Two proposed pesticides(one has organic carbon sorption coefficient, K_oc, of 147 L/kg which is more moveable than XXXX, and another one

       In this work, we prove that the triple linear partial differential equations (PDEs) of elliptic type (TLEPDEs) with a given classical continuous boundary control vector (CCBCVr) has a unique "state" solution vector (SSV)  by utilizing the Galerkin's method (GME). Also, we prove the existence of a classical continuous boundary optimal control vector (CCBOCVr) ruled by the TLEPDEs. We study the existence solution for the triple adjoint equations (TAJEs) related with the triple state equations (TSEs). The Fréchet derivative (FDe) for the objective function is derived. At the end we prove the necessary "conditions" theorem (NCTh) for optimality for the problem.

A common field development task is the object of the present research by specifying the best location of new horizontal re-entry wells within AB unit of South Rumaila Oil Field. One of the key parameters in the success of a new well is the well location in the reservoir, especially when there are several wells are planned to be drilled from the existing wells. This paper demonstrates an application of neural network with reservoir simulation technique as decision tool. A fully trained predictive artificial feed forward neural network (FFNNW) with efficient selection of horizontal re-entry wells location in AB unit has been carried out with maintaining a reasonable accuracy. Sets of available input data were collected from the exploited g

Computer systems and networks are being used in almost every aspect of our daily life, the security threats to computers and networks have increased significantly. Usually, password-based user authentication is used to authenticate the legitimate user. However, this method has many gaps such as password sharing, brute force attack, dictionary attack and guessing. Keystroke dynamics is one of the famous and inexpensive behavioral biometric technologies, which authenticate a user based on the analysis of his/her typing rhythm. In this way, intrusion becomes more difficult because the password as well as the typing speed must match with the correct keystroke patterns. This thesis considers static keystroke dynamics as a transparent layer of t

The aim of this paper is to design fast neural networks to approximate periodic functions, that is, design a fully connected networks contains links between all nodes in adjacent layers which can speed up the approximation times, reduce approximation failures, and increase possibility of obtaining the globally optimal approximation. We training suggested network by Levenberg-Marquardt training algorithm then speeding suggested networks by choosing most activation function (transfer function) which having a very fast convergence rate for reasonable size networks.             In all algorithms, the gradient of the performance function (energy function) is used to determine how to

I n  this  paper ,we 'viii  consider  the density  questions  associC;lted with  the single  hidden layer feed forward  model. We proved  that a FFNN   with   one   hidden   layer  can   uniformly   approximate   any continuous  function  in C(k)(where k is a compact set in R11 ) to any required accuracy.

However, if the set of basis function is dense then the ANN's can has al most one hidden layer. But if the set of basis function  non-dense, then we  need more  hidden layers. Also, we have shown  that there exist  localized functions and that there is no t

Its well known that understanding human facial expressions is a key component in understanding emotions and finds broad applications in the field of human-computer interaction (HCI), has been a long-standing issue. In this paper, we shed light on the utilisation of a deep convolutional neural network (DCNN) for facial emotion recognition from videos using the TensorFlow machine-learning library from Google. This work was applied to ten emotions from the Amsterdam Dynamic Facial Expression Set-Bath Intensity Variations (ADFES-BIV) dataset and tested using two datasets.

    With the freedom offered by the Deep Web, people have the opportunity to express themselves freely and discretely, and sadly, this is one of the reasons why people carry out illicit activities there. In this work, a novel dataset for Dark Web active domains known as crawler-DB is presented. To build the crawler-DB, the Onion Routing Network (Tor) was sampled, and then a web crawler capable of crawling into links was built. The link addresses that are gathered by the crawler are then classified automatically into five classes. The algorithm built in this study demonstrated good performance as it achieved an accuracy of 85%. A popular text representation method was used with the proposed crawler-DB crossed by two different supervise