Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complexity bounding”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Optimal band structure for thermoelectrics with realistic scattering and bands

Abstract Understanding how to optimize electronic band structures for thermoelectrics is a topic of long-standing interest in the community. Prior models have been limited to simplified bands and/or scattering models. In this study, we apply more rigorous scattering treatments to more realistic model band structures—upward-parabolic bands that inflect to an inverted-parabolic behavior—including cases of multiple bands. In contrast to common descriptors (e.g., quality factor and complexity factor), the degree to which multiple pockets improve thermoelectric performance is bounded by interband scattering and the relative shapes of the bands. We establish that extremely anisotropic “flat-and-dispersive” bands, although best-performing in theory, may not represent a promising design strategy in practice. Critically, we determine optimum bandwidth, dependent on temperature and lattice thermal conductivity, from perfect transport cutoffs that can in theory significantly boost z T beyond the values attainable through intrinsic band structures alone. Our analysis should be widely useful as the thermoelectric research community eyes z T > 3.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1970

FASTER 3: A generalized-geometry Monte Carlo computer program for the transport of neutrons and gamma rays. Volume 1: Summary report

The theory used in FASTER-III, a Monte Carlo computer program for the transport of neutrons and gamma rays in complex geometries, is outlined. The program includes the treatment of geometric regions bounded by quadratic and quadric surfaces with multiple radiation sources which have specified space, angle, and energy dependence. The program calculates, using importance sampling, the resulting number and energy fluxes at specified point, surface, and volume detectors. It can also calculate minimum weight shield configuration meeting a specified dose rate constraint. Results are presented for sample problems involving primary neutron, and primary and secondary photon, transport in a spherical reactor shield configuration.

Jordan, T. M.↗
NASA NTRS1983

On the resolvent condition in the Kreiss matrix theorem

The Kreiss Matrix Theorem asserts the uniform equivalence over all N x N matrices of power boundedness and a certain resolvent estimate. It is shown that the ratio of the constants in these two conditions grows linearly with N, and the optimal proportionality factor is obtained up to a factor of 2. Analogous results are also given for the related problem involving matrix exponentials. The proofs make use of a lemma that may be of independent interest, which bounds the arch length of the image of a circle in the complex plane under a rational function.

Leveque, R. J.↗
NASA NTRS1992

Fault-tolerant wait-free shared objects

A concurrent system consists of processes and shared objects. Previous research focused on the problem of tolerating process failure. We study the complementary problem of tolerating failures. We divide object failures into two broad classes: responsive and non-responsive. With responsive failures, a faulty object responds to every invocation, but responses may be incorrect. With non-responsive failures, a faulty object may also 'hang' without responding. For each class, we consider crash, and arbitrary types of failures. For each type of failure, we are seeking a universal implementation for fault-tolerant wait-free shared objects. We present (deterministic) implementations for all types of responsive failures, including arbitrary failures. In contrast, we show that even the most benign type of non-responsive failures requires the use of randomization. Of special interest is the problem of implementing fault-tolerant objects using only objects of the same type. We present such fault-tolerant self-implementations for many common object types. Graceful degradation is a desirable property of fault-tolerant implementations: the implemented object never fails more severely than the base objects it is derived from, even if all the base objects fail. For several failure models, we show whether this property can be achieved, and, if so, how. In addition to the above possibility/impossibility results, we also consider the resources complexity of fault-tolerant implementations. In many cases, we present lower bounds and give matching algorithms.

Jayanti, Prasad↗
NASA NTRS1996

Fatigue response of perforated titanium for application in laminar flow control

The room temperature tensile and fatigue response of non-perforated and perforated titanium for laminar flow control application was investigated both experimentally and analytically. Results showed that multiple perforations did not affect the tensile response, but did reduce the fatigue life. A two dimensional finite element stress analysis was used to determine that the stress fields from adjacent perforations did not influence one another. The stress fields around the holes did not overlap one another, allowing the materials to be modeled as a plate with a center hole. Fatigue life was predicted using an equivalent MW flow size approach to relate the experimental results to microstructural features of the titanium. Predictions using flaw sizes ranging from 1 to 15 microns correlated within a factor of 2 with the experimental results by using a flow stress of 260 MPa. By using two different flow stresses in the crack closure model and correcting for plasticity, the experimental results were bounded by the predictions for high applied stresses. Further analysis of the complex geometry of the perforations and the local material chemistry is needed to further understand the fatigue behavior of the perforated titanium.

