Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational pipelines”

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 649 records · Page 36

High speed hardware development for FDMA/TDM system

The development of a transmultiplexor and a quadrature phase shift keying (QPSK) demodulator is discussed. The system is designed to meet real time signal processing requirements of future satellite systems and should consume very little power. The architectures of the transmultiplexor and the demodulator are designed for the pipelining of all the modules, namely the commutator, the filter bank fast fourier transform (FFT), and the internal modules of the QPSK. The architecture is designed for the case of 800 channels. Each channel is to have a bandwidth of 45 KHz and a bit rate of 64 Kb/s. In this case each module will have 22.22 micro seconds to complete a computation.

Kwatra, S. C.↗

MLtool: Universal Supervised Machine Learning Tool to Model Tabulated Data

Machine Learning (ML) is a subfield of Artificial Intelligence that gives computers the ability to learn from past data without being explicitly programmed. The predictive capabilities of ML models have already been used to facilitate several scientific breakthroughs. However, the practical application of ML is often limited due to the gaps in technical knowledge of its users. The common issue faced by many scientific researchers is the inability to choose the appropriate ML pipelines that are needed to treat real-world data, which is often sparse and noisy. To solve this problem, we have developed an automated Machine Learning tool (MLtool) that includes a set of ML algorithms and approaches to aid scientific researchers. The current version of MLtool is implemented as an object-oriented Python code that is easily extensible. It includes 44 different regression algorithms used to model data. MLtool helps users select the best model for their data, based on the scoring metrics used. Besides regression algorithms, MLtool also includes a suite of pre- and post-processing techniques such as missing value imputation, categorical variable encoding, input feature normalization, uncertainty quantification, exploratory data analysis (EDA), etc. MLtool was tested on several publicly available multi-dimensional data sets and was found capable of making accurate predictions.

Machine learning↗

MLtool Python Code

Machine Learning (ML) is a subfield of Artificial Intelligence that gives computers the ability to learn from past data without being explicitly programmed. The predictive capabilities of ML models have already been used to facilitate several scientific breakthroughs. However, the practical application of ML is often limited due to the gaps in technical knowledge of its users. The common issue faced by many scientific researchers is the inability to choose the appropriate ML pipelines that are needed to treat real-world data, which is often sparse and noisy. To solve this problem, we have developed an automated Machine Learning tool (MLtool) that includes a set of ML algorithms and approaches to aid scientific researchers. The current version of MLtool is implemented as an object-oriented Python code that is easily extensible. It includes 44 different regression algorithms used to model data. MLtool helps users select the best model for their data, based on the scoring metrics used. Besides regression algorithms, MLtool also includes a suite of pre- and post-processing techniques such as missing value imputation, categorical variable encoding, input feature normalization, uncertainty quantification, exploratory data analysis (EDA), etc. MLtool was tested on several publicly available multi-dimensional data sets and was found capable of making accurate predictions.

Machine Learning↗

Multiscale System Modeling of Single-Event-Induced Faults in Advanced Node Processors

Integration-technology feature shrink increases computing-system susceptibility to single-event effects (SEE). While modeling SEE faults will be critical, an integrated processor’s scope makes physically correct modeling computationally intractable. Without useful models, presilicon evaluation of fault-tolerance approaches becomes impossible. To incorporate accurate transistor-level effects at a system scope, we present a multiscale simulation framework. Charge collection at the 1) device level determines 2) circuit-level transient duration and state-upset likelihood. Circuit effects, in turn, impact 3) register-transfer-level architecture-state corruption visible at 4) the system level. Furthermore, the physically accurate effects of SEEs in large-scale systems, executed on a high-performance computing (HPC) simulator, could be used to drive cross-layer radiation hardening by design. We demonstrate the capabilities of this model with two case studies. First, we determine a D flip-flop’s sensitivity at the transistor level on 14-nm FinFet technology, validating the model against published cross sections. Second, we track and estimate faults in a microprocessor without interlocked pipelined stages (MIPS) processor for Adams 90% worst case environment in an isotropic space environment.

42 ENGINEERING↗

Earth System Model Improvement Pipeline via Uncertainty Attribution and Active Learning

Primary focal area: 2 (Predictive Modeling via AI): We develop methods to formally quantify uncertainties in Earth System models for the land-atmosphere coupled system. Science Challenge: Earth system models still have significant biases in historical predictions of the intensity and frequency of water cycling extremes (e.g., droughts and flood events), leading to low confidence in future projections. Uncertainties arise from incomplete understanding of land and atmospheric processes, and insufficient observational constraints on model parameters. Many observations, including those from key DOE investments such as ARM and AmeriFlux, are used to evaluate model performance but have not been used to formally quantify model uncertainty because of the expense of running ESM simulations. An efficient pipeline engaging cutting-edge machine learning (ML) and uncertainty quantification (UQ) methods is needed to improve the predictive understanding of water cycle extremes in the Earth system.

