Advanced Non-Intrusive Load Monitoring (NILM) research is important to help reduce energy consumption. Very-low-frequency approaches have traditionally faced challenges in separating appliance uses due to low discriminative information. The richer signatures available in high-frequency electrical data include many harmonic orders that have the potential to advance disaggregation. This has been explored to some extent, but not comprehensively due to a lack of an appropriate public dataset. This paper presents the development of a cost-effective energy monitoring system scalable for multiple entries while producing detailed measurements. We will detail our approach to creating a NILM dataset comprising both aggregate loads and individual appliance measurements, all while ensuring that the dataset is reproducible and accessible. Ultimately, the dataset can be used to validate NILM, and we show through the use of machine learning techniques that high-frequency features improve disaggregation accuracy when compared with traditional methods. This work addresses a critical gap in NILM research by detailing the design and implementation of a data acquisition system capable of generating rich and structured datasets that support precise energy consumption analysis and prepare the essential materials for advanced, real-time energy disaggregation and smart energy management applications.

In many applications, including underwater robotics, the coverage problem requires an autonomous vehicle to systematically explore a defined area while minimizing redundancy and avoiding obstacles. This paper investigates coverage path-planning strategies to enhance the efficiency of underwater gliders particularly in maximizing the probability of detecting a radioactive source while ensuring safe navigation. We evaluate three path-planning approaches: the Traveling Salesman Problem (TSP), Minimum Spanning Tree (MST), and the Optimal Control Problem (OCP). Simulations were conducted in MATLAB R2020a, comparing processing time, uncovered areas, path length, and traversal time. Results indicate that the OCP is preferable when traversal time is constrained, although it incurs significantly higher computational costs. Conversely, MST-based approaches provide faster but fewer optimal solutions. These findings offer insights into selecting appropriate algorithms based on mission priorities, balancing efficiency and computational feasbility.

This paper presents the development of a radiographic characterization method for microshells. In the Laser MegaJoule (LMJ) framework, microshells are tiny plastic spheres used in inertial fusion laser experiments. For this work, these microshells were characterized using low-energy radiography. In the microshell radiographs, phase contrast was noted at the edges of the microshells. The origin of this phenomenon has been identified as sharp variation of gray-scale amplitude due to refraction. Our theoretical model links pixel information with microshell geometry and is used for contour detection and characterization. Finally, an estimation of surface defects described by spherical harmonics is calculated.

In many applications, including underwater robotics, the coverage problem requires an autonomous vehicle to systematically explore a defined area while minimizing redundancy and avoiding obstacles. This paper investigates coverage path planning strategies to enhance the efficiency of underwater gliders, particularly in maximizing the probability of detecting a radioactive source while ensuring safe navigation. We evaluate three path-planning approaches: the Traveling Salesman Problem (TSP), Minimum Spanning Tree (MST), and Optimal Control Problem (OCP). Simulations were conducted in MATLAB, comparing processing time, uncovered areas, path length, and traversal time. Results indicate that OCP is preferable when traversal time is constrained, although it incurs significantly higher computational costs. Conversely, MST-based approaches provide faster but less optimal solutions. These findings offer insights into selecting appropriate algorithms based on mission priorities, balancing efficiency and computational feasibility.