Johnson, W. Steven↗
NASA NTRS1999

A Probabilistic Approach of Incorporating Safety and Reliability in System Designs for a Manned Mission to Mars

Conceptual stages in mission design often lack the input of quantitative safety and reliability assessments, simply because failure rates or other data are not yet available for systems that have not yet been designed. Absence of such data should not, however, prevent the development of a quantitative risk models with placeholders for missing data. Functions (that is, actions the systems must perform) in mission design will eventually require system probabilities of success, and there could be much learned from surrogate data, adequately bounded in uncertainty, used in a large event tree model of a complex mission.

Railsback, Jan W.↗
NASA NTRS2006

Convective Weather Forecast Quality Metrics for Air Traffic Management Decision-Making

Since numerical weather prediction models are unable to accurately forecast the severity and the location of the storm cells several hours into the future when compared with observation data, there has been a growing interest in probabilistic description of convective weather. The classical approach for generating uncertainty bounds consists of integrating the state equations and covariance propagation equations forward in time. This step is readily recognized as the process update step of the Kalman Filter algorithm. The second well known method, known as the Monte Carlo method, consists of generating output samples by driving the forecast algorithm with input samples selected from distributions. The statistical properties of the distributions of the output samples are then used for defining the uncertainty bounds of the output variables. This method is computationally expensive for a complex model compared to the covariance propagation method. The main advantage of the Monte Carlo method is that a complex non-linear model can be easily handled. Recently, a few different methods for probabilistic forecasting have appeared in the literature. A method for computing probability of convection in a region using forecast data is described in Ref. 5. Probability at a grid location is computed as the fraction of grid points, within a box of specified dimensions around the grid location, with forecast convection precipitation exceeding a specified threshold. The main limitation of this method is that the results are dependent on the chosen dimensions of the box. The examples presented Ref. 5 show that this process is equivalent to low-pass filtering of the forecast data with a finite support spatial filter. References 6 and 7 describe the technique for computing percentage coverage within a 92 x 92 square-kilometer box and assigning the value to the center 4 x 4 square-kilometer box. This technique is same as that described in Ref. 5. Characterizing the forecast, following the process described in Refs. 5 through 7, in terms of percentage coverage or confidence level is notionally sound compared to characterizing in terms of probabilities because the probability of the forecast being correct can only be determined using actual observations. References 5 through 7 only use the forecast data and not the observations. The method for computing the probability of detection, false alarm ratio and several forecast quality metrics (Skill Scores) using both the forecast and observation data are given in Ref. 2. This paper extends the statistical verification method in Ref. 2 to determine co-occurrence probabilities. The method consists of computing the probability that a severe weather cell (grid location) is detected in the observation data in the neighborhood of the severe weather cell in the forecast data. Probabilities of occurrence at the grid location and in its neighborhood with higher severity, and with lower severity in the observation data compared to that in the forecast data are examined. The method proposed in Refs. 5 through 7 is used for computing the probability that a certain number of cells in the neighborhood of severe weather cells in the forecast data are seen as severe weather cells in the observation data. Finally, the probability of existence of gaps in the observation data in the neighborhood of severe weather cells in forecast data is computed. Gaps are defined as openings between severe weather cells through which an aircraft can safely fly to its intended destination. The rest of the paper is organized as follows. Section II summarizes the statistical verification method described in Ref. 2. The extension of this method for computing the co-occurrence probabilities in discussed in Section HI. Numerical examples using NCWF forecast data and NCWD observation data are presented in Section III to elucidate the characteristics of the co-occurrence probabilities. This section also discusses the procedure for computing throbabilities that the severity of convection in the observation data will be higher or lower in the neighborhood of grid locations compared to that indicated at the grid locations in the forecast data. The probability of coverage of neighborhood grid cells is also described via examples in this section. Section IV discusses the gap detection algorithm and presents a numerical example to illustrate the method. The locations of the detected gaps in the observation data are used along with the locations of convective weather cells in the forecast data to determine the probability of existence of gaps in the neighborhood of these cells. Finally, the paper is concluded in Section V.