54 ENVIRONMENTAL SCIENCES↗

Machine Learning for Correlated Intelligence. LDRD SAND Report

The Machine Learning for Correlated Intelligence Laboratory Directed Research & Development (LDRD) Project explored competing a variety of machine learning (ML) classification techniques against a known, open source dataset through the use of a rapid and automated algorithm research & development (RD) infrastructure. This approach relied heavily on creating an infrastructure in which to provide a pipeline for automatic target recognition (ATR) ML algorithm competition. Results are presented for nine ML classifiers against a primary dataset using the pipeline infrastructure developed for this project. New approaches to feature set extraction are presented and discussed as well.

97 MATHEMATICS AND COMPUTING↗

A hardware implementation of a relaxation algorithm to segment images

Relaxation labelling is a mathematical technique frequently applied in image processing algorithms. In particular, it is extensively used for the purpose of segmenting images. The paper presents a hardware implementation of a segmentation algorithm, for images consisting of two regions, based on relaxation labelling. The algorithm determines, for each pixel, the probability that it should be labelled as belonging to a particular region, for all regions in the image. The label probabilities (labellings) of every pixel are iteratively updated, based on those of the pixel's neighbors, until they converge. The pixel is then assigned to the region correspondent to the maximum label probability. The system consists of a control unit and of a pipeline of segmentation stages. Each segmentation stage emulates in the hardware an iteration of the relaxation algorithm. The design of the segmentation stage is based on commercially available digital signal processing integrated circuits. Multiple iterations are accomplished by stringing stages together or by looping the output of a stage, or string of stages, to its input. The system interfaces with a generic host computer. Given the modularity of the architecture, performance can be enhanced by merely adding segmentation stages.

Loda, Antonio G.↗

VLSI architectures for geometrical mapping problems in high-definition image processing

This paper explores a VLSI architecture for geometrical mapping address computation. The geometric transformation is discussed in the context of plane projective geometry, which invokes a set of basic transformations to be implemented for the general image processing. The homogeneous and 2-dimensional cartesian coordinates are employed to represent the transformations, each of which is implemented via an augmented CORDIC as a processing element. A specific scheme for a processor, which utilizes full-pipelining at the macro-level and parallel constant-factor-redundant arithmetic and full-pipelining at the micro-level, is assessed to produce a single VLSI chip for HDTV applications using state-of-art MOS technology.

Kim, K.↗

Developing a Genetic Variant Calling Pipeline for Quantifying the Complex Mutagenic Load Accumulated in BioNutrients-1 Production Pack Samples

Microorganisms hold great promise for on demand production of labile nutrients and pharmaceuticals as well recycling and in situ resource utilization. The utilization of microorganisms for such tasks on space missions is hindered by the limited data on how microbes respond to spaceflight. For example, the genetic stability of microorganisms, and the genomic engineered traits added to deliver desired functions, over long-term storage in the spacecraft environment is poorly understood. The BioNutrients-1 (BN-1) mission conducted a 5-year study of desiccated storage in Low Earth Orbit (LEO) to evaluate the suitability of eight synthetic biology chassis organisms for long-duration space missions. We are employing high-depth, whole genome sequencing (WGS) to determine the mutagenic load that accumulated during long-term storage. Mutation analysis pipelines are well established for homogenous culture grown from a single colony, but the mutational landscape of the BN-1 samples present a unique analysis challenge, as every cell in the BN-1 samples had a unique genetic journey of DNA damage and repair. Consequently, sequence variants are expected at low allele frequency within samples. To address this genetic complexity, we apply two distinct computational approaches to identify mutations in pre-existing WGS data collected from populations of Chlamydomonas reinhardtii that were exposed to UV mutagenesis and growth in LEO. For reference genome free mutation detection, we utilized DiscoSNP++, which is a de Bruijn graph approach. For reference genome-based mutation detection we utilize GATK for Microbes, which is a Bayesian probabilistic approach. We will benchmark these approaches against the mutations originally identified using CRISP, a method optimized for pooled samples. Ultimately, quantifying the mutation load imposed by storage or growth on the ISS will help identify chassis organisms with both high levels of genome stability and viability, which are desirable traits for implementation of bioproduction in long-duration missions.

SNP↗

Sensitive parameter identification and uncertainty quantification for the stability of pipeline conveying fluid

