Search NASA⌕ Search

SEARCH · Search NASA

Results for “Types Of Problems”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Toward Global Regional Seismic Moment Tensor Inversion with Three-Dimensional Earth Models for Nuclear Explosion Monitoring with Sparse Networks: Demonstration of Reciprocity for Strain Greens Tensor Database Simulation with Salvus

Seismic source characterization is an essential function of global nuclear explosion monitoring (NEM). While large events (roughly with moment magnitude, M w , greater than 5.0) can often be easily detected, located and identified with high signal-to-noise ratios at teleseismic distances (> 20°), trends in NEM research require confident source characterization at much lower magnitudes (say down to 3.0) and exploitation of sparse observations (from only a few stations) at regional distance (< 20°). Regional distance waveform inversion to characterize sources is now widely used and effective (e.g. Ford et al., 2009; Alvizuri and Tape, 2018; Alvizuri et al., 2018; Chiang et al., 2018; Ford et al., 2022). These methods obtain the magnitude, depth and seismic moment tensor, which represents the forces that excited the observed seismic waves (slip on an earthquake fault, explosion, collapse or a combination of various forces). Common to many problems in seismology, the isolation of the source 2 properties requires removal of path propagation effects that waves experience while traveling through the three-dimensional (3D) Earth (the structure exists due to different rock types, material properties, temperature and tectonic processes).

58 GEOSCIENCES↗
DOE OSTI2025

Beyond Price Taker: Optimizing Integrated Energy Systems Considering Market/Grid Interactions

Integrated Energy Systems (IES) combine two or more processes to increase the efficiency, flexibility of operation, and the overall reliability. However, analyzing IESs in volatile electricity markets is challenging, since the volatility in electricity prices makes the conventional levelized cost-type analysis less realistic. This work presents two approaches to address the challenge: price-taker and a surrogates-based approach for incorporating market interactions. The price-taker approach formulates a multiperiod optimization problem that takes the time-varying electricity prices into account, and solves the optimization problem to determine the optimal operational schedule that maximizes the chosen economic metric. This approach is successfully applied to investigate the performance of flexible power and hydrogen co-production systems. The market surrogates approach trains a machine learning model to predict the market behavior as a function of the characteristics of the IES. The trained surrogate model is used to optimize the design and operation of the given IES in an electricity market. This approach is demonstrated on a case study involving a nuclear power plant retrofitted with a low-temperature electrolysis unit to co-produce power and hydrogen.

beyond price taker↗
DOE OSTI2020

Partitioned exponential methods for coupled multiphysics systems

Multiphysics problems involving two or more coupled physical phenomena are ubiquitous in science and engineering. This work develops a new partitioned exponential approach for the time integration of multiphysics problems. After a possible semi-discretization in space, the class of problems under consideration is modeled by a system of ordinary differential equations where the right-hand side is a summation of two component functions, each corresponding to a given set of physical processes. The partitioned-exponential methods proposed herein evolve each component of the system via an exponential integrator, and information between partitions is exchanged via coupling terms. Here, the traditional approach to constructing exponential methods, based on the variation-of-constants formula, is not directly applicable to partitioned systems. Rather, our approach to developing new partitioned-exponential families is based on a general-structure additive formulation of the schemes. Two method formulations are considered, one based on a linear-nonlinear splitting of the right hand component functions, and another based on approximate Jacobians. The paper develops classical (non-stiff) order conditions theory for partitioned exponential schemes based on particular families of T-trees and B-series theory. Several practical methods of third order are constructed that extend the Rosenbrock-type and EPIRK families of exponential integrators. Several implementation optimizations specific to the application of these methods to reaction-diffusion systems are also discussed. Numerical experiments reveal that the new partitioned-exponential methods can perform better than traditional unpartitioned exponential methods on some problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Progressive transfer learning for advancing machine learning-based reduced-order modeling