Chatterji, Gano B.↗
DOE OSTI2024

Uncertainty quantification of graph convolution neural network models of evolving processes

The application of neural network models to scientific machine learning tasks has proliferated in recent years. In particular, neural networks have proved to be adept at modeling processes with spatial–temporal complexity. Nevertheless, these highly parameterized models have garnered skepticism in their ability to produce outputs with quantified error bounds over the regimes of interest. Hence there is a need to find uncertainty quantification methods that are suitable for neural networks. In this work we present comparisons of the parametric uncertainty quantification of neural networks modeling complex spatial–temporal processes with Hamiltonian Monte Carlo and Stein variational gradient descent and its projected variant. Specifically we apply these methods to graph convolutional neural network models of evolving systems modeled with recurrent neural network and neural ordinary differential equations architectures. We show that Stein variational inference is a viable alternative to Monte Carlo methods with some clear advantages for complex neural network models. For our exemplars, Stein variational interference gave similar pushed forward uncertainty profiles through time compared to Hamiltonian Monte Carlo, albeit with generally more generous variance. As a result, projected Stein variational gradient descent also produced similar uncertainty profiles to the non-projected counterpart, but large reductions in the active weight space were confounded by the stability of the neural network predictions and the convoluted likelihood landscape.

36 MATERIALS SCIENCE↗
NASA NTRS2015

A Framework for Orbital Performance Evaluation in Distributed Space Missions for Earth Observation

Distributed Space Missions (DSMs) are gaining momentum in their application to earth science missions owing to their unique ability to increase observation sampling in spatial, spectral and temporal dimensions simultaneously. DSM architectures have a large number of design variables and since they are expected to increase mission flexibility, scalability, evolvability and robustness, their design is a complex problem with many variables and objectives affecting performance. There are very few open-access tools available to explore the tradespace of variables which allow performance assessment and are easy to plug into science goals, and therefore select the most optimal design. This paper presents a software tool developed on the MATLAB engine interfacing with STK, for DSM orbit design and selection. It is capable of generating thousands of homogeneous constellation or formation flight architectures based on pre-defined design variable ranges and sizing those architectures in terms of predefined performance metrics. The metrics can be input into observing system simulation experiments, as available from the science teams, allowing dynamic coupling of science and engineering designs. Design variables include but are not restricted to constellation type, formation flight type, FOV of instrument, altitude and inclination of chief orbits, differential orbital elements, leader satellites, latitudes or regions of interest, planes and satellite numbers. Intermediate performance metrics include angular coverage, number of accesses, revisit coverage, access deterioration over time at every point of the Earth's grid. The orbit design process can be streamlined and variables more bounded along the way, owing to the availability of low fidelity and low complexity models such as corrected HCW equations up to high precision STK models with J2 and drag. The tool can thus help any scientist or program manager select pre-Phase A, Pareto optimal DSM designs for a variety of science goals without having to delve into the details of the engineering design process.

Earth Science↗
NASA NTRS1993

Localization of the chaperone binding site

The hypothesis derived from models of the multi-oligomeric chaperone complex suggests that partially denatured proteins bind in a central cavity in the aggregate. To test this hypothesis, the molecular chaperone, alpha crystallin, was bound to partially denatured forms of gamma crystallin, and the binding site was visualized by immunogold localization. In an alternative approach, gold particles were directly complexed with gamma crystallin, followed by binding to the alpha crystallin aggregate. In both cases, binding was localized to the central region of the aggregate, confirming for the first time that partially denatured proteins do indeed bind to a central region of the molecular chaperone aggregate.

Non-NASA Center↗
DOE OSTI2021

Hamiltonian simulation in the low-energy subspace

