Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Taxonomy”

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 181 records · Page 10

Data Readiness for AI: A 360-Degree Survey

Artificial Intelligence (AI) applications critically depend on data. Poor-quality data produces inaccurate and ineffective AI models that may lead to incorrect or unsafe use. Evaluation of data readiness is a crucial step in improving the quality and appropriateness of data usage for AI. R&D efforts have been spent on improving data quality. However, standardized metrics for evaluating data readiness for use in AI training are still evolving. In this study, we perform a comprehensive survey of metrics used to verify data readiness for AI training. This survey examines more than 140 papers published by ACM Digital Library, IEEE Xplore, journals such as Nature, Springer, and Science Direct, and online articles published by prominent AI experts. This survey aims to propose a taxonomy of data readiness for AI (DRAI) metrics for structured and unstructured datasets. We anticipate that this taxonomy will lead to new standards for DRAI metrics that would be used for enhancing the quality, accuracy, and fairness of AI training and inference.

97 MATHEMATICS AND COMPUTING↗

CHESS 2025: Field-collected vegetation attributes and site photos

This dataset represents field observations of vegetation samples collected as part of the Colorado Headwaters Ecological Spectroscopy Study (CHESS) during June and July of 2025. Samples were collected in the field using tablet computers and digital forms, with target data differing by sample type (individual trees, individual shrubs, or 1-meter square plots of meadow and subshrub vegetation). Field samples were collected within 72 hours of airborne data collection using the National Ecological Observatory Network’s Aerial Observation Platform (NEON AOP). The NEON AOP collected waveform LiDAR (Light Detection and Ranging) and imaging spectrometer data in 426 spectral bands from the visible to shortwave infrared. Remote sensing data for the project is available on ESS-DIVE (DOI and citation to be added upon publication). Field data collected included canopy height and per-species horizontal proportional cover for meadow plots, species identity and height information for shrubs, as well as species identity, height, diameter at breast height, and health assessment information for trees. Photos of the focal site and surrounding landscape were taken for all sampling sites and are included in this archive. Green leaves or needles were collected for plant trait and foliar chemistry analysis. This data is archived separately (DOI and citation to be added upon publication). High-precision geospatial data for each sample (crown perimeter polygons for trees and shrubs, plot boundaries for meadow plots) is available here (Henderson et al., 2026). Field and remote sensing protocols largely followed those of a previous field and airborne imaging campaign performed in 2018 (described in Chadwick et al. 2020). Field data from the 2018 campaign can be found here (Chadwick et al., 2020 doi:10.15485/1618130). Because different field measurements were taken for meadow, shrub, and tree sites, data from these three sample types are archived as separate tables (chess_meadow_site_cleaned.csv, chess_shrub_site_cleaned.csv, chess_tree_site_cleaned.csv). Meadow proportional cover data is stored in a separate table (chess_meadow_cover_cleaned.csv). Taxonomy was treated identically between sample types, and the dataset shares a common set of voucher specimens (chess_voucher_IDs_cleaned.csv), as well as a single species list (chess_species_list_cleaned.csv). All taxonomic determinations were performed to the species level, and adhere to the Global Biodiversity Information Facility (GBIF) backbone taxonomy as of January 10th, 2026 (GBIF Secretariat 2023). CHESS Project Description: The Colorado Headwaters Ecological Spectroscopy Study (CHESS) comprised a multi-week airborne remote sensing and field observation campaign in the Upper Gunnison Basin, Colorado, conducted in June and July of 2025. Airborne remote sensing was conducted by the National Ecological Observatory Network Airborne Observation Platform (NEON AOP), concurrent with a field campaign run by the Rocky Mountain Biological Laboratory (RMBL), the Lawrence Berkeley National Laboratory (LBNL) and SLAC National Accelerator Laboratory Watershed Function Science Focus Area (SFA), and NASA-JPL (Jet Propulsion Laboratory) Earth Surface Mineral Dust Source Investigation (EMIT) program. Between June 10 and July 18, 2025, the NEON AOP flight team collected high-resolution aerial imaging spectroscopy and Light Detection and Ranging (LiDAR) data over three domains: the Upper East River (CRBU), Almont Triangle (ALMO), and the Upper Taylor Basin (UPTA). In coordination with the flights, a field campaign acquired ground-truth observations, including observations of vegetation composition, foliar traits, forest demography, and subsurface properties in 18 core sampling areas within the domains. Additional surface water observations were taken at over 380 point locations. All CHESS campaign datasets can be found within the CHESS ESS-DIVE data portal: https://data.ess-dive.lbl.gov/portals/chess. Funding Acknowledgment: Field and remote-sensing data acquisition was performed under a grant from the National Aeronautics and Space Administration (80NSSC24K1005). This work was also supported by the Watershed Function Science Focus Area at Lawrence Berkeley National Laboratory funded by the US Department of Energy, Office of Science, Biological and Environmental Research under Contract No. DE-AC02-05CH11231.

