Search NASA⌕ Search

SEARCH · Search NASA

Results for “SET”

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 145 records · Page 8

Deep Set Auto Encoders for Anomaly Detection in Particle Physics

There is an increased interest in model agnostic search strategies for physics beyond the standard model at the Large Hadron Collider. We introduce a Deep Set Variational Autoencoder and present results on the Dark Machines Anomaly Score Challenge. We find that the method attains the best anomaly detection ability when there is no decoding step for the network, and the anomaly score is based solely on the representation within the encoded latent space. This method was one of the top-performing models in the Dark Machines Challenge, both for the open data sets as well as the blinded data sets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exploring the Whole Set of Accurate Sparse Interpretable Models

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.

97 MATHEMATICS AND COMPUTING↗

A Public Data Set of Auto-Generated Geotagged PV Site Equipment, Generated via Deep Learning

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.

14 SOLAR ENERGY↗

Gate Set Tomography

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.

97 MATHEMATICS AND COMPUTING↗

Distributed Transient Safety Verification via Robust Control Invariant Sets: A Microgrid Application

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.

Bouvier, Jean-Baptiste H.↗

Two Dimensional Topology Optimization of Heat Exchangers with the Density and Level-Set Methods

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.

42 ENGINEERING↗

A Novel Method for Setting Meaningful Thresholds for RMS-Energy Oscillation Detectors

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.

Follum, James D.↗

Unveiling the Occupational Exposure to Microbial Contamination in Conservation–Restoration Settings

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.

Viegas, Carla (ORCID:0000000215456479)↗

An Expanded Set of Los Alamos OPLIB Tables in MESA: Type-1 Rosseland-mean Opacities and Solar Models

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.

79 ASTRONOMY AND ASTROPHYSICS↗

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

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.

Combinatorics (math.CO)↗

Selection of Training Sets for 235U Source Detection Classifiers Using Gamma Signatures

The machine learning methods for classifiers to detect low level radiation sources are of interest when suitable training data sets are available. Their application and performance assessment, however, involves the aspects of over-fitting and training data selection that are somewhat uncommon in other existing methods for this task.We study U-235 gamma signatures using data sets collected by 21 NaI detectors under controlled conditions. The gamma spectra are collected by the detectors located at different distances from the source, and we study their choice as training sets for classifiers to detect a source. The detectors form the near, middle and outer groups based on the distance to source. The classifiers based on the outer group are susceptible to over-fitting, that is, they achieve low training error but incur much higher testing error in independent tests. The other two groups achieve lower training error and comparable testing error, and the near group achieves the overall lowest error. In detecting a source at an unknown distance, the farther detectors in the middle group achieve the overall lowest testing error with limited over-fitting, thereby indicating the complex dependencies between the training and classifier performance.

Rao, Nageswara↗

Method for rapid development of additive manufacturing parameter set

An apparatus includes a control system that defines a test part having multiple features of multiple feature types. The control system controls an additive manufacturing (AM) machine to print multiple copies of the test part, with each copy being printed according to a respective set of values used as printing parameters. A measurement system obtains a computed tomography (CT) image of each of the copies of the test part. An analysis system, for each of the plurality of feature types, analyzes the CT images to identify a selected set of values for the printing parameters. The analysis system identifies a portion of the CT image related to a first feature and assesses its density based on an average grayscale value. The AM machine is then controlled to print production parts according to, for each feature type of the production parts, the selected set of values for the printing parameters.

Bhattad, Pradeep↗

Use of Grid-Forming Medium-Voltage Power Electronics Hub in a Microgrid Setting: Preprint

This paper presents the application of a new design of a multiport, modular, medium-voltage power electronics hub (M3PE-HUB) in a microgrid setting. The M3PE-HUB system was modeled in a digital real-time simulator (DRTS) and integrated into the Banshee microgrid test system. This paper presents the preliminary DRTS simulation-based results of the M3PE- HUB system connected in a test microgrid system. Verification and validation of the M3PE-HUB architecture and controls in the test microgrid setting are the primary contributions of this work. The results of the operation during the islanding and resynchronization process indicate the feasibility of the proposed architecture in a microgrid setting. This paper also presents results for a system reconfiguration use case where the M3PE- HUB was used to reconfigure the system under a fault condition.

grid forming↗

KSSOLV 2.0: An efficient MATLAB toolbox for solving the Kohn-Sham equations with plane-wave basis set

KSSOLV (Kohn-Sham Solver) is a MATLAB toolbox for performing Kohn-Sham density functional theory (DFT) calculations with a plane-wave basis set. KSSOLV 2.0 preserves the design features of the original KSSOLV software to allow users and developers to easily set up a problem and perform ground-state calculations as well as to prototype and test new algorithms. Furthermore, it includes new functionalities such as new iterative diagonalization algorithms, k-point sampling for electron band structures, geometry optimization and advanced algorithms for performing DFT calculations with local, semi-local, and hybrid exchange-correlation functionals. It can be used to study the electronic structures of both molecules and solids. So, we describe these new capabilities in this work through a few use cases. We also demonstrate the numerical accuracy and computational efficiency of KSSOLV on a variety of examples.

97 MATHEMATICS AND COMPUTING↗

A level-set immersed boundary method for reactive transport in complex topologies with moving interfaces

A simulation framework based on the level-set and the immersed boundary methods (LS-IBM) has been developed for reactive transport problems in porous media involving a moving solid-fluid interface. The interface movement due to surface reactions is tracked by the level-set method, while the immersed boundary method captures the momentum and mass transport at the interface. The proposed method is capable of accurately modeling transport near evolving boundaries in Cartesian grids. The framework formulation guarantees second order accuracy in space. Since the interface velocity is only defined at the moving boundary, an interface velocity propagation method is also proposed. The method can be applied to other moving interface problems of the “Stefan” type. Here, we validate the proposed LS-IBM both for flow and transport close to an immersed object with reactive boundaries as well as for crystal growth. Lastly, the proposed method provides a powerful tool to model more realistic problems involving moving reactive interfaces in complex domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hierarchical median narrow band for level set segmentation of cervical cell nuclei

This paper presents a novel hierarchical nuclei segmentation algorithm for isolated and overlapping cervical cells based on a narrow band level set implementation. Our method applies a new multiscale analysis algorithm to estimate the number of clusters in each image region containing cells, which turns into the input to a narrow band level set algorithm. We assess the nuclei segmentation results on three public cervical cell image databases. Overall, our segmentation method outperformed six state-of-the-art methods concerning the number of correctly segmented nuclei and the Dice coefficient reached values equal to or higher than 0.90. We also carried out classification experiments using features extracted from our segmentation results and the proposed pipeline achieved the highest average accuracy values equal to 0.89 and 0.77 for two-class and three-class problems, respectively. Furthermore, these results demonstrated the suitability of the proposed segmentation algorithm to integrate decision support systems for cervical cell screening.

47 OTHER INSTRUMENTATION↗

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↗

Simplifying the Quantum World: Demonstrations for Young Learners in an Informal Setting

A set of modules for the informal learning of quantum science was developed. They include (1) Waves and Bottling Light in Quantum Dots, (2) Quantization of Energy Levels, (3) Particle-Wave Duality, (4) Magnetism and Electron Spin, and (5) Quantum Entanglement. Their teaching objective is to clarify concepts in quantum science, and they have been presented together as part of an hour-long show to ∼250 adults and school-age children. The learning outcomes of the modules were assessed by pre- and postevent quizzes as well as interactive clicker questions. The results suggest effective learning of all of the assessed concepts. These modules are detailed in a way that makes them deployable, together or in part, in other formal or informal settings to support the dissemination of information about quantum science to the general public.

electron spin↗