Search NASA⌕ Search

SEARCH · Search NASA

Results for “demonstration box”

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 217 records · Page 12

Target Selection and Validation of DESI Emission Line Galaxies

The Dark Energy Spectroscopic Instrument (DESI) will precisely constrain cosmic expansion and the growth of structure by collecting ~40 million extragalactic redshifts across ~80% of cosmic history and one-third of the sky. The Emission Line galaxy (ELG) sample, which will comprise about one-third of all DESI tracers, will be used to probe the universe over the 0.6 < z < 1.6 range, including the 1.1 < z < 1.6 range, which is expected to provide the tightest constraints. We present the target selection for the DESI Survey Validation (SV) and Main Survey ELG samples, which relies on the imaging of the Legacy Surveys. The Main ELG selection consists of a g-band magnitude cut and a (g – r) versus (r – z) color box, while the SV selection explores extensions of the Main selection boundaries. The Main ELG sample is composed of two disjoint subsamples, which have target densities of about 1940 deg –2 and 460 deg –2 , respectively. We first characterize their photometric properties and density variations across the footprint. We then analyze the DESI spectroscopic data that have been obtained from 2020 December to 2021 December in the SV and Main Survey. We establish a preliminary criterion for selecting reliable redshifts, based on the [O ιι] flux measurement, and assess its performance. Using this criterion, we are able to present the spectroscopic efficiency of the Main ELG selection, along with its redshift distribution. We thus demonstrate that the Main selection 1940 deg –2 subsample alone should provide 400 deg –2 and 460 deg –2 reliable redshifts in the 0.6 < z < 1.1 and the 1.1 < z < 1.6 ranges, respectively.

79 ASTRONOMY AND ASTROPHYSICS↗

A Nonlocal-Gradient Descent Method for Inverse Design in Nanophotonics

Local-gradient-based optimization approaches lack nonlocal exploration abilityrequired for escaping from local minima when searching non-convex landscapes.A directional Gaussian smoothing (DGS) approach was recently proposed in [29]and used to define a truly nonlocal gradient, referred to as the DGS gradient, inorder to enable nonlocal exploration in high-dimensional black-box optimization.Promising results show that replacing the traditional local gradient with the nonlocalDGS gradient can significantly improve the performance of gradient-based methodsin optimizing highly multi-modal loss functions. However, the current DGS methodis designed for unbounded and uncontrained optimization problems, making itinapplicable to real-world engineering optimization problems where the tuningparameters are often bounded and the loss function is usually constrained byphysical processes. In this work, we propose to extend to the DGS approachto the constrained inverse design framework in order to find better optima ofmulti-modal loss functions. A series of adaptive strategies for smoothing radiusand learning rate updating are developed to improve the computational efficiencyand robustness. Our methodology is demonstrated by an example of designing ananoscale wavelength demultiplexer, and shows superior performance compared tothe state-of-the-art approaches. By incorporating volume constraints, the optimizeddesign achieves an equivalently high performance but significantly reduces theamount of material usage.

Bi, Sirui↗

Surrogate Model Guided Optimization of Expensive Black-Box Multi-Objective Problems: A Posteriori Methods

Many engineering applications require the simultaneous optimization of multiple conflicting objective functions. Often, these objective functions are evaluated using highly accurate computer simulations that are computationally too expensive to be evaluated hundreds or thousands of times during optimization. Thus, the goal is to find good approximations of the Pareto front using as few of these expensive simulations as possible. Here, we describe an optimization approach based on surrogate models and diverse sampling strategies to accelerate the search for the Pareto solutions. We use a separate surrogate model for approximating each objective function and then we use the surrogate models to inform where additional expensive simulations should be run. The surrogate models are updated in an active learning framework whenever new information from the expensive simulations becomes available. The sampling strategies aim at balancing local improvements of the approximate Pareto front and global exploration to identify the extrema and fill in large gaps of the approximate Pareto front. We demonstrate on a large set of benchmark problems the effectiveness of the method for finding good approximations of the Pareto front.