2018 NEON and 2025 CHESS Campaigns↗

A Functional All-Hazard Approach to Critical Infrastructure Dependency Analysis

The critical infrastructures protection landscape is a vast and varied pattern of independent, but interconnected infrastructure systems that are essential to the function of our modern society. The U.S. policy on critical infrastructure protection has been continually evolving since the “President’s Commission on Critical Infrastructure Protection” was published in 1997. In response to these policies, federal, state, and local governments, along with research institutions, have invested a substantial amount of time and effort into identifying and analyzing critical infrastructure, their functions, and dependencies/interdependencies to better understand their vulnerabilities. To date, the ability to assess vulnerabilities, resiliency, and priorities for protecting interdependent critical infrastructure systems from an all-hazards perspective remains a difficult problem. In this paper we introduce the All-Hazards Analysis (AHA) methodology, which provides an integrated functional basis across infrastructure systems, through the implementation of a common language and a scalable level of decomposition to effectively evaluate the resilience of interconnected infrastructure systems. AHA models infrastructure systems as directed multidimensional graphs, which enable the evaluation of cross-sector interdependencies prior to, during, and after disruptive events. Finally, and by design, AHA enables the cross linking of data taxonomies to enable more effective data sharing, such as the National Critical Functions (NCF) and Infrastructure Data Taxonomy (IDT).

02 PETROLEUM↗

Understanding the Design Space of Sparse/Dense Multiphase Dataflows for Mapping Graph Neural Networks on Spatial Accelerators

Graph Neural Networks (GNNs) have garnered a lot of recent interest because of their success in learning representations from graph-structured data across several critical applications in cloud and HPC. Owing to their unique compute and memory characteristics that come from an interplay between dense and sparse phases of computations, the emergence of reconfigurable dataflow (aka spatial) accelerators offers promise for acceleration by mapping optimized dataflows (i.e., computation order and parallelism) for both phases. The goal of this work is to characterize and understand the design-space of dataflow choices for running GNNs on spatial accelerators in order for the compilers to optimize the dataflow based on the workload. Specifically, we propose a taxonomy to describe all possible choices for mapping the dense and sparse phases of GNNs spatially and temporally over a spatial accelerator, capturing both the intra-phase dataflow and the inter-phase (pipelined) dataflow. Using this taxonomy, we do deep-dives into the cost and benefits of several dataflows and perform case studies on implications of hardware parameters for dataflows and value of flexibility to support pipelined execution.

97 MATHEMATICS AND COMPUTING↗

Grid Event Signature Library Analytics Report: Signature Matching Tool Development Efforts

This report describes the purpose and features of the Signature Matching Tool (SMT), employed in the Department of Energy (DOE) Grid Event Signature Library (GESL). The SMT supports a user of GESL to identify snippets of electric signatures, usually from sensor devices measuring electric characteristics such as phase voltages and currents, frequency, etc., suspected to represent certain events in the power grid but are not known to the user. The SMT uses a classification method to identify an event of the unknown signature, using the repository of known and labeled signatures in the GESL. The classifier applies a local binary classifier per node (LCN) approach to the unique event tag taxonomy used in the GESL, where training phases are separated based on the Primary labels in the taxonomy, sensor type, and voltage level. Results show that this method helps with computing time during training, in comparison to a flat, multinomial classifier, and produces acceptable average accuracy of 83% across all Primary labels. The report concludes with planned future work including integration to the web interface and API.

