Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm testing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11

Autonomous Closed-Loop Experimental Characterization and Dynamic Model Validation of a Scaled Underwater Kite

This paper presents the closed-loop experimental framework and dynamic model validation for a 1/12-scale underwater kite design. The pool-based tow testing framework described herein, which involves a fully actuated, closed-loop controlled kite and flexible tether, significantly expands upon the capabilities of any previously developed open-source framework for experimental underwater kite characterization. Specifically, the framework has allowed for the validation of three closed-loop flight control strategies, along with a critical comparison between dynamic model predictions and experimental results. In this paper, we provide a detailed presentation of the experimental tow system and kite setup, describe the control algorithms implemented and tested, and quantify the level of agreement between our multi-degree-of-freedom kite dynamic model and experimental data. Finally, we also present a sensitivity analysis that helps to identify the most influential parameters to kite performance and further explain the remaining mismatches between the model and data.

42 ENGINEERING↗

Comparison of Machine Learning and Deep Learning for View Identification from Cardiac Magnetic Resonance Images

Background: Artificial intelligence is increasingly utilized to aid in the interpretation of cardiac magnetic resonance (CMR) studies. One of the first steps is the identification of the imaging plane depicted, which can be achieved by both deep learning (DL) and classical machine learning (ML) techniques without user input. We aimed to compare the accuracy of ML and DL for CMR view classification and to identify potential pitfalls during training and testing of the algorithms. Methods: To train our DL and ML algorithms, we first established datasets by retrospectively selecting 200 CMR cases. The models were trained using two different cohorts (passively and actively curated) and applied data augmentation to enhance training. Once trained, the models were validated on an external dataset, consisting of 20 cases acquired at another center. We then compared accuracy metrics and applied class activation mapping (CAM) to visualize DL model performance. Results: The DL and ML models trained with the passively-curated CMR cohort were 99.1% and 99.3% accurate on the validation set, respectively. However, when tested on the CMR cases with complex anatomy, both models performed poorly. After training and testing our models again on all 200 cases (active cohort), validation on the external dataset resulted in 95% and 90% accuracy, respectively. The CAM analysis depicted heat maps that demonstrated the importance of carefully curating the datasets to be used for training. Conclusions: Both DL and ML models can accurately classify CMR images, but DL outperformed ML when classifying images with complex heart anatomy.

artificial intelligence↗

HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware

In order to characterize and benchmark computational hardware, software, and algorithms, it is essential to have many problem instances on-hand. This is no less true for quantum computation, where a large collection of real-world problem instances would allow for benchmarking studies that in turn help to improve both algorithms and hardware designs. To this end, here we present a large dataset of qubit-based quantum Hamiltonians. The dataset, called HamLib (for Hamiltonian Library), is freely available online and contains problem sizes ranging from 2 to 1000 qubits. HamLib includes problem instances of the Heisenberg model, Fermi-Hubbard model, Bose-Hubbard model, molecular electronic structure, molecular vibrational structure, MaxCut, Max- k -SAT, Max- k -Cut, QMaxCut, and the traveling salesperson problem. The goals of this effort are (a) to save researchers time by eliminating the need to prepare problem instances and map them to qubit representations, (b) to allow for more thorough tests of new algorithms and hardware, and (c) to allow for reproducibility and standardization across research studies.

97 MATHEMATICS AND COMPUTING↗

Advection algorithms for quantum neutrino moment transport

Neutrino transport in compact objects is an inherently challenging multidimensional problem. Here, this difficulty is compounded if one includes flavor transformation—an intrinsically quantum phenomenon requiring one to follow the coherence between flavors and thus necessitating the introduction of complex numbers. To reduce the computational burden, simulations of compact objects that include neutrino transport often make use of momentum-angle-integrated moments (the lowest order ones being commonly referred to as the energy density and flux) and these quantities can be generalized to include neutrino flavor, i.e., they become quantum moments. Numerous finite-volume approaches to solving the moment evolution equations for classical neutrino transport have been developed based on solving a Riemann problem at cell interfaces. In this paper we describe our generalization of a Riemann solver for quantum moments, specifically decomposing complex numbers in terms of a (signed) magnitude and phase instead of real and imaginary parts. We then test our new algorithm in numerous cases showing a neutrino fast flavor instability, varying from toy models with analytic solutions to snapshots from neutron star merger simulations. Compared to previous algorithms for neutrino transport with flavor mixing, we find uniformly smaller growth rates of the flavor transformation along with concomitantly larger length-scales, and that the results are a better match with the growth rates seen from multiangle codes.

