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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Situational Awareness of Network System Roles (SANSR)

In a large enterprise it is difficult for cyber security analysts to know what services and roles every machine on the network is performing (e.g. file server, domain name server, email server). Understanding the roles of the systems in the network provides analysts with a situational awareness that will allow them to detect consequential changes in the network, initiate an incident response plan, and optimize their security posture. Using the network flow data, already collected by most enterprises, we developed a tool that enables analysts to automatically detect/classify services and roles of every machine that’s operating on a network (e.g. file server, domain name server, email server) for better situational awareness of potential threats to the network. his tool queries Elasticsearch for network flow data, creates a temporal behavior model of each system, uses unsupervised machine learning to cluster the models with a set of labeled temporal behavior models, and the resulting information can be printed to the console or programmatically accessed. The results include the likelihood that a machine has a labeled role and lists other machines that are most similar in behavior.

Huffer, KellyM.↗
DOE OSTI2021

Comparison of Different Variants of the U.S. Army Occupational Physical Assessment Test

The U.S. Army Occupational Physical Assessment Test (OPAT) is a pre-enlistment physical employment screening assessment developed to place recruits and soldiers into Military Occupational Specialties (MOSs) based on their physical capabilities in order to optimize performance and limit injury. The OPAT consists of the seated power throw (SPT), strength deadlift (SDL), standing long jump, and interval aerobic run. During the scientific validation of the OPAT, two variants of the SPT and two variants of the SDL were used. Although the OPAT was validated using both variants for each test, U.S. Army scientists and policymakers have received queries regarding how these variants compare to each other. Therefore, the purpose of this study was to compare different variants of the SPT and SDL. Thirty-two participants (14 male and 18 female) between the ages of 18 and 42 years visited the laboratory on one occasion and performed two variants of the SPT (seated on the ground [the current OPAT standard] versus seated in a chair with a 35 cm seat height) and two variants of the SDL (using a hex-bar [the current OPAT standard] versus using paired dumbbells). Testing order for the different variants was randomized. The protocol was approved by the U.S. Army Medical Research and Development Command Institutional Review Board. Performing the SPT from a chair significantly (P < .05) increased performance when compared to performing the SPT from the ground (5.4 ± 1.3 m versus 5.0 ± 1.4 m, respectively). Values for the two SPT variants were correlated (tau = 0.90). Performing the SDL using the hex-bar significantly increased the maximal weight lifted when compared to performing the SDL using paired dumbbells (86.9 ± 18.4 kg versus 83.1 ± 18.0 kg, respectively). Values for the two SDL variants were correlated (tau = 0.83). Performing different variants of the SPT and SDL influenced the resulting score. Although these findings do not alter the administration or scoring of the OPAT, they do provide a valuable reference in the event of future inquiries regarding the development of the OPAT.

General & Internal Medicine↗
DOE OSTI2019

What Constitutes Optimal Management of T1N0 Esophageal Adenocarcinoma?

Purpose and Design: Esophageal adenocarcinoma (EAC) develops as a consequence of gastroesophageal reflux disease and Barrett’s esophagus (BE). While combination therapy with chemotherapy or concurrent chemoradiotherapy followed by esophagectomy improves survival in more advanced tumors, the optimal treatment strategy for early-stage EAC is undefined. Endoscopic eradication therapy, consisting of endoscopic resection and mucosal ablation, has revolutionized therapy for superficial (T1a) EAC in BE and allows for esophageal preservation in appropriate patients at low risk for lymph node metastasis (LNM). This review critically examines the literature regarding evaluation, treatment, and outcomes in patients with T1 EAC. Methods: The literature was queried via the PubMed database to include articles published between 1990 and 2017. Search terms were generated from the key statements “Endoscopic eradication therapy results in equivalent overall survival when compared to esophagectomy for clinical T1aN0 EAC” and “Esophagectomy provides better overall survival than endoscopic eradication therapy for cT1b EAC”. Abstracts were reviewed and included according to predefined selection and exclusion criteria, and were then assessed according to the GRADE system. Results and Conclusions: In patients with T1aN0 EAC, overall survival with endoscopic eradication therapy is equal to esophagectomy. Given the substantial risk of LNM in patients with submucosal (T1b) EAC, esophagectomy remains the standard of care for surgical candidates. In the case of inoperability or low-risk lesions, endoscopic resection may be considered adequate therapy. Chemotherapy and radiation can be offered as primary therapy for non-surgical candidates with lesions not amenable to endoscopic therapy, but does not have a clear role in the adjuvant setting after either endoscopic or surgical resection.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2026

AI-Ready Semantic Infrastructure for CEBAF: From CED to PALS Knowledge Graphs

JLab and PNNL are jointly developing an AI-ready data ecosystem that exposes the Continuous Electron Beam Acceleration Facility’s (CEBAF’s) operational configuration, lattice description, and control-system channels to agentic optimization frameworks through a standards-based semantic layer. The effort integrates the existing facility-specific CEBAF Element Database (CED) with extensions of the emerging facility-agnostic Particle Accelerator Lattice Standard (PALS) to produce a knowledge graph (KG) containing coherent, machine-interpretable views of devices, signals, and regions. With this KG, CEBAF’s setpoints, readbacks, and device hierarchies become queryable using a uniform declarative graph query language (e.g., Neo4j Cypher), providing intents and inspectable semantics suitable for agentic control. The resulting graph-backed interfaces will allow autonomous agents to retrieve authoritative machine configurations, reason over device- and signal-level relationships, and execute tuning and diagnostic workflows without bespoke CEBAF-specific logic, thereby delivering a scalable pathway from operational data to trustworthy agentic accelerator tuning frameworks.

Zhang, He [Thomas Jefferson National Accelerator F↗
DOE OSTI2020

ExaHDF5: Delivering Efficient Parallel I/O on Exascale Computing Systems

Scientific applications at exascale generate and analyze massive amounts of data. A critical requirement of these applications is the capability to access and manage this data efficiently on exascale systems. As such, parallel I/O, the key technology enables moving data between compute nodes and storage, faces monumental challenges from new applications, memory, and storage architectures considered in the designs of exascale systems. As the storage hierarchy is expanding to include node-local persistent memory, burst buffers, etc., as well as disk-based storage, data movement among these layers must be efficient. Parallel I/O libraries of the future should be capable of handling file sizes of many terabytes and beyond. In this paper, we describe new capabilities we have developed in Hierarchical Data Format version 5 (HDF5), the most popular parallel I/O library for scientific applications. HDF5 is one of the most used libraries at the leadership computing facilities for performing parallel I/O on existing HPC systems. The state-of-the-art features we describe include: Virtual Object Layer (VOL), Data Elevator, asynchronous I/O, full-featured single-writer and multiple-reader (Full SWMR), and parallel querying. In this paper, we introduce these features, their implementations, and the performance and feature benefits to applications and other libraries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

MerAligner: A Fully Parallel Sequence Aligner

Aligning a set of query sequences to a set of target sequences is an important task in bioinformatics. In this work we present merAligner, a highly parallel sequence aligner that implements a seed-and-extend algorithm and employs parallelism in all of its components. MerAligner relies on a high performance distributed hash table (seed index) and uses onesided communication capabilities of the Unified Parallel C to facilitate a fine-grained parallelism. We leverage communication optimizations at the construction of the distributed hash table and software caching schemes to reduce communication during the aligning phase. Additionally, merAligner preprocesses the target sequences to extract properties enabling exact sequence matching with minimal communication. Finally, we efficiently parallelize the I/O intensive phases and implement an effective load balancing scheme. Results show that merAligner exhibits efficient scaling up to thousands of cores on a Cray XC30 supercomputer using real human and wheat genome data while significantly outperforming existing parallel alignment tools.

Georganas, E↗
DOE OSTI2023

Single-Filament Imaging Mass Spectrometry Lipidomics in Arthrospira platensis

Elucidating intra-organismal biochemical and lipid organization in photosynthetic biological cell factories of filamentous cyanobacteria, i.e., Arthrospira platensis (Spirulina), is important to track physiological response mechanisms during growth. Little is known about the filaments' biochemical organization and cellular structure and no label-free imaging techniques exist that provide molecular mapping. We applied ultra-high resolution mass spectrometry (7T FT-ICR-MS) matrix-assisted laser desorption ionization (MALDI) imaging to immobilized Spirulina filaments to investigate the localization of lipids across distinct physiological regions. We optimized matrix selection and deposition methods with the goal of facilitating high spatial, and intra-filament, resolution using untargeted multivariate statistical spectral deconvolution across MS pixels. Our results demonstrate an improved two step application with an optimized procedure for intra-organismal lipid profiling to improve analyte sensitivity and achieve higher spatial resolution, whereby we evaluate three conventional matrices 2,5-dihydroxybenzoic acid (DHB), a 9:1 ratio of DHB:superDHB (sDHB), 1,5- diaminonaphthalene (DAN) and a 50:50 mix of DHB:sDHB and compare delineation and pixel-based elucidation of intra-filament lipidomics. We identified a total of 1,626 features that could be putatively assigned a lipid-like formula based on database query and 46 unique features, with associated lipid assignments that were significantly distinct in their intra-filament location. MALDI- imaging MS with untargeted statistical spectral deconvolution was used to visualize intra-filament lipidomics organization in Spirulina filaments. Improvements in matrix deposition, including sequential sublimation and pneumatic spraying, increased signal abundance at high spatial resolution and allowed for identification of distinct lipid composition regions. Here in this work outlines a methodology that may be used for micro-ecological untargeted molecular phenotyping.

09 BIOMASS FUELS↗
DOE OSTI2024

A portable application framework for energy management and information systems (EMIS) solutions using Brick semantic schema

This paper introduces a portable framework for developing, scaling and maintaining energy management and information systems (EMIS) applications using an ontology-based approach. Key contributions include an interoperable layer based on Brick schema, the formalization of application constraints pertaining metadata and data requirements, and a field demonstration. The framework allows for querying metadata models, fetching data, preprocessing, and analyzing data, thereby offering a modular and flexible workflow for application development. Its effectiveness is demonstrated through a case study involving the development and implementation of a data-driven anomaly detection tool for the photovoltaic systems installed at the Politecnico di Torino, Italy. During eight months of testing, the framework was used to tackle practical challenges including: (i) developing a machine learning-based anomaly detection pipeline, (ii) replacing data-driven models during operation, (iii) optimizing model deployment and retraining, (iv) handling critical changes in variable naming conventions and sensor availability (v) extending the pipeline from one system to additional ones.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Interactive Web Application for Traffic Simulation Data Management and Visualization

As traffic simulation software becomes more effective for realistically simulating and analyzing traffic dynamics and vehicle interactions on the mesoscopic and microscopic level, the management, dissemination, and collaborative visualization of traffic simulation results produced by individual transportation planners presents a significant challenge. Existing online content management systems have a very limited capability in allowing users to query specific traffic simulation scenarios and geospatially visualize simulation results through shareable and interactive web interfaces. This paper presents a web-based application for promoting the archiving, sharing, and visualization of large-scale traffic simulation outputs. The application is developed to enhance cyber-physical controls, communications, and public education for collaborative transportation planning. Unique features of the web application include: (a) allowing users to upload their new traffic simulation scenarios (parameters and outputs), as well as search existing scenarios using easily accessible interfaces; (b) optimizing simulation output files with heterogeneous data formats and projected coordinate systems for web-based storage and management using a scalable and searchable data/metadata standard; (c) standardizing user-uploaded simulation outputs using web interfaces and data processing libraries with parallel computing capacity; and (d) providing shareable web visual interfaces for visualizing the traffic flow and signal information stored in simulation outputs (e.g., regional traffic patterns and individual vehicle interactions) and visually comparing multiple simulation outputs both spatially and temporally. Furthermore, the paper presents the conceptual design and implementation of this application, and demonstrates the application’s performance for sharing, comparing, and visualizing simulation outputs from VISSIM and SUMO, two commonly used traffic simulation software programs.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2024

To Derive or Not to Derive: I/O Libraries Take Charge of Derived Quantities Computation

The ever-increasing volume of data produced by HPC simulations necessitates scalable methods for data exploration and knowledge extraction. Scientific data analysis often involves complex queries across distributed datasets, requiring manipulation of multiple primary variables and generating derived data that needs to be handled efficiently, creating challenges for applications that need to parse many large datasets. Relying on individual applications to handle all intermediate data generally leads to redundant computations across studies and unnecessary data transfers. In this paper, we investigate the performance of different approaches where applications define derived variables as quantities of interest (QoIs) and offload the computation and transfer of these QoIs to the I/O library. This significantly reduces redundancy and optimizes data movement across the distributed storage and processing infrastructure by allowing control over when and where derived variables are computed. We present a detailed analysis of the performance-storage trade-offs associated with different solutions and showcase results for our study on two large-scale datasets created from climate and combustion simulations.

Gainaru, Ana↗
DOE OSTI2020

Near-optimal ground state preparation

Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We assume that an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and the first excited energy is bounded from below. With these assumptions we design an algorithm that prepares the ground state when an upper bound of the ground energy is known, whose runtime has a logarithmic dependence on the inverse error. When such an upper bound is not known, we propose a hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. These two algorithms can then be combined to prepare a ground state without knowing an upper bound of the ground energy. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Toward designing effective exascale scientific computing workflows: experiences and best practices

Many fields within scientific computing have embraced advances in big-data analysis and machine learning, which often requires the deployment of large, distributed and complicated workflows that may combine training neural networks, performing simulations, running inference, and performing database queries and data analysis in asynchronous, parallel and pipelined execution frameworks. Such a shift has brought into focus the need for scalable, efficient workflow management solutions with reproducibility, error and provenance handling, traceability, and checkpoint-restart capabilities, among other needs. Here, we discuss challenges and best-practices for deploying exascale-generation computational science workflows on resources at the Oak Ridge Leadership Computing Facility (OLCF). We present our experiences with large-scale deployment of distributed workflows on the Summit supercomputer, including for bioinformatics and computational biophysics, materials science, and deep learning model optimization. We also present problems and solutions created by working within a Python-centric software base on traditional HPC systems, and discuss steps that will be required before the convergence of HPC, AI, and data science can be fully realized. Our results point to a wealth of exciting new possibilities for harnessing this convergence to tackle new scientific challenges.

Coletti, Mark↗
DOE OSTI2025

Leveraging Radiofrequency Identification Success Beyond Hazardous Material Inventory Management at a National Laboratory

Effective inventory management can be overshadowed by conflicting priorities in organizational procedures, particularly in research-focused institutions such as national laboratories that handle expensive, delicate, and hazardous materials. Here, this study investigated the potential of radiofrequency identification (RFID) technology, currently used for hazardous chemical inventory, in applications with higher metal interference and absorption, specifically pressure release device (PRD) compliance and nuclear container management, at Lawrence Livermore National Laboratory (LLNL). This study was done to document best practices to enhance inventory identification speeds for inventory reconciliation and inventory recall and to explore optimal configurations for RFID implementation compared to traditional manual methods of equipment management. Tests were conducted to determine the ideal RFID tag orientation (read at angles of 0°, 90°, and 270°), various container layouts (linear, separated, curved, operational), and ID methods such as manual, barcode, and RFID performing three trials per method per orientation. Results indicated that 0° was the optimal read angle for minimizing metallic interference, and the operational and curved arrangements significantly outperformed the linear and separated configurations in read speed. 3D printed mounts were developed and tested, increasing the read range of the RFID reader by up to 235% in cases of high metallic interference. The RFID technology demonstrated an average speed increase of 65% over a simplified manual identification, which supports the conclusion that RFID is a more efficient method for large hazardous inventory management and equipment reconciliation. Additionally, capturing meta-data, such as location and date, can be used to query for inventory recall and automated updating of record information.

42 ENGINEERING↗
DOE OSTI2016

A Review of Current Machine Learning Methods Used for Cancer Recurrence Modeling and Prediction

Cancer has been characterized as a heterogeneous disease consisting of many different subtypes. The early diagnosis and prognosis of a cancer type has become a necessity in cancer research. A major challenge in cancer management is the classification of patients into appropriate risk groups for better treatment and follow-up. Such risk assessment is critically important in order to optimize the patient’s health and the use of medical resources, as well as to avoid cancer recurrence. This paper focuses on the application of machine learning methods for predicting the likelihood of a recurrence of cancer. It is not meant to be an extensive review of the literature on the subject of machine learning techniques for cancer recurrence modeling. Other recent papers have performed such a review, and I will rely heavily on the results and outcomes from these papers. The electronic databases that were used for this review include PubMed, Google, and Google Scholar. Query terms used include “cancer recurrence modeling”, “cancer recurrence and machine learning”, “cancer recurrence modeling and machine learning”, and “machine learning for cancer recurrence and prediction”. The most recent and most applicable papers to the topic of this review have been included in the references. It also includes a list of modeling and classification methods to predict cancer recurrence.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Unified many-worlds browsing of arbitrary physics-based animations

Manually tuning physics-based animation parameters to explore a simulation outcome space or achieve desired motion outcomes can be notoriously tedious. This problem has motivated many sophisticated and specialized optimization-based methods for fine-grained (keyframe) control, each of which are typically limited to specific animation phenomena, usually complicated, and, unfortunately, not widely used. In this paper, we propose Unified Many-Worlds Browsing (UMWB), a practical method for sample-level control and exploration of physics-based animations. Our approach supports browsing of large simulation ensembles of arbitrary animation phenomena by using a unified volumetric WORLDPACK representation based on spatiotemporally compressed voxel data associated with geometric occupancy and other low-fidelity animation state. Beyond memory reduction, the WORLDPACK representation also enables unified query support for interactive browsing: it provides fast evaluation of approximate spatiotemporal queries, such as occupancy tests that find ensemble samples ("worlds") where material is either IN or NOT IN a user-specified spacetime region. WORLDPACKS also support real-time hardware-accelerated voxel rendering by exploiting the spatially hierarchical and temporal RLE raster data structure. Our UMWB implementation supports interactive browsing (and offline refinement) of ensembles containing thousands of simulation samples, and fast spatiotemporal queries and ranking. We show UMWB results using a wide variety of physics-based animation phenomena---not just JELL-O ® .

Computer Science↗
DOE OSTI2026

Growth of Low-Defect WSe 2 Film via High-Purity van der Waals Crystal Precursor

Two-dimensional (2D) semiconducting transition metal dichalcogenides (TMDs) exhibit exceptional electrical and optical properties, empowering their promising prospects for future nanoelectronics. Despite major advances in n-type 2D semiconductors, the field has yet to synthesize high-mobility p-type 2D TMDs, in particular WSe 2 , and systematically query the influence of defects. In this study, we unveil the pivotal role of substitutional impurity defects vis-à-vis the precursor used and growth method employed in defining the quality of 2D p-type WSe 2 . Density functional theory calculations suggest the adverse effect of Fe-, Co-, Ni- and Si-substituted W impurity defects on the mobility of WSe 2 , whereas defects such as O-, S-substituted Se and Mo-substituted W pose negligible impact. Guided by the theory, we pinpoint van der Waals (vdW) crystals, commonly used in mechanical exfoliation, as the optimal precursor, and develop a facile vdW crystal physical vapor deposition (PVD) method to grow high-purity monolayer 2D WSe 2 film (VPVD-WSe 2 ) that is continuous across a centimeter scale. A suite of spectroscopies confirms the markedly reduced defect density of the as-synthesized WSe 2 compared to those by typical chemical vapor deposition methods, and by PVD with commercial or hydrothermal precursors. Scanning tunneling microscopy further evidence the ultralow substitutional impurity defect density of VPVD-WSe 2 , greatly outperforming the control samples and approaching the mechanically exfoliated counterparts. The VPVD-WSe 2 based field-effect transistors exhibit notable electrical performance with record-high field-effect hole mobility up to 112 cm 2 V –1 s –1 at room temperature, exceeding the best-reported monolayer WSe 2 synthesized by chemical vapor deposition and rivaling the mechanically exfoliated 2D WSe 2 flakes.

WSe2↗
DOE OSTI2016

Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments

Sequence alignment algorithms are a key component of many bioinformatics applications. Though various fast Smith-Waterman local sequence alignment implementations have been developed for x86 CPUs, most are embedded into larger database search tools. In addition, fast implementations of Needleman-Wunsch global sequence alignment and its semi-global variants are not as widespread. This article presents the first software library for local, global, and semi-global pairwise intra-sequence alignments and improves the performance of previous intra-sequence implementations. As a result, a faster intra-sequence pairwise alignment implementation is described and benchmarked. Using a 375 residue query sequence a speed of 136 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon E5-2670 12-core processor system, the highest reported for an implementation based on Farrar’s ’striped’ approach. When using only a single thread, parasail was 1.7 times faster than Rognes’s SWIPE. For many score matrices, parasail is faster than BLAST. The software library is designed for 64 bit Linux, OS X, or Windows on processors with SSE2, SSE41, or AVX2. Source code is available from https://github.com/jeffdaily/parasail under the Battelle BSD-style license. In conclusion, applications that require optimal alignment scores could benefit from the improved performance. For the first time, SIMD global, semi-global, and local alignments are available in a stand-alone C library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The strip method for shape derivatives

Abstract A major challenge 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 multiphysics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. The volume and boundary methods are two approaches to computing shape derivatives. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. 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. As an added benefit, its computational complexity is comparable to that of the boundary method, that is, it is faster than the volume method. We illustrate the benefits of the strip method with numerical examples.

Hardesty, Sean↗