Search NASA⌕ Search

SEARCH · Search NASA

Results for “enumerators”

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 253 records · Page 14

Tensor network method for reversible classical computation

We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs and outputs at the boundary can be represented as the full contraction of a tensor network. We introduce an iterative compression-decimation (ICD) scheme that performs this contraction efficiently. The ICD algorithm first propagates local constraints to longer ranges via repeated contraction-decomposition sweeps over all lattice bonds, thus achieving compression on a given length scale. It then decimates the lattice via coarse-graining tensor contractions. Repeated iterations of these two steps gradually collapse the tensor network and ultimately yield the exact tensor trace for large systems, without the need for manual control of tensor dimensions. Our protocol allows us to obtain the exact number of solutions for computations where a naive enumeration would take astronomically long times.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Minimal Positive Design for Self-Assembly of the Archimedean Tilings

A challenge of molecular self-assembly is to understand how to design particles that self-assemble into a desired structure and not any of a potentially large number of undesired structures. Here we use simulation to show that a strategy of minimal positive design allows the self-assembly of networks equivalent to the 8 semiregular Archimedean tilings of the plane, structures not previously realized in simulation. This strategy consists of identifying the fewest distinct types of interparticle interaction that appear in the desired structure, and does not require enumeration of the many possible undesired structures. The resulting particles, which self-assemble into the desired networks, possess DNA-like selectivity of their interactions. Assembly of certain molecular networks may therefore require such selectivity.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Octahedral tilting instabilities in inorganic halide perovskites

Dynamic instabilities, stabilized by anharmonic interactions in cubic and tetragonal halide perovskites at high temperature, play a role in the electronic structure and optoelectronic properties of halide perovskites. In particular, inorganic and hybrid perovskite materials undergo structural phase transitions associated with octahedral tilts of the metal-halide octahedra. Here, we investigate the structural instabilities present in inorganic Cs M X 3 perovskites with Pb or Sn on the metal site and Br or I on the X site. Defining primary order parameters in terms of symmetry-adapted collective displacement modes and secondary order parameters in terms of symmetrized Hencky strain components, we unravel the coupling between octahedral tilt modes and macroscopic strains as well as the role of A -site displacements in perovskite phase stability. Symmetry-allowed secondary strain order parameters are enumerated for the 14 unique perovskite tilt systems. Using first-principles calculations to explore the Born-Oppenheimer energy surface in terms of symmetrized order parameters, we find coupling between octahedral tilting and A -site displacements is necessary to stabilize P n m a ground states. Additionally, we show that the relative stability of an inorganic halide perovskite tilt system correlates with the volume decrease from the high-symmetry cubic phase to the low-symmetry distorted phase.

36 MATERIALS SCIENCE↗

Data-driven approach to parameterize SCAN + U for an accurate description of 3 d transition metal oxide thermochemistry

Semilocal density-functional theory (DFT) methods exhibit significant errors for the phase diagrams of transition-metal oxides that are caused by an incorrect description of molecular oxygen and the large self-interaction error in materials with strongly localized electronic orbitals. Empirical and semiempirical corrections based on the DFT + U method can reduce these errors, but the parameterization and validation of the correction terms remains an on-going challenge. Here we develop a systematic methodology to determine the parameters and to statistically assess the results by considering interlinked thermochemical data across a set of transition metal compounds. We consider three interconnected levels of correction terms: (1) a constant oxygen binding correction, (2) Hubbard-U correction, and (3) DFT/DFT + U compatibility correction. The parameterization is expressed as a unified optimization problem. We demonstrate this approach for 3d transition metal oxides, considering a target set of binary and ternary oxides. With a total of 37 measured formation enthalpies taken from the literature, the dataset is augmented by the reaction energies of 1710 unique reactions that were derived from the formation energies by systematic enumeration. To ensure a balanced dataset across the available data, the reactions were grouped by their similarity using clustering and suitably weighted. The parameterization is validated using leave-one-out cross validation (CV), a standard technique for the validation of statistical models. We apply the methodology to the strongly constrained and appropriately normed (SCAN) density functional. Based on the CV score, the error of binary (ternary) oxide formation energies is reduced by 40% (75%) to 0.10 (0.03) eV/atom. A simplified correction scheme that does not involve SCAN/SCAN + U compatibility terms still achieves an error reduction of 30% (25%). The method and tools demonstrated here can be applied to other classes of materials or to parameterize the corrections to optimize DFT + U performance for other target physical properties.

36 MATERIALS SCIENCE↗

Hemoglobin redux: combining neutron and X-ray diffraction with mass spectrometry to analyse the quaternary state of oxidized hemoglobins

X-ray and neutron diffraction studies of cyanomethemoglobin are being used to evaluate the structural waters within the dimer–dimer interface involved in quaternary-state transitions. Improvements in neutron diffraction instrumentation are affording the opportunity to re-examine the structures of vertebrate hemoglobins and to interrogate proton and solvent position changes between the different quaternary states of the protein. For hemoglobins of unknown primary sequence, structural studies of cyanomethemoglobin (CNmetHb) are being used to help to resolve sequence ambiguity in the mass spectra. These studies have also provided additional structural evidence for the involvement of oxidized hemoglobin in the process of erythrocyte senescence. X-ray crystal studies of Tibetan snow leopard CNmetHb have shown that this protein crystallizes in the B state, a structure with a more open dyad, which possibly has relevance to RBC band 3 protein binding and erythrocyte senescence. R-state equine CNmetHb crystal studies elaborate the solvent differences in the switch and hinge region compared with a human deoxyhemoglobin T-state neutron structure. Lastly, comparison of histidine protonation between the T and R state should enumerate the Bohr-effect protons.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient Clustering of Software Vulnerabilities using Self Organizing Map (SOM)

The common vulnerabilities and exposures (CVE) database was created with a mission to ``identify, define, and catalog publicly disclosed cybersecurity vulnerabilities''. This rich body of information can be used to enable rapid and efficient response to secure and defend cyber operations and protect critical cyber infrastructure. The main goal of this paper is to develop a visual analytics tool to enable deep analysis of CVEs using unsupervised clustering techniques. We enhance our analysis by first mapping CVEs to hierarchical-classes in Common Weakness Enumeration (CWE) using information in the National Vulnerability Database (NVD). Both the mapping and the numerical representation of CVEs are enabled by V2W-BERT, which uses natural language processing of the extensive information in NVD to generate a large tabular database of 137,226 CVE entries from 1999 to 2020, where each CVE is represented by a vector of 768 numerical features. The vectorized data is processed by Self-Organizing Maps (SOM), which is an unsupervised machine learning technique for dimensionality reduction, visual representation and clustering. Using a Torus map of 6417 units, we achieve ~10-fold data compression of ~140k CVEs using SOM. The trained map is further clustered using standard K-means clustering into 138 clusters of CVEs. We conducted a brief investigation of the rich mapping of CVEs to best-matching-units to K-means clusters, as well as CVEs to CWEs. For example, this novel mapping provided insight into the role of CWE-59 and CWE-264 in several CVEs that is otherwise hard to explore in the original data. We conclude that our this novel approach will not only enable deep analysis of the complex relationships between CVEs and CWEs, but also a mechanism to quickly respond to and design mitigation actions for rapidly evolving vulnerabilities that have not been mapped to existing CWEs.

Panchal, Khyati↗

Revealing Fundamental Physics from the Daya Bay Neutrino Experiment Using Deep Neural Networks

Experiments in particle physics produce enormous quantities of data that must be analyzed and interpreted by teams of physicists. This analysis is often exploratory, where scientists are unable to enumerate the possible types of signal prior to performing the experiment. Thus, tools for summarizing, clustering, visualizing and classifying high-dimensional data are essential. Here in this work, we show that meaningful physical content can be revealed by transforming the raw data into a learned high-level representation using deep neural networks, with measurements taken at the Daya Bay Neutrino Experiment as a case study. We further show how convolutional deep neural networks can provide an effective classification filter with greater than 97% accuracy across different classes of physics events, significantly better than other machine learning approaches.

60 APPLIED LIFE SCIENCES↗

Towards Automatically Matching Security Advisories to CPEs: String Similarity-based Vendor Matching

When a vulnerability is reported by the National Vulnerability Database (NVD), affected products are listed in the structured Common Platform Enumeration (CPE) format. Unfortunately, if the vulnerability is in a software library (e.g., Log4j), it will not include CPEs for each product containing that library. In these cases, security operators need to manually read the vendor's or third-party security advisories to see if their product is affected. However, these advisories do not report affected products in a structured format, which prevents automated processing, This paper makes the first effort towards automatically constructing structured CPEs for the vulnerable products in a non-NVD security advisory from the unstructured data in the advisory. Since this is a very challenging problem, this paper specifically focuses on the initial but key step of matching the un-structured vendor names in security advisories to the structured vendor representations in the standard CPE format. We explore the feasibility of using string similarity to solve the problem. The basic idea is to compare a vendor name from the non-NVD advisory with each vendor in the official CPE dictionary. The CPE vendor with the highest similarity score to the advisory's vendor will be considered as the match. We first conduct an experimental, comparative study of multiple mainstream string similarity metrics for this matching problem. To improve the performance, we then design a new string similarity metric that is adapted from an existing metric by weighing different tokens in the advisory's vendor name differently.

McClanahan, Kylie↗

Testbed Demonstration of a Microgrid Building Block Prototype

With the adoption of ambitious climate action goals, the penetration level of distributed energy resources (DERs) is rapidly increasing. Microgrids are an efficient way to integrate these DERs, facilitating their operation and control. Additionally, microgrids enhance the overall resilience of the distribution system by serving critical loads both within and outside their boundaries. However, the need for substantial customized engineering leads to a high cost of development, installation and maintenance of microgrids. To address this challenge, Microgrid Building Blocks (MBB) are proposed to reduce the deployment cost of microgrids through modular, standardized design and implementation. This work presents a testbed demonstrating the integrated power conversion, control, and communication functionalities of an MBB. The testbed is formed by a real-time electromagnetic transient (EMT) simulation combined with a hardware and software prototype of MBB. The use cases supported by the MBB testbed are enumerated. The islanded operation, voltage regulation, and optimal dispatch capabilities of an MBB-based microgrid controller are validated through a case study.

Somda, Baza [Virginia Tech]↗

Low-Cost Parallel Algorithms for 2:1 Octree Balance

The logical structure of a forest of octrees can be used to create scalable algorithms for parallel adaptive mesh refinement (AMR), which has recently been demonstrated for several petascale applications. Among various frequently used octree-based mesh operations, including refinement, coarsening, partitioning, and enumerating nodes, ensuring a 2:1 size balance between neighboring elements has historically been the most expensive in terms of CPU time and communication volume. The 2:1 balance operation is thus a primary target to optimize. One important component of a parallel balance algorithm is the ability to determine whether any two given octants have a consistent distance/size relation. Based on new logical concepts we propose fast algorithms for making this decision for all types of 2:1 balance conditions in 2D and 3D. Since we are able to achieve this without constructing any parent nodes in the tree that would otherwise need to be sorted and communicated, we can significantly reduce the required memory and communication volume. In addition, we propose a lightweight collective algorithm for reversing the asymmetric communication pattern induced by non-local octant interactions. We have implemented our improvements as part of the opensource “p4est” software. Benchmarking this code with both synthetic and simulation-driven adapted meshes we are able to demonstrate much reduced runtime and excellent weak and strong scalability. On our largest benchmark problem with 5.13 × 10 11 octants the new 2:1 balance algorithm executes in less than 8 seconds on 112,128 CPU cores of the Jaguar Cray XT5 supercomputer.

Computer Science↗

Graph Analytics on Jellyfish topology

Because large unstructured datasets is important for many science domains, distributed graph analytics is critical to many scientists. Unfortunately, obtaining scaling and performance for irregular communication is challenging because contemporary network interconnects are primarily designed to maximize bandwidths of fixed-neighborhoods large-message exchanges (e.g., stencils). Although there is no consensus on the “best” network topologies for irregular communication, unstructured graph-based interconnects can be more suitable. We analyze three popular graph workloads – clustering, pattern enumeration, and traversal — on comparable networks (in terms of resources and costs) constructed from Jellyfish Random Regular, Dragonfly and Fat tree topologies, varying the routing algorithms. Using packet-level simulations, we demonstrate up to 60% improvement in communication time with Jellyfish due to diversity of the short paths between arbitrary endpoints, which can reduce overall network stalls and congestion.

Graph Analytics, network topology, interconnect, H↗

Flexibility Requirements for Energy Systems with Renewable Generation under Forecast Uncertainties

Energy systems with high fractions of renewable energy-based resources require adequate assets providing flexibility in electricity usage to maximize the benefits of renewable energy. In this paper, we provide an analytical approach to estimate the flexibility requirements of such energy systems, with forecast uncertainties in both demand and generation. Our analytical results show that even with forecast errors, the expected system operating cost decreases with an increase in the amount of flexibility capacity -- however, there is an inflection point, beyond which addition of further flexibility capacity does not reduce expected system cost any further. Additionally, an enumeration-based approach is presented to estimate the maximum flexibility capacity needed to optimize the operating cost. Numerical experiments conducted on a network-abstracted modified IEEE 30-bus system are used for empirical validation and gaining additional insights on the effect of prosumers' willingness to offer flexibility on the dispatch performance.

Bhattacharya, Saptarshi↗

Improved microgrid resiliency through distributionally robust optimization under a policy-mode framework

Critical energy infrastructure are constantly under stress due to the ever increasing disruptions caused by wildfires, hurricanes, other weather related extreme events and cyber-attacks. Hence it becomes important to make critical infrastructure resilient to threats from such cyber-physical events. However, such events are hard to predict and numerous in nature and type and it becomes infeasible to make a system resilient to every possible such cyber-physical event. Such an approach can make the system operation overly conservative and impractical to operate. Furthermore, distributions of such events are hard to predict and historical data available on such events can be very sparse, making the problem even harder to solve. To deal with these issues, in this paper we present a policy-mode framework that enumerates and predicts the probability of various cyber-physical events and then a distributionally robust optimization (DRO) formulation that is robust to the sparsity of the available historical data. The proposed algorithm is illustrated on an islanded microgrid example: a modified IEEE 123-node feeder with distributed energy resources (DERs) and energy storage. Simulations are carried to validate the resiliency metrics under the sampled disruption events.

Nazir, Mohammad Nawaf↗

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗

Pulsed-Power Innovations for Next-Generation, High-Current Drivers

There are proposals to build larger high-current drivers to be used for high-energy-density physics (HEDP), inertial confinement fusion (ICF), radiation effects testing, and basic science. Drivers significantly larger than the Z Machine at Sandia National Laboratories, Albuquerque, NM, USA, encounter increasing difficulties in water power flow, insulator performance, and vacuum power flow. The physics requirements of imploding loads limit a designer’s flexibility in choosing machine parameters, such as current rise time, driving impedance, and total inductance. This article enumerates these physics constraints and shows how they impact driver design. Here, we conclude that advances in pulsed-power capabilities are needed to control risk and to build a cost-effective driver at peak currents of ~60 MA.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Mitigating Cascading Outages in Severe Weather Using Simulation-Based Optimization

Severe weather events can trigger cascading power outages and lead to significant losses. In this work, we investigate cascading outage mitigation under severe weather conditions. Given day-ahead weather forecasts and component failure models, we aim to identify a set of power lines that can be hardened to minimize the expected impact of potential cascading outages. Since the expected load shedding cannot be expressed as an explicit function of line hardening decisions and system states, we developed a cascading outage simulator to estimate the expected value of load shedding under various initial weather-related disruption scenarios generated using a weather forecast. To avoid massive enumeration of all possible combinations of line hardening decisions and reduce the simulation efforts, we employed an efficient simulation-based optimization approach that quickly identifies the (near) optimal line hardening decisions in the presence of both large simulation noises due to the highly variable initial disturbances and system states, and significant randomness in the subsequent cascades. Furthermore, the algorithm is also able to utilize parallel computing to dramatically reduce computation time to support decision making in preparation for severe weather conditions. We performed a case study on the Northeast Power Coordinating Council (NPCC) 140-bus system model to demonstrate that our approach can significantly improve power grid resilience to adverse weather events.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Evaluation of revised polymerase chain reaction primers for more inclusive quantification of ammonia‐oxidizing archaea and bacteria

Summary Ammonia‐oxidizing archaea ( AOA ) and bacteria ( AOB ) fill key roles in the nitrogen cycle. Thus, well‐vetted methods for characterizing their distribution are essential for framing studies of their significance in natural and managed systems. Quantification of the gene coding for one subunit of the ammonia monooxygenase ( amoA ) by polymerase chain reaction is frequently employed to enumerate the two groups. However, variable amplification of sequence variants comprising this conserved genetic marker for ammonia oxidizers potentially compromises within‐ and between‐system comparisons. We compared the performance of newly designed non‐degenerate quantitative polymerase chain reaction primer sets to existing primer sets commonly used to quantify the amoA of AOA and AOB using a collection of plasmids and soil DNA samples. The new AOA primer set provided improved quantification of model mixtures of different amoA sequence variants and increased detection of amoA in DNA recovered from soils. Although both primer sets for the AOB provided similar results for many comparisons, the new primers demonstrated increased detection in environmental application. Thus, the new primer sets should provide a useful complement to primers now commonly used to characterize the environmental distribution of AOA and AOB .

Meinhardt, Kelley A.↗

Senescence chips for ultrahigh-throughput isolation and removal of senescent cells

Cellular senescence plays an important role in organismal aging and age-related diseases. However, it is challenging to isolate low numbers of senescent cells from small volumes of biofluids for downstream analysis. Furthermore, there is no technology that could selectively remove senescent cells in a high-throughput manner. In this work, we developed a novel microfluidic chip platform, termed senescence chip, for ultrahigh-throughput isolation and removal of senescent cells. The core component of our senescence chip is a slanted and tunable 3D micropillar array with a variety of shutters in the vertical direction for rapid cell sieving, taking advantage of the characteristic cell size increase during cellular senescence. The 3D configuration achieves high throughput, high recovery rate, and device robustness with minimum clogging. We demonstrated proof-of-principle applications in isolation and enumeration of senescent mesenchymal stem cells (MSCs) from undiluted human whole blood, and senescent cells from mouse bone marrow after total body irradiation, with the single cell resolution. After scale-up to a multilayer and multichannel structure, our senescence chip achieved ultrahigh-throughput removal of senescent cells from human whole blood with an efficiency of over 70% at a flow rate of 300 ml/hr. Sensitivity and specificity of our senescence chips could be augmented with implementation of multiscale size separation, and identification of background white blood cells using their cell surface markers such as CD45. With the advantages of high throughput, robustness, and simplicity, our senescence chips may find wide applications and contribute to diagnosis and therapeutic targeting of cellular senescence.

59 BASIC BIOLOGICAL SCIENCES↗