79 ASTRONOMY AND ASTROPHYSICS↗

The Dark Energy Survey supernova programme: modelling selection efficiency and observed core-collapse supernova contamination

ABSTRACT The analysis of current and future cosmological surveys of Type Ia supernovae (SNe Ia) at high redshift depends on the accurate photometric classification of the SN events detected. Generating realistic simulations of photometric SN surveys constitutes an essential step for training and testing photometric classification algorithms, and for correcting biases introduced by selection effects and contamination arising from core-collapse SNe in the photometric SN Ia samples. We use published SN time-series spectrophotometric templates, rates, luminosity functions, and empirical relationships between SNe and their host galaxies to construct a framework for simulating photometric SN surveys. We present this framework in the context of the Dark Energy Survey (DES) 5-yr photometric SN sample, comparing our simulations of DES with the observed DES transient populations. We demonstrate excellent agreement in many distributions, including Hubble residuals, between our simulations and data. We estimate the core collapse fraction expected in the DES SN sample after selection requirements are applied and before photometric classification. After testing different modelling choices and astrophysical assumptions underlying our simulation, we find that the predicted contamination varies from 7.2 to 11.7 per cent, with an average of 8.8 per cent and an r.m.s. of 1.1 per cent. Our simulations are the first to reproduce the observed photometric SN and host galaxy properties in high-redshift surveys without fine-tuning the input parameters. The simulation methods presented here will be a critical component of the cosmology analysis of the DES photometric SN Ia sample: correcting for biases arising from contamination, and evaluating the associated systematic uncertainty.

79 ASTRONOMY AND ASTROPHYSICS↗

Autonomous System Subversion Tactics: Prototypes and Recommended Countermeasures

One of the fielding requirements for Advanced and Small Modular Reactors (AR/SMR) is the ability to support remote and autonomous operations. Autonomous Control Systems (ACS) are found on platforms such as Autonomous Space Vehicles, Cruise Missiles, and advanced driver-assistance systems. Each of these ACS implementations depends upon a set of decision support subsystems responsible for supporting Autonomous Mission Managers (names vary based upon field and author preferences). These Autonomous Mission Managers receive inputs from system sensors (e.g., LIDAR collection from an automobile travelling down a street; transients from a nuclear reactor), and perform a set of classifications (e.g., Red Traffic Light; Small Pedestrian at 10m; Load Rejection; Single Coolant Pump Trip), and then use these classifications in combination with recommendation algorithms to achieve platform goals (e.g., Stop the Vehicle at the Traffic Light, Avoid the Small Pedestrian; Trip the Reactor to prevent a Safety Event). The design, implementation, and fielding of an ACS capability will alter the cyber-attack surface such that existing risk management plans will need to be updated to include how to protect and defend against data-science and decision-support-system attack classes. These attack classes would include protection of the design and training environments where algorithm selection and testing and training data would be obvious attack vectors. These attack classes would also require an informed set of detection and response procedures to identify anomalous behaviors and document best practices for anomaly assessment and vulnerability mitigation and remediation. Last year we published a Cyber Threat Assessment Methodology for Autonomous and Remote Operations for AR/SMRs along with a companion publication on Cyber Attack and Defense Use Cases. The focus of the methodology was on describing and enumerating ACS processes, components, and functions such that security engineers could: evaluate subversion options against the target; identify threat actor attributes and capabilities derived from each subversion option; and identify security controls and response countermeasures. The Use Cases document offered detailed methodology examples including an assessment of a Military Base SMR, an Autonomous System Decision Loop, and implementation of AR/SMR Machine Learning algorithms. Our proposal at the end of last year was to focus on implementation of subversion prototypes related to the last Use Case area: AR/SMR Machine Learning (ML) Algorithms. We included six attack scenarios in our Use Cases paper: a Poisoning Attack against ML functions implemented using an FPGA; a Trojaning Attack against ML classifiers exploiting the excitability of Nuclear Engineers; a Backdooring Attack against ML Training environments to ensure persistence of an attack vector; a False Positive Evasion Attack against multi-factor Access Control Systems using clever inputs; an Inference Attack against ML models by an Insider with access to the Operational environment; and an Adversarial Reprogramming Attack against a Material Access Control Video Surveillance System. At the beginning of this year these six attack scenarios were provided to our research teams at Georgia Tech and Idaho State University and each team successfully implemented a subversion attack against a ML implementation to include transient misclassifications. While this is a notable outcome from this type of research, this paper offers the reader insight into not only how to structure and execute these types of attacks, but into the thought process behind how the researcher investigated the problem space, performed initial algorithm implementation, and the trial-and-error behind arriving at the successful subversion prototypes. We include in this paper a set of associated Scenarios on how these subversion prototypes could be implemented and an initial set of guidance for AR/SMR architects, Nuclear Regulators, and Cyber Defenders to implement awareness and defense capabilities into their current operational portfolios.