Abstract To maximize knowledge transfer and improve the data requirement for data-driven machine learning (ML) modeling, a progressive transfer learning for reduced-order modeling (p-ROM) framework is proposed. A key concept of p-ROM is to selectively transfer knowledge from previously trained ML models and effectively develop a new ML model(s) for unseen tasks by optimizing information gates in hidden layers. The p-ROM framework is designed to work with any type of data-driven ROMs. For demonstration purposes, we evaluate the p-ROM with specific Barlow Twins ROMs (p-BT-ROMs) to highlight how progress learning can apply to multiple topological and physical problems with an emphasis on a small training set regime. The proposed p-BT-ROM framework has been tested using multiple examples, including transport, flow, and solid mechanics, to illustrate the importance of progressive knowledge transfer and its impact on model accuracy with reduced training samples. In both similar and different topologies, p-BT-ROM achieves improved model accuracy with much less training data. For instance, p-BT-ROM with four-parent (i.e., pre-trained models) outperforms the no-parent counterpart trained on data nine times larger. The p-ROM framework is poised to significantly enhance the capabilities of ML-based ROM approaches for scientific and engineering applications by mitigating data scarcity through progressively transferring knowledge.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Statistical modelling and Bayesian inversion for a Compton imaging system: application to radioactive source localization

Abstract This paper presents a statistical forward model for a Compton imaging system, called Compton imager. This system, under development at the University of Illinois Urbana Champaign, is a variant of Compton cameras with a single type of sensors which can simultaneously act as scatterers and absorbers. This imager is convenient for imaging situations requiring a wide field of view. The proposed statistical forward model is then used to solve the inverse problem of estimating the location and energy of point-like sources from observed data. This inverse problem is formulated and solved in a Bayesian framework by using a Metropolis within Gibbs algorithm for the estimation of the location, and an expectation-maximization algorithm for the estimation of the energy. This approach leads to more accurate estimation when compared with the deterministic standard back-projection approach, with the additional benefit of uncertainty quantification in the low photon imaging setting.

Tarpau, Cécilia (ORCID:0000000286539490)↗
DOE OSTI2020

Preserving Contextual Awareness during Selection of Moving Targets in Animated Stream Visualizations

In many types of dynamic interactive visualizations, it is often desired to interact with moving objects. Stopping moving objects can make selection easier, but pausing animated content can disrupt perception and understanding of the visualization. To address such problems, we explore selection techniques that only pause a subset of all moving targets in the visualization. We present various designs for controlling pause regions based on cursor trajectory or cursor position. We then report a dual-task experiment that evaluates how different techniques affect both target selection performance and contextual awareness of the visualization. Our findings indicate that all pause techniques significantly improved selection performance as compared to the baseline method without pause, but the results also show that pausing the entire visualization can interfere with contextual awareness. However, the problem with reduced contextual awareness was not observed with our new techniques that only pause a limited region of the visualization. Thus, our research provides evidence that region-limited pause techniques can retain the advantages of selection in dynamic visualizations without imposing a negative effect on contextual awareness.

Ragan, Eric↗
DOE OSTI2022

What We Learned From Analyzing 18 Million Rows of Commercial Buildings’ HVAC Fault Data

To achieve ambitious decarbonization goals it is critical that buildings operate to their full potential. Commercial HVAC systems, however, experience a wide range of operational faults, adversely affecting energy consumption, occupant comfort, and maintenance costs. Analytical tools such as fault detection & diagnostics (FDD) software identify and help diagnose these types of sensing, mechanical, or control-related faults. While significant energy savings has been documented for FDD, along with limited-scale studies on technical capabilities, there is a lack of empirical data on faults being reported by FDD tools. With FDD deployment accelerating significantly over the past decade there is an opportunity to gather and analyze data on commercial HVAC operational problems at an unprecedented scale. Such data could address many questions such as: [a] What faults are most commonly reported?; and [b] How does fault reporting vary by time of year and other possible drivers? A recent study into FDD fault reporting amassed the largest U.S. dataset of commercial HVAC air-side fault records, drawn from multi-year monitoring across over 60,000 pieces of HVAC equipment. The results of this study provide granular data on fault reporting for over 90 unique fault types. In this paper we provide an overview of the research process and highlight key findings and lessons learned. This study presents an extraordinary level of detail on FDD fault reporting characteristics across many climate zones and building types. Armed with these new insights, commercial building industry stakeholders can make better informed decisions when designing, configuring, and operating commercial HVAC systems.

Crowe, Eliot↗
DOE OSTI2022

Automatic inspection of program state in an uncooperative environment

