Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “data representations”

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 541 records · Page 30

TangibleData: Interactive Data Visualization with Mid-Air Haptics

In this paper, we investigate the effects of mid-air haptics in interactive 3D data visualization. We build an interactive 3D data visualization tool that adapts hand gestures and mid-air haptics to provide tangible interaction in VR using ultrasound haptic feedback on 3D data visualization. We consider two types of 3D visualization datasets and provide different data encoding methods for haptic representations. Two user experiments are conducted to evaluate the effectiveness of our approach. The first experimental results show that adding a mid-air haptic modality can be beneficial regardless of noise conditions and useful for handling occlusion or discerning density and volume information. The second experiment results further show the strengths and weaknesses of direct touch and indirect touch modes. Our findings can shed light on designing and implementing a tangible interaction on 3D data visualization with mid-air haptic feedback.

Bhardwaj, Ayush↗

Indirect and semi-direct aerosol campaign: The impact of Arctic aerosols on clouds

A comprehensive dataset of microphysical and radiative properties of aerosols and clouds in the boundary layer in the vicinity of Barrow, Alaska, was collected in April 2008 during the Indirect and Semi-Direct Aerosol Campaign (ISDAC). ISDAC's primary aim was to examine the effects of aerosols, including those generated by Asian wildfires, on clouds that contain both liquid and ice. ISDAC utilized the Atmospheric Radiation Measurement Pro- gram's permanent observational facilities at Barrow and specially deployed instruments measuring aerosol, ice fog, precipitation, and radiation. The National Research Council of Canada Convair-580 flew 27 sorties and collected data using an unprecedented 41 stateof- the-art cloud and aerosol instruments for more than 100 h on 12 different days. Aerosol compositions, including fresh and processed sea salt, biomassburning particles, organics, and sulfates mixed with organics, varied between flights. Observations in a dense arctic haze on 19 April and above, within, and below the single-layer stratocumulus on 8 and 26 April are enabling a process-oriented understanding of how aerosols affect arctic clouds. Inhomogeneities in reflectivity, a close coupling of upward and downward Doppler motion, and a nearly constant ice profile in the single-layer stratocumulus suggests that vertical mixing is responsible for its longevity observed during ISDAC. Data acquired in cirrus on flights between Barrow and Fairbanks, Alaska, are improving the understanding of the performance of cloud probes in ice. Furthermore, ISDAC data will improve the representation of cloud and aerosol processes in models covering a variety of spatial and temporal scales, and determine the extent to which surface measurements can provide retrievals of aerosols, clouds, precipitation, and radiative heating.

54 ENVIRONMENTAL SCIENCES↗

A methodology for optimal MSW management, with an application in the waste transportation of Attica Region, Greece

Highlights: • A two-step (strategic and detailed optimal planning) methodology is used for solving complex MSW management problems. • A software package is outlined, which can be used for generating detailed optimal plans. • Sensitivity analysis compares alternative scenarios that address objections and/or wishes of local communities. • A case study shows the application of the above procedure in practice and demonstrates the results and benefits obtained. - Abstract: The paper describes a software system capable of formulating alternative optimal Municipal Solid Wastes (MSWs) management plans, each of which meets a set of constraints that may reflect selected objections and/or wishes of local communities. The objective function to be minimized in each plan is the sum of the annualized capital investment and annual operating cost of all transportation, treatment and final disposal operations involved, taking into consideration the possible income from the sale of products and any other financial incentives or disincentives that may exist. For each plan formulated, the system generates several reports that define the plan, analyze its cost elements and yield an indicative profile of selected types of installations, as well as data files that facilitate the geographic representation of the optimal solution in maps through the use of GIS. A number of these reports compare the technical and economic data from all scenarios considered at the study area, municipality and installation level constituting in effect sensitivity analysis. The generation of alternative plans offers local authorities the opportunity of choice and the results of the sensitivity analysis allow them to choose wisely and with consensus. The paper presents also an application of this software system in the capital Region of Attica in Greece, for the purpose of developing an optimal waste transportation system in line with its approved waste management plan. The formulated plan was able to: (a) serve 113 Municipalities and Communities that generate nearly 2 million t/y of comingled MSW with distinctly different waste collection patterns, (b) take into consideration several existing waste transfer stations (WTS) and optimize their use within the overall plan, (c) select the most appropriate sites among the potentially suitable (new and in use) ones, (d) generate the optimal profile of each WTS proposed, and (e) perform sensitivity analysis so as to define the impact of selected sets of constraints (limitations in the availability of sites and in the capacity of their installations) on the design and cost of the ensuing optimal waste transfer system. The results show that optimal planning offers significant economic savings to municipalities, while reducing at the same time the present levels of traffic, fuel consumptions and air emissions in the congested Athens basin.

