Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast algorithm”

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 1,567 records · Page 87

Assessing Adaptive Irrigation Impacts on Water Scarcity in Nonstationary Environments—A Multi‐Agent Reinforcement Learning Approach

Abstract One major challenge in water resource management is to balance the uncertain and nonstationary water demands and supplies caused by the changing anthropogenic and hydroclimate conditions. To address this issue, we developed a reinforcement learning agent‐based modeling (RL‐ABM) framework where agents (agriculture water users) are able to learn and adjust water demands based on their interactions with the water systems. The intelligent agents are created by a reinforcement learning algorithm adapted from the Q‐learning algorithm. We illustrated this framework in a case study where the RL‐ABM is two‐way coupled with the Colorado River Simulation System (CRSS), a long‐term planning model used for the administration of the Colorado River Basin, for assessing agriculture water uses impacts on water scarcity. Seventy‐eight intelligent agents are simulated, which can be grouped into three categories based on their parameter values: the “aggressive” (swift actions; low regrets), the “forward‐looking conservative” (mild actions; high regrets; fast learning), and the “myopic conservative” (mild actions; median regrets; slow learning). The ABM‐CRSS results showed that the major reservoirs in the Upper Colorado Basin might experience more frequent water shortages due to the increasing water uses compared to the original CRSS results. If the drought continues, the case study also demonstrates that agents can learn and adjust their demands.

Hung, Fengwei↗

Information Leakage Analysis using a Co-design-Based Fault Injection Technique on a RISC-V Microprocessor

The RISC-V instruction set architecture open licensing policy has spawned a hive of development activity, making a range of implementations publicly available. The environments in which RISC-V operates have expanded correspondingly, driving the need for a generalized approach to evaluating the reliability of RISC-V implementations under adverse operating conditions or after normal wear-out periods. Fault injection (FI) refers to the process of changing the state of registers or wires, either permanently or momentarily, and then observing execution behavior. The analysis provides insight into the development of countermeasures that protect against the leakage or corruption of sensitive information which might occur because of unexpected execution behavior. In this paper, we develop a hardware-software co-design architecture that enables fast, configurable fault emulation and utilize it for information leakage and data corruption analysis. Modern System-on-chip FPGAs enable building an evaluation platform where control elements run on a processor(s) (PS) simultaneously with the target design running in the programmable logic (PL). Software components of the FI system introduce faults and report execution behavior. A pair of RISC-V FI-instrumented implementations are created and configured to execute the Advanced Encryption Standard and Twister algorithms. Key and plaintext information leakage and degraded pseudo-random sequences are both observed in the output for a subset of the emulated faults.

42 ENGINEERING↗

Weak-Form Latent Space Dynamics Identification

This software showcases the enhanced capabilities of the Latent Space Dynamics Identification (LaSDI) algorithm through the application of the weak form, resulting in WLaSDI. WLaSDI first compresses the data, then projects it onto test functions, and subsequently learns the local latent space models. Notably, WLaSDI demonstrates significantly improved robustness to noise. Using weak-form equation learning techniques, WLaSDI achieves local latent space modeling. Compared to the standard sparse identification of nonlinear dynamics (SINDy) used in LaSDI, the variance reduction of the weak form ensures robust and precise latent space recovery, enabling fast, robust, and accurate simulations. We demonstrate the efficacy of WLaSDI against LaSDI using several common benchmark examples, including viscid and inviscid Burgers', radial advection, and heat conduction. For instance, in 1D inviscid Burgers' simulations with up to 100% Gaussian white noise, WLaSDI maintains relative errors consistently below 6%, whereas LaSDI errors can exceed 10,000%. Similarly, in radial advection simulations, WLaSDI keeps relative errors below 16%, compared to potential errors of up to 10,000% with LaSDI. Additionally, WLaSDI achieves significant speedups, such as a 140X speedup in 1D Burgers' simulations compared to the corresponding full order model.

Choi, Youngsoo↗

Hierarchical Flexibility Offering Strategy for Integrated Hybrid Resources in Real-time Energy Markets

