XXXX

 A particle swarm optimization algorithm and neural network like self-tuning PID controller for CSTR system is presented. The scheme of the discrete-time PID control structure is based on neural network and tuned the parameters of the PID controller by using a particle swarm optimization PSO technique as a simple and fast training algorithm. The proposed method has advantage that it is not necessary to use a combined structure of identification and decision because it used PSO. Simulation results show the effectiveness of the proposed adaptive PID neural control algorithm in terms of minimum tracking error and smoothness control signal obtained for non-linear dynamical CSTR system.

        The research deals with the analysis of the city's commercial center using geographic information systems to solve the problem of congestion by evaluating the efficiency and adequacy of car parking lots according to local and Arab standards. Undoubtedly, the importance of car parking areas, as they are not within the desired efficiency within the city, will lead to congestion and traffic becomes very difficult. Thus, the transportation service loses its most important characteristic, which is the ease of movement. Therefore, there has become an urgent need to study and analyze it, as well as to verify the adequacy of the service, and the amount of deficit required to be provided to solve the tra

Simplification of new fashion design methods

Massive multiple-input multiple-output (m-MIMO) is considered as an essential technique to meet the high data rate requirements of future sixth generation (6G) wireless communications networks. The vast majority of m-MIMO research has assumed that the channels are uncorrelated. However, this assumption seems highly idealistic. Therefore, this study investigates the m-MIMO performance when the channels are correlated and the base station employs different antenna array topologies, namely the uniform linear array (ULA) and uniform rectangular array (URA). In addition, this study develops analyses of the mean square error (MSE) and the regularized zero-forcing (RZF) precoder under imperfect channel state information (CSI) and a realist

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith