Search NASA⌕ Search

SEARCH · Search NASA

Results for “data layout optimization”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Pure JavaScript Storyline Layout Algorithm

This is a JavaScript library for a storyline layout algorithm. Storylines are adept at communicating complex change by encoding time on the x-axis and using the proximity of lines in the y direction to represent interaction between entities. The library in this disclosure takes as input a list of objects containing an id, time, and state. The output is a data structure that can be used to conveniently render a storyline visualization. Most importantly, the library computes the y-coordinate of the entities over time that decreases layout artifacts including crossings, wiggles, and whitespace. This is accomplished through multi-objective, multi-stage optimization problem, where the output of one stage produces input and constraints for the next stage.

Source record↗
DOE OSTI2024

PyOED: An Extensible Suite for Data Assimilation and Model-Constrained Optimal Design of Experiments

This article describes PyOED, a highly extensible scientific package that enables developing and testing model-constrained optimal experimental design (OED) for inverse problems. Specifically, PyOED aims to be a comprehensive Python toolkit for model-constrained OED. The package targets scientists and researchers interested in understanding the details of OED formulations and approaches. It is also meant to enable researchers to experiment with standard and innovative OED technologies with a wide range of test problems (e.g., simulation models). OED, inverse problems (e.g., Bayesian inversion), and data assimilation (DA) are closely related research fields, and their formulations overlap significantly. Thus, PyOED is continuously being expanded with a plethora of Bayesian inversion, DA, and OED methods as well as new scientific simulation models, observation error models, and observation operators. These pieces are added such that they can be permuted to enable testing OED methods in various settings of varying complexities. The PyOED core is completely written in Python and utilizes the inherent object-oriented capabilities; however, the current version of PyOED is meant to be extensible rather than scalable. Specifically, PyOED is developed to “enable rapid development and benchmarking of OED methods with minimal coding effort and to maximize code reutilization.” This article provides a brief description of the PyOED layout and philosophy and provides a set of exemplary test cases and tutorials to demonstrate the potential of the package.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Positron Emission Tomography in Water Resources and Subsurface Energy Resources Engineering Research

Recent studies have demonstrated that positron emission tomography (PET) is a valuable tool for in-situ characterization of fluid transport in porous and fractured geologic media at the laboratory scale. While PET imaging is routinely used for clinical cancer diagnosis and preclinical medical research—and therefore imaging facilities are available at most research institutes—widespread adoption for applications in water resources and subsurface energy resources engineering have been limited by real and perceived challenges of working with this technique. In this study we discuss and address these challenges, and provide detailed analysis highlighting how positron emission tomography can complement and improve laboratory characterization of different subsurface fluid transport problems. The physics of PET are reviewed to provide a fundamental understanding of the sources of noise, resolution limits, and safety considerations. We then layout the methodology required to perform laboratory experiments imaged with PET, including a new protocol for radioactivity dosing optimization for imaging in geologic materials. Signal-to-noise and sensitivity analysis comparisons between PET and clinical X-ray computed tomography are performed to highlight how PET data can complement more traditional characterization methods, particularly for solute transport problems. Lastly, prior work is critically reviewed and discussed to provide a better understanding of the strengths and weakness of PET and how to best utilize PET-derived data for future studies.

02 PETROLEUM↗
DOE OSTI2017

TGE: Machine Learning Based Task Graph Embedding for Large-Scale Topology Mapping

Task mapping is an important problem in parallel and distributed computing. The goal in task mapping is to find an optimal layout of the processes of an application (or a task) onto a given network topology. We target this problem in the context of staging applications. A staging application consists of two or more parallel applications (also referred to as staging tasks) which run concurrently and exchange data over the course of computation. Task mapping becomes a more challenging problem in staging applications, because not only data is exchanged between the staging tasks, but also the processes of a staging task may exchange data with each other. We propose a novel method, called Task Graph Embedding (TGE), that harnesses the observable graph structures of parallel applications and network topologies. TGE employs a machine learning based algorithm to find the best representation of a graph, called an embedding, onto a space in which the task-to-processor mapping problem can be solved. We evaluate and demonstrate the effectiveness of TGE experimentally with the communication patterns extracted from runs of XGC, a large-scale fusion simulation code, on Titan.