97 MATHEMATICS AND COMPUTING↗

Predictive Indicators of the Performance of Large Language Models

In several mission contexts, it is desirable to estimate the performance of large language models (LLMs) on tasks that we cannot run directly. In light of published “scaling laws” our hypothesis is that some tasks should be consistently more challenging than others based on characteristics of the task. The goal of this project was to begin quantifying how much information about LLM performance can be gained from the features of a model and a task. Two of our statistical models struggled to converge. Pass/fail test results may provide limited information for inference beyond model quality and task difficulty, but we see no evidence at this time for significant feature interaction effect sizes, arguing for simple models. Future work extending the models to capitalize on perplexity of ground truth answers is suggested. This project also introduces “Depth of Knowledge Variant Testing” as a strategy for more finely assessing language models on open domain question and answer tasks. We developed sets of questions that ask a language model to produce similar information while demonstrating increasing depth of knowledge, and also relabeled existing Q&A test questions with their depth of knowledge. Our results suggest further consideration of Bloom’s taxonomy and further refinement of prompts to properly elicit information at varying depths. In the course of this work, we set up a basic infrastructure for standardizing tasks and testing many language models on these tasks. In addition to testing the predictive quality of model features and performance across test suites, with this project we have introduced two new task features to contextualize each test question: the Dewey Classification main category of information covered, and the Bloom’s taxonomy level that corresponds to the depth of knowledge probed by the question. Splits across these and other features produced over five hundred task subtypes with distinct feature vectors, which we tested on half a dozen models.

97 MATHEMATICS AND COMPUTING↗

A Framework for Evaluating the Implementation Cost of Attacks on Large Language Models

Large Language Models (LLMs) have been increasingly proposed as a method to enhance productivity in tasks that involve language and code. However, these models are large, complex, and their capabilities are not easily understood and controlled, meaning that their adoption opens many possibilities for new cyberattacks and misuse. Numerous attacks on LLMs have been reported and summarized in literature reviews, but we found existing reviews lacking in understanding the implementation cost of the attacks - i.e., how much effort would an attacker need in terms of coding, expertise, and resources to adopt attacks presented in the literature. Therefore, we divide existing attacks on LLMs into a taxonomy, and define a cost evaluation framework to determine the cost of the attack. An attack’s cost can be 1) estimated from reading the publication about the attack or 2) determined by implementing the attack from that publication. We provide an example evaluation of a couple jailbreaking frameworks based on experiments, and then apply the more lightweight cost estimate to a representative selection of attacks across the taxonomy we define. We discuss the relative difficulty of the attacks and also highlight defenses that have attempted to mitigate these attacks and assess their effectiveness.

97 MATHEMATICS AND COMPUTING↗

Dataset for the Danczak et al., 2025 manuscript about bacterial-fungal interactions

We generated genome-resolved multiomics data from a series of metagenomic and metatranscriptomic sequencing. Specifically, we acquired, functionally annotated, and taxonomically classified both bacterial and eukaryotic metagenome assembled genomes (MAGs). For bacterial MAGs, we assembled eukaryotic float metagenomic sequencing data from JGI using MEGAHIT, binned and refined MAGs using MetaWRAP and dRep, functionally annotated MAGs using eggNOG mapper, and assigned taxonomy using GTDB-tk. For eukaryotic MAGs, we first identified potentially eukaryotic contigs from a coassembly of eukaryotic float metagenomic sequencing data from JGI using EukRep and Whokaryote, binned MAGs using MetaBAT2, functionally annotated MAGs using eggNOG mapper, and assigned taxonomy using Eukulele. Bulk metatranscriptomic reads were mapped to bacterial MAGs and polyA-metatranscriptomic read were mapped to eukaryotic MAGs using bbmap.