This paper proposes a hierarchical model for determining the energy flexibility offering strategy of integrated hybrid resources (IHRs) in power distribution systems to participate in real-time energy markets. The proposed model utilizes the scalability, fast response time, and uncertainty observation of deep reinforcement learning (DRL) to overcome the scalability issue of operating numerous flexible resources and deliverability of energy flexibility to the real-time markets in the presence of the network constraints. To that end, the power distribution system is divided into multiple IHRs, where different types of flexible loads, energy storage systems, and solar plants with controllable inverters are operated through local IHR controllers, trained by deep deterministic policy gradient (DDPG) algorithm. Active power request and reactive power capacity of IHRs are then transmitted to a central flexibility controller, where a quadratic optimization model ensures the deliverability of the energy flexibility to the real-time energy market by satisfying the distribution network constraints. The proposed model is implemented on the 123-bus test power distribution system, demonstrating the capability of DRL-based hierarchical model for scalable operation of IHRs in order to offer deliverable energy flexibility to the real-time energy market.

Majidi, Majid↗

Fast wide-field upconversion luminescence lifetime thermometry enabled by single-shot compressed ultrahigh-speed imaging

Photoluminescence lifetime imaging of upconverting nanoparticles is increasingly featured in recent progress in optical thermometry. Despite remarkable advances in photoluminescent temperature indicators, existing optical instruments lack the ability of wide-field photoluminescence lifetime imaging in real time, thus falling short in dynamic temperature mapping. Here, we report video-rate upconversion temperature sensing in wide field using single-shot photoluminescence lifetime imaging thermometry (SPLIT). Developed from a compressed-sensing ultrahigh-speed imaging paradigm, SPLIT first records wide-field luminescence intensity decay compressively in two views in a single exposure. Then, an algorithm, built upon the plug-and-play alternating direction method of multipliers, is used to reconstruct the video, from which the extracted lifetime distribution is converted to a temperature map. Using the core/shell NaGdF 4 :Er 3+ ,Yb 3+ /NaGdF 4 upconverting nanoparticles as the lifetime-based temperature indicators, we apply SPLIT in longitudinal wide-field temperature monitoring beneath a thin scattering medium. SPLIT also enables video-rate temperature mapping of a moving biological sample at single-cell resolution.

47 OTHER INSTRUMENTATION↗

Thermodynamic stability versus kinetic accessibility: Pareto fronts for programmable self-assembly

A challenge in designing self-assembling building blocks is to ensure the target state is both thermodynamically stable and kinetically accessible. These two objectives are known to be typically in competition, but it is not known how to simultaneously optimize them. We consider this problem through the lens of multi-objective optimization theory: we develop a genetic algorithm to compute the Pareto fronts characterizing the tradeoff between equilibrium probability and folding rate, for a model system of small polymers of colloids with tunable short-ranged interaction energies. We use a coarse-grained model for the particles' dynamics that allows us to efficiently search over parameters, for systems small enough to be enumerated. For most target states there is a tradeoff when the number of types of particles is small, with medium-weak bonds favouring fast folding, and strong bonds favouring high equilibrium probability. Additionally, the tradeoff disappears when the number of particle types reaches a value m *, that is usually much less than the total number of particles. This general approach of computing Pareto fronts allows one to identify the minimum number of design parameters to avoid a thermodynamic–kinetic tradeoff. However, we argue, by contrasting our coarse-grained model's predictions with those of Brownian dynamics simulations, that particles with short-ranged isotropic interactions should generically have a tradeoff, and avoiding it in larger systems will require orientation-dependent interactions.

36 MATERIALS SCIENCE↗

Leveraging Real-World Driving Data for Design and Impact Evaluation of Energy Efficient Control Strategies

