SEARCH · Search NASA
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.
In data science applications, there are often many models that fit the data well. This phenomenon was called the Rashomon Effect by Leo Breiman. The set of good models is called the Rashomon Set, and the goal of this project is to locate, store, and study the Rashomon sets for classes of interpretable models, including decision trees and generalized additive models.
In this research, we present a data set over 100 photovoltaic (PV) sites in TX, which have been automatically geotagged via a fully autonomous deep learning (DL) pipeline. Specifically, locations of inverters, tracker/fixed tilt rows, batteries, and substations are labeled algorithmically. To ensure high data quality, all systems have been reviewed manually and any deep learning errors have been corrected. This public data set, as well as the open-sourced pipeline used to generate it, is valuable for site planning, modelling, and insurance purposes. Given time and resources, we hope to extend the data set to additional states/regions in the US.
Gate set tomography (GST) is a protocol for detailed, predictive characterization of logic operations (gates) on quantum computing processors. Early versions of GST emerged around 2012-13, and since then it has been refined, demonstrated, and used in a large number of experiments. This paper presents the foundations of GST in comprehensive detail. The most important feature of GST, compared to older state and process tomography protocols, is that it is calibration-free . GST does not rely on pre-calibrated state preparations and measurements. Instead, it characterizes all the operations in a gate set simultaneously and self-consistently, relative to each other. Long sequence GST can estimate gates with very high precision and efficiency, achieving Heisenberg scaling in regimes of practical interest. In this paper, we cover GST's intellectual history, the techniques and experiments used to achieve its intended purpose, data analysis, gauge freedom and fixing, error bars, and the interpretation of gauge-fixed estimates of gate sets. Our focus is fundamental mathematical aspects of GST, rather than implementation details, but we touch on some of the foundational algorithmic tricks used in the pyGSTi implementation.
Modern safety-critical energy infrastructures are increasingly operated in a hierarchical and modular control framework which allows for limited data exchange between the modules. In this context, it is important for each module to synthesize and communicate constraints on the values of exchanged information in order to assure system-wide safety. To ensure transient safety in inverter-based microgrids, we develop a set invariance-based distributed safety verification algorithm for each inverter module. Applying Nagumo's invariance condition, we construct a robust polynomial optimization problem to jointly search for safety-admissible set of control set-points and design parameters, under allowable disturbances from neighbors. We use sum-of-squares (SOS) programming to solve the verification problem and we perform numerical simulations using grid-forming inverters to illustrate the algorithm.
We design heat exchangers using two topology optimization approaches: the density, i.e. volume fraction and level set methods. Our goal is to maximize the heat exchange between two fluids in separate channels while constraining the pressure drop across each channel. The heat exchanger is modeled with a coupled thermal-flow formulation. The flow is governed by an isothermal and incompressible Stokes-Brinkman equation and the heat transfer is governed by a convection-diffusion equation with high Peclet number. We solve one set of Stokes-Brinkman equations per fluid. Each Brinkman term in the flow equation serves to model the other phase as a solid, thereby preventing mixing. We first represent the solid and fluid phases using a volume fraction variable and apply a SIMP-like penalization in the Brinkman term to drive the optimization to a discrete design. The cost and constraint function derivatives are automatically calculated with the library pyadjoint and the optimization is performed by the Method of Moving Asymptotes. In a second optimization formulation, we use the level set approach to define the interface that separates the two fluids. Pyadjoint calculates the shape derivatives of the cost and constraint functions and the Hamilton-Jacobi advects the interface, allowing for topological changes. We present results in two dimensions and discuss the advantages and disadvantages of each approach.
Oscillation detection and mitigation is a crucial aspect of reliable power system operation. Several transmission system operators and reliability coordinators use the RMS-energy method of oscillation detection, but the process of setting thresholds is time and labor intensive. The current industry practice in the United States is to set thresholds based on the RMS-energy's value during ambient conditions, which can often lead to nuisance alarms that require thresholds to be manually retuned. In this paper, we propose a method for setting RMS-energy thresholds that directly accounts for oscillation amplitudes specified by the user. A theoretical analysis of the statistical properties of the RMS-energy incorporates these user-specified amplitudes, resulting in thresholds that reliably detect oscillations of interest while avoiding nuisance alarms. Theoretical results are validated with simulated measurements and the real-world practicality of the method is established with publicly available field-measured data from the Grid Event Signature Library.
Assuring a proper environment for the fulfillment of professional activities is one of the Sustainable Development Goals and is contemplated in the One Health approach assumed by the World Health Organization. This particular study is applied to an often neglected sector of our society—the conservators/restorers—despite the many health issues reported by these professionals. Three different specialties (textiles, paintings and wood sculpture) and locations were selected for evaluation by placement of electrostatic dust cloths. After treatment of the samples, bacterial and fungal contamination were assessed, as well as mycotoxin determination, the presence of azole-resistant strains and cytotoxicity of the microorganisms encountered. Bacteria were only present in one of medias used and showed relatively low numbers. The highest level of contamination by fungi was identified in one of the textiles settings. The textile area also showed the highest variability for fungi. Aspergillus sp. are one indicator of possible environmental issues, and A. sections Fumigati and Circumdati were particularly relevant in two of the settings and identified in all of them. No mycotoxins were detected and the large majority of the fungi identified were non-cytotoxic. Overall, these can be considered low-contaminated environments but attention should be given to the Aspergillus sp. contamination. Additional studies are needed not only to make these results more robust, but also to test if the environmental sampling alone is the best approach in a setting where there is very little movement and dust displacement and where professionals are in very close proximity to the artefacts being treated, which may suggest the existence of a micro-atmosphere worth evaluating and comparing to the obtained results.
Abstract We present a set of 1194 Type-1 Rosseland-mean opacity tables for four different metallicity mixtures. These new Los Alamos OPLIB atomic radiative opacity tables are an order of magnitude larger in number than any previous opacity table release, and span regimes where previous opacity tables have not existed. For example, the new set of opacity tables expands the metallicity range to Z = 10 −6 to Z = 0.2, which allows improved accuracy of opacities at low and high metallicity, increases the table density in the metallicity range Z = 10 −4 to Z = 0.1 to enhance the accuracy of opacities drawn from interpolations across neighboring metallicities, and adds entries for hydrogen mass fractions between X = 0 and X = 0.1 including X = 10 −2 , 10 −3 , 10 −4 , 10 −5 , 10 −6 that can improve stellar models of hydrogen deficient stars. We implement these new OPLIB radiative opacity tables in MESA and find that calibrated solar models agree broadly with previously published helioseismic and solar neutrino results. We find differences between using the new 1194 OPLIB opacity tables and the 126 OPAL opacity tables range from ≈20% to 80% across individual chemical mixtures, up to ≈8% and ≈15% at the bottom and top of the solar convection zone respectively, and ≈7% in the solar core. We also find differences between standard solar models using different opacity table sources that are on par with altering the initial abundance mixture. We conclude that this new, open-access set of OPLIB opacity tables does not solve the solar modeling problem, and suggest the investigation of physical mechanisms other than the atomic radiative opacity.
Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.
Metal oxide semiconductor four-stage binary counter contains reset capability as well as four parallel-set inputs gated in by a logic signal. Parallel-set inputs permit setting the counter into any of sixteen possible states.
The properties of reachable sets for linear dynamical systems for specified control sets are discussed. Iterative procedures for determining numerical approximations of the reachable set are suggested and methods of obtaining an admissible control function which transfers an initial state to as near a prescribed target as possible is described. The problem of reachability with multiple control constraints is discussed and certain aspects of reachability for time-invariant systems with adjustable parameters is considered.
Stator setting angle optimization tests were conducted on a two-stage fan to improve efficiency at overspeed, stall margin at design speed, and both efficiency and stall margin at partspeed. The fan has a design pressure ratio of 2.8, a flow rate of 184.2 lb/sec (83.55 kg/sec) and a 1st-stage rotor tip speed of 1450 ft/sec (441.96 in/sec). Performance was obtained at 70,100, and 105 percent of design speed with different combinations of 1st-stage and 2nd-stage stator settings. One combination of settings, other than design, was common to all three speeds. At design speed, a 2.0 percentage point increase in stall margin was obtained at the expense of a 1.3 percentage point efficiency decrease. At 105 percent speed, efficiency was improved by 1.8 percentage points but stall margin decreased 4.7 percentage points. At 70 percent speed, no change in stall margin or operating line efficiency was obtained with stator resets although considerable speed-flow requlation occurred.
Similarities between regular and structured microprogramming were examined. An explanation of machine branching architecture (particularly in the SUMC computer), required for ease of structured microprogram implementation is presented. Implementation of a structured microprogram set in the SUMC to emulate the IBM System/360 is described and a comparison is made between the structured set with a nonstructured set previously written for the SUMC.
A combination of a local network, a mass storage system, and an autonomous set processor serving as a data/storage management machine is described. Its characteristics include: content-accessible data bases usable from all connected devices; efficient storage/access of large data bases; simple and direct programming with data manipulation and storage management handled by the set processor; simple data base design and entry from source representation to set processor representation with no predefinition necessary; capability available for user sort/order specification; significant reduction in tape/disk pack storage and mounts; flexible environment that allows upgrading hardware/software configuration without causing major interruptions in service; minimal traffic on data communications network; and improved central memory usage on large processors.
The performance of the first stage of a transonic, multistage compressor was mapped over a range of inlet-guide-vane and stator-blade settings. Both stall-free and deep-stall performance data were obtained. For the settings tested, as stall was encountered and flow was further reduced, a relatively sharp drop in pressure ratio occurred and was followed by a continuing but more gradual reduction in pressure ratio with reduced flow. The position of the stall line on the map of pressure ratio against equivalent weight flow was essentially unaffected over the range of inlet-guide-vane and stator-blade settings.
This paper presents and analyzes a method for the interpolation of a unique surface from two sets of independent digital height data of differing statistical characteristics. This method is based on linear prediction and thus relies on the concepts of auto- and cross-covariance functions. The linear prediction algorithm for two sets of digital height measurements is first derived and then evaluated using the method of moving averages and bilinear interpolation for comparison. It is found that the overall root mean square interpolation errors of linear prediction are similar to those from moving averages and bilinear interpolation. This accuracy performance, together with the well known potential for controlled filtering of measuring errors and good-behavior in areas of poor control, makes linear prediction a versatile and general method for interpolating a unique surface from two sets of digital height data, with applications in photogrammetric mapping, remote sensing, and other fields.
The first year's data from the Nimbus 4 backscatter ultraviolet (BUV) experiment have been archived in the National Space Science Data Center (NSSDC). Backscattered radiances in the ultraviolet measured by the satellite were used to compute the global total ozone for the period April 1970 - April 1971. The data sets now in the NSSDC are the results obtained by the Ozone Processing Team, which has processed the data with the purpose of determining the best quality of the data. There are four basic sets of data available in the NSSDC representing various stages in processing. The primary data base contains organized and cleaned data in telemetry units. The radiance data has had most of the engineering calibrations performed. The detailed total ozone data is the result of computations to obtain the total ozone; the Compressed Total Ozone data is a convenient condensation of the detailed total ozone. Product data sets are also included.
The paper describes a computer program, DSNLOAD, which provides the Deep Space Network (DSN) loading information given a proposed future NASA mission set. The DSNLOAD model includes required pre- and post-calibration periods, and station 'overhead' such as maintenance or 'down' time. The analysis is presented which transforms station view period data for the mission set into loading matrices used to assess loading requirement. Assessment of future loading on the DSN for a set of NASA missions by estimating the tracking situation and presenting the DSN loading data, and a flowchart for selecting a possible future mission, determining a heliocentric orbit for the mission, generating view period schedules, and converting these schedules into basic loading data for each mission for each station are given. The tracking schedule model which considers the tracking schedule to be represented by passes of maximum required length and centered within the view period of available tracking time for each mission is described, and, finally, an example of typical loading study is provided.