Abstract The program state is formed by the values that the program manipulates. These values are stored in the stack, in the heap, or in static memory. The ability to inspect the program state is useful as a debugging or as a verification aid. Yet, there exists no general technique to insert inspection points in type‐unsafe languages such as C or C++. The difficulty comes from the need to traverse the memory graph in a so‐called uncooperative environment. In this article, we propose an automatic technique to deal with this problem. We introduce a static code transformation approach that inserts in a program the instrumentation necessary to report its internal state. Our technique has been implemented in LLVM. It is possible to adjust the granularity of inspection points trading precision for performance. In this article, we demonstrate how to use inspection points to debug compiler optimizations; to augment benchmarks with verification code; and to visualize data structures.

Magalhães, José Wesley de Souza↗
DOE OSTI2020

“Lagrangian disks” in M-theory

While the study of bordered (pseudo-)holomorphic curves with boundary on Lagrangian submanifolds has a long history, a similar problem that involves (special) Lagrangian submanifolds with boundary on complex surfaces appears to be largely overlooked in both physics and math literature. We relate this problem to geometry of coassociative submanifolds in G 2 holonomy spaces and to Spin(7) metrics on 8-manifolds with T 2 fibrations. As an application to physics, we propose a large class of brane models in type IIA string theory that generalize brane brick models on the one hand and 2d theories T[M 4 ] on the other.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

A Type II Hamiltonian Variational Principle and Adjoint Systems for Lie Groups

We present a novel Type II variational principle on the cotangent bundle of a Lie group which enforces Type II boundary conditions, i.e., fixed initial position and final momentum. In general, such Type II variational principles are only globally defined on vector spaces or locally defined on general manifolds; however, by left translation, we are able to define this variational principle globally on cotangent bundles of Lie groups. Type II boundary conditions are particularly important for adjoint sensitivity analysis, which is our motivating application. As such, we additionally discuss adjoint systems on Lie groups, their properties, and how they can be used to solve optimization problems subject to dynamics on Lie groups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Mathematical Programming Models for Shale Oil & Gas Development: A Review and Perspective

Here, in this paper, we provide a comprehensive review of mathematical programming models for shale oil & gas development, and we offer a perspective on outstanding research opportunities. We distinguish contributions in five major topic areas, namely: (1) development planning, (2) water management, (3) production optimization, (4) supplies, gathering & processing, and (5) life cycle analysis & sustainability. We highlight how various types of mathematical programming models (i.e., linear programs, nonlinear programs, mixed-integer linear programs, mixed-integer nonlinear programs) have been proposed primarily by the Process Systems Engineering community to address the respective decision-making problems, and we highlight instances of successful deployment in industry. Finally, based on a critical assessment of the existing body of work, we identify opportunities for future research across the major topic areas.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

A pseudo-kinetic model to simulate phase changes in gas hydrate bearing sediments

Herein, modeling of the phase transitions anticipated in gas hydrate bearing sediments (GHBS) is critical for a proper understanding of time-dependent changes in states and volumes (e.g. the production of methane from this type of soils). We propose a new pseudo-kinetic approach to simulate the typical phase changes anticipated in GHBS, using published experimental results involving gas hydrate dissociation that are the basis of a widely used kinetic model. The proposed pseudo-kinetic model is formulated in the pressure-temperature (P-T) plane and assumes a rate of gas hydrate dissociation (or formation) proportional to the distance between the current state and the phase boundary. The model consists of only one parameter and is simple to implement in numerical simulators. A similar concept is used to model ice formation/thawing phenomena, but based on the ice/liquid-water phase boundary. We implemented the pseudo-kinetic model in a fully coupled thermo-hydro-chemo-mechanical (THCM) finite element code and validated it against experimental results performed on the dissociation of synthetic gas hydrate. We also evaluated the pseudo-kinetic model using synthetic cases covering several scenarios associated with gas hydrate formation/dissociation and ice formation/thawing. The model successfully reproduced the gas production test from a natural GHBS core from Korea (scaled gas venting experiment over 14 h), and also the formation of gas hydrate and ice in permafrost in Alaska (over 2 × 10 6 years). -The analyses show the versatility of the proposed pseudo-kinetic approach by applying it to model the different types of phase transitions typically encounter in GHBS. The simple formulation, easy implementation in numerical simulator, and reduced number of parameters (only one per phase change) make this model an attractive option for simulating phase transformations in problems involving GHBS.

58 GEOSCIENCES↗
DOE OSTI2020