42 ENGINEERING↗

Closed Loop Pumped Storage Hydropower Resource Assessment of the United States

The data includes a geospatial and spreadsheet representation of a resource analysis for closed loop pumped storage systems across the Continental United States, Alaska, Hawaii, and Puerto Rico. The data includes energy storage potential, water volume, distance from source to storage, hydraulic head, dollars per kilowatt of storage, and transmission spurline cost for each pumped storage hydropower (PHS) reservoir. Each reservoir represented in this dataset is represented on potential 10 hour storage duration PSH system comprised of two reservoirs. Units of measure are laid out in the dataset. Pumped storage hydropower (PSH) represents the bulk of the United States' current energy storage capacity: 23 gigawatts (GW) of the 24 GW national total (Denholm et al. 2021). This capacity was largely built between 1960 and 1990. PSH is a mature and proven method of energy storage with competitive round-trip efficiency and long life spans. These qualities make PSH a very attractive potential solution to energy storage needs, particularly for longer-duration storage (8 hours or more); such storage will be crucial to bridge gaps in electricity production as variable wind and solar production continue to comprise an ever-larger portion of the United States' energy portfolio. This study seeks to better understand the technical potential for PSH development in the United States by developing a national-scale resource assessment for closed-loop PSH. For more information, please refer to the Closed Loop Pumped Storage Hydropower Resource Assessment for the United States linked in the resources.

Array↗

A framework for graph-based synthesis, analysis, and visualization of HPC cluster job data.

The monitoring and system analysis of high performance computing (HPC) clusters is of increasing importance to the HPC community. Analysis of HPC job data can be used to characterize system usage and diagnose and examine failure modes and their effects. This analysis is not straightforward, however, due to the complex relationships that exist between jobs. These relationships are based on a number of factors, including shared compute nodes between jobs, proximity of jobs in time, etc. Graph-based techniques represent an approach that is particularly well suited to this problem, and provide an effective technique for discovering important relationships in job queuing and execution data. The efficacy of these techniques is rooted in the use of a semantic graph as a knowledge representation tool. In a semantic graph job data, represented in a combination of numerical and textual forms, can be flexibly processed into edges, with corresponding weights, expressing relationships between jobs, nodes, users, and other relevant entities. This graph-based representation permits formal manipulation by a number of analysis algorithms. This report presents a methodology and software implementation that leverages semantic graph-based techniques for the system-level monitoring and analysis of HPC clusters based on job queuing and execution data. Ontology development and graph synthesis is discussed with respect to the domain of HPC job data. The framework developed automates the synthesis of graphs from a database of job information. It also provides a front end, enabling visualization of the synthesized graphs. Additionally, an analysis engine is incorporated that provides performance analysis, graph-based clustering, and failure prediction capabilities for HPC systems.

97 MATHEMATICS AND COMPUTING↗

Multiscale geometric modeling of macromolecules I: Cartesian representation

This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace–Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the polarized curvature, for the prediction of protein binding sites.

97 MATHEMATICS AND COMPUTING↗

PROGRESS ON 140,142CE NEUTRON CROSS SECTION RESOLVED RESONANCE REGION EVALUATIONS

Oak Ridge National Laboratory is working on completing the resonance parameter evaluation of 140,142Ce in the neutron energy range up to 200 keV. Performed with the support of the US Nuclear Criticality Safety Program, this evaluation aims to generate high-fidelity cerium cross-section and covariance data. A point-wise representation of the cross sections derived from the resonance parameters will provide improved calculations of self-shielding factors for nuclear criticality safety applications and additional evaluation support for continuous-energy radiation transport methodologies. The evaluation procedure uses the Reich Moore approximation of the R-matrix theory implemented in the SAMMY code system to fit resonance parameters to high-resolution transmission and neutron capture measurements of natCe performed in 2016 by the JRC-GEEL instrument scientists at the Geel Linear Accelerator facility as well as other experimental data sets on both natural and highly-enriched cerium samples available in the experimental library EXFOR. In the analyzed energy range this work aims to improve and extend the resolved resonance region present in the latest US nuclear data library ENDF/B-VIII.0 for 140,142Ce isotopes. This paper will present the preliminary results of the R-matrix analysis based on recently measured natCe transmission data.

Chapman, Chris↗

Efficient graph representation framework for chemical molecule similarity tasks

Graph data has emerged in numerous scientific domains and machine learning techniques have been widely used for analysis and learning of diverse data for prediction and decision. Machine learning techniques can readily address complex problems by leveraging their structural information. But graphs cannot be directly used for existing machine learning algorithms unless encoded as vectors. The problem of efficient representation of graphs is a substantial challenge in graph machine learning. In this paper, we propose a novel two-stage framework for the representation of chemical molecule graphs based on the strengths of Graph Isomorphism Networks (GINs) and Siamese autoencoders. In the first stage, the GIN model is constructed and trained using the structural information of chemical molecule graphs. Node attributes, edge attributes, and edge indices are used as input data, while graph attributes are used as labels. The GIN model effectively captures the structural characteristics of graphs and can accurately predict graph attributes, i.e., molecular properties. It also generates Graph Embeddings, represented as vectors that encode the structural information of graphs. In the second stage, Graph Embedding vectors are further optimized for downstream similarity tasks while preserving the graph structural information. The Siamese autoencoder is constructed and trained, which reduces the dimensionality of the Graph Embedding vectors, while maximizing the preservation of structural information in the original high-dimensional vectors. The resulting low-dimensional Graph Embeddings can be effectively utilized for tasks such as approximate nearest neighbor search. The experimental results demonstrate the effectiveness of our proposed framework in accurately predicting graph similarity.

Ma, Jiaji↗

Physics-guided dual implicit neural representations for source separation

Significant challenges exist in efficient data analysis of most advanced experimental and observational techniques because the collected signals often include unwanted contributions, such as background and signal distortions, that can obscure the physically relevant information of interest. To address this, we have developed a self-supervised machine-learning approach for source separation using a dual implicit neural representation framework that jointly trains two neural networks: one for approximating distortions of the physical signal of interest and the other for learning the effective background contribution. Our method learns directly from the raw data by minimizing a reconstruction-based loss function without requiring labeled data or pre-defined dictionaries. We demonstrate the effectiveness of our framework by considering a challenging case study involving large-scale simulated, as well as experimental, momentum-energy-dependent inelastic neutron scattering data in a four-dimensional parameter space, characterized by heterogeneous background contributions and unknown distortions to the target signal. The method is found to successfully separate physically meaningful signals from a complex or structured background even when the signal characteristics vary across all four dimensions of the parameter space. An analytical approach that informs the choice of the regularization parameter is presented. Our method offers a versatile framework for addressing source separation problems across diverse domains, ranging from superimposed signals in astronomical measurements to structural features in biomedical image reconstructions.

47 OTHER INSTRUMENTATION↗

Data Centers Gap Analysis [Slides]

Data centers and other large loads are a significant driver of unprecedented, near-term demand growth in the United States. Power system planners, utilities, regulators, and other stakeholders are grappling with how to integrate data centers on the system without comprising reliability, resiliency, and energy affordability. NLR is pursuing work to develop a siting and decision-making tool that would draw on power systems modeling expertise to achieve granular representation of trade-offs involved in data center sitting and development. This slide deck supports the same workstream by reviewing the literature to identify mitigation options to facilitate near-term integration of large loads and by presenting options for pursuing data development and/or modeling projects to improve representation of siting options.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Evaluating State Space Discovery by Persistent Cohomology in the Spatial Representation System