42 ENGINEERING↗

A Decision-Making Machine Learning Approach in Hermite Spectral Approximations of Partial Differential Equations

The accuracy and effectiveness of Hermite spectral methods for the numerical discretization of partial differential equations on unbounded domains are strongly affected by the amplitude of the Gaussian weight function employed to describe the approximation space. This is particularly true if the problem is under-resolved, i.e., there are no enough degrees of freedom. The issue becomes even more crucial when the equation under study is time-dependent, forcing in this way the choice of Hermite functions where the corresponding weight depends on time. In order to adapt dynamically the approximation space, it is here proposed an automatic decision-making process that relies on machine learning techniques, such as deep neural networks and support vector machines. The algorithm is numerically tested with success on a simple 1D problem, but the main goal is its exportability in the context of more serious applications. Here we also show at the end an application in the framework of plasma physics.

97 MATHEMATICS AND COMPUTING↗

Energy-efficient multimodal mobility networks in transportation digital twins: Strategies and optimization

The study proposes a comprehensive Transportation Mobility (TransitMo) framework covering conceptual design, model formulation, optimization, simulation, and impact analysis of the transportation mobility system. TransitMo is composed of a transportation digital twin developed in Simulation of Urban MObility (SUMO) and an Intelligent Traffic Management and Control Center (ITMCC) that identifies the best ways to improve the movement of people within urban areas using various modes of transportation. This study encompasses advanced modeling techniques, algorithms, and strategic testing to optimize energy efficiency and mobility in a multimodal shared mobility network. TransitMo’s practical applications are exemplified through a city-scaled simulation network in Chattanooga, TN, employing demographic data to analyze historical traffic patterns and forecast future demands. Central to this methodology are three models: the User Preference Model (UP), the Energy Consumption Model (EC), and the System Optimization Model (SO). These models work in concert to iteratively devise the optimal travel incentives and minimize the total system cost in a real-time manner. In conclusion, test results verified that the proposed adaptive incentive program and optimized bus scheduling can improve network performance by increasing public transit ridership.

42 ENGINEERING↗

Regulation of the central safety factor and normalized beta under low NBI torque in DIII-D

An algorithm has been designed to simultaneously control the central safety factor (q 0 ) and normalized beta (β N ) while ensuring near-zero torque from the neutral beam injection in DIII-D. Feedback control of q 0 and β N in tokamaks can be beneficial due to the close relationship that these variables have with plasma performance and magneto-hydrodynamic stability. In addition, low neutral-beam-torque conditions are of special interest in present devices because future burning-plasma tokamaks such as ITER will most likely operate at very low plasma rotation. The control synthesis of the algorithm presented in this work is based on a linearized, one-dimensional (1D) model of the current-profile dynamics coupled with a zero-dimensional (0D) plasma-energy balance. The actuators considered are neutral beam injection and electron-cyclotron heating and current drive, and discrete logic determines the neutral-beam injection powers that deliver near-zero torque. Here, the algorithm has been tested in nonlinear, 1D simulations using COTSIM (Control-Oriented Transport SIMulator) and in DIII-D experiments, demonstrating satisfactory performance.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Evaluation of Atmospheric Boundary Layer Height From Wind Profiling Radar and Slab Models and Its Responses to Seasonality of Land Cover, Subsidence, and Advection

In this study, we evaluated the effect of land cover, atmospheric subsidence, and advection on the annual dynamics of atmospheric boundary layer (ABL) height from two contrasting sites. The first site is the Walker Branch forest, a deciduous forest of temperate climate, complex topography, and cloudy summers. The second site is the Sacramento-San Joaquin River Delta, a site of Mediterranean climate, flat terrain on a local scale, and clear summers. After testing a new algorithm to calculate ABL heights from 915 MHz radar wind profilers, we evaluated a hierarchy of three slab models to recreate the diurnal and annual patterns of ABL growth. We found that the lower ABL heights in the Delta, particularly during late summer, are driven by the combined effects of increased atmospheric subsidence and marine air advection. In both sites, the annual pattern of ABL height was strongly correlated to total daily incoming radiation, and in the Delta, the annual pattern of ABL height closely followed the seasonal patterns of sensible heat flux from a mosaic of different land covers. A land composite of latent and sensible heat fluxes obtained through a meso-network of eddy covariance measurements and the ECOsystem Spaceborne Thermal Radiometer Experiment on Space Station (ECOSTRESS) mission resulted in higher model skill, thus showing that land cover heterogeneity is an important driver of ABL growth. To conclude, model simulations show that in the Delta, restoring agricultural land to wetlands with large open water areas could result in a reduction of ABL height during those months with low subsidence and advection.

