<p>Recently, reconfigurable intelligent surfaces have an increasing role to enhance the coverage and quality of mobile networks especially when the received signal level is very weak because of obstacles and random fluctuation. This motivates the researchers to add more contributions to the fields of reconfigurable intelligent surfaces (RIS) in wireless communications. A substantial issue in reconfigurable intelligent surfaces is the huge overhead for channel state information estimation which limits the system’s performance, oppressively. In this work, a newly proposed method is to estimate the angle of arrival and path loss at the RIS side and then send short information to the base station rather than huge overhe

This article presents a new cascaded extended state observer (CESO)-based sliding-mode control (SMC) for an underactuated flexible joint robot (FJR). The control of the FJR has many challenges, including coupling, underactuation, nonlinearity, uncertainties and external disturbances, and the noise amplification especially in the high-order systems. The proposed control integrates the CESO and SMC, in which the CESO estimates the states and disturbances, and the SMC provides the system robustness to the uncertainty and disturbance estimation errors. First, a dynamic model of the FJR is derived and converted from an underactuated form to a canonical form via the Olfati transformation and a flatness approach, which reduces the complexity of th

In cognitive radio networks, there are two important probabilities; the first probability is important to primary users called probability of detection as it indicates their protection level from secondary users, and the second probability is important to the secondary users called probability of false alarm which is used for determining their using of unoccupied channel. Cooperation sensing can improve the probabilities of detection and false alarm. A new approach of determine optimal value for these probabilities, is supposed and considered to face multi secondary users through discovering an optimal threshold value for each unique detection curve then jointly find the optimal thresholds. To get the aggregated throughput over transmission

This article studies the nonlocal inverse boundary value problem for a rectangular domain, a second-order, elliptic equation and a two-dimensional equation. The main objective of the article is to find the unidentified coefficient and provide a solution to the problem. The two-dimensional second-order, convection equation is solved directly using the finite difference method (FDM). However, the inverse problem was successfully solved the MATLAB subroutine lsqnonlin from the optimization toolbox after reformulating it as a nonlinear regularized least-square optimization problem with a simple bound on the unknown quantity. Considering that the problem under study is often ill-posed and that even a small error in the input data can hav

Were arranged this study on two sections, which included first section comparison between markets proposed through the use of transport models and the use of the program QSB for less costs , dependant the optimal solution  to chose the suggested market  to locate new market that achieve lower costs in the transport of goods from factories (ALRasheed ,ALAmeen , AlMaamun ) to points of sale, but the second part has included comparison of all methods of transport (The least cost method ,Vogels method , Results Approximations method , Total method) depending on the agenda of transport, which includes the market proposed selected from the first section and choose the way in which check the solution first best suited in terms

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]).