Search NASA⌕ Search

SEARCH · Search NASA

Results for “query optimization”

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 127 records · Page 7

High-Throughput Discovery Illuminates Design Principles and Limits for Long-Lived Charged Species in Organic Electrolytes

The chemical stability of charged molecules in all-organic redox flow batteries (RFBs) is required for the prolonged operation of these devices. Molecular engineering and electrolyte optimization are used to mitigate parasitic reactions and extend the lifetimes of the charge carriers. However, how much can structural variation extend the lifetime? To probe this query, we designed a high-throughput kinetic study of the radical cation of N-methylphenothiazinium, guided by statistical sampling and learning algorithms. Using Argonne’s autonomous discovery facility, we conducted over 6,000 kinetic experiments with robotic sample preparation, parallel kinetic measurements, and machine learning inputs, testing 188 solvent molecules selected from a space of over 540 candidates from 11 chemical classes. Algorithmic selections guided us to stable solvent candidates, which were further tested in high concentration with and without supporting electrolyte. Our findings reveal the inherent difficulty of exceeding the current state of the art through solvent variation. The desired stability is statistically rare and poorly predictable. Among the many tested, only three solvents significantly outperformed our baseline, acetonitrile─and none by more than a factor of 3─suggesting a general challenge in achieving the necessary techno-economic targets. Furthermore, we suggest that self-discharge through solvent homolysis is the cause of the observed limitations. Several structural motifs contribute to >1,000 h half-life stability including molecular simplicity, symmetry, oxidation complement, and strategic fluorination. Importantly, this workflow establishes effective assays for diagnosing and predicting oxidative stress for highly stable liquid electrolytes in all batteries.

Batteries↗

WELLBASE - An Interactive Platform for Wellbore Material Assessment

This project seeks to build an open-source wellbore material data repository with adequate material performance and contextual data to support Geological Carbon Storage (GCS). By appropriately evaluating the data types as mentioned earlier made available by the WELLBASE tool, stakeholders can make more informed decisions regarding well selections, risk assessment, and economic analysis for geologic carbon storage projects. Advanced Natural Language Processing models and other custom python scripts will be deployed in an automated process to extract unstructured data from documents, reports, and web applications and subsequently parse to more usable formats. The processed data will then be integrated into a robust and comprehensive database architecture, optimizing data accessibility, and usability for analytical purposes. The final data products will be accessible through a user-friendly visualization platform that will allow users to query and visualize the data, as well as download data in usable formats.

Tetteh, Daniel A.↗

Design of Digital Twin Sensing Strategies Via Predictive Modeling and Interpretable Machine Learning

This work develops a methodology for sensor placement and dynamic sensor scheduling decisions for digital twins. The digital twin data assimilation is posed as a classification problem, and predictive models are used to train optimal classification trees that represent the map from observed data to estimated digital twin states. In addition to providing a rapid digital twin updating capability, the resulting classification trees yield an interpretable mathematical representation that can be queried to inform sensor placement and sensor scheduling decisions. The proposed approach is demonstrated for a structural digital twin of a 12 ft wingspan unmanned aerial vehicle. Offline, training data are generated by simulating scenarios using predictive reduced-order models of the vehicle in a range of structural states. Furthermore, these training data can be further augmented using experimental or other historical data. In operation, the trained classifier is applied to observational data from the physical vehicle, enabling rapid adaptation of the digital twin in response to changes in structural health. Within this context, we study the performance of the optimal tree classifiers and demonstrate how they enable explainable structural assessments from sparse sensor measurements and also inform optimal sensor placement.

47 OTHER INSTRUMENTATION↗

Management Trends and Outcomes for Stage I to II Mantle Cell Lymphoma Using the National Cancer Data Base: Ascertaining the Ideal Treatment Paradigm

Purpose: Mantle cell lymphoma (MCL) is a rare, albeit aggressive subset of non-Hodgkin lymphoma, resulting in varied treatment approaches. Given the paucity of data defining the optimal management for early-stage MCL, we conducted an analysis using the National Cancer Data Base (NCDB) to identify practice patterns and outcomes. Methods and Materials: The NCDB was queried for patients with stage I to II MCL diagnosed from 1998 to 2012 receiving chemotherapy (CT) or radiation therapy (RT), or both (CT+RT). Univariate and multivariable analyses for factors associated with treatment selection were completed using logistic regression. Propensity scores with inverse probability treatment weighting (IPTW) were calculated based on the conditional probability of receiving CT+RT. The log-rank test and Cox proportional hazards modeling with IPTW adjustment were conducted for the survival analyses. Results: In total, 2539 patients were identified. The key characteristics were as follows: 69% were male, 71% were aged ≥60 years, 28% had extranodal involvement, and 51% had stage I disease. Of the 2539 patients, 70% underwent CT, 11% underwent RT, and 19% underwent CT+RT. The use of CT+RT decreased from 23.1% to 14.1% in 1998 to 2002 and 2010 to 2012 (P<.001). CT+RT usage was lower for patients with the following characteristics: age ≥60 years, female sex, stage II disease, and the presence of B symptoms. With a median follow-up period of 42.8 months, the unadjusted 3-year overall survival estimates for patients receiving CT, RT, or CT+RT were 67.8%, 72.4%, and 79.8%, respectively (P<.001). After correcting for indication bias through IPTW-adjusted modeling, CT+RT reduced the risk of overall mortality compared with monotherapy (hazard ratio 0.65, P=.029). Conclusions: Although uncommon, patients with stage I-II MCL can have favorable outcomes. Despite a continued decline in the usage of consolidative RT, combined modality therapy improves survival in this cohort compared with monotherapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Sirepo : an open-source cloud-based software interface for X-ray source and optics simulations

Sirepo , a browser-based GUI for X-ray source and optics simulations, is presented. Such calculations can be performed using SRW ( Synchrotron Radiation Workshop ), which is a physical optics computer code, allowing simulation of entire experimental beamlines using the concept of a `virtual beamline' with accurate treatment of synchrotron radiation generation and propagation through the X-ray optical system. SRW is interfaced with Sirepo by means of a Python application programming interface. Sirepo supports most of the optical elements currently used at beamlines, including recent developments in SRW . In particular, support is provided for the simulation of state-of-the-art X-ray beamlines, exploiting the high coherence and brightness of modern light source facilities. New scientific visualization and reporting capabilities have been recently implemented within Sirepo , as well as automatic determination of electron beam and undulator parameters. Publicly available community databases can be dynamically queried for error-free access to material characteristics. These computational tools can be used for the development and commissioning of new X-ray beamlines and for testing feasibility and optimization of experiments. The same interface can guide simulation on a local computer, a remote server or a high-performance cluster. Sirepo is available online and also within the NSLS-II firewall, with a growing number of users at other light source facilities. Our open source code is available on GitHub.

99 GENERAL AND MISCELLANEOUS↗

Mirador: A Simple, Fast Search Interface for Remote Sensing Data

A major challenge for remote sensing science researchers is searching and acquiring relevant data files for their research projects based on content, space and time constraints. Several structured query (SQ) and hierarchical navigation (HN) search interfaces have been develop ed to satisfy this requirement, yet the dominant search engines in th e general domain are based on free-text search. The Goddard Earth Sci ences Data and Information Services Center has developed a free-text search interface named Mirador that supports space-time queries, inc luding a gazetteer and geophysical event gazetteer. In order to compe nsate for a slightly reduced search precision relative to SQ and HN t echniques, Mirador uses several search optimizations to return result s quickly. The quick response enables a more iterative search strateg y than is available with many SQ and HN techniques.

Lynnes, Christopher↗

High-throughput virtual laboratory for drug discovery using massive datasets

Time-to-solution for structure-based screening of massive chemical databases for COVID-19 drug discovery has been decreased by an order of magnitude, and a virtual laboratory has been deployed at scale on up to 27,612 GPUs on the Summit supercomputer, allowing an average molecular docking of 19,028 compounds per second. Over one billion compounds were docked to two SARS-CoV-2 protein structures with full optimization of ligand position and 20 poses per docking, each in under 24 hours. GPU acceleration and high-throughput optimizations of the docking program produced 350× mean speedup over the CPU version (50× speedup per node). GPU acceleration of both feature calculation for machine-learning based scoring and distributed database queries reduced processing of the 2.4 TB output by orders of magnitude. The resulting 50× speedup for the full pipeline reduces an initial 43 day runtime to 21 hours per protein for providing high-scoring compounds to experimental collaborators for validation assays.

97 MATHEMATICS AND COMPUTING↗

CLUE: A Fast Parallel Clustering Algorithm for High Granularity Calorimeters in High-Energy Physics

One of the challenges of high granularity calorimeters, such as that to be built to cover the endcap region in the CMS Phase-2 Upgrade for HL-LHC, is that the large number of channels causes a surge in the computing load when clustering numerous digitized energy deposits (hits) in the reconstruction stage. In this article, we propose a fast and fully parallelizable density-based clustering algorithm, optimized for high-occupancy scenarios, where the number of clusters is much larger than the average number of hits in a cluster. The algorithm uses a grid spatial index for fast querying of neighbors and its timing scales linearly with the number of hits within the range considered. We also show a comparison of the performance on CPU and GPU implementations, demonstrating the power of algorithmic parallelization in the coming era of heterogeneous computing in high-energy physics.

Rovere, Marco↗

Exploring scenarios for enhanced fuel compression and performance on the National Ignition Facility with machine-learning-aided design techniques

Recent fusion experiments on the National Ignition Facility (NIF) have achieved ignition, producing multi-MJ fusion yields for input laser energies of roughly 2 MJ [Abu-Shawareb et al., Phys. Rev. Lett. 132, 065102 (2024)]. Building on the success of the target designs that have achieved ignition, we explore new implosion scenarios predicted to generate significantly more compression of the dense DT ice layer and correspondingly higher yields while preserving many of the key physics characteristics of present-day ignition designs. Our main result is a novel 3-shock implosion scheme that effectively minimizes the shock-induced entropy in the dense, accelerating DT shell and maximizes the resulting fuel compression subject to a fixed leading shock strength consistent with present-day ignition experiments, which is necessary to melt the crystalline high-density carbon ablator. Compared to the first NIF experiment to fulfill Lawson's ignition criterion, shot N210808 [Abu-Shawareb et al., Phys. Rev. Lett. 129, 075001 (2022)], our design exhibits a 40% increase in simulated peak areal density (ρR) and a 5× increase in 1D fusion yield using a 4% lighter ablator and identical DT payloads. We also present a complete integrated 2D hohlraum design and laser pulse specifications capable of generating the desired 3-shock drive and maintaining control of the low-mode capsule implosion symmetry, where the increase in simulated 2D yield relative to N210808 is > 10×. This new implosion regime was discovered with help from a machine-learning-enabled capsule design optimization framework. We outline the workflow this automated tool uses to identify improved design candidates by running several rounds of capsule simulations, constructing a surrogate model mapping input variations to key physics output quantities, and querying the resulting statistical model to propose adjustments to the x-ray drive and capsule to reach a set of physics objectives prescribed by the designer.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Spherical Region Queries on Multicore Architectures

In this short paper, we report the performance of multiple thread-parallel algorithms for spherical region queries on multicore architectures motivated by a challenging data analytics application in materials science. Performances of two tree-based algorithms and a naive algorithm are compared to identify the length scales at which these approaches perform optimally. The optimal algorithm is then used to scale the driving materials science application, which is shown to deliver over 17X speedup using 32 OpenMP threads on data sets containing many millions of atoms.

Lu, Hao↗

A perspective on Bayesian methods applied to materials discovery and design

For more than two decades, there has been increasing interest in developing frameworks for the accelerated discovery and design of novel materials that could enable promising and transformative technologies. The Integrated Computational Materials Engineering (ICME) program called for integrating computational tools to establish linkages along process-structure-property-performance (PSPP) chains. The Materials Genome Initiative called for integrating experiments and computations within data science frameworks as a strategy to accelerate the materials development cycle. While these frameworks and paradigms have been quite influential, traditional ICME or data science-based approaches tend to have some limitations, mainly when querying the materials space is costly and very little information is available. Bayesian methods are more suitable in this context due to their efficiency gains. To this end, the materials discovery problem is framed as a Bayesian Optimization (BO). Different examples in which BO has been applied to solve materials discovery problems are presented. The methods/examples discussed include BO under model uncertainty, multi-information source BO, multi-objective and multi-constraint BO, and batch BO. Bayesian Materials Discovery is a promising area of research that is likely to become more influential as more attention is put on autonomous materials discovery platforms. Therefore, a discussion is provided on the potential development of such methods to increase the ability of existing platforms in materials discovery. Here, the ultimate goal is to pave the way to autonomous materials discovery.

36 MATERIALS SCIENCE↗

Packet Capture Solutions: PcapDB Benchmark for High-Bandwidth Capture, Storage, and Searching

PcapDB stands alone when looking at the overall field of competitors, from the cost-effective COTS hardware, to the efficient utilization of disk space that enables a longer packet history. A scalable, 100GbE-enabled system that indexes every packet and indexes flow data without complicated load-balancing requirements. The Transport Layer search and indexing approach led to patent-pending flow indexing technology, providing a specialized database system specifically optimized around providing fast flow searches. While there are a plethora of options in network packet capture, there are very few that are able to effectively manage capture rates of more than 10 Gb/s, distributed capture and querying, and a responsive user interface. By far, the primary competitor in the market place is Endace and DeepSee; in addition to meeting the technical requirements we set out in this document, they provide technical support and a fully 'appliance like' system. In terms of cost, however, our experience has been that the yearly maintenance charges alone outstrip the entire hardware cost of solutions like PcapDB. Investment in cyber security research and development is a large part of what has enabled us to build the base of knowlegable workers needed to defend government resources in the rapidly evolving cyber security landscape. We believe projects like Bro, WireCap, and Farm do more than just fill temporary gaps in our capabilities. They give allow us to build the firm foundation needed to tackle the next generation of cyber challenges. PcapDB was built with loftier ambitions than simply solving the packet capture of a single lab site, but instead to provide a robust, scaleable packet capture solution to the DOE complex and beyond.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗

Optimization of biogenic methane production from coal

Given continuously increasing global energy needs, diversified efforts have been made to find and exploit new natural gas resources. These include coalbed methane (CBM), which represents an important global, unconventional source of natural gas. Efforts have been underway for some time to more effectively generate methane in-situ in coal plays by introduction of nutrients and/or microbial consortia. However, much is still to be learned about the limitations and environmental conditions that support microbial growth and are conducive to biogenic methane production from coal. Here we evaluated environmental conditions that led to increased methane production from subbituminous coal by introducing a foreign methanogenic consortium that included Methanobacterium sp. Furthermore, we used a central composite design (CCD) to explore a broad range of operational conditions, examine the effects of the important environmental factors, such as temperature, pH and salt concentration, and query a feasible region of operation to maximize methane production from coal. An anticipated detrimental effect of NaCl concentration on methane production was observed for the consortium assessed. The range of feasible operational conditions comprised initial pH values between 4.2 and 6.8, temperatures between 23 °C and 37 °C, and NaCl concentrations between 3.7 mg/cm 3 and 9.0 mg/cm 3 . Coal biogasification was optimal for this consortium at an initial pH value of 5.5, at 30 °C, and at a NaCl concentration 3.7 mg/cm 3 (i.e., 145,165 ppm, which is 25.6 sft 3 /ton).

01 COAL, LIGNITE, AND PEAT↗

Shape Optimization for Control and Isolation of Structural Vibrations in Aerospace and Defense Applications

Among the main challenges in shape optimization is the coupling of Finite Element Method (FEM) codes in a way that facilitates efficient computation of shape derivatives. This is particularly difficult with multi-physics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. There are two mathematically equivalent approaches to computing the shape derivative: the volume method, and the boundary method. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. Prior implementations of shape derivatives at Sandia have been based on the volume method. We introduce the strip method, which computes shape derivatives on a strip adjacent to the boundary. The strip method makes code coupling simple. Like the boundary method, it queries the state and adjoint solutions at quadrature nodes, but requires no knowledge of the FEM code implementations. At the same time, it exhibits the higher accuracy of the volume method. The development of the strip method also offers us the opportunity to share some lessons learned about implementing the volume method and boundary method, to show shape optimization results on problems of interest, and to begin addressing the other main challenges at hand: constraints on optimized shapes, and their interplay with optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

Spatial Query for Planetary Data

Science investigators need to quickly and effectively assess past observations of specific locations on a planetary surface. This innovation involves a location-based search technology that was adapted and applied to planetary science data to support a spatial query capability for mission operations software. High-performance location-based searching requires the use of spatial data structures for database organization. Spatial data structures are designed to organize datasets based on their coordinates in a way that is optimized for location-based retrieval. The particular spatial data structure that was adapted for planetary data search is the R+ tree.

Shams, Khawaja S.↗

Materials Databases Infrastructure Constructed by First Principles Calculations: A Review

The First Principles calculations, especially the calculation based on High-Throughput Density Functional Theory, have been widely accepted as the major tools in atom scale materials design. The emerging super computers, along with the powerful First Principles calculations, have accumulated hundreds of thousands of crystal and compound records. The exponential growing of computational materials information urges the development of the materials databases, which not only provide unlimited storage for the daily increasing data, but still keep the efficiency in data storage, management, query, presentation and manipulation. This review covers the most cutting edge materials databases in materials design, and their hot applications such as in fuel cells. By comparing the advantages and drawbacks of these high-throughput First Principles materials databases, the optimized computational framework can be identified to fit the needs of fuel cell applications. The further development of high-throughput DFT materials database, which in essence accelerates the materials innovation, is discussed in the summary as well.

36 MATERIALS SCIENCE↗

Training quantum neural networks using the quantum information bottleneck method

Abstract We provide in this paper a concrete method for training a quantum neural network to maximize the relevant information about a property that is transmitted through the network. This is significant because it gives an operationally well founded quantity to optimize when training autoencoders for problems where the inputs and outputs are fully quantum. We provide a rigorous algorithm for computing the value of the quantum information bottleneck quantity within error ε that requires O ( log 2 ⁡ ( 1 / ϵ ) + 1 / δ 2 ) queries to a purification of the input density operator if its spectrum is supported on { 0 } ⋃ [ δ , 1 − δ ] for δ > 0 and the kernels of the relevant density matrices are disjoint. We further provide algorithms for estimating the derivatives of the QIB function, showing that quantum neural networks can be trained efficiently using the QIB quantity given that the number of gradient steps required is polynomial.

Çatlı, Ahmet Burak (ORCID:0000000152294141)↗