Modeling and simulation are crucial in the development of advanced energy efficient control strategies. Utilizing real-world driving data as the underlying basis for control design and simulation lends veracity to projected real-world energy savings. Standardized drive cycles are limited in their utility for evaluating advanced driving strategies that utilize connectivity and on-vehicle sensing, primarily because they are typically intended for evaluating emissions and fuel economy under controlled conditions. Real-world driving data, because of its scale, is a useful representation of various road types, driving styles, and driving environments. The scale of real-world data also presents challenges in effectively using it in simulations. A fast and efficient simulation methodology is necessary to handle the large number of simulations performed for design analysis and impact evaluation of control strategies. In this study, two methods are presented of leveraging real-world data in both design optimization of energy efficient control strategies and in evaluating the real-world impact of those control strategies upon large-scale deployment. Through these methodologies, strategies with highest impact on energy savings were selected to be implemented as control algorithms. The developed algorithms were incorporated into a vehicle dynamics and powertrain control architecture implemented on a Cadillac CT6 demonstration vehicle. The control algorithms were then exercised on real-world driving scenarios to determine their impact on collective energy savings. The methodology utilizes the large-scale driving data sets maintained by the National Renewable Energy Laboratory to extract real-world driving scenarios and efficient simulation software tools. The insights obtained through this research help in guiding technology selection for energy efficient driving controls.

ARPA-E↗

Hybrid state-space self-tuning control using dual-rate sampling

This paper presents a hybrid state-space self-tuning control scheme using dual-rate sampling for suboptimal digital adaptive control of linear time-invariant continuous-time multivariable stochastic systems with unknown parameters. An equivalent fast-rate discrete-time state-space innovation model (with estimated states) of the continuous-time system is constructed by using the estimated system parameters and Kalman gain. To utilize the existing optimal regional-pole assignment method developed in the continuous-time domain, the constructed fast-rate discrete-time model is converted into an equivalent continuous-time model for the development of a state-feedback optimal control law with pole placement in a specific region. The developed analog optimal control law is then converted into an equivalent pseudo-slow-rate digital control law via the proposed digital redesign technique, which can be realized via slow-rate digital electronics. The proposed method enables the development of a digitally implementable advanced control algorithm for digital adaptive control of continuous-time multivariable stochastic systems which may be unstable and/or have nonminimum phase.

Shieh, Leang S.↗

FPGA Coprocessor for Accelerated Classification of Images

An effort related to that described in the preceding article focuses on developing a spaceborne processing platform for fast and accurate onboard classification of image data, a critical part of modern satellite image processing. The approach again has been to exploit the versatility of recently developed hybrid Virtex-4FX field-programmable gate array (FPGA) to run diverse science applications on embedded processors while taking advantage of the reconfigurable hardware resources of the FPGAs. In this case, the FPGA serves as a coprocessor that implements legacy C-language support-vector-machine (SVM) image-classification algorithms to detect and identify natural phenomena such as flooding, volcanic eruptions, and sea-ice break-up. The FPGA provides hardware acceleration for increased onboard processing capability than previously demonstrated in software. The original C-language program demonstrated on an imaging instrument aboard the Earth Observing-1 (EO-1) satellite implements a linear-kernel SVM algorithm for classifying parts of the images as snow, water, ice, land, or cloud or unclassified. Current onboard processors, such as on EO-1, have limited computing power, extremely limited active storage capability and are no longer considered state-of-the-art. Using commercially available software that translates C-language programs into hardware description language (HDL) files, the legacy C-language program, and two newly formulated programs for a more capable expanded-linear-kernel and a more accurate polynomial-kernel SVM algorithm, have been implemented in the Virtex-4FX FPGA. In tests, the FPGA implementations have exhibited significant speedups over conventional software implementations running on general-purpose hardware.

Pingree, Paula J.↗

A Variational Method to Retrieve the Extinction Profile in Liquid Clouds Using Multiple Field-of-View Lidar

While liquid clouds playa very important role in the global radiation budget, it's been very difficult to remotely determine their internal cloud structure. Ordinary lidar instruments (similar to radars but using visible light pulses) receive strong signals from such clouds, but the information is limited to a thin layer near the cloud boundary. Multiple field-of-view (FOV) lidars offer some new hope as they are able to isolate photons that were scattered many times by cloud droplets and penetrated deep into a cloud before returning to the instrument. Their data contains new information on cloud structure, although the lack of fast simulation methods made it challenging to interpret the observations. This paper describes a fast new technique that can simulate multiple-FOV lidar signals and can even estimate the way the signals would change in response to changes in cloud properties-an ability that allows quick refinements in our initial guesses of cloud structure. Results for a hypothetical airborne three-FOV lidar suggest that this approach can help determine cloud structure for a deeper layer in clouds, and can reliably determine the optical thickness of even fairly thick liquid clouds. The algorithm is also applied to stratocumulus observations by the 8-FOV airborne "THOR" lidar. These tests demonstrate that the new method can determine the depth to which a lidar provides useful information on vertical cloud structure. This work opens the way to exploit data from spaceborne lidar and radar more rigorously than has been possible up to now.

Pounder, Nicola L.↗

Fast Simulators for Satellite Cloud Optical Centroid Pressure Retrievals, 1. Evaluation of OMI Cloud Retrievals

The cloud Optical Centroid Pressure (OCP), also known as the effective cloud pressure, is a satellite-derived parameter that is commonly used in trace-gas retrievals to account for the effects of clouds on near-infrared through ultraviolet radiance measurements. Fast simulators are desirable to further expand the use of cloud OCP retrievals into the operational and climate communities for applications such as data assimilation and evaluation of cloud vertical structure in general circulation models. In this paper, we develop and validate fast simulators that provide estimates of the cloud OCP given a vertical profile of optical extinction. We use a pressure-weighting scheme where the weights depend upon optical parameters of clouds and/or aerosol. A cloud weighting function is easily extracted using this formulation. We then use fast simulators to compare two different satellite cloud OCP retrievals from the Ozone Monitoring Instrument (OMI) with estimates based on collocated cloud extinction profiles from a combination of CloudS at radar and MODIS visible radiance data. These comparisons are made over a wide range of conditions to provide a comprehensive validation of the OMI cloud OCP retrievals. We find generally good agreement between OMI cloud OCPs and those predicted by CloudSat. However, the OMI cloud OCPs from the two independent algorithms agree better with each other than either does with the estimates from CloudSat/MODIS. Differences between OMI cloud OCPs and those based on CloudSat/MODIS may result from undetected snow/ice at the surface, cloud 3-D effects, low altitude clouds missed by CloudSat, and the fact that CloudSat only observes a relatively small fraction of an OMI field-of-view.

Joiner, J.↗

Fast and Accurate Hybrid Stream PCRTMSOLAR Radiative Transfer Model for Reflected Solar Spectrum Simulation in the Cloudy Atmosphere

A hybrid stream PCRTM-SOLAR model has been proposed for fast and accurate radiative transfer simulation. It calculates the reflected solar (RS) radiances with a fast coarse way and then, with the help of a pre-saved matrix, transforms the results to obtain the desired high accurate RS spectrum. The methodology has been demonstrated with the hybrid stream discrete ordinate (HSDO) radiative transfer (RT) model. The HSDO method calculates the monochromatic radiances using a 4-stream discrete ordinate method, where only a small number of monochromatic radiances are simulated with both 4-stream and a larger N-stream (N ≥ 16) discrete ordinate RT algorithm. The accuracy of the obtained channel radiance is comparable to the result from N-stream moderate resolution atmospheric transmission version 5 (MODTRAN5). The root-mean-square errors are usually less than 5x10(exp -4) mW/sq cm/sr/cm. The computational speed is three to four-orders of magnitude faster than the medium speed correlated-k option MODTRAN5. This method is very efficient to simulate thousands of RS spectra under multi-layer clouds/aerosols and solar radiation conditions for climate change study and numerical weather prediction applications.

Yang, Qiguang↗

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗

A low-latency graph computer to identify metastable particles at the Large Hadron Collider for real-time analysis of potential dark matter signatures

Abstract Image recognition is a pervasive task in many information-processing environments. We present a solution to a difficult pattern recognition problem that lies at the heart of experimental particle physics. Future experiments with very high-intensity beams will produce a spray of thousands of particles in each beam-target or beam-beam collision. Recognizing the trajectories of these particles as they traverse layers of electronic sensors is a massive image recognition task that has never been accomplished in real time. We present a real-time processing solution that is implemented in a commercial field-programmable gate array using high-level synthesis. It is an unsupervised learning algorithm that uses techniques of graph computing. A prime application is the low-latency analysis of dark-matter signatures involving metastable charged particles that manifest as disappearing tracks.

47 OTHER INSTRUMENTATION↗

Prevalence and scalable control of localized networks

