Search

In this paper, an intelligent approach to the Short-Term Wind Power Prediction (STWPP) problem is considered, with the use of various types of Deep Neural Networks (DNNs). The impact of the prediction time horizon length on accuracy, and the influence of temperature on prediction effectiveness have been analyzed. Three types of DNNs have been implemented and tested, including: CNN (Convolutional Neural Networks), GRU (Gated Recurrent Unit), and H-MLP (Hierarchical Multilayer Perceptron). The DNN architectures are part of the Deep Learning Prediction (DLP) framework that is applied in the Deep Learning Power Prediction System (DLPPS). The system is trained based on data that comes from a real wind farm. This is significant because the prediction results strongly depend on weather conditions in specific locations. The results obtained from the proposed system, for the real data, are presented and compared. The best result has been achieved for the GRU network. The key advantage of the system is a high effectiveness prediction using a minimal subset of parameters. The prediction of wind power in wind farms is very important as wind power capacity has shown a rapid increase, and has become a promising source of renewable energies. [ABSTRACT FROM AUTHOR]

In the verification of identity, the aim is to increase effectiveness and reduce involvement of verified users. A good compromise between these issues is ensured by dynamic signature verification. The dynamic signature is represented by signals describing the position of the stylus in time. They can be used to determine the velocity or acceleration signal. Values of these signals can be analyzed, interpreted, selected, and compared. In this paper, we propose an approach that: (a) uses an evolutionary algorithm to create signature partitions in the time and velocity domains; (b) selects the most characteristic partitions in terms of matching with reference signatures; and (c) works individually for each user, eliminating the need of using skilled forgeries. The proposed approach was tested using Biosecure DS2 database which is a part of the DeepSignDB, a database with genuine dynamic signatures. Our simulations confirmed the correctness of the adopted assumptions. [ABSTRACT FROM AUTHOR]

Population Based Algorithms (PBAs) are excellent search tools that allow searching space of parameters defined by problems under consideration. They are especially useful when it is difficult to define a differentiable evaluation criterion. This applies, for example, to problems that are a combination of continuous and discrete (combinatorial) problems. In such problems, it is often necessary to select a certain structure of the solution (e.g. a neural network or other systems with a structure usually selected by the trial and error method) and to determine the parameters of such structure. As PBAs have great application possibilities, the aim is to develop more and more effective search formulas used in them. An interesting approach is to use multiple populations and process them with separate PBAs (in a different way). In this paper, we propose a new multi-population-based algorithm with: (a) subpopulation evaluation and (b) replacement of the associated PBAs subpopulation formulas used for their processing. In the simulations, we used a set of typical CEC2013 benchmark functions. The obtained results confirm the validity of the proposed concept. [ABSTRACT FROM AUTHOR]