SEARCH · Engineering Papers

Results for “computational challenges”

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.

SourceResearch connectionFrom yearThrough year

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

At least 415 records · Page 23

All sources NASA NTRS DOE OSTI

DOE OSTI2024

An Active Learning-Based Streaming Pipeline for Reduced Data Training of Structure Finding Models in Neutron Diffractometry

Structure determination workloads in neutron diffractometry are computationally expensive and routinely require several hours to many days to determine the structure of a material from its neutron diffraction patterns. The potential for machine learning models trained on simulated neutron scattering patterns to significantly speed up these tasks have been reported recently. However, the amount of simulated data needed to train these models grows exponentially with the number of structural parameters to be predicted and poses a significant computational challenge. To overcome this challenge, we introduce a novel batch-mode active learning (AL) policy that uses uncertainty sampling to simulate training data drawn from a probability distribution that prefers labelled examples about which the model is least certain. We confirm its efficacy in training the same models with ∼ 75% less training data while improving the accuracy. We then discuss the design of an efficient stream-based training workflow that uses this AL policy and present a performance study on two heterogeneous platforms to demonstrate that, compared with a conventional training workflow, the streaming workflow delivers ∼ 20% shorter training time without any loss of accuracy.

Wang, Tianle [Brookhaven National Laboratory (BNL)↗

DOE OSTI2017

Theoretical Framework for Integrating Distributed Energy Resources into Distribution Systems

This paper focuses on developing a novel theoretical framework for effective coordination and control of a large number of distributed energy resources in distribution systems in order to more reliably manage the future U.S. electric power grid under the high penetration of renewable generation. The proposed framework provides a systematic view of the overall structure of the future distribution systems along with the underlying information flow, functional organization, and operational procedures. It is characterized by the features of being open, flexible and interoperable with the potential to support dynamic system configuration. Under the proposed framework, the energy consumption of various DERs is coordinated and controlled in a hierarchical way by using market-based approaches. The real-time voltage control is simultaneously considered to complement the real power control in order to keep nodal voltages stable within acceptable ranges during real time. In addition, computational challenges associated with the proposed framework are also discussed with recommended practices.

Lian, Jianming↗

DOE OSTI2018

Identifying and Characterizing Non-Convexities in the Feasible Spaces of Optimal Power Flow Problems

Optimal power flow (OPF) is an important problem in the operation of electric power systems. The solution to an OPF problem provides a minimum cost operating point that satisfies constraints imposed by both the non-linear power flow equations and engineering limits. These constraints can yield non-convex feasible spaces that result in significant computational challenges. This brief proposes an algorithm that identifies and characterizes non-convexities in OPF feasible spaces. This algorithm searches for a pair of feasible points whose connecting line segment contains an infeasible point. Such points certify the existence of a non-convexity in the OPF feasible space. Moreover, the constraint violations at the infeasible point along the connecting line segment physically characterize a cause of the non-convexity. Numerical demonstrations include a small illustrative example as well as applications to various test cases.

Molzahn, Daniel K.↗

DOE OSTI2018

Representing Operational Flexibility in Generation Expansion Planning Through Convex Relaxation of Unit Commitment

Large shares of renewable generation in electric power systems increase the need for operational flexibility. Consideration of operational flexibility in generation expansion planning (GEP) necessitates the modeling of unit commitment (UC) in system operations. However, the UC problem itself is computationally challenging. We present a GEP model in which the embedded operational problem is a convex relaxation of the UC problem. Through a large-scale example based on the Texas system, we show the tightness and tractability of our relaxation, as well as the impact of operational flexibility on GEP.

convex optimization↗

DOE OSTI2021

Guaranteeing a Physically Realizable Battery Dispatch Without Charge-Discharge Complementarity Constraints

The non-convex complementarity constraints present a fundamental computational challenge in energy constrained optimization problems. In this work, we present a new, linear, and robust battery optimization formulation that sidesteps the need for battery complementarity constraints and integers and prove analytically that the formulation guarantees that all energy constraints are satisfied which ensures that the optimized battery dispatch is physically realizable. In addition, we bound the worst-case model mismatch and discuss conservativeness. In conclusion, simulation results further illustrate the effectiveness of this approach.

25 ENERGY STORAGE↗

DOE OSTI2022

Multi-objective optimization of root phenotypes for nutrient capture using evolutionary algorithms

Root phenotypes are avenues to the development of crop cultivars with improved nutrient capture, which is an important goal for global agriculture. The fitness landscape of root phenotypes is highly complex and multidimensional. It is difficult to predict which combinations of traits (phene states) will create the best performing integrated phenotypes in various environments. Brute force methods to map the fitness landscape by simulating millions of phenotypes in multiple environments are computationally challenging. Evolutionary optimization algorithms may provide more efficient avenues to explore high dimensional domains such as the root phenotypic space. We coupled the three-dimensional functional–structural plant model, SimRoot, to the Borg Multi-Objective Evolutionary Algorithm (MOEA) and the evolutionary search over several generations facilitated the identification of optimal root phenotypes balancing trade-offs across nutrient uptake, biomass accumulation, and root carbon costs in environments varying in nutrient availability. Our results show that several combinations of root phenes generate optimal integrated phenotypes where performance in one objective comes at the cost of reduced performance in one or more of the remaining objectives, and such combinations differed for mobile and non-mobile nutrients and for maize (a monocot) and bean (a dicot). Functional–structural plant models can be used with multi-objective optimization to identify optimal root phenotypes under various environments, including future climate scenarios, which will be useful in developing the more resilient, efficient crops urgently needed in global agriculture.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

A comparison of histopathology imaging comprehension algorithms based on multiple instance learning

Whole slide imaging (WSI), also called digital virtual microscopy, is a new imaging modality. It allows for the application of AI and machine learning methods to cancer pathology to help establish a means for the automatic diagnosis of cancer cases. However, designing machine-learning models for WSI is computationally challenging due to its required ultra-high resolution. The current state-of-the-art models use multiple instance learning (MIL). MIL is a weakly-supervised learning method in which the model uses an array of inferences from many smaller instances to make a final classification about the entire set. In the context of WSI, researchers divide the ultra-high-resolution image into many patches. The model then classifies the slide based on an array of inferences from the patches. Among several ways of making the final classification, attention-based mechanisms have resulted in superb accuracy scores. The Transformer, one attention-based algorithm, has reported substantial improvements for WSI comprehension tasks. In this project, we studied and compared several WSI comprehension algorithms. We used the following three datasets: CAMELYON16+17, TCGALung, and TCGA-Kidney. We found that attention-based MIL algorithms performed better than standard MIL algorithms for classifying WSI images, achieving a higher mean accuracy and AUC. However, none of the attention-based algorithms performed significantly better than the others, reporting accuracy scores that varied widely. Presumably, it is due to the limited availability of training samples in the data corpus. Since it is not easy to increase the samples from human subjects, some machine learning techniques like transfer learning could help mitigate this issue.

Saunders, Adam↗

DOE OSTI2018

A numerical hybrid model for outdoor sound propagation in complex urban environments

Noise mapping in large and dense urban areas is computationally challenging, if not impossible, with the use of conventional numerical techniques. Recently, promising results have shown the potential of energy-based models to compete with conventional numerical techniques. In this study, a hybrid full-wave/diffusion propagation model is proposed to address some of the flaws of the traditional diffusion model. The full-wave model is used for predicting sound propagation (i) near the source, where interactions between waves are important, and (ii) outside the cluttered environment, where free-field-like conditions apply. Finally, the diffusion model is used in regions where diffusion conditions are met.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Systematic electronic structure in the cuprate parent state from quantum many-body simulations

The quantitative description of correlated electron materials remains a modern computational challenge. We demonstrate a numerical strategy to simulate correlated materials at the fully ab initio level beyond the solution of effective low-energy models and apply it to gain a detailed microscopic understanding across a family of cuprate superconducting materials in their parent undoped states. We uncover microscopic trends in the electron correlations and reveal the link between the material composition and magnetic energy scales through a many-body picture of excitation processes involving the buffer layers. Our work illustrates a path toward a quantitative and reliable understanding of more complex states of correlated materials at the ab initio many-body level.

Science & Technology - Other Topics↗

DOE OSTI2012

Ab initio structural modeling of and experimental validation for Chlamydia trachomatis protein CT296 reveal structural similarity to Fe(II) 2-oxoglutarate-dependent enzymes

Chlamydia trachomatis is a medically important pathogen that encodes a relatively high percentage of proteins with unknown function. The three-dimensional structure of a protein can be very informative regarding the protein's functional characteristics; however, determining protein structures experimentally can be very challenging. Computational methods that model protein structures with sufficient accuracy to facilitate functional studies have had notable successes. To evaluate the accuracy and potential impact of computational protein structure modeling of hypothetical proteins encoded by Chlamydia, a successful computational method termed I-TASSER was utilized to model the three-dimensional structure of a hypothetical protein encoded by open reading frame (ORF) CT296. CT296 has been reported to exhibit functional properties of a divalent cation transcription repressor (DcrA), with similarity to the Escherichia coli iron-responsive transcriptional repressor, Fur. Unexpectedly, the I-TASSER model of CT296 exhibited no structural similarity to any DNA-interacting proteins or motifs. To validate the I-TASSER-generated model, the structure of CT296 was solved experimentally using X-ray crystallography. Impressively, the ab initio I-TASSER-generated model closely matched (2.72-{angstrom} C{alpha} root mean square deviation [RMSD]) the high-resolution (1.8-{angstrom}) crystal structure of CT296. Modeled and experimentally determined structures of CT296 share structural characteristics of non-heme Fe(II) 2-oxoglutarate-dependent enzymes, although key enzymatic residues are not conserved, suggesting a unique biochemical process is likely associated with CT296 function. Additionally, functional analyses did not support prior reports that CT296 has properties shared with divalent cation repressors such as Fur.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2025

Covariance-Free Bifidelity Control Variates Importance Sampling for Rare Event Reliability Analysis

Multifidelity modeling has been steadily gaining attention as a tool to address the problem of exorbitant model evaluation costs that makes the estimation of failure probabilities a significant computational challenge for complex real-world problems, particularly when failure is a rare event. To implement multifidelity modeling, estimators that efficiently combine information from multiple models/sources are necessary. In past works, the variance reduction techniques of control variates (CV) and importance sampling (IS) have been leveraged for this task. In this paper, we present the CVIS framework—a creative take on a coupled CV and IS estimator for bifidelity reliability analysis. The framework addresses some of the practical challenges of the CV method by using an estimator for the control variate mean and sidestepping the need to estimate the covariance between the original estimator and the control variate through a clever choice for the tuning constant. Furthermore, the task of selecting an efficient IS distribution is also considered, with a view towards maximally leveraging the bifidelity structure and maintaining expressivity. Additionally, a diagnostic is provided that indicates both the efficiency of the algorithm as well as the relative predictive quality of the models utilized. Finally, the behavior and performance of the framework is explored through analytical and numerical examples.

Markov chain Monte Carlo↗

DOE OSTI2013

Supercomputer assisted generation of machine learning agents for the calibration of building energy models. In: XSEDE '13 Proceedings of the Conference on Extreme Science and Engineering Discovery Environment: Gateway to Discovery, Article No. 22

Building Energy Modeling (BEM) is an approach to model the energy usage in buildings for design and retrofit purposes. EnergyPlus is the flagship Department of Energy software that performs BEM for different types of buildings. The input to EnergyPlus can often extend in the order of a few thousand parameters which have to be calibrated manually by an expert for realistic energy modeling. This makes it challenging and expensive thereby making building energy modeling unfeasible for smaller projects. In this paper, we describe the "Autotune" research which employs machine learning algorithms to generate agents for the different kinds of standard reference buildings in the U.S. building stock. The parametric space and the variety of building locations and types make this a challenging computational problem necessitating the use of supercomputers. Millions of EnergyPlus simulations are run on supercomputers which are subsequently used to train machine learning algorithms to generate agents. These agents, once created, can then run in a fraction of the time thereby allowing cost-effective calibration of building models.

Sanyal, Jibonananda↗

DOE OSTI2019

Near-Optimal and Practical Algorithms for Graph Scan Statistics with Connectivity Constraints

One fundamental task in network analysis is detecting “hotspots” or “anomalies” in the network; that is, detecting subgraphs where there is significantly more activity than one would expect given historical data or some baseline process. Scan statistics is one popular approach used for anomalous subgraph detection. This methodology involves maximizing a score function over all connected subgraphs, which is a challenging computational problem. A number of heuristics have been proposed for these problems, but they do not provide any quality guarantees. Here, we propose a framework for designing algorithms for optimizing a large class of scan statistics for networks, subject to connectivity constraints. Our algorithms run in time that scales linearly on the size of the graph and depends on a parameter we call the “effective solution size,” while providing rigorous approximation guarantees. In contrast, most prior methods have super-linear running times in terms of graph size. Extensive empirical evidence demonstrates the effectiveness and efficiency of our proposed algorithms in comparison with state-of-the-art methods. Our approach improves on the performance relative to all prior methods, giving up to over 25% increase in the score. Further, our algorithms scale to networks with up to a million nodes, which is 1–2 orders of magnitude larger than all prior applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Efficacy of using a dynamic length representation vs. a fixed-length for neuroarchitecture search

Deep learning neuroarchitecture and hyperparameter search are important in finding the best configuration that maximizes learned model accuracy. However, the number of types of layers, their associated hyperparameters, and the myriad of ways to connect layers poses a significant computational challenge in discovering ideal model configurations. Here, we assess two different approaches for neuroarchitecture search for a LeNet style neural network, one that uses a fixed-length approach where there is a preset number of possible layers that can be toggled on or off via mutation, and a variable-length approach where layers can be freely added or removed via special mutation operators. We found that the variable-length implementation trained better models while discovering unusual layer configurations worth further exploration.

Coletti, Mark↗

DOE OSTI2021

Vibronic and Environmental Effects in Simulations of Optical Spectroscopy

Including both environmental and vibronic effects is important for accurate simulation of optical spectra, but combining these effects remains computationally challenging. We outline two approaches that consider both the explicit atomistic environment and the vibronic transitions. Both phenomena are responsible for spectral shapes in linear spectroscopy and the electronic evolution measured in nonlinear spectroscopy. The first approach utilizes snapshots of chromophore-environment configurations for which chromophore normal modes are determined. We outline various approximations for this static approach that assumes harmonic potentials and ignores dynamic system-environment coupling. The second approach obtains excitation energies for a series of time-correlated snapshots. This dynamic approach relies on the accurate truncation of the cumulant expansion but treats the dynamics of the chromophore and the environment on equal footing. Both approaches show significant potential for making strides toward more accurate optical spectroscopy simulations of complex condensed phase systems.

Chemistry↗

DOE OSTI2021

Review of Wind–Wave Coupling Models for Large-Eddy Simulation of the Marine Atmospheric Boundary Layer

Abstract We present a review of existing wind–wave coupling models and parameterizations used for large-eddy simulation of the marine atmospheric boundary layer. The models are classified into two main categories: (i) the wave-phase-averaged, sea surface–roughness models and (ii) the wave-phase-resolved models. Both categories are discussed from their implementation, validity, and computational efficiency viewpoints, with emphasis given on their applicability in offshore wind energy problems. In addition to the various models discussed, a review of laboratory-scale and field-measurement databases is presented thereafter. The majority of the presented data have been gathered over many decades of studying air–sea interaction phenomena, with the most recent ones compiled to reflect an offshore wind energy perspective. Both provide valuable data for model validation. We also discuss the modeling knowledge gaps and computational challenges ahead.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

VariantStore: an index for large-scale genomic variant search

Abstract Efficiently scaling genomic variant search indexes to thousands of samples is computationally challenging due to the presence of multiple coordinate systems to avoid reference biases. We present VariantStore, a system that indexes genomic variants from multiple samples using a variation graph and enables variant queries across any sample-specific coordinate system. We show the scalability of VariantStore by indexing genomic variants from the TCGA project in 4 h and the 1000 Genomes project in 3 h. Querying for variants in a gene takes between 0.002 and 3 seconds using memory only 10% of the size of the full representation.

Pandey, Prashant↗

DOE OSTI2017

Extreme-Scale De Novo Genome Assembly

De novo whole genome assembly reconstructs genomic sequence from short, overlapping, and potentially erroneous DNA segments and is one of the most important computations in modern genomics. This work presents HipMER, a high-quality end-to-end de novo assembler designed for extreme scale analysis, via efficient parallelization of the Meraculous code. Genome assembly software has many components, each of which stresses different components of a computer system. This chapter explains the computational challenges involved in each step of the HipMer pipeline, the key distributed data structures, and communication costs in detail. We present performance results of assembling the human genome and the large hexaploid wheat genome on large supercomputers up to tens of thousands of cores.

59 BASIC BIOLOGICAL SCIENCES↗