54 ENVIRONMENTAL SCIENCES↗

Cric searchable image database as a public platform for conventional pap smear cytology data

Amidst the current health crisis and social distancing, telemedicine has become an important part of mainstream of healthcare, and building and deploying computational tools to support screening more efficiently is an increasing medical priority. The early identification of cervical cancer precursor lesions by Pap smear test can identify candidates for subsequent treatment. However, one of the main challenges is the accuracy of the conventional method, often subject to high rates of false negative. While machine learning has been highlighted to reduce the limitations of the test, the absence of high-quality curated datasets has prevented strategies development to improve cervical cancer screening. The Center for Recognition and Inspection of Cells (CRIC) platform enables the creation of CRIC Cervix collection, currently with 400 images (1,376 × 1,020 pixels) curated from conventional Pap smears, with manual classification of 11,534 cells. This collection has the potential to advance current efforts in training and testing machine learning algorithms for the automation of tasks as part of the cytopathological analysis in the routine work of laboratories.

59 BASIC BIOLOGICAL SCIENCES↗

A synthetic building operation dataset

Abstract This paper presents a synthetic building operation dataset which includes HVAC, lighting, miscellaneous electric loads (MELs) system operating conditions, occupant counts, environmental parameters, end-use and whole-building energy consumptions at 10-minute intervals. The data is created with 1395 annual simulations using the U.S. DOE detailed medium-sized reference office building, and 30 years’ historical weather data in three typical climates including Miami, San Francisco, and Chicago. Three energy efficiency levels of the building and systems are considered. Assumptions regarding occupant movements, occupants’ diverse temperature preferences, lighting, and MELs are adopted to reflect realistic building operations. A semantic building metadata schema - BRICK, is used to store the building metadata. The dataset is saved in a 1.2 TB of compressed HDF5 file. This dataset can be used in various applications, including building energy and load shape benchmarking, energy model calibration, evaluation of occupant and weather variability and their influences on building performance, algorithm development and testing for thermal and energy load prediction, model predictive control, policy development for reinforcement learning based building controls.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Verification of a fully implicit particle-in-cell method for the <!--${MathJax: TeX-AMS-MML_HTMLorMML}--> v &#x2225; -formalism of electromagnetic gyrokinetics in the XGC code

A fully implicit particle-in-cell method for handling the v ∥ -formalism of electromagnetic gyrokinetics has been implemented in XGC. By choosing the v ∥ -formalism, here we avoid introducing the nonphysical skin terms in Ampère's law, which are responsible for the well-known “cancellation problem” in the p ∥ -formalism. The v ∥ -formalism, however, is known to suffer from a numerical instability when explicit time integration schemes are used due to the appearance of a time derivative in the particle equations of motion from the inductive component of the electric field. Here, using the conventional δf scheme, we demonstrate that our implicitly discretized algorithm can provide numerically stable simulation results with accurate dispersive properties. We verify the algorithm using a test case for shear Alfvén wave propagation in addition to a case demonstrating the ion temperature gradient-kinetic ballooning mode (ITG-KBM) transition. The ITG-KBM transition case is compared to results obtained from other δf gyrokinetic codes/schemes, whose verification has already been archived in the literature.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantifying uncertainties on fission fragment mass yields with mixture density networks

Probabilistic machine learning techniques can learn both complex relations between input features and output quantities of interest as well as take into account stochasticity or uncertainty within a data set. In this initial work, we explore the use of one such probabilistic network, the mixture density network (MDN), to reproduce fission yields and their uncertainties. In this paper, we study mass yields for the spontaneous fission of 252 Cf, exploring the number of training samples needed for converged predictions, how different levels of uncertainty propagate from the training set to the MDN predictions, and how well physical constraints of the yields—such as normalization and symmetry—are upheld by the algorithm. Finally, we test the ability of the MDN to interpolate between and extrapolate beyond samples in the training set using energy-dependent mass yields for the neutron-induced fission on 235 U. The MDN provides a reliable way to include and predict uncertainties and is a promising path forward for supplementing sparse sets of nuclear data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Long-Range Biometric Identification in Real World Scenarios: A Comprehensive Evaluation Framework Based on Missions