In this study, several uncertainty quantification and sensitivity analysis methods are used to determine the most sensitive geometric and material input parameters of a cantilevered pipeline conveying fluid when uncertainty is introduced to the system at the onset of instability. The full nonlinear equations of motion are modeled using the extended Hamilton’s principle and then discretized using Galerkin’s method. A parametric study is first performed, and the Morris elementary effects are calculated to obtain a preliminary understanding of how the onset speed changes when each parameter is introduced to a ± 5% uncertainty. Then, four different input uncertainty distributions, mainly, uniform and Gaussian distribution, are chosen to investigate how input distributions affect uncertainty in the output. A convergence analysis is used to determine the number of samples needed to maintain simulation accuracy while saving the most computational time. Then, Monte Carlo simulations are run, and the output distributions for each input distribution at ± 1%, ± 3% and ± 5% input uncertainty range are found and discussed. Additionally, the Pearson correlation coefficients are evaluated for different uncertainty ranges. A final Monte Carlo study is performed in which single parameters are held constant while all others still have uncertainty. Overall, the flow speed at the onset of instability is the most sensitive to changes in the outer diameter of the pipe.

36 MATERIALS SCIENCE↗

Toward High-Voltage Cathodes for Zinc-Ion Batteries: Discovery Pipeline and Material Design Rules

Efficient energy storage systems are crucial to address the intermittency of renewable energy sources. As multivalent batteries, Zn-ion batteries (ZIBs), while inherently low voltage, offer a promising low-cost alternative to Li-ion batteries due to the viable use of zinc as the anode. However, to maximize the potential impact of ZIBs, rechargeable cathodes with improved Zn diffusion are needed. To better understand the chemical and structural factors influencing Zn-ion mobility within battery electrode materials, we employ a high-throughput computational screening approach to systematically evaluate candidate intercalation hosts for ZIB cathodes, expanding the chemical search space on empty intercalation hosts that do not contain Zn. We leverage a high-throughput screening funnel to identify promising cathodes in ZIBs, integrating screening criteria with density functional theory (DFT)-based calculations of Zn2+ intercalation and diffusion inside the host materials. Using these data, we identify the design principles that favor Zn-ion mobility in candidate cathode materials. Building on previous work on divalent-ion cathodes, this study broadens the chemical space for next-generation multivalent energy storage systems.

electrodes↗

Evolving Multi-hazard Machine Learning Modeling for Advanced Risk-Informed Infrastructure Resilience Assessment

The socioeconomic impacts of pipeline incidents have escalated over the past three decades, revealing the limitation of traditional risk modeling methods when applied to extensive pipeline networks. This research aims to develop machine learning (ML) models that effectively identify, rank, and predict the diverse hazards and socioeconomic consequences associated with pipeline incidents. Utilizing historical data on pipeline incidents alongside weather and oceanographic data from the 1980s onward, the Houston metropolitan area serves as a testbed for the proposed methodologies. The research segments the combined datasets into three consecutive periods, demonstrating the efficacy of the updated model in predicting future events, particularly concerning precipitation rate data. Despite the challenges posed by a relatively limited dataset, local-level ML modeling offers valuable insights into the spatial and temporal dynamics of multiple hazards that contribute to pipeline incidents. These findings hold significant implications for future research, particularly in understanding and mitigating risks in various locations across the Gulf Coast and other coastal regions.

42 ENGINEERING↗

Vulcan-Forge: Architecture and Design of a Multi-Modal Forensic Analysis Plugin for CALDERA

Forge and VULCAN together describe an open-architecture cybersecurity analysis ecosystem that unifies forensic artifact processing, detection engineering, and vulnerability intelligence within integrated platforms. Forge operates as a plugin for MITRE CALDERA, ingesting diverse evidence formats—including EVTX, PCAP/PCAPNG, CSV, JSON, YAML, XML, binaries, and archives—to construct a unified artifact graph enriched with severity scoring, TLP classification, and audit trails. It provides subsystems for artifact parsing, streaming structured-data visualization, NetworkMiner-based packet inspection, PE/.NET binary analysis, and LLM-assisted triage and rule generation, with outputs validated against CCCS-YARA and pySigma schemas. VULCAN complements this by serving as a cybersecurity analyst platform that integrates a Neo4j knowledge graph, Qdrant vector retrieval, SSVC-based triage, and a local LLM to deliver CVE intelligence and forensic analysis through a multi-source ingest pipeline drawing from NVD, CISA KEV, EPSS, MITRE ATT&CK, and CAPEC. Together, they bridge structured threat intelligence with automated forensic analysis and detection workflows.

97 MATHEMATICS AND COMPUTING↗

In-depth analysis on parallel processing patterns for high-performance Dataframes

The Data Science domain has expanded monumentally in both research and industry communities during the past decade, predominantly owing to the Big Data revolution. Artificial Intelligence (AI) and Machine Learning (ML) are bringing more complexities to data engineering applications, which are now integrated into data processing pipelines to process terabytes of data. Typically, a significant amount of time is spent on data preprocessing in these pipelines, and hence improving its efficiency directly impacts the overall pipeline performance. The community has recently embraced the concept of Dataframes as the de-facto data structure for data representation and manipulation. However, the most widely used serial Dataframes today (R, pandas) experience performance limitations while working on even moderately large data sets. We believe that there is plenty of room for improvement by taking a look at this problem from a high-performance computing point of view. In a prior publication, we presented a set of parallel processing patterns for distributed dataframe operators and the reference runtime implementation, Cylon. In this paper, we are expanding on the initial concept by introducing a cost model for evaluating the said patterns. Furthermore, we evaluate the performance of Cylon on the ORNL Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗

Trisodium Phosphate Phases and Solubility in Alkaline Solutions Relevant to Radioactive Waste Processing

The U.S. Department of Energy’s Hanford Site faces significant challenges in managing millions of gallons of legacy radioactive waste, where phosphate precipitation can obstruct pipelines during retrieval and processing. To resolve long-standing inconsistencies in reported solubility and clarify factors governing trisodium phosphate hydrates, we examined the Na3PO4:NaOH:H2O system. Powder and single-crystal X-ray diffraction revealed that commercial precursors undergo transformations that produce multiple hydrates, including three previously unreported phases comprising an ordered polymorph of Na3(PO4)·12H2O·1/6NaOH, Na3PO4·5H2O, and Na3PO4·9H2O. Computational modeling indicated that the ordered dodecahydrate is more stable than its disordered counterpart, suggesting kinetic persistence of structural disorder. Solubility measurements were conducted with solutions prepared either from anhydrous Na3PO4 or from Na3(PO4)·12H2O·1/6NaOH and revealed that release of interstitial NaOH from the hydrate precursor elevated solution alkalinity, thereby significantly reducing phosphate solubility relative to solutions prepared with anhydrous Na3PO4 across 20–44 °C. These results begin to reconcile inconsistencies in prior solubility data and clarify how phase composition dictates phosphate precipitation under alkaline conditions.

Graham, Trenton R. (ORCID:0000000189078004)↗

BEYONDPLANCK II. CMB mapmaking through Gibbs sampling

We present a Gibbs sampling solution to the mapmaking problem for cosmic microwave background (CMB) measurements that builds on existing destriping methodology. Gibbs sampling breaks the computationally heavy destriping problem into two separate steps: noise filtering and map binning. Considered as two separate steps, both are computationally much cheaper than solving the combined problem. This provides a huge performance benefit as compared to traditional methods and it allows us, for the first time, to bring the destriping baseline length to a single sample. Here, we applied the Gibbs procedure to simulated Planck 30 GHz data. We find that gaps in the time-ordered data are handled efficiently by filling them in with simulated noise as part of the Gibbs process. The Gibbs procedure yields a chain of map samples, from which we are able to compute the posterior mean as a best-estimate map. The variation in the chain provides information on the correlated residual noise, without the need to construct a full noise covariance matrix. However, if only a single maximum-likelihood frequency map estimate is required, we find that traditional conjugate gradient solvers converge much faster than a Gibbs sampler in terms of the total number of iterations. The conceptual advantages of the Gibbs sampling approach lies in statistically well-defined error propagation and systematic error correction. This methodology thus forms the conceptual basis for the mapmaking algorithm employed in the BEYONDPLANCK framework, which implements the first end-to-end Bayesian analysis pipeline for CMB observations.

79 ASTRONOMY AND ASTROPHYSICS↗

Closing the loop between microstructure and charge transport in conjugated polymers by combining microscopy and simulation

A grand challenge in materials science is to identify the impact of molecular composition and structure across a range of length scales on macroscopic properties. We demonstrate a unified experimental–theoretical framework that coordinates experimental measurements of mesoscale structure with molecular-level physical modeling to bridge multiple scales of physical behavior. Here we apply this framework to understand charge transport in a semiconducting polymer. Spatially-resolved nanodiffraction in a transmission electron microscope is combined with a self-consistent framework of the polymer chain statistics to yield a detailed picture of the polymer microstructure ranging from the molecular to device relevant scale. Using these data as inputs for charge transport calculations, the combined multiscale approach highlights the underrepresented role of defects in existing transport models. Short-range transport is shown to be more chaotic than is often pictured, with the drift velocity accounting for a small portion of overall charge motion. Local transport is sensitive to the alignment and geometry of polymer chains. At longer length scales, large domains and gradual grain boundaries funnel charges preferentially to certain regions, creating inhomogeneous charge distributions. While alignment generally improves mobility, these funneling effects negatively impact mobility. The microstructure is modified in silico to explore possible design rules, showing chain stiffness and alignment to be beneficial while local homogeneity has no positive effect. This combined approach creates a flexible and extensible pipeline for analyzing multiscale functional properties and a general strategy for extending the accesible length scales of experimental and theoretical probes by harnessing their combined strengths.

42 ENGINEERING↗

Reducing Communication in Graph Neural Network Training

Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks. Here, we introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1. 5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.

97 MATHEMATICS AND COMPUTING↗