Search NASA⌕ Search

SEARCH · Search NASA

Results for “setting”

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 37 records · Page 2

The Sensitivity of B3LYP Atomization Energies to the Basis Set and a Comparison of the Basis Set Requirements for CCSD(T) and B3LYP

The atomization energies of the 55 G2 molecules are computed using the B3LYP approach with a variety of basis sets. The 6-311 + G(3df) basis set is found to yield superior results to those obtained using the augmented - correlation - consistent valence-polarized triple-zeta set. The atomization energy of SO2 is found to be the most sensitive to basis set and is studied in detail. Including tight d functions is found to be important for obtaining good atomization energies. The results for SO2 are compared with those obtained using the coupled-cluster singles and doubles approach including a perturbational estimate of the triple excitations.

Bauschlicher, Charles W., Jr.↗

TOPSIS method based on the connection number of set pair analysis under interval-valued intuitionistic fuzzy set environment

The objective of this paper is to focus on multi-attribute decision-making for interval-valued intuitionistic fuzzy set environment based on set pair analysis (SPA). For it, the major component of the SPA known as connection number has been constructed based on the set pairs between two preference values consists of every attribute and ideal pairs of it. Based on these connection numbers, an extension of technique for order of preference by similarity to ideal solution method is developed by combining the proposed connection number for IVIFSs and hence finding the best alternative(s) using relative degree of closeness coefficient. An illustrative example has been given for demonstrating the approach and compares their performance with some existing measures.

97 MATHEMATICS AND COMPUTING↗

Measuring uncertainty by extracting fuzzy rules using rough sets and extracting fuzzy rules under uncertainty and measuring definability using rough sets

Computers are not designed to handle terms where uncertainty is present. To deal with uncertainty, techniques other than classical logic must be developed. This paper examines the concepts of statistical analysis, the Dempster-Shafer theory, rough set theory, and fuzzy set theory to solve this problem. The fundamentals of these theories are combined to provide the possible optimal solution. By incorporating principles from these theories, a decision-making process may be simulated by extracting two sets of fuzzy rules: certain rules and possible rules. From these rules a corresponding measure of how much we believe these rules is constructed. From this, the idea of how much a fuzzy diagnosis is definable in terms of its fuzzy attributes is studied.

Worm, Jeffrey A.↗

The Number of Support Constraints for Overlapping Set Optimization with Nested Admissible Sets Is Equal to One

This paper reports on the formalization of a recent result by Crespo, et al., as found in the references. The formalized result bounds the number of support constraints in a particular type of optimization problem. The problem involves discovering an optimal member of a family of sets that overlaps each member of a constraining collection of sets. The particular case addressed here concerns optimizations in which the family of sets is nested. The primary results were formalized in the interactive theorem prover PVS and support the claim that a single support constraint exists in very general circumstances.

Siratt, John↗

Delineating Facies Spatial Distribution by Integrating Ensemble Data Assimilation and Indicator Geostatistics with Level-Set Transformation

The facies-based approach has been widely adopted to delineate an aquifer into distinct geological units with unique distributions of hydraulic, physical, and/or chemical properties. The recent development in ensemble-based data assimilation methods allows both the direct and indirect data to be used to improve facies delineation. A major difficulty in those applications is to honor the spatial continuity and avoid overfitting after data assimilation. We introduce a new facies delineation framework to integrate ensemble data assimilation with traditional transition probability-based geostatistics. A level-set concept is used to parametrize discrete facies indicators and for updating facies shape. During the iterative data assimilation process, we impose spatial continuity by conditioning facies field generation on points selected adaptively based on their sensitivity to observation data. This reconditioning step is a key step to maintain spatial continuity and overcome over-fitting problems in inversion. We selected two examples to evaluate the performance of the new framework in estimating facies-based permeability field. The first example is a two-dimensional synthetic system with transient head data induced by pumping tests used for delineating two facies. The second example is a three-dimensional case with three facies, conceptualized from a field tracer experiment within the Columbia River corridor in Washington State, USA. Both examples demonstrate that the new method can adequately capture the spatial pattern of hydrofacies with reconditioning, which leads to the improved prediction of system behaviors.

Song, Xuehang↗

Intersections of Disadvantaged Communities and Renewable Energy Potential: Data Set and Analysis to Inform Equitable Investment Prioritization in the United States

Renewable energy development can bolster local economies through job creation, local tax revenues, and reduced energy costs; however, communities most in need of economic development and employment opportunities often see lower levels of renewable energy deployment. We sought to identify areas where disadvantaged community indicators and high generation potential from cost-effective renewable energy opportunities intersect and deployment could lead to economic development and job creation. This presentation will highlight several of our findings. This research and the associated county-level data set are intended to inform national- and state-level energy-related assistance programs, economic development efforts, and infrastructure programs seeking to prioritize investments in disadvantaged communities.

community energy planning↗

Validation of the Community Land Model Version 5 over the Contiguous United States (CONUS) using in situ and remote sensing data sets

The Community Land Model (CLM) is an effective tool to simulate the biophysical and biogeochemical processes and their interactions with the atmosphere. Although CLM Version 5 (CLM5) constitutes various updates in these processes, its performance in simulating energy, water and carbon cycles over the Contiguous United States (CONUS) at scales which land surface changes and hydrometeorological and hydroclimatological applications are more locally relevant is yet to be assessed. In this study, we conducted three simulations at 0.125? during 1979-2018 over the CONUS using different configurations of CLM, namely CLM5-biogeochemistry (CLM5BGC), CLM4.5BGC, and CLM5-satellite phenology (CLM5SP). We validated and compared their simulations against multiple remote-sensed and in-situ datasets. Overall, the parametric and structural updates (e.g., carbon cost for nitrogen uptake, variable soil thickness, dry surface layer) in CLM5 improve its ability in capturing terrestrial biogeochemical dynamics. The low evapotranspiration in CLM5BGC is associated with biases in simulating vegetation phenological characteristics rather than soil water limitations. The mismatch between CLM5BGC-simulated peak leaf area index and reference data can be attributed to CLM5BGC's inability in simulating phenology of trees and grasses. The differences between CLM-simulated irrigation and reference estimates can be attributed to differences between processes represented in models and in reality, and uncertainties in input and validation datasets. Evaluation against observations at small catchments suggest that hydrologic parameters needed to be calibrated to improve simulations of runoff, especially subsurface runoff. Additional efforts are needed to incorporate spatially-distributed plant phenology and physiology parameters and regional-specific agricultural management practices (e.g., planting, harvest).

Cheng, Yanyan↗

Minimizing Optimal Transport for Functions with Fixed-Size Nodal Sets

Consider the class of zero-mean functions with fixed L ∞ and L 1 norms and exactly N ϵ N nodal points. Which functions f minimize W p (f + ,f – ), the Wasserstein distance between the measures whose densities are the positive and negative parts? We provide a complete solution to this minimization problem on the line and the circle, which provides sharp constants for previously proven “uncertainty principle”-type inequalities, i.e., lower bounds on N • W p (f + ,f – ). We further show that, while such inequalities hold in many metric measure spaces, they are no longer sharp when the non-branching assumption is violated; indeed, for metric star-graphs, the optimal lower bound on W p (f + ,f – ) is not inversely proportional to the size of the nodal set, N. Here, based on similar reductions, we make connections between the analogous problem of minimizing W p (f + ,f – ) for f defined on Ω C R d with an equivalent optimal domain partition problem.

97 MATHEMATICS AND COMPUTING↗

Dimensional reduction in manifoldlike causal sets

We investigate the behavior of small subsets of causal sets that approximate Minkowski space in three, four, and five dimensions, and show that their effective dimension decreases smoothly at small distances. The details of the short distance behavior depend on a choice of dimensional estimator, but for a reasonable version of the Myrheim-Meyer dimension, the minimum dimension is d ≈ 2 , reproducing results that have been seen in other approaches to quantum gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Automated detection of photovoltaic cleaning events: A performance comparison of techniques as applied to a broad set of labeled photovoltaic data sets

Extracting accurate soiling loss information from photovoltaic (PV) production data first requires segmenting the time series data per natural or manually occurring cleaning events. Maintenance logs are often incomplete, rain data are often unavailable, and the debate on rain thresholds for cleaning and dew or wind cleanings is still ongoing. The present work aims to overtake these issues by improving automated methods to detect these cleaning events and therefore improve extraction of soiling loss information. Time series power production data from 22 PV inverters were labeled for natural or manually occurring cleaning events. The data sets were carefully selected to include varying degrees of soiling, cleaning events, and noise. Several algorithms, including filtering logic and change point detection, were examined for efficacy at detecting the labeled cleanings. All the methods introduced except for changepoint detection showed significant improvement at detecting the labeled cleaning events per the mean F 1 score. Furthermore, the highest performing cleaning detection algorithm achieved an absolute increase in the mean F 1 score of 43% over the default version of the RdTools stochastic rate and recovery (SRR) algorithm. The highest performing algorithm included irradiance filtering and a cleaning detection threshold, adjusted based on the 40-day centered rolling median of the absolute day-to-day deviations in the daily performance index (PI). Furthermore, these improvements are promising as cleaning detection is an essential step in the automated analysis of PV soiling.

14 SOLAR ENERGY↗

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N . In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.

97 MATHEMATICS AND COMPUTING↗