Choi, Jong Youl↗
NASA NTRS1973

Printed wiring board system programmer's manual

The printed wiring board system provides automated techniques for the design of printed circuit boards and hybrid circuit boards. The system consists of four programs: (1) the preprocessor program combines user supplied data and pre-defined library data to produce the detailed circuit description data; (2) the placement program assigns circuit components to specific areas of the board in a manner that optimizes the total interconnection length of the circuit; (3) the organizer program assigns pin interconnections to specific board levels and determines the optimal order in which the router program should attempt to layout the paths connecting the pins; and (4) the router program determines the wire paths which are to be used to connect each input pin pair on the circuit board. This document is intended to serve as a programmer's reference manual for the printed wiring board system. A detailed description of the internal logic and flow of the printed wiring board programs is included.

Brinkerhoff, C. D.↗
DOE OSTI2025

CSP Systems Analysis 2022-2024 (Final Technical Report)

The CSP Systems Analysis project estimates the current market cost of CSP subsystems and technologies for use by the DOE Program and within NREL analysis tools. The project addresses upgrades to NREL's System Advisor Model (SAM) related to CSP, as well as development of new modules within SAM to expand the types of CSP systems that can be simulated and new tools for evaluating CSP subsystem performance or optimizing CSP system layouts, for example, SolarPILOT and SolTrace. The project evaluates the potential cost and performance of new CSP-relevant technologies and generally includes assessment of CSP technologies in support of the DOE subprogram. A primary goal of the CSP System Analysis project is to provide timely and accurate cost data to the DOE to assess the current state of CSP technologies as well as predict performance and cost for pre-commercial and emerging technologies that may impact the industry. Prior work in this task has produced technology cost reports and roadmaps for DOE and highlighted promising research paths that could reduce overall CSP cost, such as the supercritical CO2 power cycle and molten-salt trough systems. CSP Systems Analysis produces modeling tools to evaluate the performance of CSP systems, subsystems, or components, and journal articles, conference papers, technical reports and databases to disseminate information to the CSP industry. CSP technology costs are estimated and tracked using these tools as well as analysis of literature and industry sources. The CSP modeling tools and NREL analysis results are used by researchers; government, financial, and industry analysts; and other CSP stakeholders. The purpose of this final technical report is to summarize the key accomplishments of the past three years of this project. The project was divided into seven separate tasks, and in what follows, we describe the background, objectives, key accomplishments, and path forward for each task within the project, with one section of this report summarizing each task.

14 SOLAR ENERGY↗
DOE OSTI2013

A system-level cost-of-energy wind farm layout optimization with landowner modeling

This work applies an enhanced levelized wind farm cost model, including landowner remittance fees, to determine optimal turbine placements under three landowner participation scenarios and two land-plot shapes. Instead of assuming a continuous piece of land is available for the wind farm construction, as in most layout optimizations, the problem formulation represents landowner participation scenarios as a binary string variable, along with the number of turbines. The cost parameters and model are a combination of models from the National Renewable Energy Laboratory (NREL), Lawrence Berkeley National Laboratory, and Windustiy. The system-level cost-of-energy (COE) optimization model is also tested under two land-plot shapes: equally-sized square land plots and unequal rectangle land plots. The optimal COEs results are compared to actual COE data and found to be realistic. The results show that landowner remittances account for approximately 10% of farm operating costs across all cases. Irregular land-plot shapes are easily handled by the model. We find that larger land plots do not necessarily receive higher remittance fees. The model can help site developers identify the most crucial land plots for project success and the optimal positions of turbines, with realistic estimates of costs and profitability. (C) 2013 Elsevier Ltd. All rights reserved.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Compiler and Runtime Approaches to Enable Large-Scale Irregular Programs. Final report, July 2013 - July 2019

