Predicting energy consumption in Smart Buildings (SB), and scheduling it, is crucial for deploying Energy-efficient Management Systems. Most important, this constitutes a key aspect in the promising Smart Grids technology, whereby loads need to be predicted and scheduled in real-time to cope for the strongly coupled variance between energy demand and cost. Several approaches and models have been adopted for energy consumption prediction and scheduling. In this paper, we investigated available models and opted for machine learning. Namely, we use Artificial Neural Networks (ANN) along with Genetic Algorithms. We deployed our models in a real-world SB testbed. We used CompactRIO for ANN implementation. The proposed models are trained and validated using real-world data collected from a PV installation along with SB electrical appliances. Though our model exhibited a modest prediction accuracy, which is due to the small size of the data set, we strongly recommend our model as a blue-print for researchers willing to deploy real-world SB testbeds and investigate machine learning as a promising venue for energy consumption prediction and scheduling.
1 December 2020 in Advances in Science, Technology and Engineering Systems Journal
Increases in power demand and consumption are very noticeable. This increase presents a number of challenges to the traditional grid systems. Thus, there is the need to come up with a new solution that copes with the stringent demand on energy and provides better power quality, which gives a better experience to the end users. This is how the concept of smart grids (SG) came to light. SGs have been introduced to better monitor and control the power produced and consumed. In addition to this, SGs help with reducing the electricity bill through the integration of renewable energy sources. The underlying smartness of the SGs resides in the flow of information in addition to the flow of energy. Information/data flowing implies the use of smart sensors and smart meters that sense and send data about the power produced and consumed, and the data about the environment where they are deployed. This makes SGs a direct application of IoT. In this paper, we are implementing an edge platform that is based on single-board computers (SBCs) to process data stemming from SG. The use of SBCs is driven by the energy efficiency and cost effectiveness concepts that the SG is trying to apply. The platform in question is tested against a distributed job that averages random numbers using Hadoop’s MapReduce programming model. The SBC that we are using in this implementation is the NVIDIA Jetson Developer Kit. The results of this work show that a cluster of SBCs is low-cost, easy to maintain, and simple to deploy, which makes it a great candidate for providing edge computing. Although it revealed a performance that beat the one of the remote cloud servers, it could not outperform the single-computer edge platform.
In the realm of computer science and optimization, matrices are fundamental components with a significant role across diverse applications. Matrix multiplication stands as a pivotal operation, and enhancing the efficiency of serial matrix multiplication algorithms holds key importance. This project focuses on optimizing matrix multiplication on a single computing device by exploring algorithmic approaches and optimization techniques. Matrices provide structured data representation, serving purposes ranging from dataset representation, data transformation in computer graphics, image processing, physical system modeling, to mathematical equation solving. This project concentrates specifically on algorithms for matrix multiplication. The standard algorithm computes matrix entries by directly multiplying corresponding input entries, though its efficiency degrades for larger matrices due to its high time complexity. Other algorithms like Strassen's algorithm reduce multiplications or exploit parallelism for efficiency. They employ techniques like divide-and-conquer, fast matrix multiplication, and parallel processing. In this work, these algorithms are analyzed in terms of their concepts, time complexities, and advantages. Practical performance factors like matrix size, hardware architecture, memory needs, cache efficiency, and arithmetic complexity are also explored. Through benchmarking and evaluation on standard platforms, insights into their strengths and weaknesses regarding speed and resource utilization are sought. The ultimate goal is to elevate the efficiency of serial matrix multiplication algorithms in computer science and optimization. By studying and implementing a spectrum of algorithms, the project contributes to optimizing computations and enhancing matrix operation performance across scientific and engineering domains.
Nowadays, Genomic data constitutes one of the fastest growing datasets in the world. As of 2025, it is supposed to become the fourth largest source of Big Data, and thus mandating adequate high-performance computing (HPC) platform for processing. With the latest unprecedented and unpredictable mutations in severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), the research community is in crucial need for ICT tools to process SARS-CoV-2 RNA data, e.g., by classifying it (i.e., clustering) and thus assisting in tracking virus mutations and predict future ones. In this paper, we are presenting an HPC-based SARS-CoV-2 RNAs clustering tool. We are adopting a data science approach, from data collection, through analysis, to visualization. In the analysis step, we present how our clustering approach leverages on HPC and the longest common subsequence (LCS) algorithm. The approach uses the Hadoop MapReduce programming paradigm and adapts the LCS algorithm in order to efficiently compute the length of the LCS for each pair of SARS-CoV-2 RNA sequences. The latter are extracted from the U.S. National Center for Biotechnology Information (NCBI) Virus repository. The computed LCS lengths are used to measure the dissimilarities between RNA sequences in order to work out existing clusters. In addition to that, we present a comparative study of the LCS algorithm performance based on variable workloads and different numbers of Hadoop worker nodes.