Artificial neural network based photovoltaic fault detection algorithm integrating two bi-directional input parameters

In this paper, a fault detection algorithm for photovoltaic systems based on artificial neural networks (ANN) is proposed. Numerous literatures can be found on the topic of PV fault detection through the implementation of artificial intelligence. The novel part of this research is the successful development, deployment and validation of a fault detection PV system using radial basis function (RBF), requiring only two parameters as the input to the ANN (solar irradiance and output power). The results obtained through the testing of the developed ANN on a PV installation of 2.2 kW capacity, provided an accuracy of 97.9%. To endorse the accuracy of the newly developed algorithm, the ANN was tested on another PV system, installed at a remote location. The total capacity of the new system was significantly higher, 4.16 kW. A vital part of the test was to see how the proposed ANN would perform with ‘scaled-up’ input data, during normal operation as well as partial shading scenarios. The validation process provided an overall fault detection accuracy of above 97%. The decrease in accuracy was due to the varying nature of the two systems in terms of total capacity, number of samples and type of faults

Hybrid Multicore/vectorisation technique applied to the elastic wave equation on a staggered grid

In modern physics it has become common to find the solution of a problem by solving numerically a set of PDEs. Whether solving them on a finite difference grid or by a finite element approach, the main calculations are often applied to a stencil structure. In the last decade it has become usual to work with so called big data problems where calculations are very heavy and accelerators and modern architectures are widely used. Although CPU and GPU clusters are often used to solve such problems, parallelisation of any calculation ideally starts from a single processor optimisation. Unfortunately, it is impossible to vectorise a stencil structured loop with high level instructions. In this paper we suggest a new approach to rearranging the data structure which makes it possible to apply high level vectorisation instructions to a stencil loop and which results in significant acceleration. The suggested method allows further acceleration if shared memory APIs are used. We show the effectiveness of the method by applying it to an elastic wave propagation problem on a finite difference grid. We have chosen Intel architecture for the test problem and OpenMP (Open Multi-Processing) since they are extensively used in many applications

A hybrid machine learning approach for prediction of conversion from mild cognitive impairment to dementia

Mild cognitive impairment (MCI) represents a precursor to dementia for many individuals; however, some forms of MCI tend to remain stable over time and do not progress to dementia. In fact, conversion rates vary substantially depending on the diagnostic criteria used and the nature of the analytic sample and clinical setting. To identify personalized strategies to prevent or slow the progression of dementia and to support the clinical development of novel treatments, we need to develop new approaches for modelling disease progression that can differentiate between progressive and non-progressive MCI subjects. The aim of this study was to develop a novel prognostic machine learning (ML) framework utilising longitudinal information encoded in efficient, cost-effective, and non-invasive markers to identify MCI subjects that are at risk for developing dementia. Our approach was developed using the dataset from the National Alzheimer’s Coordinating Center. We built two prognostic models based on the patient data from 3 (n = 768) (Model 1) and 4 (n = 409) (Model 2) assessment visits. A novel hybrid prognostic approach, using cognitive trajectory classes, generated through unsupervised learning (Stage 1), as input in supervised ML models (Stage 2), was developed and systematically tested. Our unsupervised learning approach (Stage 1) involved: (i) the implementation of the longitudinal data partitioning method allowing for clustering trajectories based on their shapes; (ii) validation of the optimal number of clusters using three different Clustering Validity Indices (CVIs), and (iii) application of the fusion-based methods for combining CVIs into the fused normalized CVI scores, averaged for each cluster partition to determine the final number of trajectory classes for each type of clinical scores. In Stage 2, we built four types of prognostic models based on random forest (RF), Support Vector Machines (SVM), logistic regression (LR), and kNN ensemble approaches. Classification models incorporating both clinical scores and cognitive trajectory classes input showed up to 6.5 % higher accuracy than models based only on clinical scores (p < 0.05 in all cases). Given the patient data from three time points (Model 1), the highest recorded prediction accuracy was achieved for the ensemble and RF model, i.e., 85.0 % (standard deviation: 3.1 %) and 84.6 % (4.1 %) respectively. Using the patient data from four time points (Model 2), the highest accuracy was reported for RF and ensemble models, i.e., 87.5 % (6.1 %) and 86.8 % (3.7 %) respectively. We showed that the incorporation of the output of unsupervised learning significantly improved the performance of supervised ML models. Our prognostic framework can be applied to improve recruitment in clinical trials and to select early interventions for individuals at high risk of developing dementia