While regular algorithms, characterized by operations on dense matrices and arrays, have long been the mainstay of scientific, high-performance computing, irregular algorithms, which feature unpredictable accesses to pointer-based data structures, are becoming increasingly common in high performance computing, arising in graph analysis, data mining and visualization, among other domains. Unfortunately, the defining characteristics of irregular applications, their dynamic, unpredictable, data-dependent access patterns and data layouts, make achieving high performance on large scale systems difficult. Scaling applications to peta- and exa-scale requires carefully controlling communication and data movement and placement, an inherently difficult task when access patterns and data layouts are unpredictable! Most irregular applications that attain high performance must be painstakingly hand-written and hand-tuned, with few common principles or paradigms uniting various implementations and easing future development. Despite the increasing importance of irregular applications, there is little programmer knowledge, and even less compiler ability, devoted to optimizing them. This project aims to solve these problems. By allowing programmers to write irregular applications in high level forms, with at most a few annotations highlighting key structural properties, programmers can focus on developing their algorithms and methods. The compiler and run-time system can take on the tedious task of optimizing the application for execution at large scales, and can automatically provide efficient implementations. This will provide portability and ease maintenance for existing irregular applications, but, more importantly, open up whole new domains of computational science to large-scale, high-performance simulation codes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Data-Driven Method for Groundwater-Level Mapping and Monitoring-Well Network Optimization at Hanford

This report summarizes the initial results and outcomes of a physics-informed, data-driven groundwater level (GWL) mapping capability for the Hanford Site. GWL mapping at Hanford is typically conducted annually and requires a significant amount of computational and expert resources, and it does not allow assessment of the informational value of specific monitoring wells. The proposed method produces spatially and temporally resolved fields consistent with sparse, irregularly sampled, and nonuniformly distributed well measurements. Implemented successfully, this capability will allow rapid mapping of groundwater levels and provide an opportunity to optimize monitoring activities (both location and sampling frequency) based on data information value evaluation. The approach integrates a diffusion-based generative model – trained on MODFLOW simulation data from the Plateau-to-River (P2R) model – with score-based data assimilation (SDA), allowing observation-conditioned mapping without retraining for each monitoring-network layout.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1993

Propagation model for the Land Mobile Satellite channel in urban environments

This paper presents the major characteristics of a simulation package capable of performing a complete narrow and wideband analysis of the mobile satellite communication channel in urban environments for any given orbital configuration. The wavelength-to-average urban geometrical dimension ratio has required the use of the Geometrical Theory of Diffraction (GTD). For the RF frequency range, the model has been designed to be (1 up to 60 GHz) extended to include effects of non-perfect conductivity and surface roughness. Taking advantage of the inherent capabilities of such a high frequency method, we are able to provide a complete description of the electromagnetic field at the mobile terminal. Using the information made available at the ray-tracer and GTD solver outputs, the Land Mobile Satellite (LMS) urban model can also give a detailed description of the communication channel in terms of power delay profiles, Doppler spectra, channel scattering functions, and so forth. Statistical data, e.g. cumulative distribution functions, level crossing rates or distributions of fades are also provided. The user can access the simulation tool through a Design-CAD user-friendly interface by means of which she can effectively design her own urban layout and run consequently all the envisaged routines. The software is optimized in its execution time so that numerous runs can be achieved in a considerably short time.

Sforza, M.↗
DOE OSTI2024

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Inferring safety critical events from vehicle kinematics in naturalistic driving environment: Application of deep learning Algorithms

Advances in sensing technology has enabled the collection of countless terabytes of second-by-second kinematics data. Such data provides opportunities for real-time monitoring of driving behavior and identification of safety critical events (SCEs) including crashes and near crashes. The concept of volatility is relevant in this context, which identifies instability and erratic variations in driving behavior prior to involvement in SCEs. This study utilized vehicle kinematics from a large-scale naturalistic driving data to develop a deep learning approach based on 1D convolutional neural networks (CNN) for inferring SCEs. The data are unique in the sense that such accurate pre-crash data at high fidelity are not available in traditional crash repositories. This study contributes to the literature by providing a first attempt at predicting responses to SCEs by developing deep learning-based CNN architectures using novel driving volatility based kinematic thresholds for a sample of 9553 events. The key contribution lies in developing a volatility-based CNN input layout that is acceptable to CNN schemes and represents the motion kinematics such as speed, acceleration and volatility measures. Several 1D-CNN architectures were developed using layers, numbers of convolutions, layer patterns, and kernels. Shallow and deep architectures were tested, revealing higher accuracy of shallow architectures in detecting SCEs. The optimal number of epochs were identified using an early stopping method while the CNN performance was improved by increasing the number of epochs. The ensemble CNN had the highest predictive accuracy of 95.6% for detection of crashes and near crashes, which was 2.5% higher than the optimal CNN using 20% hold out test data. The ensemble CNN also outperformed classical machine learning models and model performance reported in past studies on detection of SCEs. Finally, these results have implications for identification of safety hotspots and providing real-time alerts and warnings in connected and highly automated vehicle environment including society of automotive engineers levels 3–5.

42 ENGINEERING↗
DOE OSTI2020

A general-purpose method for Pareto optimal placement of flow rate and concentration sensors in networked systems – With application to wastewater treatment plants

The advent of affordable computing, low-cost sensor hardware, and high-speed and reliable communications have spurred installation of ubiquitous sensors in complex engineered systems. However, ensuring reliable data quality remains a challenge. Exploitation of redundancy among sensor signals can help improving the precision of measured variables, detecting the presence of gross errors, and identifying faulty sensors. The cost of sensor ownership, maintenance efforts in particular, can still be cost-prohibitive however. Maximizing the ability to assess and control data quality while minimizing the cost of ownership thus requires a careful sensor placement. To solve this challenge, in this work we develop a generally applicable method to solve the multi-objective sensor placement problem in systems governed by linear and bilinear balance equations. Importantly, the method computes all Pareto-optimal sensor layouts with conventional computational resources and requires no information about the expected sensor quality.

42 ENGINEERING↗
NASA NTRS2009

Processing and Probability Analysis of Pulsed Terahertz NDE of Corrosion under Shuttle Tile Data

This paper examines data processing and probability analysis of pulsed terahertz NDE scans of corrosion defects under a Shuttle tile. Pulsed terahertz data collected from an aluminum plate with fabricated corrosion defects and covered with a Shuttle tile is presented. The corrosion defects imaged were fabricated by electrochemically etching areas of various diameter and depth in the plate. In this work, the aluminum plate echo signal is located in the terahertz time-of-flight data and a threshold is applied to produce a binary image of sample features. Feature location and area are examined and identified as corrosion through comparison with the known defect layout. The results are tabulated with hit, miss, or false call information for a probability of detection analysis that is used to identify an optimal processing threshold.

Anastasi, Robert F.↗
NASA NTRS2018

Overcoming Pitfalls When Using HDF5 Compression

Compression of large datasets in S-NPP, JPSS and other HDF5 data files may substantially reduce their size, in turn reducing disk space requirements and file download time. However, mismatches between the layout of the files' datasets, the HDF5 instance's cache settings, choice of compression algorithm, and the access pattern of applications using the data can sometimes result in poor performance or exhausting machine resources when running the application. Whether designed in advance or modified in response to encountered problems, applications can be tuned to optimize efficiency of data access, avoid unnecessary repeated decompression, and reduce the amount of memory used. Examples will be given of problems that may be encountered, how to use available tools to diagnose or work around them, changing cache settings to conserve memory, and designing access strategies to avoid both performance and memory issues when creating or modifying applications.

