SEARCH · Search NASA
Results for “Query Tool”
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.
Residential Building Energy Efficiency Field Studies: Low-Rise Multifamily
In recent years, the U.S. Department of Energy (DOE) has conducted a series of research studies to validate energy efficient building technologies in the field. Much of the work has focused on single-family construction, and some has also addressed commercial energy codes. The work detailed in this DOE-funded study (EE0007616) focuses on low-rise multifamily buildings (three stories or fewer above grade) in various regions of the United States, and reports on how state-level building codes are being implemented, both in terms of observed characteristics and also in terms of estimated energy impacts. Nearly 100 buildings across four states—Illinois, Minnesota, Oregon, and Washington—were sampled, which represent a range of climate types from mild temperature to very cold continental. Both common entry and outdoor entry buildings were included, and a parallel research project evaluated envelope air tightness and current still-evolving air tightness testing methods. Finally, a set of structured interviews of building designers and other relevant professionals was carried to out to gain more insight into this market. To the greatest extent possible, the methodology developed under the project for low-rise multifamily buildings mirrored the approach established by Pacific Northwest National Laboratory (PNNL) for single-family residential buildings (https://www.energy.gov/eere/buildings/downloads/residential-building-energy-code-field-study). This included the general approach to sampling, recruitment, and data collection, as well as data analysis and presentation. The range of permitting dates for the sites encompassed two energy code cycles in most regions. All states in the study had adopted a variation of the International Energy Conservation Code (IECC) for the structure of their state code. The low-rise multifamily occupancy presents a hybrid building type: most of the building’s conditioned floor area was covered by the residential chapter of the code while portions of the building (such as corridors and common spaces) fell under the commercial code chapter. The key items assessed in this work were: Building Shell—exterior wall insulation, ceiling insulation, foundation insulation, windows. Common Areas—HVAC and lighting. Living Units—lighting, ventilation. A few items were not assessed in detail, given their relative paucity in this occupancy type; these included duct leakage, pipe insulation, and hot water circulation controls. Building characteristics were collected via a combination of architectural, mechanical, electrical, and plumbing plan reviews and field inspections, and entered into a spreadsheet-based tool that was later queried to build a database. Data went through quality control both upon arrival and via a later semi-automated review and assurance process. Most of the data are presented graphically so that the reader can quickly assess compliance with the applicable energy codes (both by state and by code year). As a final step, EnergyPlus™ simulations were created for all buildings in the study to estimate both the as-found energy use intensity (EUI) and the energy and CO 2 that could be saved if features that were found to not meet code minimums were brought up to code. The savings estimates were tabulated for each of the four states in the study. The research team found that the single-family approach was largely applicable to low-rise multifamily buildings. This applies to both the data collection and the prototype EUI analysis. Most of the occupied space is living units and falls under residential energy codes, and many characteristics use similar envelope construction and relatively straightforward mechanical systems and lighting. One of the most challenging aspects of this work was to build an effective spreadsheet-based data collection instrument that could allow efficient collection of both building plan and field data. The research team is of the view that other methods could be equally effective if the work is done carefully with diligent quality control. The primary findings for the work center around the thermal envelope and mechanical systems and lighting at the sites: For thermal envelope components, the majority of buildings met or were better than the prescriptive code.This suggests that building designers and builders are aware of code requirements. In some cases, surveyed buildings were designed to qualify for energy efficiency certification programs. These buildings made up at least 20% of sampled buildings in each state. Almost all buildings met mechanical system efficiency requirements (for both living units and common areas). In some cases, sites employed systems that were considerably more efficient than required by the applicable energy code. Dwelling units had a majority of high-efficacy lighting, often in excess of the state’s residential code requirements. While high-efficacy fixtures were also typical in common areas (corridors and stairwells), lighting power densities (LPDs) in these areas were sometimes higher than levels dictated by the applicable part of the state commercial energy code. The simulation models run on a series of low-rise multifamily prototypes, informed by a composite of the field data collected, calculated annual EUIs of between 20 and 50 kBtu/ft2-yr, with the range representing the effects of both building characteristics and building location (climate zone). A detailed process (based on simulations of prototype buildings) was used to estimate the amount of avoided energy use that would occur if 100% adherence to energy codes were attained. The results indicated modest savings are attainable for items such as window thermal performance and common area lighting. The result is overall only a modest potential for additional energy savings, averaging about 10% of EUI.
The Integration and Mapping of an Open-Source National Well Resource to Inform Geologic Carbon Storage Site Selection and Risk Prevention: The CO2-Locate Database
Geologic carbon storage (GCS) offers a way to capture and permanently store CO₂ from fossil fuel operations in underground geologic structures, aiding in the transition to a carbon-neutral energy economy. However, CO₂ injection sites can experience gas leakage through existing wells that penetrate storage reservoirs, making knowledge of well locations and characteristics crucial for permitting, infrastructure reusability, and risk assessment in GCS. Currently, public wellbore data from state, federal, and tribal entities are inconsistent and fragmented, with gaps and redundancies. To address this, the National Energy Technology Laboratory (NETL) developed CO2-Locate, an open-source, geospatial database and online application. CO2-Locate integrates over 50 data sources from federal, state, and tribal entities, creating a standardized national well database. Funded by the Bipartisan Infrastructure Law, the database is publicly available through the Energy Data eXchange (EDX) and viewable via the CO2-Locate web mapping application. This tool allows users to query, filter, and visualize well data to support GCS planning, permitting, and risk assessments. This presentation covers the methods used to create CO2-Locate, including data acquisition, processing, attribute mapping, and integration, much of which is automated for future updates. The web mapping application and its role in GCS site selection will also be discussed.
The Dark Energy Survey Data Release 2
In this work, we present the second public data release of the Dark Energy Survey, DES DR2, based on optical/near-infrared imaging by the Dark Energy Camera mounted on the 4 m Blanco telescope at Cerro Tololo Inter-American Observatory in Chile. DES DR2 consists of reduced single-epoch and coadded images, a source catalog derived from coadded images, and associated data products assembled from 6 yr of DES science operations. This release includes data from the DES wide-area survey covering ~5000 deg 2 of the southern Galactic cap in five broad photometric bands, grizY. DES DR2 has a median delivered point-spread function FWHM of g = 1.11'', r = 0.95'', i = 0.88'', z = 0.83'', and Y = 0farcs90, photometric uniformity with a standard deviation of < 3 mmag with respect to Gaia DR2 G band, a photometric accuracy of ~11 mmag, and a median internal astrometric precision of ~27 mas. The median coadded catalog depth for a 1farcs95 diameter aperture at signal-to-noise ratio = 10 is g = 24.7, r = 24.4, i = 23.8, z = 23.1, and Y = 21.7 mag. DES DR2 includes ~691 million distinct astronomical objects detected in 10,169 coadded image tiles of size 0.534 deg2 produced from 76,217 single-epoch images. After a basic quality selection, benchmark galaxy and stellar samples contain 543 million and 145 million objects, respectively. These data are accessible through several interfaces, including interactive image visualization tools, web-based query clients, image cutout servers, and Jupyter notebooks. DES DR2 constitutes the largest photometric data set to date at the achieved depth and photometric precision.
Visualizing metagenomic and metatranscriptomic data: A comprehensive review
The fields of Metagenomics and Metatranscriptomics involve the examination of complete nucleotide sequences, gene identification, and analysis of potential biological functions within diverse organisms or environmental samples. Despite the vast opportunities for discovery in metagenomics, the sheer volume and complexity of sequence data often present challenges in processing analysis and visualization. This article highlights the critical role of advanced visualization tools in enabling effective exploration, querying, and analysis of these complex datasets. Emphasizing the importance of accessibility, the article categorizes various visualizers based on their intended applications and highlights their utility in empowering bioinformaticians and non-bioinformaticians to interpret and derive insights from meta-omics data effectively.
Method and system for information retrieval and aggregation from inferred user reasoning
The visual analytic system enables information retrieval within large text collections. Typically, users have to directly and explicitly query information to retrieve it. With this system and process, the reasoning of the user is inferred from the user interaction they perform in a visual analytic tool, and the appropriate information to query, process, and visualize is systematically determined.
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.
Simulation INsight and Analysis
Sina is a tool set for modern scientific data management that provides flexible, light-weight support of non-bulk data capture for retention in and queries against SQL and noSQL data stores. HPC simulations traditionally maintain their data in files. Extracting data of interest for subsequent analysis then requires the time-consuming process of traversing directories and scraping data from files in a variety of formats. Sina facilitates capturing relevant data during execution or post-processing of simulation runs for retention in and queries from a modern data store. The tools are sufficiently general to allow for the inclusion of new fields as scientists learn more about their data. Libraries, currently in C++ and Python, and a command line interface (CLI) are provided. Sina's flexibility starts with a general schema, in JSON, for the collection of non-bulk simulation data. JSON provides a flexible, human-readable representation of the data that of interest. Sina currently has a C++ library for simulations to write data to and read from a schema-compliant file for subsequent ingestion into one of the supported data stores. However, applications are free to write their data directly into a schema-compliant file. Python packages provide data ingestion, management, query, and export capabilities. A command line interface (CLI) provides simplified access to these features. A common application programming interface (API) is used to maintain and query data in any of the supported data stores, which are currently limited to SQL and Apache Cassandra (a column store). Tutorials, demonstrations, and examples illustrate aspects of the process using scripts and Jupyter notebooks.
exodus_helper
SAND2022-7288 O The exodus_helper Python package is a set of tools that allows a user to query and create datasets in the Exodus II format for use in finite element analysis. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
SoDaH: the SOils DAta Harmonization database, an open-source synthesis of soil data from research networks, version 1.0
Data collected from research networks present opportunities to test theories and develop models about factors responsible for the long-term persistence and vulnerability of soil organic matter (SOM). Synthesizing datasets collected by different research networks presents opportunities to expand the ecological gradients and scientific breadth of information available for inquiry. Synthesizing these data is challenging, especially considering the legacy of soil data that have already been collected and an expansion of new network science initiatives. To facilitate this effort, here we present the SOils DAta Harmonization database (SoDaH; https://lter.github.io/som-website, last access: 22 December 2020), a flexible database designed to harmonize diverse SOM datasets from multiple research networks. SoDaH is built on several network science efforts in the United States, but the tools built for SoDaH aim to provide an open-access resource to facilitate synthesis of soil carbon data. Moreover, SoDaH allows for individual locations to contribute results from experimental manipulations, repeated measurements from long-term studies, and local- to regional-scale gradients across ecosystems or landscapes. Finally, we also provide data visualization and analysis tools that can be used to query and analyze the aggregated database. The SoDaH v1.0 dataset is archived and available at https://doi.org/10.6073/pasta/9733f6b6d2ffd12bf126dc36a763e0b4 (Wieder et al., 2020).
Collection And Analysis Of Telemetry For The Cyote Heuristic
CATCH CLI focuses on gathering telemetry data, storing it in the Neo4j database, querying for Mitre ATT&CK patterns, and creating STIX 2.1 reports. Key Components: Analysis Modules: Analyze data to detect attack patterns. GoSTOTS Collection Engines: Collect telemetry data. These tools can be used together or individually. Analysis modules rely on data from specific engines to identify attack patterns. Source Code Organization: Engines: CATCH/catch/cmd/collection Modules: CATCH/catch/cmd/analysis CGUI Overview CATCH Graphical User Interface (CGUI) offers a graphical shell to execute CATCH CLI, allowing easy editing of: Analysis Modules Database configurations Profiles (collection and device settings) Neo4j Overview Neo4j is a graph database using the Cypher query language, storing data in JSON. It seamlessly integrates with STIX 2.1 data for: Data Submission: CATCH Collection Engines Data Querying: Analysis Modules CATCH modifies STIX 2.1 data for Neo4j submission and reverts it back during querying. STIG Overview Structured Threat Intelligence Graph (STIG) is a tool for creating, editing, querying, analyzing, and visualizing threat intelligence using STIX 2.1 and storing data in Neo4j. Usage Tools can be run: Manually (CLI): Refer to CATCH documentation User Interface: Run ./cgui/CGUI or go run ./cgui/ Additional Information Logging System: Detailed in the config documentation Further Documentation: Available for CATCH and CGUI
A Knowledge Graph Approach for the Secondary Use of Cancer Registry Data
Population-based central cancer registries collect valuable structured and unstructured data primarily for cancer surveillance and research, enhancing insights into clinical features associated with cancer occurrence, cancer treatment, and cancer outcomes to guide interventions which reduce the cancer burden. Cancer registries primarily collect data on (1) cancer type (case or tumor); (2) patient demographics such as age, gender, and residential address at time of diagnosis; (3) planned first course of treatment; and (4) date of last contact, vital status, and cause of death. Cancer registry data is dynamic, structured data, which is extracted from many unstructured sources such as electronic healthcare records, and consolidated for reporting and other purposes. While available advanced analytic tools such as SEER*Stat have the ability to build SAS queries, we, however, explore an innovative knowledge graph approach to organizing cancer registry data for advanced analytics and visualization, which has unique advantages over approaches of existing tools. This innovative knowledge graph approach semantically enriches the data and easily enables linkage with third-party data, which can better explain variation in outcomes. We have developed a prototype knowledge graph based on data from the Louisiana Tumor Registry and other publicly available datasets including Behavioral Risk Factor Surveillance System, Clinical Trials, DBpedia, GeoNames, Rural-Urban Continuum Codes, and Semantic MEDLINE. The resource description framework (RDF) data model was selected to represent our knowledge graph, which contains more than 25 billion triples and is ~4TB in storage size. To exhibit the benefits of the knowledge graph approach, we used scenario specific queries, which find the relationships between cancer treatment sequences and outcomes. To illustrate its ease of use in iterative analysis, the knowledge graph was linked to external datasets for performing complex queries across multiple datasets. In addition, we used knowledge graphs to identify data discrepancies and to handle schema changes. Finally, we visualized the knowledge graph to discover data patterns. Our results demonstrate this graph-based solution enables cancer researchers to execute complex queries and more easily perform iterative analyses to improve understanding of cancer registry data. In the future, we would like to use high-performance computing (HPC) resources for faster-generating hypotheses with clinical potential from our knowledge graph.
Reverse image search for scientific data within and beyond the visible spectrum
The explosion in the rate, quality and diversity of image acquisition instruments has propelled the development of expert systems to organize and query image collections more efficiently. Recommendation systems that handle scientific images are rare, particularly if records lack metadata. This paper introduces new strategies to enable fast searches and image ranking from large pictorial datasets with or without labels. The main contribution is the development of pyCBIR, a deep neural network software to search scientific images by content. This tool exploits convolutional layers with locality sensitivity hashing for querying images across domains through a user-friendly interface. Our results report image searches over databases ranging from thousands to millions of samples. We test pyCBIR search capabilities using three convNets against four scientific datasets, including samples from cell microscopy, microtomography, atomic diffraction patterns, and materials photographs to demonstrate 95% accurate recommendations in most cases. Furthermore, all scientific data collections are released.
Geocube
NOTICE: Geocube has been replaced by EDX Spatial, a modern geospatial platform to map, visualize, query and explore spatial data. Online web mapping tool for visualization and simple analysis of Earth-energy data files from public and DOE related sources. Geocube allows users to upload and visualize their own datasets but also comes preloaded with individual spatial datasets as well as spatial data collections that align to topical themes.
TripleGraph
RDF triplestores are great tools for online graph analytic processing (i.e., graph pattern query processing), but they do not provide graph mining capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.). The software title “TripleGraph” is a graph analysis toolkit, which uses an RDF triplestore as its backend for creating, manipulating, mining, and programming with large scale property graphs. It allows users to run various graph mining algorithms easily. User can import edgelist-formatted (homogeneous graph) or JSON-formatted graph (property graph) into the RDF triplestore using the provided tool and perform various analysis such as (1) Node/edge retrieval and manipulation, (2) Pathfinding between two given nodes, (3) Running graph mining algorithms (PageRank/Personalized PageRank, Single Source Shortest Path/Multi-Source Shortest Path, Connected Component, Node Eccentricity, Peer Pressure Clustering). It supports standard graph data format and works with a standard SPARQL endpoint like Jena Fuseki. It allows users to perform online graph analytic processing and graph mining on the same platform (a triplestore).
Testing SOAR tools in use
Investigations within Security Operation Centers (SOCs) are tedious as they rely on manual efforts to query diverse data sources, overlay related logs, correlate the data into information, and then document results in a ticketing system. Security Orchestration, Automation, and Response (SOAR) tools are a relatively new technology that promise, with appropriate configuration, to collect, filter, and display needed diverse information; automate many of the common tasks that unnecessarily require SOC analysts’ time; facilitate SOC collaboration; and, in doing so, improve both efficiency and consistency of SOCs. There has been no prior research to test SOAR tools in practice; hence, understanding and evaluation of their effect is nascent and needed. Here, in this paper, we design and administer the first hands-on user study of SOAR tools, involving 24 participants and six commercial SOAR tools. Our contributions include the experimental design, itemizing six characteristics of SOAR tools, and a methodology for testing them. We describe configuration of a cyber range test environment, including network, user, and threat emulation; a full SOC tool suite; and creation of artifacts allowing multiple representative investigation scenarios to permit testing. We present the first research results on SOAR tools. Concisely, our findings are that: per-SOC SOAR configuration is extremely important; SOAR tools increase efficiency and reduce context switching, although with potentially decreased ticketing accuracy/completeness; user preference is slightly negatively correlated with their performance with the tool; internet dependence varies widely among SOAR tools; and balance of automation with assisting decision making is preferred by senior participants. We deliver a public user- and tool-anonymized and -obfuscated version of the data.
Visualizing Hierarchical Performance Profiles of Parallel Codes Using CallFlow
Calling context trees (CCTs) couple performance metrics with call paths, helping understand the execution and performance of parallel programs. To identify performance bottlenecks, programmers and performance analysts visually explore CCTs to form and validate hypotheses regarding degraded performance. However, due to the complexity of parallel programs, existing visual representations do not scale to applications running on a large number of processors. In this work, we present CallFlow, an interactive visual analysis tool that provides a high-level overview of CCTs together with semantic refinement operations to progressively explore CCTs. Using a flow-based metaphor, we visualize a CCT by treating execution time as a resource spent during the call chain, and demonstrate the effectiveness of our design with case studies on large-scale, production simulation codes.