MATHEMATICS AND COMPUTING↗

Mild hybridisation of turboprop engine with high-power-density integrated electric drives

Here this paper shares with the aerospace community a case study of turboprop mild hybridisation using a recently developed integrated drive system in the University of Nottingham, UK, within the ACHIEVE project under EU H2020 CleanSky 2 program (project No. 737814). The developed drive system enables green taxiing of a turboprop aircraft while on the ground with its engine off, and as an electrical generator when the turboprop is in the air. The entire system is designed to be able to integrate within the power auxiliary gear box (PAGB) of a turboprop aircraft. Some of the key features of the developed system include a high-speed permanent magnet machine (up to 14,200rpm) with dual three-phase design, SiC-based high power density (11.8kW/L for the power converter, 35.3kW/L and 7.2kW/kg for the machine active parts), integrated cooling design for high-temperature operation (>130°C ambient temperature), fault tolerance consideration with dual channel operation capabilities and sensorless control for entire operational conditions. This paper is giving an overview of the design process of the electrical machine, power converters, and its cooling of the entire drive. Numerical analysis (FEM and CFD) and some experimental results are presented to demonstrate the effectiveness and the desired performance of the developed integrated drive system.

42 ENGINEERING↗

Exploiting the Local Parabolic Landscapes of Adversarial Losses to Accelerate Black-Box Adversarial Attack

Existing black-box adversarial attacks on image classifiers update the perturbation at each iteration from only a small number of queries of the loss function. Since the queries contain very limited information about the loss, black-box methods usually require much more queries than white-box methods. We propose to improve the query efficiency of black-box methods by exploiting the smoothness of the local loss landscape. However, many adversarial losses are not locally smooth with respect to pixel perturbations. To resolve this issue, our first contribution is to theoretically and experimentally justify that the adversarial losses of many standard and robust image classifiers behave like parabolas with respect to perturbations in the Fourier domain. Our second contribution is to exploit the parabolic landscape to build a quadratic approximation of the loss around the current state, and use this approximation to interpolate the loss value as well as update the perturbation without additional queries. Since the local region is already informed by the quadratic fitting, we use large perturbation steps to explore far areas. We demonstrate the efficiency of our method on MNIST, CIFAR-10 and ImageNet datasets for various standard and robust models, as well as on Google Cloud Vision. The experimental results show that exploiting the loss landscape can help significantly reduce the number of queries and increase the success rate. Our codes are available at https://github.com/HoangATran/BABIES.

Tran, Hoang↗

Sequential Learning of Active Subspaces

This study shows that in recent years, active subspace methods (ASMs) have become a popular means of performing subspace sensitivity analysis on black-box functions. Naively applied, however, ASMs require gradient evaluations of the target function. In the event of noisy, expensive, or stochastic simulators, evaluating gradients via finite differencing may be infeasible. In such cases, often a surrogate model is employed, on which finite differencing is performed. When the surrogate model is a Gaussian process (GP), we show that the ASM estimator is available in closed form, rendering the finite-difference approximation unnecessary. We use our closed-form solution to develop acquisition functions focused on sequential learning tailored to sensitivity analysis on top of ASMs. We also show that the traditional ASM estimator may be viewed as a method of moments estimator for a certain class of GPs. We demonstrate how uncertainty on GP hyperparameters may be propagated to uncertainty on the sensitivity analysis, allowing model-based confidence intervals on the active subspace. Our methodological developments are illustrated on several examples.

97 MATHEMATICS AND COMPUTING↗

Systematic Construction of Time-Dependent Hamiltonians for Microwave-Driven Josephson Circuits