Repair and Resource Scheduling in Unbalanced Distribution Systems Using Neighborhood Search

—This paper proposes an optimization strategy to assist utility operators to recover power distribution systems after large outages. Specifically, a mixed-integer linear programming (MILP) model is developed for co-optimizing crews, resources, and network operations. The MILP model coordinates damage isolation, network reconfiguration, distributed generator re-dispatch, and crew/resource logistics. In addition, a framework for integrating different types of photovoltaic (PV) systems in the restoration process is developed. We consider two different types of crews, namely, line crews for damage repair and tree crews for obstacle removal. We also model the repair resource logistic constraints. Furthermore, a new algorithm is developed for solving the distribution system repair and restoration problem (DSRRP). The algorithm starts by solving DSRRP using an assignmentbased method, then a neighborhood search method is designed to iteratively improve the solution. The proposed method is validated on modified IEEE 123- and 8500-bus distribution test systems.

Outage management↗
DOE OSTI2021

The Significance of Aggregation Methods in Functional Group Modeling

The growth of forests and the feedbacks between forests and environmental changes are central issues in the planetary carbon cycle, global climate change, and basic plant ecology. A challenge to understanding both growth and feedbacks from local to global scales is that many critical metabolic processes vary among species. An innovation in solving this challenge is the recognition that species can be lumped into “functional groups” based on metabolic similarity, and these functional groups can then be studied in computational models that simulate ecosystem function. Despite the vast resources devoted to functional group studies and the progress made by them, an important logical and biological question has not been formally addressed, “How do the groupings alter the results of modeling studies?” To what extent do modeling results depend on the choices made in aggregating taxa into functional groups. Here, we consider the effects of using different aggregation strategies in simulating the carbon dynamics of a deciduous forest. Understanding the impacts that aggregation strategy has on efforts to simulate regional-to-global-scale forest dynamics offers insights into both ecosystem regulation and model function and addresses this central problem in the study of carbon dynamics.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Image feature extraction and galaxy classification: a novel and efficient approach with automated machine learning

ABSTRACT In this work, we explore the possibility of applying machine learning methods designed for 1D problems to the task of galaxy image classification. The algorithms used for image classification typically rely on multiple costly steps, such as the point spread function deconvolution and the training and application of complex Convolutional Neural Networks of thousands or even millions of parameters. In our approach, we extract features from the galaxy images by analysing the elliptical isophotes in their light distribution and collect the information in a sequence. The sequences obtained with this method present definite features allowing a direct distinction between galaxy types. Then, we train and classify the sequences with machine learning algorithms, designed through the platform Modulos AutoML. As a demonstration of this method, we use the second public release of the Dark Energy Survey (DES DR2). We show that we are able to successfully distinguish between early-type and late-type galaxies, for images with signal-to-noise ratio greater than 300. This yields an accuracy of $86{{\ \rm per\ cent}}$ for the early-type galaxies and $93{{\ \rm per\ cent}}$ for the late-type galaxies, which is on par with most contemporary automated image classification approaches. The data dimensionality reduction of our novel method implies a significant lowering in computational cost of classification. In the perspective of future data sets obtained with e.g. Euclid and the Vera Rubin Observatory, this work represents a path towards using a well-tested and widely used platform from industry in efficiently tackling galaxy classification problems at the peta-byte scale.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Likelihood Maximization and Moment Matching in Low SNR Gaussian Mixture Models

We derive an asymptotic expansion for the log-likelihood of Gaussian mixture models (GMMs) with equal covariance matrices in the low signal-to-noise regime. The expansion reveals an intimate connection between two types of algorithms for parameter estimation: the method of moments and likelihood optimizing algorithms such as Expectation-Maximization (EM). We show that likelihood optimization in the low SNR regime reduces to a sequence of least squares optimization problems that match the moments of the estimate to the ground truth moments one by one. This connection is a stepping stone towards the analysis of EM and maximum likelihood estimation in a wide range of models. A motivating application for the study of low SNR mixture models is cryo-electron microscopy data, which can be modeled as a GMM with algebraic constraints imposed on the mixture centers. We discuss the application of our expansion to algebraically constrained GMMs, among other example models of interest. © 2022 The Authors. Communications on Pure and Applied Mathematics published by Wiley Periodicals LLC.

97 MATHEMATICS AND COMPUTING↗