Persistent cohomology is a powerful technique for discovering topological structure in data. Strategies for its use in neuroscience are still undergoing development. We comprehensively and rigorously assess its performance in simulated neural recordings of the brain's spatial representation system. Grid, head direction, and conjunctive cell populations each span low-dimensional topological structures embedded in high-dimensional neural activity space. We evaluate the ability for persistent cohomology to discover these structures for different dataset dimensions, variations in spatial tuning, and forms of noise. We quantify its ability to decode simulated animal trajectories contained within these topological structures. We also identify regimes under which mixtures of populations form product topologies that can be detected. Our results reveal how dataset parameters affect the success of topological discovery and suggest principles for applying persistent cohomology, as well as persistent homology, to experimental neural recordings.

59 BASIC BIOLOGICAL SCIENCES↗

Inference of Causal Networks from Time-Varying Transcriptome Data via Sparse Coding

Temporal analysis of genome-wide data can provide insights into the underlying mechanism of the biological processes in two ways. First, grouping the temporal data provides a richer, more robust representation of the underlying processes that are co-regulated. The net result is a significant dimensional reduction of the genome-wide array data into a smaller set of vocabularies for bioinformatics analysis. Second, the computed set of time-course vocabularies can be interrogated for a potential causal network that can shed light on the underlying interactions. The method is coupled with an experiment for investigating responses to high doses of ionizing radiation with and without a small priming dose. From a computational perspective, inference of a causal network can rapidly become computationally intractable with the increasing number of variables. Additionally, from a bioinformatics perspective, larger networks always hinder interpretation. Therefore, our method focuses on inferring the simplest network that is computationally tractable and interpretable. The method first reduces the number of temporal variables through consensus clustering to reveal a small set of temporal templates. It then enforces simplicity in the network configuration through the sparsity constraint, which is further regularized by requiring continuity between consecutive time points. We present intermediate results for each computational step, and apply our method to a time-course transcriptome dataset for a cell line receiving a challenge dose of ionizing radiation with and without a prior priming dose. Our analyses indicate that (i) the priming dose increases the diversity of the computed templates (e.g., diversity of transcriptome signatures); thus, increasing the network complexity; (ii) as a result of the priming dose, there are a number of unique templates with delayed and oscillatory profiles; and (iii) radiation-induced stress responses are enriched through pathway and subnetwork studies.

59 BASIC BIOLOGICAL SCIENCES↗

Adaptive continuity-preserving simplification of street networks

While street network data are nearly universally available, their representation is usually transportation-based. However, for many types of analyses, e.g., urban morphology or network science, unprocessed transportation-based street network data is unsuitable, making a cumbersome manual simplification process necessary. To address this challenge, in this paper we propose an algorithm for simplification of street networks, based on the detection of network portions that need to be simplified, and continuity-preserving heuristics that generate new geometries. The algorithm, released in the open-source Python package neatnet, facilitates the generation of morphological networks and generalises to various geographical contexts without a need to alter the parameters, while offering better performance than other available solutions.