Danczak, Robert E. [Pacific Northwest National Lab↗

Pathways to IEC Standards for Heliostat Design Qualification and Site Acceptance in Central Receiver CSP Applications

This paper surveys the existing landscape of standards relevant to heliostats, identifies their gaps, and proposes a path forward to a comprehensive set of heliostat guidelines, technical specifications, and standards under the framework of International Electrotechnical Commission (IEC) TC 117. Gaps in existing guidelines and standards are surveyed using a three-tiered taxonomy: component-level, heliostat-level, and field-level. At each level, the gap analysis is followed by a proposal for a coordinated path forward on the development of standards. At the component level, advances in the understanding of wind loading should inform a technical specification for drives and structures. Reflectors require consolidation of measurement guidelines into existing standards documents. Communications & controls require technical standards to inform their selection and secure implementation. At the heliostat level, IEC 62817 (solar trackers) adequately characterizes drive systems, structures, and electronics, but requires adaptation to heliostats' use patterns, operating modes, and expected life cycles. IEC 62817 does not address heliostat beam quality and pointing accuracy, but the process for determining both is elaborated in the SolarPACES Guideline for Heliostat Performance Testing. This SolarPACES document requires two main modifications: adaptation to IEC language and inclusion of testing after heliostats which have undergone accelerated weathering and mechanical cycling (to understand performance degradation). At the field level, IEC 62862-4-2 addresses the function and control of heliostat fields but does not cover the statistically rigorous testing of heliostat groups, or field performance factors like security and soiling. The addition of documents under IEC-62862-4 is proposed to address this gap.

beam↗

Problems related to the integration of fault tolerant aircraft electronic systems

Problems related to the design of the hardware for an integrated aircraft electronic system are considered. Taxonomies of concurrent systems are reviewed and a new taxonomy is proposed. An informal methodology intended to identify feasible regions of the taxonomic design space is described. Specific tools are recommended for use in the methodology. Based on the methodology, a preliminary strawman integrated fault tolerant aircraft electronic system is proposed. Next, problems related to the programming and control of inegrated aircraft electronic systems are discussed. Issues of system resource management, including the scheduling and allocation of real time periodic tasks in a multiprocessor environment, are treated in detail. The role of software design in integrated fault tolerant aircraft electronic systems is discussed. Conclusions and recommendations for further work are included.

Bannister, J. A.↗

Characteristic variations in reflectance of surface soils

Surface soil samples from a wide range of naturally occurring soils were obtained for the purpose of studying the characteristic variations in soil reflectance as these variations relate to other soil properties and soil classification. A total 485 soil samples from the U.S. and Brazil representing 30 suborders of the 10 orders of 'Soil Taxonomy' was examined. The spectral bidirectional reflectance factor was measured on uniformly moist soils over the 0.52 to 2.32 micron wavelength range with a spectroradiometer adapted for indoor use. Five distinct soil spectral reflectance curve forms were identified according to curve shape, the presence or absence of absorption bands, and the predominance of soil organic matter and iron oxide composition. These curve forms were further characterized according to generically homogeneous soil properties in a manner similar to the subdivisions at the suborder level of 'Soil Taxonomy'. Results indicate that spectroradiometric measurements of soil spectral bidirectional reflectance factor can be used to characterize soil reflectance in terms that are meaningful to soil classification, genesis, and survey.

Stoner, E. R.↗

Equating an expert system to a classifier in order to evaluate the expert system

A strategy to evaluate an expert system is formulated. The strategy proposed is based on finding an equivalent classifier to an expert system and evaluate that classifier with respect to an optimal classifier, a Bayes classifier. Here it is shown that for the rules considered an equivalent classifier exists. Also, a brief consideration of meta and meta-meta rules is included. Also, a taxonomy of expert systems is presented and an assertion made that an equivalent classifier exists for each type of expert system in the taxonomy with associated sets of underlying assumptions.

Odell, Patrick L.↗

Designers as users - Design supports based on crew system design practices

The behavioral processes in aviation crew system design are theoretically discussed. Interviews with designers concerning actual design experiences were conducted in a structured manner, focusing on the nature of the design problem, the designers's tasks, how decisions governing the human operator's role are made, and how this decision making can be supported. Two taxonomies emerge, one of which summarizes the nature of the design problem and the second of which summarizes the tasks that designers perform toward solving the problem. Combining the taxonomies yields a design problem space that is used to classify existing forms of support. The results of this classification and the implications for needed supports are discussed.

Cody, William J.↗

Observer properties for understanding dynamical displays: Capacities, limitations, and defaults

People's ability to extract relevant information while viewing ongoing events is discussed in terms of human capabilities, limitations, and defaults. A taxonomy of event complexity is developed which predicts which dynamical events people can and cannot construe. This taxonomy is related to the distinction drawn in classical mechanics between particle and extended body motions. People's commonsense understandings of simple mechanical systems are impacted little by formal training, but rather reflect heuristical simplifications that focus on a single dimension of perceived dynamical relevance.

Proffitt, Dennis R.↗

Advanced software development workstation project ACCESS user's guide

ACCESS is a knowledge based software information system designed to assist the user in modifying retrieved software to satisfy user specifications. A user's guide is presented for the knowledge engineer who wishes to create for ACCESS a knowledge base consisting of representations of objects in some software system. This knowledge is accessible to an end user who wishes to use the catalogued software objects to create a new application program or an input stream for an existing system. The application specific portion of an ACCESS knowledge base consists of a taxonomy of object classes, as well as instances of these classes. All objects in the knowledge base are stored in an associative memory. ACCESS provides a standard interface for the end user to browse and modify objects. In addition, the interface can be customized by the addition of application specific data entry forms and by specification of display order for the taxonomy and object attributes. These customization options are described.

Source record↗

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗

On-line upgrade of program modules

This paper presents a taxonomy of problems that must be solved in order to achieve on-line upgradability of long-lived programs, and presents a solution to the fundamental problems in the taxonomy. The solutions are based upon AdaPT, a set of language extensions designed to aid in the distribution of a single Ada program. AdaPT introduces three major units, the public, the partition, and the node. Publics are primarily used to share type information. Partitions are the basic units of distribution while nodes are used to control the configuration of the program. Nodes and partitions can be created dynamically via the allocator. A node-level routine controls the replacement process. The controlling node creates a new instance of the routine being replaced; the run-time system must ensure that the new instance is the updated one. Once access to the new version has been established, all further calls to the module are redirected to the new version and the caller is informed of the change so that it may make subsequent calls directly. When a module is being upgraded, there is a transition period during which both the old and new versions are present. We require that clients of a potentially replaceable module 'check in' with the controlling node. The controlling node keeps track of the number of clients that have been redirected to the replacement. When all have been redirected, the old version can be deallocated.

Waldrop, Raymond S.↗

Cognition and procedure representational requirements for predictive human performance models

Models and modeling environments for human performance are becoming significant contributors to early system design and analysis procedures. Issues of levels of automation, physical environment, informational environment, and manning requirements are being addressed by such man/machine analysis systems. The research reported here investigates the close interaction between models of human cognition and models that described procedural performance. We describe a methodology for the decomposition of aircrew procedures that supports interaction with models of cognition on the basis of procedures observed; that serves to identify cockpit/avionics information sources and crew information requirements; and that provides the structure to support methods for function allocation among crew and aiding systems. Our approach is to develop an object-oriented, modular, executable software representation of the aircrew, the aircraft, and the procedures necessary to satisfy flight-phase goals. We then encode in a time-based language, taxonomies of the conceptual, relational, and procedural constraints among the cockpit avionics and control system and the aircrew. We have designed and implemented a goals/procedures hierarchic representation sufficient to describe procedural flow in the cockpit. We then execute the procedural representation in simulation software and calculate the values of the flight instruments, aircraft state variables and crew resources using the constraints available from the relationship taxonomies. The system provides a flexible, extensible, manipulative and executable representation of aircrew and procedures that is generally applicable to crew/procedure task-analysis. The representation supports developed methods of intent inference, and is extensible to include issues of information requirements and functional allocation. We are attempting to link the procedural representation to models of cognitive functions to establish several intent inference methods including procedural backtracking with concurrent search, temporal reasoning, and constraint checking for partial ordering of procedures. Finally, the representation is being linked to models of human decision making processes that include heuristic, propositional and prescriptive judgement models that are sensitive to the procedural content in which the valuative functions are being performed.

Corker, K.↗