This paper presents a hybrid energy resources (HER) system consisting of solar PV, storage, and utility grid. It is a challenge in real time to extract maximum power point (MPP) from the PV solar under variations of the irradiance strength.  This work addresses challenges in identifying global MPP, dynamic algorithm behavior, tracking speed, adaptability to changing conditions, and accuracy. Shallow Neural Networks using the deep learning NARMA-L2 controller have been proposed. It is modeled to predict the reference voltage under different irradiance. The dynamic PV solar and nonlinearity have been trained to track the maximum power drawn from the PV solar systems in real time.

Moreover, the proposed controller i

Abstract 

For sparse system identification,recent suggested algorithms are  -norm Least Mean Square (  -LMS), Zero-Attracting LMS (ZA-LMS), Reweighted Zero-Attracting LMS (RZA-LMS), and p-norm LMS (p-LMS) algorithms, that have modified the cost function of the conventional LMS algorithm by adding a constraint of coefficients sparsity. And so, the proposed algorithms are named  -ZA-LMS, 

A novel fractal design scheme has been introduced in this paper to generate microstrip bandpass filter designs with miniaturized sizes for wireless applications. The presented fractal scheme is based on Minkowski-like prefractal geometry. The space-filling property and self-similarity of this fractal geometry has found to produce reduced size symmetrical structures corresponding to the successive iteration levels. The resulting filter designs are with sizes suitable for use in modern wireless communication systems. The performance of each of the generated bandpass filter structures up to the 2^nd iteration has been analyzed using a method of moments (MoM) based software IE3D, which is widely adopted in microwave research and in

In recent years, observed focus greatly on gold nanoparticles synthesis due to its unique properties and tremendous applicability. In most of these researches, the citrate reduction method has been adopted. The aim of this study was to prepare and optimize monodisperse ultrafine particles by addition of reducing agent to gold salt, as a result of seed mediated growth mechanism. In this research, gold nanoparticles suspension (G) was prepared by traditional standard Turkevich method and optimized by studying different variables such as reactants concentrations, preparation temperature and stirring rate on controlling size and uniformity of nanoparticles through preparing twenty formulas (G1-G20). Subsequently, the selected formula that pr

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed