Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tractable algorithms”

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 73 records · Page 4

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

MODIS Cloud Optical Property Retrieval Uncertainties Derived from Pixel-Level VNIR/SWIR Radiometric Uncertainties

Moderate Resolution Imaging Spectroradiometer (MODIS) retrievals of optical thickness and effective particle radius for liquid water and ice phase clouds employ a well-known VNIR/ SWIR solar reflectance technique. For this type of algorithm, we evaluate the quantitative uncertainty in simultaneous retrievals of these two cloud parameters to pixel-level radiometric calibration estimates and other fundamental (and tractable) error sources.

Platnick, S.↗

Optimal Experimental Design With Fast Neural Network Surrogate Models

Designing optimal experiments minimizes the uncertainty of results and maximizes the efficient use of resources. Herein, machine learning surrogate models and the approximate coordinate exchange (ACE) algorithm are used to determine optimum experimental designs over large or arbitrarily restrictive design spaces. Optimal experimental design is particularly salient in materials science where experiments are expensive and material properties must often be inferred indirectly. The proposed framework is demonstrated by finding optimal experiments with which the hidden constituent properties of composite materials can be most efficiently inferred from observable experimental outcomes. The optimum experimental design is given by an information-theoretic criteria, which maximizes the conditional mutual information between the hidden properties and the expected experimental outcomes. To perform tractable optimization a neural network is trained as a surrogate model to mimic a physics based simulation, which can calculate the expected experimental outcome based on a candidate experimental design and sampled constituent properties. The ACE algorithm is used to optimize over large design spaces with many tests and controlled parameters where an exhaustive search would be intractable even with the surrogate model. Using this approach, optimal experimental designs that are consistent with those produced by heuristic knowledge and established best practices are found; then optimal designs in larger design spaces where heuristic knowledge is unavailable are examined.

machine learning↗

Probabilistic Nanomagnetic Memories for Uncertain and Robust Machine Learning

This project evaluated the use of emerging spintronic memory devices for robust and efficient variational inference schemes. Variational inference (VI) schemes, which constrain the distribution for each weight to be a Gaussian distribution with a mean and standard deviation, are a tractable method for calculating posterior distributions of weights in a Bayesian neural network such that this neural network can also be trained using the powerful backpropagation algorithm. Our project focuses on domain-wall magnetic tunnel junctions (DW-MTJs), a powerful multi-functional spintronic synapse design that can achieve low power switching while also opening the pathway towards repeatable, analog operation using fabricated notches. Our initial efforts to employ DW-MTJs as an all-in-one stochastic synapse with both a mean and standard deviation didn’t end up meeting the quality metrics for hardware-friendly VI. In the future, new device stacks and methods for expressive anisotropy modification may make this idea still possible. However, as a fall back that immediately satisfies our requirements, we invented and detailed how the combination of a DW-MTJ synapse encoding the mean and a probabilistic Bayes-MTJ device, programmed via a ferroelectric or ionically modifiable layer, can robustly and expressively implement VI. This design includes a physics-informed small circuit model, that was scaled up to perform and demonstrate rigorous uncertainty quantification applications, up to and including small convolutional networks on a grayscale image classification task, and larger (Residual) networks implementing multi-channel image classification. Lastly, as these results and ideas all depend upon the idea of an inference application where weights (spintronic memory states) remain non-volatile, the retention of these synapses for the notched case was further interrogated. These investigations revealed and emphasized the importance of both notch geometry and anisotropy modification in order to further enhance the endurance of written spintronic states. In the near future, these results will be mapped to effective predictions for room temperature and elevated operation DW-MTJ memory retention, and experimentally verified when devices become available.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

A generalized patched-grid algorithm with application to the F-18 forebody with actuated control strake

Analysis of complex configurations using structured grids virtually demands multiple blocks of grids. To facilitate calculations involving multiple blocks, a geneal grid-block patching algorithm based on generalized coordinate inerpolation has been developed. The computational grid may contain as many arbirarily shaped blocks as required to make the grid generation problem tractable and to accurately model the fow features. Results are presented for several test cases as well as for the F-18 forebody control strake. The methodology developed has application to overlapped or embedded grids.

Biedron, R. T.↗

Validation of Airborne FMCW Radar Measurements of Snow Thickness Over Sea Ice in Antarctica

Antarctic sea ice and its snow cover are integral components of the global climate system, yet many aspects of their vertical dimensions are poorly understood, making their representation in global climate models poor. Remote sensing is the key to monitoring the dynamic nature of sea ice and its snow cover. Reliable and accurate snow thickness data are currently a highly sought after data product. Remotely sensed snow thickness measurements can provide an indication of precipitation levels, predicted to increase with effects of climate change in the polar regions. Airborne techniques provide a means for regional-scale estimation of snow depth and distribution. Accurate regional-scale snow thickness data will also facilitate an increase in the accuracy of sea ice thickness retrieval from satellite altimeter freeboard estimates. The airborne data sets are easier to validate with in situ measurements and are better suited to validating satellite algorithms when compared with in situ techniques. This is primarily due to two factors: better chance of getting coincident in situ and airborne data sets and the tractability of comparison between an in situ data set and the airborne data set averaged over the footprint of the antennas. A 28-GHz frequency modulated continuous wave (FMCW) radar loaned by the Center for Remote Sensing of Ice Sheets to the Australian Antarctic Division is used to measure snow thickness over sea ice in East Antarctica. Provided with the radar design parameters, the expected performance parameters of the radar are summarized. The necessary conditions for unambiguous identification of the airsnow and snowice layers for the radar are presented. Roughnesses of the snow and ice surfaces are found to be dominant determinants in the effectiveness of layer identification for this radar. Finally, this paper presents the first in situ validated snow thickness estimates over sea ice in Antarctica derived from an FMCW radar on a helicopterborne platform.

sea ice↗

Bayesian Estimation of Precipitation from Satellite Passive Microwave Observations Using Combined Radar-Radiometer Retrievals

Precipitation estimation from satellite passive microwave radiometer observations is a problem that does not have a unique solution that is insensitive to errors in the input data. Traditionally, to make this problem well posed, a priori information derived from physical models or independent, high-quality observations is incorporated into the solution. In the present study, a database of precipitation profiles and associated brightness temperatures is constructed to serve as a priori information in a passive microwave radiometer algorithm. The precipitation profiles are derived from a Tropical Rainfall Measuring Mission (TRMM) combined radar radiometer algorithm, and the brightness temperatures are TRMM Microwave Imager (TMI) observed. Because the observed brightness temperatures are consistent with those derived from a radiative transfer model embedded in the combined algorithm, the precipitation brightness temperature database is considered to be physically consistent. The database examined here is derived from the analysis of a month-long record of TRMM data that yields more than a million profiles of precipitation and associated brightness temperatures. These profiles are clustered into a tractable number of classes based on the local sea surface temperature, a radiometer-based estimate of the echo-top height (the height beyond which the reflectivity drops below 17 dBZ), and brightness temperature principal components. For each class, the mean precipitation profile, brightness temperature principal components, and probability of occurrence are determined. The precipitation brightness temperature database supports a radiometer-only algorithm that incorporates a Bayesian estimation methodology. In the Bayesian framework, precipitation estimates are weighted averages of the mean precipitation values corresponding to the classes in the database, with the weights being determined according to the similarity between the observed brightness temperature principal components and the brightness temperature principal components of the classes. Because the classes are stratified by the sea surface temperature and the echo-top-height estimator, the number of classes that are considered for retrieval is significantly smaller than the total number of classes, making the algorithm computationally efficient. The radiometer-only algorithm is applied to TMI observations, and precipitation estimates are compared with combined TRMM precipitation radar (PR) TMI reference estimates. The TMI-only algorithm, supported by the empirically derived database, produces estimates that are more consistent with the reference values than the precipitation estimates from the version-6 TRMM facility TMI algorithm. Cloud-resolving model simulations are used to assign a latent heating profile to each precipitation profile in the empirically derived database, making it possible to estimate latent heating using the radiometer-only algorithm. Although the evaluation of latent heating estimates in this study is preliminary, because realistic conditional probability distribution functions are attached to latent heating structures in the algorithm s database, a generally positive impact on latent heating estimation from passive microwave observations is expected.

Grecu, Mircea↗

A distributed voltage inference framework for cyber-physical attacks detection and localization in active distribution grids

The transition to active distribution grids with real-time monitoring and control depends on the proliferation of advanced communication networks and devices. This paradigm shift towards a cyber-physical architecture also introduces new vulnerabilities for adversaries to exploit and launch sophisticated cyber-physical attacks targeting grid observability. Current research highlights the challenges in distinguishing attacks on voltage phasor or nodal injection measurements and isolating multi-source attack locations in a multiphase distribution grid. The attack detection and localization methods in literature face accuracy issues, applications across diverse attack scenarios, or scalability limits. Here, to bridge these gaps, this paper proposes a distributed Voltage Inference framework for real-time detection and localization of cyber-physical attacks, addressing scalability, adaptability, and accuracy challenges in state-of-the-art methods. The proposed methodology leverages the distributed nature of the Voltage Inference framework through a two-step process of prediction and correction, together with a tractable graph partitioning approach, providing a reliable solution to identify compromised measurement sources and facilitate isolation. Extensive testing on IEEE 13 and 123-node distribution feeders underscores the algorithm’s efficacy, enhancing the security and resilience of active distribution grids against evolving cyber threats. Additionally, Hardware-in-the-Loop (HIL) implementation validates the proposed strategy’s practical applicability in real-world scenarios.

active distribution grids↗

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗

Mana and thermalization: Probing the feasibility of near-Clifford Hamiltonian simulation

Quantum hydrodynamics is the emergent classical dynamics governing transport of conserved quantities in generic strongly interacting quantum systems. Here, recent matrix product operator methods [1,2] have made simulations of quantum hydrodynamics in 1+1D tractable, but they do not naturally generalize to 2+1D or higher, and they offer limited guidance as to the difficulty of simulations on quantum computers. Near-Clifford simulation algorithms are not limited to one dimension, and future error-corrected quantum computers will likely be bottlenecked by non-Clifford operations. We therefore investigate the non-Clifford resource requirements for simulation of quantum hydrodynamics using mana, a resource theory of non-Clifford operations. For infinite-temperature starting states, we find that the mana of subsystems quickly approaches zero, while for starting states with energy above some threshold the mana approaches a nonzero value. Surprisingly, in each case the finite-time mana is governed by the subsystem entropy, not the thermal state mana; we argue that this is because mana is a sensitive diagnostic of finite-time deviations from canonical typicality.

1-dimensional spin chains↗

Tractable Learning in Underexcited Power Grids

Estimating the structure of physical flow networks, such as power grids, is critical to secure delivery of energy. This article discusses statistical structure estimation in power grids in the “underexcited” regime, where a subset of internal nodes has zero injection fluctuations. Prior estimation algorithms based on nodal voltages fail for such grids as the voltage covariance matrix is not invertible. Here, we propose a novel topology learning algorithm for learning underexcited general networks. Our algorithm uses physics-informed conservation laws to first identify the zero-injection buses and their neighbors, and then estimates the remaining edges in the grid. We prove the asymptotic correctness of our algorithm for grids with nonadjacent internal zero-injection nodes. More important, we theoretically analyze our algorithm’s efficacy under noisy measurements, and determine bounds on maximum noise under which asymptotically correct recovery is guaranteed. Our approach is validated through simulations with voltage samples generated on test distribution grids with real injection data and nonlinear power flow models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Land surface temperature measurements from EOS MODIS data

A generalized split-window method for retrieving land-surface temperature (LST) from AVHRR and MODIS data has been developed. Accurate radiative transfer simulations show that the coefficients in the split-window algorithm for LST must depend on the viewing angle, if we are to achieve a LST accuracy of about 1 K for the whole scan swath range (+/-55.4 deg and +/-55 deg from nadir for AVHRR and MODIS, respectively) and for the ranges of surface temperature and atmospheric conditions over land, which are much wider than those over oceans. We obtain these coefficients from regression analysis of radiative transfer simulations, and we analyze sensitivity and error by using results from systematic radiative transfer simulations over wide ranges of surface temperatures and emissivities, and atmospheric water vapor abundance and temperatures. Simulations indicated that as atmospheric column water vapor increases and viewing angle is larger than 45 deg it is necessary to optimize the split-window method by separating the ranges of the atmospheric column water vapor and lower boundary temperature, and the surface temperature into tractable sub-ranges. The atmospheric lower boundary temperature and (vertical) column water vapor values retrieved from HIRS/2 or MODIS atmospheric sounding channels can be used to determine the range where the optimum coefficients of the split-window method are given. This new LST algorithm not only retrieves LST more accurately but also is less sensitive than viewing-angle independent LST algorithms to the uncertainty in the band emissivities of the land-surface in the split-window and to the instrument noise.

Wan, Zhengming↗

Formal verification of an oral messages algorithm for interactive consistency

The formal specification and verification of an algorithm for Interactive Consistency based on the Oral Messages algorithm for Byzantine Agreement is described. We compare our treatment with that of Bevier and Young, who presented a formal specification and verification for a very similar algorithm. Unlike Bevier and Young, who observed that 'the invariant maintained in the recursive subcases of the algorithm is significantly more complicated than is suggested by the published proof' and who found its formal verification 'a fairly difficult exercise in mechanical theorem proving,' our treatment is very close to the previously published analysis of the algorithm, and our formal specification and verification are straightforward. This example illustrates how delicate choices in the formulation of the problem can have significant impact on the readability of its formal specification and on the tractability of its formal verification.

Rushby, John↗

Networked Microgrid Topology Reconfiguration to Promote Fairness in Proactive Load Shedding

Increasing occurrences of natural disasters and grid emergency events consistently challenge the safe and reliable operations of power systems. During such emergency situations, system operators may proactively shed load to mitigate risks. However, uncoordinated implementation of load shedding may disrupt electricity supply and even lead to cascading failures. Meanwhile, it is crucial to address potential biases affecting different customers when executing load shedding. This paper addresses the dynamic topology reconfiguration problem for networked microgrids with distributed energy resources under emergency conditions. Specifically, we propose a novel rolling-horizon optimization model that integrates fairness-aware constraints into the networked microgrid topology reconfiguration. Unlike existing approaches that focus solely on efficiency or apply fairness considerations in static settings, our method explicitly incorporates temporal fairness constraints to restrict repeated or excessive load curtailment for load blocks. Moreover, the fairness-aware constraints are specifically developed for the context of dynamic networked microgrid topology reconfiguration, and are designed to be convex or amenable to linear reformulations, which offers a more tractable alternative to traditional models with non-convex formulations. Numerical studies on a modified IEEE 13-bus system and a larger-sized SMART-DS networked microgrid system demonstrate the performance of the proposed algorithm towards more fairness-aware networked microgrid topology reconfiguration decision-making.

24 POWER TRANSMISSION AND DISTRIBUTION↗

LPV Modeling of a Flexible Wing Aircraft Using Modal Alignment and Adaptive Gridding Methods

One of the earliest approaches in gain-scheduling control is the gridding based approach, in which a set of local linear time-invariant models are obtained at various gridded points corresponding to the varying parameters within the flight envelop. In order to ensure smooth and effective Linear Parameter-Varying control, aligning all the flexible modes within each local model and maintaining small number of representative local models over the gridded parameter space are crucial. In addition, since the flexible structural models tend to have large dimensions, a tractable model reduction process is necessary. In this paper, the notion of s-shifted H2- and H Infinity-norm are introduced and used as a metric to measure the model mismatch. A new modal alignment algorithm is developed which utilizes the defined metric for aligning all the local models over the entire gridded parameter space. Furthermore, an Adaptive Grid Step Size Determination algorithm is developed to minimize the number of local models required to represent the gridded parameter space. For model reduction, we propose to utilize the concept of Composite Modal Cost Analysis, through which the collective contribution of each flexible mode is computed and ranked. Therefore, a reduced-order model is constructed by retaining only those modes with significant contribution. The NASA Generic Transport Model operating at various flight speeds is studied for verification purpose, and the analysis and simulation results demonstrate the effectiveness of the proposed modeling approach.

LPV Modeling↗

A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25-100 Logical Qubits

The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource requirements for simulating quantum systems, quantum chemistry has long been recognized as a natural candidate for quantum computation. This perspective focuses on identifying scientifically meaningful use cases where early fault-tolerant quantum computers, which are considered to be equipped with approximately 25-100 logical qubits, could deliver tangible impact. While recent advances in classical computing have pushed the boundaries of tractable simulations to unprecedented scales, this logical-qubit regime represents the first window where quantum devices can pursue qualitatively distinct strategies, such as polynomial-scaling phase estimation, direct simulation of quantum dynamics, and active-space embedding, that remain challenging for classical solvers, such as multireference charge-transfer and conical-intersection states central to photochemistry and materials design. We highlight near-term opportunities in algorithm and software design, discuss representative chemical problems suited for quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimized low-depth quantum circuits for molecular electronic structure using a separable-pair approximation

We present a classically tractable model that leads to optimized low-depth quantum circuits leveraging separable-pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wave functions can be represented with linear memory requirement, which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work we employ directly determined pair-natural orbitals within a basis-set-free approach. This leads to accurate representation of the one- and many-body parts for weakly correlated systems and we explicitly illustrate how the model can be integrated into other quantum algorithms for stronger correlated systems.

74 ATOMIC AND MOLECULAR PHYSICS↗