Fleischmann, Martin [Charles University, Prague, C↗

A fast and accurate physics-informed neural network reduced order model with shallow masked autoencoder

Traditional linear subspace reduced order models (LS-ROMs) are able to accelerate physical simulations in which the intrinsic solution space falls into a subspace with a small dimension, i.e., the solution space has a small Kolmogorov n-width. However, for physical phenomena not of this type, e.g., any advection-dominated flow phenomena such as in traffic flow, atmospheric flows, and air flow over vehicles, a low-dimensional linear subspace poorly approximates the solution. To address cases such as these, we have developed a fast and accurate physics-informed neural network ROM, namely nonlinear manifold ROM (NM-ROM), which can better approximate high-fidelity model solutions with a smaller latent space dimension than the LS-ROMs. Our method takes advantage of the existing numerical methods that are used to solve the corresponding full order models. The efficiency is achieved by developing a hyper-reduction technique in the context of the NM-ROM. Numerical results show that neural networks can learn a more efficient latent space representation on advection-dominated data from 1D and 2D Burgers' equations. A speedup of up to 2.6 for 1D Burgers' and a speedup of 11.7 for 2D Burgers' equations are achieved with an appropriate treatment of the nonlinear terms through a hyper-reduction technique. Lastly, a posteriori error bounds for the NM-ROMs are derived that take account of the hyper-reduced operators.

97 MATHEMATICS AND COMPUTING↗

AMIE (ARM MJO Investigation Experiment): Observations of the Madden-Julian Oscillation for Modeling Studies Science Plan

Deep convection in the tropics plays an important role in driving global circulations and the transport of energy from the tropics to the mid-latitudes. Understanding the mechanisms that control tropical convection is a key to improving climate modeling simulations of the global energy balance. One of the dominant sources of tropical convective variability is the Madden-Julian Oscillation (MJO), which has a period of approximately 30–60 days. There is no agreed-upon explanation for the underlying physics that maintain the MJO. Many climate models do not show well-defined MJO signals, and those that do have problems accurately simulating the amplitude, propagation speed, and/or seasonality of the MJO signal. Therefore, the MJO is a very important modeling target for the ARM modeling community geared specifically toward improving climate models. The ARM MJO Investigation Experiment (AMIE) period coincides with a large international MJO initiation field campaign called CINDY2011 (Cooperative Indian Ocean experiment on intraseasonal variability in the Year 2011) that will take place in and around the Indian Ocean from October 2011 to January 2012. AMIE, in conjunction with CINDY2011 efforts, will provide an unprecedented data set that will allow investigation of the evolution of convection within the framework of the MJO. AMIE observations will also complement the long-term MJO statistics produced using ARM Manus data and will allow testing of several of the current hypotheses related to the MJO phenomenon. Taking advantage of the expected deployment of a C-POL scanning precipitation radar and an ECOR surface flux tower at the ARM Manus site, we propose to increase the number of sonde launches to eight per day starting in about mid-October of the field experiment year, which is climatologically a period of generally suppressed conditions at Manus and just prior to the climatologically strongest MJO period. The field experiment will last until the end of the MJO season (typically March), affording the documentation of conditions before, during, and after the peak MJO season. The increased frequency of sonde launches throughout the experimental period will provide better diurnal understanding of the thermodynamic profiles, and thus a better representation within the variational analysis data set. Finally, a small surface radiation and ceilometer system will be deployed at the PNG Lombrum Naval Base about 6 km away from the ARM Manus site in order to provide some documentation of scale variability with respect to the representativeness of the ARM measurements.

54 ENVIRONMENTAL SCIENCES↗

sciCAN: single-cell chromatin accessibility and gene expression data integration via cycle-consistent adversarial network

The boom in single-cell technologies has brought a surge of high dimensional data that come from different sources and represent cellular systems from different views. With advances in these single-cell technologies, integrating single-cell data across modalities arises as a new computational challenge. Here, we present an adversarial approach, sciCAN, to integrate single-cell chromatin accessibility and gene expression data in an unsupervised manner. We benchmarked sciCAN with 5 existing methods in 5 scATAC-seq/scRNA-seq datasets, and we demonstrated that our method dealt with data integration with consistent performance across datasets and better balance of mutual transferring between modalities than the other 5 existing methods. We further applied sciCAN to 10X Multiome data and confirmed that the integrated representation preserves biological relationships within the hematopoietic hierarchy. Finally, we investigated CRISPR-perturbed single-cell K562 ATAC-seq and RNA-seq data to identify cells with related responses to different perturbations in these different modalities.

59 BASIC BIOLOGICAL SCIENCES↗

HPC-FAIR: A Framework Managing Data and AI Models for Analyzing and Optimizing Scientific Applications

The increasing reliance on machine learning (ML) to analyze and optimize large-scale scientific applications on supercomputers faces a significant bottleneck: the lack of readily available, high-quality training datasets and the difficulty in reusing existing AI models. This project was motivated by the urgent need to address the “FAIR” principles (Findability, Accessibility, Interoperability, Reusability) for both training datasets and AI models in the high-performance computing (HPC) domain. The project developed HPC-FAIR, a high-performance computing data management framework designed to centralize HPC-related datasets and AI models within a unified hub. To ensure interoperability, the framework established a standardized representation and vocabulary (ontology) for both data and models. HPC-FAIR also implemented automated workflows to streamline data processing, model access, and benchmarking. Additionally, the project focused on optimizing data harnessing efficiency through advanced techniques like deep reuse and compression-based analytics.

97 MATHEMATICS AND COMPUTING↗