The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable, even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network controllability and optimizing the placement of driver nodes. This also allows us to develop a localized algorithm for designing local feedback controllers that approach the performance of the corresponding best global controllers, while incurring a computational cost orders-of-magnitude lower. Here, we validate the locality, performance, and efficiency of the algorithms in Kuramoto oscillator networks, as well as three large empirical networks: synchronization dynamics in the Eastern US power grid, epidemic spreading mediated by the global air-transportation network, and Alzheimer’s disease dynamics in a human brain network. Taken together, our results establish that large networks can be controlled with computation and communication costs comparable to those for small networks.

42 ENGINEERING↗

Fast and scalable quantum Monte Carlo simulations of electron-phonon models

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly-bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. Here, these methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

On the Hilbert-Huang Transform Theoretical Developments

One of the main heritage tools used in scientific and engineering data spectrum analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). Both carry strong a-priori assumptions about the source data, such as linearity, of being stationary, and of satisfying the Dirichlet conditions. A recent development at the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC), known as the Hilbert-Huang Transform (HHT), proposes a novel approach to the solution for the nonlinear class of spectrum analysis problems. Using a-posteriori data processing based on the Empirical Mode Decomposition (EMD) sifting process (algorithm), followed by the normalized Hilbert Transform of the decomposition data, the HHT allows spectrum analysis of nonlinear and nonstationary data. The EMD sifting process results in a non-constrained decomposition of a source real value data vector into a finite set of Intrinsic Mode Functions (IMF). These functions form a near orthogonal adaptive basis, a basis that is derived from the data. The IMFs can be further analyzed for spectrum interpretation by the classical Hilbert Transform. A new engineering spectrum analysis tool using HHT has been developed at NASA GSFC, the HHT Data Processing System (HHT-DPS). As the HHT-DPS has been successfully used and commercialized, new applications post additional questions about the theoretical basis behind the HHT and EMD algorithms. Why is the fastest changing component of a composite signal being sifted out first in the EMD sifting process? Why does the EMD sifting process seemingly converge and why does it converge rapidly? Does an IMF have a distinctive structure? Why are the IMFs near orthogonal? We address these questions and develop the initial theoretical background for the HHT. This will contribute to the developments of new HHT processing options, such as real-time and 2-D processing using Field Programmable Array (FPGA) computational resources, enhanced HHT synthesis, and broaden the scope of HHT applications for signal processing.

Kizhner, Semion↗

On Certain Theoretical Developments Underlying the Hilbert-Huang Transform

One of the main traditional tools used in scientific and engineering data spectral analysis is the Fourier Integral Transform and its high performance digital equivalent - the Fast Fourier Transform (FFT). Both carry strong a-priori assumptions about the source data, such as being linear and stationary, and of satisfying the Dirichlet conditions. A recent development at the National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC), known as the Hilbert-Huang Transform (HHT), proposes a novel approach to the solution for the nonlinear class of spectral analysis problems. Using a-posteriori data processing based on the Empirical Mode Decomposition (EMD) sifting process (algorithm), followed by the normalized Hilbert Transform of the decomposed data, the HHT allows spectral analysis of nonlinear and nonstationary data. The EMD sifting process results in a non-constrained decomposition of a source real-value data vector into a finite set of Intrinsic Mode Functions (IMF). These functions form a nearly orthogonal derived from the data (adaptive) basis. The IMFs can be further analyzed for spectrum content by using the classical Hilbert Transform. A new engineering spectral analysis tool using HHT has been developed at NASA GSFC, the HHT Data Processing System (HHT-DPS). As the HHT-DPS has been successfully used and commercialized, new applications pose additional questions about the theoretical basis behind the HHT and EMD algorithms. Why is the fastest changing component of a composite signal being sifted out first in the EMD sifting process? Why does the EMD sifting process seemingly converge and why does it converge rapidly? Does an IMF have a distinctive structure? Why are the IMFs nearly orthogonal? We address these questions and develop the initial theoretical background for the HHT. This will contribute to the development of new HHT processing options, such as real-time and 2-D processing using Field Programmable Gate Array (FPGA) computational resources,

Kizhner, Semion↗