The considerable body of data available for evaluating biometric recognition systems in Research and Development (R&D) environments has contributed to the increasingly common problem of target performance mismatch. Biometric algorithms are frequently tested against data that may not reflect the real world applications they target. From a Testing and Evaluation (T&E) standpoint, this domain mismatch causes difficulty assessing when improvements in State-of-the-Art (SOTA) research actually translate to improved applied outcomes. This problem can be addressed with thoughtful preparation of data and experimental methods to reflect specific use-cases and scenarios.To that end, this paper evaluates research solutions for identifying individuals at ranges and altitudes, which could support various application areas such as counterterrorism, protection of critical infrastructure facilities, military force protection, and border security. We address challenges including image quality issues and reliance on face recognition as the sole biometric modality. By fusing face and body features, we propose developing robust biometric systems for effective long-range identification from both the ground and steep pitch angles. Preliminary results show promising progress in whole-body recognition. This paper presents these early findings and discusses potential future directions for advancing long-range biometric identification systems based on mission-driven metrics.

Aykac, Deniz↗

Non-Intrusive Appliance Identification with Appliance-Specific Networks

The problem of noninstrusive load monitoring (NILM) is usually formulated as a single-channel blind source separation task, whose successful solution enable fast and convenient load identification and energy disaggregation. When applied at test time, NILM algorithms aim to identify the operating characteristics of individual appliances from an aggregate power measurement of the entire house. Recent advances in deep learning gave rise to many methods that mostly focus on learning a direct mapping from aggregate measurement to individual appliance power. However, these methods are not only computationally expensive, but they often suffer from overfitting and do not generalize very well. In this article, we propose a novel NILM method that leverages advances in statistical learning that have not been properly applied in this domain before. The proposed method consists of three stages: first, a Bayesian nonparametric learning-based approach for appliance state extraction; second, synthetic minority oversampling technique for data augmentation and mitigating the heavy imbalance in switching events; and third, appliance-specific lightweight long short-term memory networks for status classification for each appliance. Here, we adopt a “differential” input (the difference before and after the switching event) to reduce the complexity of network training and make the proposed method robust to multiappliance switching events. Experiments are conducted to demonstrate the effectiveness of the proposed method, achieving superior performance when compared to recent methods. An ablation study is conducted to demonstrate the effectiveness of each module of our method. Finally, we investigate the quality of generated synthetic samples.

42 ENGINEERING↗

Enhancing ACPF Analysis: Integrating Newton-Raphson Method with Gradient Descent and Computational Graphs

This paper presents a new method for enhancing Alternating Current Power Flow (ACPF) analysis. The method integrates the Newton-Raphson (NR) method with Enhanced-Gradient Descent (GD) and computational graphs. The integration of renewable energy sources in power systems introduces variability and unpredictability, and this method addresses these challenges. It leverages the robustness of NR for accurate approximations and the flexibility of GD for handling variable conditions, all without requiring Jacobian matrix inversion. Furthermore, computational graphs provide a structured and visual framework that simplifies and systematizes the application of these methods. The goal of this fusion is to overcome the limitations of traditional ACPF methods and improve the resilience, adaptability, and efficiency of modern power grid analyses. We validate the effectiveness of our advanced algorithm through comprehensive testing on established IEEE benchmark systems. Furthermore, our findings demonstrate that our approach not only speeds up the convergence process but also ensures consistent performance across diverse system states, representing a significant advancement in power flow computation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Application of Markov Chain Monte Carlo Methods for Uncertainty Quantification in Inverse Transport Problems

Determination of the components of a radioactive source/shield system using the system’s radiation signature is of great importance in homeland security, material safeguards, and waste management. Although significant progress has been made toward solving this inverse transport problem in recent years, work remains to be done to quantify the uncertainty in reconstructed results. In this article we apply two Markov chain Monte Carlo (MCMC) approaches, the delayed rejection adaptive metropolis (DRAM) and differential evolution adaptive metropolis (DREAM) methods, to solve inverse problems and quantify uncertainty. The DRAM method uses delayed rejection combined with global adaptation of the proposal covariance matrix. Furthermore, the DREAM method hybridizes MCMC sampling with the differential evolution (DE) algorithm. In numerical test cases, the DRAM and DREAM methods are shown to be superior to a first-order inverse Hessian approach for problems with noisy data and multiple unknown quantities, with DREAM converging to the posterior distribution more quickly than DRAM. The DREAM and DRAM results indicate that a full posterior distribution is required to quantify uncertainty in many inverse transport problems.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