Time-dependent electromagnetic drives are fundamental for controlling complex quantum systems, including superconducting Josephson circuits. In these devices, accurate time-dependent Hamiltonian models are imperative for predicting their dynamics and designing high-fidelity quantum operations. Existing numerical methods, such as black-box quantization (BBQ) and energy-participation ratio (EPR), excel at modeling the static Hamiltonians of Josephson circuits. However, these techniques do not fully capture the behavior of driven circuits stimulated by external microwave drives, nor do they include a generalized approach to account for the inevitable noise and dissipation that enter through microwave ports. Here, we introduce numerical techniques that leverage classical microwave simulations, efficiently executable in finite-element solvers, to obtain the time-dependent Hamiltonian of microwave-driven superconducting circuits with arbitrary geometries under charge, flux, or mixed electromagnetic modulation. Importantly, our techniques do not rely on a lumped-element description of the superconducting circuit, in contrast to previous approaches to tackling this problem. We demonstrate the versatility of our approach by characterizing the driven properties of realistic circuit devices in complex electromagnetic environments, including coherent dynamics due to charge and flux modulation, as well as drive-induced relaxation and dephasing. Our techniques offer a powerful toolbox for optimizing circuit designs and advancing practical applications in superconducting quantum computing.

Lu, Yao [Yale U.; Yale U. (main); Fermilab] (ORCID↗

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗

Robustness of Deep Learning Classification to Adversarial Input on GPUs: Asynchronous Parallel Accumulation Is a Source of Vulnerability

The ability of machine learning (ML) classification models to resist small, targeted input perturbations—known as adversarial attacks—is a key measure of their safety and reliability. We show that floating-point non associativity (FPNA) coupled with asynchronous parallel programming on GPUs is sufficient to result in misclassification, without any perturbation to the input. Additionally, we show that this misclassification is particularly significant for inputs close to the decision boundary and that standard adversarial robustness results may be overestimated up to 4.6 when not considering machine-level details. We first study a linear classifier, before focusing on standard Graph Neural Network (GNN) architectures and datasets used in robustness assessments. We develop a novel black-box attack using Bayesian optimization to discover external workloads that can change the instruction scheduling which bias the output of reductions on GPUs and reliably lead to misclassification. Motivated by these results, we present a new learnable permutation (LP) gradient-based approach to learning floating-point operation orderings that lead to misclassifications. The LP approach provides a worst-case estimate in a computationally efficient manner, avoiding the need to run identical experiments tens of thousands of times over a potentially large set of possible GPU states or architectures. Finally, using instrumentation-based testing, we investigate parallel reduction ordering across different GPU architectures under external background workloads, when utilizing multi-GPU virtualization, and when applying power capping. Our results demonstrate that parallel reduction ordering varies significantly across architectures under the first two conditions, substantially increasing the search space required to fully test the effects of this parallel scheduler-based vulnerability. These results and the methods developed here can help to include machine-level considerations into adversarial robustness assessments, which can make a difference in safety and mission critical applications.

Shanmugavelu, Sanjif [Maxeler Technologies, a Groq↗

Black-box optimization of CT acquisition and reconstruction parameters: a reinforcement learning approach

Protocol optimization is critical in Computed Tomography (CT) for achieving desired diagnostic image quality while minimizing radiation dose. Due to the inter-effect of influencing CT parameters, traditional optimization methods rely on the testing of exhaustive combinations of these parameters. This poses a notable limitation due to the impracticality of exhaustive parameter testing. This study introduces a novel methodology leveraging Virtual Imaging Trials (VITs) and reinforcement learning to more efficiently optimize CT protocols. Computational phantoms with liver lesions were imaged using a validated CT simulator and reconstructed with a novel CT reconstruction Toolkit. The optimization parameter space included tube voltage, tube current, reconstruction kernel, slice thickness, and pixel size. The optimization process was done using a Proximal Policy Optimization (PPO) agent which was trained to maximize the Detectability Index (d’) of the liver lesion for each reconstructed image. Results showed that our reinforcement learning approach found the absolute maximum d’ across the test cases while requiring 79.7% fewer steps compared to an exhaustive search, demonstrating both accuracy and computational efficiency, offering a efficient and robust framework for CT protocol optimization. The flexibility of the proposed technique allows for use of varying image quality metrics as the objective metric to maximize for. Our findings highlight the advantages of combining VIT and reinforcement learning for CT protocol management.

Fenwick, David [Duke University Medical Center]↗

Modal Field Reconstruction in Resonant Cavities in the Fundamental and Undermoded Frequency Regimes

Theory, simulations, and experiments are presented that demonstrate reconstruction of electromagnetic fields in a cavity from sparse probe measurements. Such techniques are often referred to as virtual sensing, allowing fields at unobserved locations to be predicted. These methods are appropriate for the fundamental and undermoded regimes, providing the ability to estimate fields (and shielding effectiveness) throughout an arbitrarily shaped cavity from a few judiciously spaced probes. A modal simulation method is implemented that allows the response of arbitrarily shaped cavities to be rapidly computed with respect to varying probe locations and slot parameters, enabling statistical analysis of probe placement on reconstruction performance. A cylindrical vessel with numerous probe holes is developed for experiments, referred to as Perforated Vessel 2 (PV2). Experiments are performed on the vessel with and without a steel box inside, where transmit power is delivered into the vessel either through probes (probe injection) or through slots using an external antenna (slot excitation). Simulations and experiments illustrate that when the number of probes is minimal (equal to the number of mode coefficients to be estimated at each frequency), probe placement is critical to avoid missed peaks and to have acceptable reconstruction error. Probe placement becomes less important as the number of probes is increased, but care is still required to avoid probe locations giving poor performance.

42 ENGINEERING↗

Effects of Central Cut Width on the Dynamical Characteristics of Box Assembly Structure

An investigation into the Box Assembly with Removable Component (BARC) structure is conducted by utilizing computational simulations and experimental structural testing in order to determine the complex dynamical responses instigated by the central cut of the system. Because the dynamics of the BARC system is complex, this study focuses primarily on analyzing the behavior of the box assembly (BA) system. The investigation explores the dynamics of the BA system by varying the central cut widths, ranging from a cut as wide as 0.5” cut to a 0.25” cut system, as well as a 0.1” cut and a system with no cut at all. Experimental testing is performed on each system including a free vibration test using an impact hammer to excite and identify the dominant frequencies of each structure. This testing is followed by pseudo-random vibration tests and swept sinusoidal excitation tests to determine the nonlinear aspects of these systems, such as the possible existence of nonlinear softening, hardening, and/or damping. The results show that nonlinear softening and nonlinear damping are present in each system. The no-cut system demonstrated the highest peak frequencies throughout all the tests, being the most rigid structure. The 0.25” cut system was shown to have the highest peak frequencies among all the cut systems in both the finite elemenet analysis (FEA) and impact testing. This trend did not continue, though, in the random and harmonic testing, possibly due to the added stiffness of the test setup with the slip table and stinger. The results show the importance of accurately measuring the central cut width and how possible geometric uncertainties change the overall dynamical behaviors of complex systems, such as natural characteristics, nonlinear responses, coupling of modes, and oscillating amplitudes.

Padilla, Christopher (ORCID:000900033446732X)↗

A Model Tree Generator (MTG) Framework for Simulating Hydrologic Systems: Application to Reservoir Routing

Data-driven algorithms have been widely used as effective tools to mimic hydrologic systems. Unlike black-box models, decision tree algorithms offer transparent representations of systems and reveal useful information about the underlying process. A popular class of decision tree models is model tree (MT), which is designed for predicting continuous variables. Most MT algorithms employ an exhaustive search mechanism and a pre-defined splitting criterion to generate a piecewise linear model. However, this approach is computationally intensive, and the selection of the splitting criterion can significantly affect the performance of the generated model. These drawbacks can limit the application of MTs to large datasets. To overcome these shortcomings, a new flexible Model Tree Generator (MTG) framework is introduced here. MTG is equipped with several modules to provide a flexible, efficient, and effective tool for generating MTs. The application of the algorithm is demonstrated through simulation of controlled discharge from several reservoirs across the Contiguous United States (CONUS).

54 ENVIRONMENTAL SCIENCES↗

C-terminal conformational changes in SCF-D3/MAX2 ubiquitin ligase are required for KAI2-mediated signaling

Karrikins (KARs) are bioactive molecules derived from burning vegetation. Plants perceive KARs through the hydrolase KARRIKIN INSENSITIVE 2 (KAI2) that interacts with the F-box protein ubiquitin ligase MORE AXILLARY GROWTH 2 (MAX2). MAX2 also plays a role in the perception and signal activation by Strigolactone (SL), a phytohormone controlling various developmental processes in plants. SL also acts as a rhizosphere signal to activate arbuscular mycorrhiza fungi that can be exploited by parasitic plants. kai2 knockouts exhibit distinct developmental defects and therefore KAI2 is hypothesized to perceive an unidentified endogenous ligand provisionally termed KAI2-Ligand (KL). Upon KAR/KL perception, the protein complex of KAI2-MAX2 targets SUPPRESSOR OF MAX2-1/2 (SMAX1)/SMXL2 for proteasomal degradation. Despite the identification of the key components KAI2, MAX2, and SMAX1 in KAR/KL signaling, their mode of interaction and regulation remains elusive. Recently, the regulatory function of the conformational switch of MAX2 C-terminal helix (CTH) in SL signaling has been demonstrated however its role in KAR/KL signaling remained unknown. Here we address the function of MAX2-CTH dynamics both in vitro and in planta and show that the central role of CTH is conserved between SL and KAR/KL signaling pathway.

59 BASIC BIOLOGICAL SCIENCES↗

Sampling Low-Dimensional Markovian Dynamics for Preasymptotically Recovering Reduced Models from Data with Operator Inference

This work introduces a method for learning low-dimensional models from data of high-dimensional black-box dynamical systems. The novelty is that the learned models are exactly the reduced models that are traditionally constructed with classical projection-based model reduction techniques. Thus, the proposed approach learns models that are guaranteed to have the well-studied properties of reduced models known from model reduction, without requiring full knowledge of the governing equations and without requiring the operators of the high-dimensional systems. The key ingredient is a new data sampling scheme to obtain re-projected trajectories of high-dimensional systems that correspond to Markovian dynamics in low-dimensional subspaces. The exact recovery of reduced models from these re-projected trajectories is guaranteed pre-asymptotically under certain conditions for finite amounts of data and for a large class of systems with polynomial nonlinear terms. Numerical results demonstrate that the low-dimensional models learned with the proposed approach match reduced models from traditional model reduction up to numerical errors in practice. In conclusion, the numerical results further indicate that low-dimensional models fitted to re-projected trajectories are predictive even in situations where models fitted to trajectories without re-projection are inaccurate and unstable.

97 MATHEMATICS AND COMPUTING↗

SANE: strategic autonomous non-smooth exploration for multiple optima discovery in multi-modal and non-differentiable black-box functions

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and multimodal parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, material structure image spaces, and molecular embedding spaces. Often these systems are black-boxes and time-consuming to evaluate, which resulted in strong interest towards active learning methods such as Bayesian optimization (BO). However, these systems are often noisy which make the black box function severely multi-modal and non-differentiable, where a vanilla BO can get overly focused near a single or faux optimum, deviating from the broader goal of scientific discovery. To address these limitations, here we developed Strategic Autonomous Non-Smooth Exploration (SANE) to facilitate an intelligent Bayesian optimized navigation with a proposed cost-driven probabilistic acquisition function to find multiple global and local optimal regions, avoiding the tendency to becoming trapped in a single optimum. To distinguish between a true and false optimal region due to noisy experimental measurements, a human (domain) knowledge driven dynamic surrogate gate is integrated with SANE. We implemented the gate-SANE into pre-acquired piezoresponse spectroscopy data of a ferroelectric combinatorial library with high noise levels in specific regions, and piezoresponse force microscopy (PFM) hyperspectral data. SANE demonstrated better performance than classical BO to facilitate the exploration of multiple optimal regions and thereby prioritized learning with higher coverage of scientific values in autonomous experiments. Our work showcases the potential application of this method to real-world experiments, where such combined strategic and human intervening approaches can be critical to unlocking new discoveries in autonomous research.

Biswas, Arpan [University of Tennessee, Knoxville,↗

Machine learning-enhanced MPC for demand flexibility in small commercial buildings: An experimental study

Small- and medium-sized commercial buildings (SMCBs) represent the majority of U.S. commercial building stock and a significant share of peak electricity demand, yet they often lack centralized building automation systems, representing a significant untapped resource for urban energy management. This infrastructure gap makes advanced control implementation challenging, limiting the potential for widespread demand flexibility. Model Predictive Control (MPC) has shown strong potential for load shifting, peak demand reduction, and cost savings, but its effectiveness is hindered by unmeasured disturbances such as internal heat gains. This paper presents a Hybrid MPC framework that integrates a physics-based gray-box building thermal model, identified using a lumped disturbance (LD) approach, with a machine learning (ML) model for forecasting unmeasured disturbances. The hybrid approach is designed for buildings with multiple individually controlled heat pump and thermostat pairs, common in SMCBs, and aims to optimize coordinated scheduling of multiple heat pumps under dynamic electricity pricing while respecting comfort constraints. The methodology is validated through both simulations of case study buildings and experimental studies at a highly-instrumented test facility. Simulation results show that the Hybrid MPC achieves substantial load shifting and peak demand reduction, approaching the performance of an ideal MPC with perfect disturbance knowledge, and outperforming a conventional MPC without disturbance forecasting. In experiments, the Hybrid MPC reduced daily HVAC energy costs by 8.7%, peak-price time load (load shifting) by 41.7%, and peak demand by 29.2% compared to baseline control, demonstrating comparable benefits to the 11.6% cost savings, 42.9% load shifting, and 23.2% peak reduction of the ideal MPC. These results demonstrate that the proposed hybrid modeling approach can significantly improve MPC performance in real-world SMCB applications without requiring additional disturbance measurements.

Demand Flexibility↗

Sequence-to-sequence neural networks for short-term electrical load forecasting in commercial office buildings

The U.S. power grid is transforming to become smarter, cleaner, and more effi- cient. This is leading to the addition of significant distributed variable renew- able generation. Due to the variable nature of renewable generation, the short- and long-term supply-demand imbalances are less predictable, and conventional approaches to mitigating the imbalance will not be efficient or cost-effective. To address this challenge, transactive control technologies have been proposed which balance energy generation and consumption with market activity and in- frastructural limitations. Transactive control requires the ability of individual end-use loads to express flexibility as a function of a transactive signal (e.g., price). Empirical gray- and black-box models have been widely used to express flexibility, and although these approaches are generally easy to construct and simple to use, they do not capture the non-linear behavior that some end-use loads represent . Machine learning approaches have been proposed to address this limitation. Although deep learning approaches for forecasting end-use loads have been explored, certain aspects of the application of deep models to load forecasting are not well understood. These aspects include how much training data is required, and how models should be structured and trained. To that end, this work explores how to approach applying deep recurrent neural networks to short-term electrical load forecasting with a case study of four commercial office buildings. We identify data requirements for training accurate models of whole building electricity use conditioned on outdoor temperature, provide insight into model hyperparameter sensitivity, and demonstrate how readily models can be generalized to unseen buildings.

Skomski, Elliott↗