Abstract We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian H . This is a central problem in physics with vast applications in many-body systems and beyond, where the interesting physics takes place in the low-energy sector. We analyze error bounds induced by product formulas that approximate the evolution operator and show that these bounds depend on an effective low-energy norm of H . We find improvements over the best previous complexities of product formulas that apply to the general case, and these improvements are more significant for long evolution times that scale with the system size and/or small approximation errors. To obtain these improvements, we prove exponentially decaying upper bounds on the leakage to high-energy subspaces due to the product formula. Our results provide a path to a systematic study of Hamiltonian simulation at low energies, which will be required to push quantum simulation closer to reality.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Isolation of Ce( IV ) centered polyoxoalkoxide sandwich-type complexes allows comparison of metal–oxygen bond covalency

The new Ce III centered sandwich-type complex (TBA) 3 [Ce{W 4 O 13 (OMe) 4 MoNO} 2 ] is reported. The redox properties of this molecule, and its all-molybdenum analogue, (TBA) 3 [Ce{Mo 5 O 13 (OMe) 4 NO} 2 ], were investigated using cyclic voltammetry. The data reveals the presence of reversible Ce IV /Ce III redox couples at modest potentials. One electron oxidation of the complexes provides facile access to the corresponding Ce IV derivatives, which were fully characterized. 17 O NMR spectroscopy reveals that the chemical shifts of the oxygen nuclei directly bound to Ce IV are much higher than the corresponding signals in isostructural, diamagnetic, Zr IV , Hf IV , or Th IV centered complexes. Density functional theory (DFT) calculations indicate that the increase in chemical shift correlates with an increase in the covalency of the M IV –O bonds, illustrating that 17 O NMR spectroscopy is a powerful experimental tool for interrogating the nature of metal oxygen bonding in diamagnetic complexes.

