Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATRICES”

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 865 records · Page 48

Two-Stream Multi-Channel Convolutional Neural Network for Multi-Lane Traffic Speed Prediction Considering Traffic Volume Impact

Traffic speed prediction is a critically important component of intelligent transportation systems. Recently, with the rapid development of deep learning and transportation data science, a growing body of new traffic speed prediction models have been designed that achieved high accuracy and large-scale prediction. However, existing studies have two major limitations. First, they predict aggregated traffic speed rather than lane-level traffic speed; second, most studies ignore the impact of other traffic flow parameters in speed prediction. To address these issues, the authors propose a two-stream multi-channel convolutional neural network (TM-CNN) model for multi-lane traffic speed prediction considering traffic volume impact. In this model, the authors first introduce a new data conversion method that converts raw traffic speed data and volume data into spatial–temporal multi-channel matrices. Then the authors carefully design a two-stream deep neural network to effectively learn the features and correlations between individual lanes, in the spatial–temporal dimensions, and between speed and volume. Accordingly, a new loss function that considers the volume impact in speed prediction is developed. A case study using 1-year data validates the TM-CNN model and demonstrates its superiority. This paper contributes to two research areas: (1) traffic speed prediction, and (2) multi-lane traffic flow study.

97 MATHEMATICS AND COMPUTING↗

Experimental study of UV induced tensile properties deterioration and chemical aging of polyurea–POSS composites

Ultraviolet (UV) radiation present in natural sunlight degrades the chemical and mechanical properties of polymeric matrices in composites. Polyurea possess a unique set of chemical and mechanical properties due to its complex microstructure comprising of hard and soft segments (phases). The primary objective of the work presented here is to characterize the chemical and mechanical degradation of pure polyurea and polyurea - polyhedral oligomeric silsesquioxane (POSS) nanocomposites subjected to UV radiation exposure for 45 days. Control specimen in as-received condition (reference specimen) and UV-aged tensile test specimen are tested in the study. Analysis of Fourier transformed infrared (FTIR) spectra for UV-aged polyurea and polyurea-POSS composites reveals that the addition of POSS nanoparticles accelerate the deterioration of polyurea matrix by breaking the hard phase network and altering the mechanism of degradation for the soft phase present in polyurea microstructure. The deterioration of hard and soft segments cause a significant reduction in tensile properties of polyurea-POSS composites.

Materials Science↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗

From 2D to 4D: a containerized workflow and browser to explore dynamic chromatin architecture

Background Characterizing the physical organization of the genome is essential for understanding long-range gene regulation, chromatin compartmentalization, and epigenetic accessibility. Hi-C experiments generate two-dimensional (2D) genome-wide contact maps of chromatin interactions by capturing the spatial proximity between genomic loci, which reveal interaction frequencies but lack the spatial resolution needed to interpret the three-dimensional (3D) genome structure(s). Emerging evidence suggests that epigenetic regulation is closely linked to 3D genome architecture, and that structural changes over time (4D) drive key biological processes in development, disease, and environmental response. Thus, integrating 3D structure with functional data is critical for a more complete understanding of genome regulation. Previous work, most notably the 4DHiC chromosome modeling framework, has shown that physical multi-dimensional modeling approaches rooted in polymer physics and molecular dynamics can resolve these structures at biologically meaningful resolutions by integrating temporal Hi-C data with physical constraints to uncover dynamic chromosome reorganization. Thus, molecular dynamics simulations, constrained by Hi-C contact matrices, can resolve fine-scale structural changes and reveal functionally significant transitions in chromatin conformation. Results Herein, we present the 4D Genome Browser Workflow (4DGBWorkflow) and the 4D Genome Browser (4DGB). The algorithm is based on the 4DHiC method, and the containerized tool is an end-to-end workflow that can transform, filter, and view 4D epigenomics and chromatin datasets, allowing non-specialists to apply three-dimensional modeling principles to diverse datasets and experimental conditions. The software executes on a laptop running macOS, Linux or Windows. From input Hi-C files (.hic), the 4DGBWorkflow produces 3D reconstructions of chromosomes, integrates the reconstruction with track data (e.g., epigenetic marks, transcriptome profiles), and provides comparative visualization of the results in a single workflow. Conclusions The 4DGBWorkflow and 4D Genome Browser are open-source tools for comparative analysis and visualization of 4D chromosome datasets, including chromatin architecture and epigenomic signals. Automatic integration of Hi-C data with molecular dynamics democratizes the construction of time resolved 3D genome structures, simplifying complex simulations and data integration schemes.

3D Genome Browser↗

General Bayesian Inference over the Stiefel Manifold via the Givens Transform

We introduce here an approach based on the Givens representation for posterior inference in statistical models with orthogonal matrix parameters, such as factor models and probabilistic principal component analysis (PPCA). We show how the Givens representation can be used to develop practical methods for transforming densities over the Stiefel manifold into densities over subsets of Euclidean space. We demonstrate how to deal with issues arising from the topology of the Stiefel manifold and how to inexpensively compute the change-of-measure terms. We introduce an auxiliary parameter approach that limits the impact of topological issues. We provide both analysis of our methods and numerical examples demonstrating the effectiveness of the approach. We also discuss how our Givens representation can be used to define general classes of distributions over the space of orthogonal matrices. We then give demonstrations on several examples showing how the Givens approach performs in practice in comparison with other methods.

97 MATHEMATICS AND COMPUTING↗

Graph link prediction in computer networks using Poisson matrix factorisation

Graph link prediction is an important task in cybersecurity: relationships between entities within a computer network, such as users interacting with computers or system libraries and the corresponding processes that use them, can provide key insights into adversary behaviour. Poisson matrix factorisation (PMF) is a popular model for link prediction in large networks, particularly useful for its scalability. In this article PMF is extended to include scenarios that are commonly encountered in cybersecurity applications. Specifically, an extension is proposed to explicitly handle binary adjacency matrices and include known categorical covariates associated with the graph nodes. A seasonal PMF model is also presented to handle seasonal networks. To allow the methods to scale to large graphs, variational methods are discussed for performing fast inference. The results show an improved performance over the standard PMF model and other statistical network models.

97 MATHEMATICS AND COMPUTING↗

If We Build Them, They Will Run: Automated HPC Apps Deployment and Profiling with eBPF in Cloud

The high performance computing (HPC) community is in a period of transition. The rise of AI/ML coupled with a changing landscape of resources deems portability a new metric of performance, and methods to move between on-premises and cloud environments and assess compatibility are paramount. Here we design and test a strategy for bridging the gap between traditional HPC and Kubernetes environments – first containerizing applications, providing automated orchestration to run studies, and packaging the setup with automated means to assess performance using low overhead eXtended Berkeley Packet Filter (eBPF) programs. We first assess different designs for eBPF collection, demonstrating a tradeoff between number of programs deployed on a node and overhead added. We develop 5 low overhead eBPF programs that combine with streaming ML models to assess CPU, futex, TCP, shared memory, and file access across four different builds of an HPC application for CPU and GPU. We use eBPF data to generate insights into the possible underlying etiology of scaling issues. We then assess compatibility of a well-known benchmark, HPCG, across matrices of micro-architectures and optimization levels (217 containers across 24 instance types and over 7500 runs). We provide to the community 30 applications to deploy in our automated setup and perform a scaling study from 4 to a maximum of 256 nodes for both CPU and GPU applications. Finally, we use our gained knowledge about performance to generate compatibility artifacts that are used by a newly developed Kubernetes controller to intelligently select instance type based on optimizing a figure of merit. Along with insights to scaling in this environment with a collection of applications and templates to work from, we provide an overall strategy for approaching HPC application deployment and image selection based on compatibility in cloud.

Computer science↗

Dynamic Graph Sequence Data from Simulated Neutron Reflectometry Measurements

This dataset comprises dynamic graph sequences derived from simulated in-situ neutron reflectometry measurements, capturing the gradual evolution of a layer structure over time. Each graph sequence represents a synthetic sample, with node features detailing the scattering vector and corresponding reflectivity measurements, while adjacency matrices have corresponding reference material parameters attached as metadata. The dataset spans multiple sets, each with a different number of sequences, offering a comprehensive basis for training models that handle dynamic input sequences with embedded physics. This dataset is particularly suited for tackling inverse problems with hidden physical states that evolve over time, challenges that are typically difficult to address using conventional iterative fitting methods.

36 MATERIALS SCIENCE↗

Statistical uncertainty of fission matrix eigenvalues using perturbation theory

Eigenvalue search of high dominance ratio systems may be slow to converge. The fission matrix element is defined by its element (FM){sub ij}, which are the probability for a neutron born in cell i to create a fission in cell j for a spatial mesh of n{sub i}*n{sub j} elements. Fission matrices are used in Monte Carlo criticality simulations to enhance computing speed, but also to find higher order eigenvalues. However, few studies have been made on the link between statistical uncertainties of fission matrix elements and eigenvalues uncertainties. Thus, dominance ratio statistical uncertainties remain unknown. This paper uses a new generalized perturbation theory (GPT) method to estimate sensitivities of eigenvalues to fission matrix elements and then to calculate dominance ratio uncertainties.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Status of the WPEC subgroup 46 - Efficient and effective use of integral experiments for nuclear data validation

The present paper summarizes the current status of the activities of the on-going WPEC subgroup 46 which was the last significant initiative of Massimo before he passed away. The goal of WPEC/SG46 is to define, test and document a methodology to provide unambiguous feedback to the nuclear data evaluator community, based on the joint use of integral experiments and data assimilation techniques. Part of this effort resulted in a renewed analysis of the original Target Accuracy Requirement (TAR) exercise of WPEC/SG26, by adding more diverse nuclear systems and parameters, including reaction channels correlations and a coarser energy group structure; and making use of the progress made in the most recent evaluations in terms of both nuclear data and covariance matrices. The preliminary outcomes of the updated TAR exercise, documented by various groups worldwide are clear already: uncertainty reductions are required for many nuclide-reaction pairs in a variety of energy range if the target uncertainty requirements set by the industry are to be met, especially for k{sub eff}. The inclusion of correlations between the various reaction channels had a major impact on the magnitude of the required uncertainty reduction. Those uncertainty reductions are unlikely to be met by differential measurements alone. However, the selection of relevant integral experiment and a subsequent adjustment procedure may help meet these requirements. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Proof-of-concept Talbot–Lau x-ray interferometry with a high-intensity, high-repetition-rate, laser-driven K-alpha source

Talbot–Lau x-ray interferometry is a grating-based phase-contrast technique, which enables measurement of refractive index changes in matter with micrometric spatial resolution. The technique has been established using a variety of hard x-ray sources, including synchrotron, free-electron lasers, and x-ray tubes, and could be used in the optical range for low-density plasmas. The tremendous development of table-top high-power lasers makes the use of high-intensity, laser-driven K-alpha sources appealing for Talbot–Lau interferometer applications in both high-energy-density plasma experiments and biological imaging. To this end, we present the first, to the best of our knowledge, feasibility study of Talbot–Lau phase-contrast imaging using a high-repetition-rate laser of moderate energy (100 mJ at a repetition rate of 10 Hz) to irradiate a copper backlighter foil. The results from up to 900 laser pulses were integrated to form interferometric images. A constant fringe contrast of 20% is demonstrated over 100 accumulations, while the signal-to-noise ratio continued to increase with the number of shots. Phase retrieval is demonstrated without prior ex-situ phase stepping. Instead, correlation matrices are used to compensate for the displacement between reference acquisition and the probing of a PMMA target rod. The steps for improved measurements with more energetic laser systems are discussed. The final results are in good agreement with the theoretically predicted outcomes, demonstrating the applicability of this diagnostic to a range of laser facilities for use across several disciplines.

Bouffetier, V. (ORCID:0000000160791260)↗

Development of advanced machine learning models for analysis of plutonium surrogate optical emission spectra

This work investigates and applies machine learning paradigms seldom seen in analytical spectroscopy for quantification of gallium in cerium matrices via processing of laser-plasma spectra. Ensemble regressions, support vector machine regressions, Gaussian kernel regressions, and artificial neural network techniques are trained and tested on cerium-gallium pellet spectra. A thorough hyperparameter optimization experiment is conducted initially to determine the best design features for each model. The optimized models are evaluated for sensitivity and precision using the limit of detection (LoD) and root mean-squared error of prediction (RMSEP) metrics, respectively. Gaussian kernel regression yields the superlative predictive model with an RMSEP of 0.33% and an LoD of 0.015% for quantification of Ga in a Ce matrix. This study concludes that these machine learning methods could yield robust prediction models for rapid quality control analysis of plutonium alloys.

Rao, Ashwin P. (ORCID:0000000319312568)↗

Implementation of stacked ensemble machine learning for the detection of surrogate plutonium contamination in soil via LIBS

Supervised machine learning methods have demonstrated increased utility for the quantification of lanthanide and actinide elements in atomic spectroscopy applications. This study implements laser-induced breakdown spectroscopy (LIBS) for the identification of plutonium surrogate material (CeO 2 ) in soil matrices by training supervised machine learning methods on the recorded spectral data. A bagged ensemble using Random Forest yields the highest sensitivity predictions with a detection limit of 0.015 wt.% CeO 2 . However, high precision in Ce content prediction required the use of a stacked ensemble regression, which provided the superlative Ce quantification model with an error of 0.107% and a detection limit of 0.022 wt.%. Furthermore, the high performance of the stacked ensemble demonstrates its potential to enhance the accuracy and sensitivity of nuclear contaminant detection using field-deployable spectroscopic analyzers in real-world scenarios.

47 OTHER INSTRUMENTATION↗

Machine-learning-aided cognitive reconfiguration for flexible-bandwidth HPC and data center networks [Invited]

This paper proposes a machine-learning (ML)-aided cognitive approach for effective bandwidth reconfiguration in optically interconnected datacenter/high-performance computing (HPC) systems. The proposed approach relies on a Hyper-X-like architecture augmented with flexible-bandwidth photonic interconnections at large scales using a hierarchical intra/inter-POD photonic switching layout. We first formulate the problem of the connectivity graph and routing scheme optimization as a mixed-integer linear programming model. A two-phase heuristic algorithm and a joint optimization approach are devised to solve the problem with low time complexity. Then, we propose an ML-based end-to-end performance estimator design to assist the network control plane with intelligent decision making for bandwidth reconfiguration. Numerical simulations using traffic distribution profiles extracted from HPC applications traces as well as random traffic matrices verify the accuracy performance of the ML design estimator ( < <#comment/> 9 % <#comment/> error) and demonstrate up to 5 × <#comment/> throughput gain from the proposed approach compared with the baseline Hyper-X network using fixed all-to-all intra/inter-portable data center interconnects.

Chen, Xiaoliang (ORCID:0000000278056237)↗

High-rate multiplexed entanglement source based on time-bin qubits for advanced quantum networks

Entanglement distribution based on time-bin qubits is an attractive option for emerging quantum networks. We demonstrate a 4.09-GHz repetition rate source of photon pairs entangled across early and late time bins separated by 80 ps. Simultaneous high rates and high visibilities are achieved through frequency multiplexing the spontaneous parametric down conversion output into eight time-bin entangled channel pairs. We demonstrate entanglement visibilities as high as 99.4%, total entanglement rates up to 3.55×10 6 coincidences/s, and predict a straightforward path towards achieving up to an order of magnitude improvement in rates without compromising visibility. Finally, we resolve the density matrices of the entangled states for each multiplexed channel and express distillable entanglement rates in ebit/s, thereby quantifying the trade-off between visibility and coincidence rates that contributes to useful entanglement distribution. This source is a fundamental building block for high-rate entanglement-based quantum key distribution systems or advanced quantum networks.

Mueller, Andrew (ORCID:0000000265989732)↗

Single-nuclei transcriptome analysis of channel catfish spleen provides insight into the immunome of an aquaculture-relevant species

The catfish industry is the largest sector of U.S. aquaculture production. Given its role in food production, the catfish immune response to industry-relevant pathogens has been extensively studied and has provided crucial information on innate and adaptive immune function during disease progression. To further examine the channel catfish immune system, we performed single-cell RNA sequencing on nuclei isolated from whole spleens, a major lymphoid organ in teleost fish. Libraries were prepared using the 10X Genomics Chromium X with the Next GEM Single Cell 3’ reagents and sequenced on an Illumina sequencer. Each demultiplexed sample was aligned to the Coco_2.0 channel catfish reference assembly, filtered, and counted to generate feature-barcode matrices. From whole spleen samples, outputs were analyzed both individually and as an integrated dataset. The three splenic transcriptome libraries generated an average of 278,717,872 reads from a mean 8,157 cells. The integrated data included 19,613 cells, counts for 20,121 genes, with a median 665 genes/cell. Cluster analysis of all cells identified 17 clusters which were classified as erythroid, hematopoietic stem cells, B cells, T cells, myeloid cells, and endothelial cells. Subcluster analysis was carried out on the immune cell populations. Here, distinct subclusters such as immature B cells, mature B cells, plasma cells, γδ T cells, dendritic cells, and macrophages were further identified. Differential gene expression analyses allowed for the identification of the most highly expressed genes for each cluster and subcluster. This dataset is a rich cellular gene expression resource for investigation of the channel catfish and teleost splenic immunome.

Science & Technology - Other Topics↗