performance↗
DOE OSTI2025

Data Structure Alchemy

In an increasingly more data-driven world, the project set out to uncover the first principles of data-structure design, chart the immense design space they form, and build automation that can synthesize an optimal structure, or even a whole storage engine, for any given workload, hardware platform, and cost target. Data structures are at the center of every computational system and are directly responsible for its performance. Two core technical thrusts were defined: 1) Mapping design spaces for key data-centric abstractions (filters, hash functions, storage-engine layouts, neural-network topologies, blockchain protocols, image layouts, etc.). 2) Developing search & synthesis algorithms, initially analytical cost models, later neural-guided bi-level optimisers that navigate sextillions of candidate designs in seconds and materialise the best one as ready‐to-run code. This report distills the key insights, accomplishments, and impact.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Experimental study of airpath electrification in an opposed-piston two stroke (OP2S) engine architecture

The opposed-piston two stroke (OP2S) engine shows potential as an alternative engine architecture to the conventional four stroke engine due to its high-power density, thermal efficiency, and versatile airpath management system. Since the pistons of a two-stroke engine do not pump the air into and out of the cylinder like in a four-stroke engine, the selection of the air induction devices and airpath actuators becomes critical to optimize engine performance. Both the pumping losses and the in-cylinder combustion process can be affected by the scavenging process in a two-stroke engine. Therefore, this study compares two different airpath configurations for the same family of OP2S engines and investigates performance metrics like scavenging control, pumping work, net indicated and brake efficiencies, and engine-out emissions associated with each airpath. Data was collected on a 3.2 L, two-cylinder OP2S engine with an electrically assisted turbocharger (EAT) and a 4.9 L displacement, three-cylinder engine with a variable geometry turbocharger (VGT) and a supercharger. The experiments consisted of speed and load sweeps for both engines at the same operating conditions to compare scavenge control in both architectures. For the three-cylinder layout, the SE sweep range was much higher, and the intake pressure could be independently varied with air flowrate, thus providing more flexibility for scavenging control. The supercharger and the VGT usage was optimized based on its efficiency map and thus, this layout had lower pumping losses compared to the EAT. The two-cylinder engine had a higher overall SE as compared to the three-cylinder engine, but the intake pressure and air flowrate could not be decoupled, leading to over scavenging and increased short circuiting of fresh charge into the exhaust.

Bhatt, Ankur [Clemson University, Clemson, SC, USA↗
DOE OSTI2017

FleCSPH notes

FleCSI is a compile-time con gurable framework designed to support multi-physics application development. As such, FleCSI provides a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. FleCSI currently supports multi-dimensional mesh topology, geometry, and adjacency information, as well as n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent both with MPI and with state-of-the-art, task-based runtimes such as Legion and Charm++. The abstraction layer insulates developers from the underlying runtime, while allowing support for multiple runtime systems including conventional models like asynchronous MPI. The intent is to provide developers with a concrete set of user-friendly programming tools that can be used now, while allowing exibility in choosing runtime implementations and optimization that can be applied to future architectures and runtimes. FleCSI's control and execution models provide formal nomenclature for describing poorly understood concepts such as kernels and tasks. FleCSI's data model provides a low-buy-in approach that makes it an attractive option for many application projects, as developers are not locked into particular layouts or data structure representations. FleCSI currently provides a parallel but not distributed implementation of Binary, Quad and Oct-tree topology. This implementation is base on space lling curves domain decomposition, the Morton order. The current FleCSI version requires the implementation of a driver and a specialization driver. The role of the specialization driver is to provide the data distribution. This feature is not complete in FleCSI code and we provide it. The next step will be to incorporate it directly from FleCSPH to FleCSI as we reach a good level of performance. Then the driver represent the general execution of the resolution without worrying of the data locality and communications. As FleCSI is an On-Development code the structure may change in the future and we keep track of these changes in FleCSPH.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