Shiels, Dominic [Univ. of Rochester, NY (United St↗
DOE OSTI2020

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗
DOE OSTI2024

Dinickel enzyme evolved to metabolize the pharmaceutical metformin and its implications for wastewater and human microbiomes

Metformin is the first-line treatment for type II diabetes patients and a pervasive pollutant with more than 180 million kg ingested globally and entering wastewater. The drug’s direct mode of action is currently unknown but is linked to effects on gut microbiomes and may involve specific gut microbial reactions to the drug. In wastewater treatment plants, metformin is known to be transformed by microbes to guanylurea, although genes encoding this metabolism had not been elucidated. In the present study, we revealed the function of two genes responsible for metformin decomposition (mfmA and mfmB) found in isolated bacteria from activated sludge. MfmA and MfmB form an active heterocomplex (MfmAB) and are members of the ureohydrolase protein superfamily with binuclear metal-dependent activity. MfmAB is nickel-dependent and catalyzes the hydrolysis of metformin to dimethylamine and guanylurea with a catalytic efficiency (k cat /K M ) of 9.6 × 10 3 M -1 s -1 and KM for metformin of 0.82 mM. MfmAB shows preferential activity for metformin, being able to discriminate other close substrates by several orders of magnitude. Crystal structures of MfmAB show coordination of binuclear nickel bound in the active site of the MfmA subunit but not MfmB subunits, indicating that MfmA is the active site for the MfmAB complex. Mutagenesis of residues conserved in the MfmA active site revealed those critical to metformin hydrolase activity and its small substrate binding pocket allowed for modeling of bound metformin. In conclusion, this study characterizes the products of the mfmAB genes identified in wastewater treatment plants on three continents, suggesting that metformin hydrolase is widespread globally in wastewater.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Human IgE monoclonal antibodies define two unusual epitopes trapping dog allergen Can f 1 in different conformations

Abstract Molecular analysis of interactions between IgE antibody and allergen allows the structural basis of IgE recognition to be defined. Human IgE (hIgE) epitopes of respiratory lipocalin allergens, including Can f 1, remain elusive due to a lack of IgE‐allergen complexes. This study aims to map the structure of allergenic epitopes on Can f 1. The fragment antigen‐binding (Fab) regions of Can f 1 specific human IgE monoclonal antibodies (hIgE mAb) were used to determine the structures of IgE epitopes. Epitope mutants were designed to target Can f 1 epitopes. Immunoassays and a human FcεRIαtransgenic mouse model of passive anaphylaxis in vivo were used to assess the functional activity of epitope mutants. Crystal structures of natural or recombinant Can f 1 complexed with two hIgE mAb 1J11 and 12F3 Fabs, respectively, were determined. The hIgE mAb bound to two partially overlapping epitopes and recognized two different Can f 1 conformations. The hIgE mAb 12F3 showed an unusual mode of binding by protruding its heavy chain CDR3 inside the Can f 1 calyx. Epitope mutants generated based on the structural analyses displayed a 64%–89% reduction in IgE antibody binding and failed to induce passive anaphylaxis in a human FcεRIαtransgenic mouse model. In summary, the structures of Can f 1‐hIgE Fab complexes revealed two unique and partially overlapping epitopes on Can f 1. The modification of the identified IgE epitopes provides a pathway for the design of hypoallergens to treat dog allergies.

Biochemistry & Molecular Biology↗
DOE OSTI2021

Advancing Tassel Detection and Counting: Annotation and Algorithms

Tassel counts provide valuable information related to flowering and yield prediction in maize, but are expensive and time-consuming to acquire via traditional manual approaches. High-resolution RGB imagery acquired by unmanned aerial vehicles (UAVs), coupled with advanced machine learning approaches, including deep learning (DL), provides a new capability for monitoring flowering. In this article, three state-of-the-art DL techniques, CenterNet based on point annotation, task-aware spatial disentanglement (TSD), and detecting objects with recursive feature pyramids and switchable atrous convolution (DetectoRS) based on bounding box annotation, are modified to improve their performance for this application and evaluated for tassel detection relative to Tasselnetv2+. The dataset for the experiments is comprised of RGB images of maize tassels from plant breeding experiments, which vary in size, complexity, and overlap. Results show that the point annotations are more accurate and simpler to acquire than the bounding boxes, and bounding box-based approaches are more sensitive to the size of the bounding boxes and background than point-based approaches. Overall, CenterNet has high accuracy in comparison to the other techniques, but DetectoRS can better detect early-stage tassels. The results for these experiments were more robust than Tasselnetv2+, which is sensitive to the number of tassels in the image.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Quantifying the generalization error in deep learning in terms of data distribution and neural network smoothness

We report the accuracy of deep learning, i.e., deep neural networks, can be characterized by dividing the total error into three main types: approximation error, optimization error, and generalization error. Whereas there are some satisfactory answers to the problems of approximation and optimization, much less is known about the theory of generalization. Most existing theoretical works for generalization fail to explain the performance of neural networks in practice. To derive a meaningful bound, we study the generalization error of neural networks for classification problems in terms of data distribution and neural network smoothness. We introduce the cover complexity (CC) to measure the difficulty of learning a data set and the inverse of the modulus of continuity to quantify neural network smoothness. A quantitative bound for expected accuracy/error is derived by considering both the CC and neural network smoothness. Although most of the analysis is general and not specific to neural networks, we validate our theoretical assumptions and results numerically for neural networks by several data sets of images. The numerical results confirm that the expected error of trained networks scaled with the square root of the number of classes has a linear relationship with respect to the CC. We also observe a clear consistency between test loss and neural network smoothness during the training process. In addition, we demonstrate empirically that the neural network smoothness decreases when the network size increases whereas the smoothness is insensitive to training dataset size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Bounding uncertainty in functional data: A case study

Functional data are fast becoming a preeminent source of information across a wide range of industries. A particularly challenging aspect of functional data is bounding uncertainty. In this unique case study, we present our attempts at creating bounding functions for selected applications at Sandia National Laboratories (SNL). The first attempt involved a simple extension of functional principal component analysis (fPCA) to incorporate covariates. Though this method was straightforward, the extension was plagued by poor coverage accuracy for the bounding curve. This led to a second attempt utilizing elastic methodology which yielded more accurate coverage at the cost of more complexity.

97 MATHEMATICS AND COMPUTING↗