SEARCH · Engineering Papers

Results for “solve time”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

DOE OSTI2021

How Many Trip Requests Could We Support? An Activity-Travel Based Vehicle Scheduling Approach

In a world of ever-changing travel behavior and ever-increasing modal options, is vital to have integrated models that could capture the interactions between supply and demand layers of travel. Addressing this need, we propose three different versions of network representation and mathematical models for the activity-based vehicle routing problem to connect activity-travel graphs of passengers (demand layer) to spatio-temporal networks of vehicles (supply layer). Versions I and II are arc-based, while version III is path-based. In version I, we introduce the concept of activity-travel graphs for passengers. For vehicles, we construct space–time networks and add a new dimension, called “under-service state”, to track the execution status of trip requests at any location and time. In version II, we reduce the complexity of the network structure by eliminating the state dimension and some other modifications in the structure of the passengers’ and vehicles’ network. Although both versions can capture various behavioral constraints of the activity-based vehicle routing problem (e.g., mandatory and optimal activities, duration of activities, chain of activities, preferred starting and ending times of activities), due to the high level of complexity of the network structure, both versions can only solve small-sized problems. To tackle the computational complexity, we propose a path-based network representation in version III, and to make a balance between the disutility of passengers and vehicles, we present a tolled user equilibrium problem. Mathematical models are coded in C and GAMS and implemented on real-world Phoenix regional transportation network with more than 39 million trip requests, which demonstrate the effectiveness of the proposed solution for the original and restricted master problems.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2020

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Tandem Predictions for HPC Jobs

At the core of the predictive analytics applied to High Performance Computing (HPC), the most prominent tasks are the prediction of job runtimes and the prediction of job queue times, both of which have the potential for informing HPC users during their every-day decision making. Accurate runtime predictions can help users better choose so-called wallclock times at job submission, decreasing the odds of their jobs waiting in queues longer than necessary. The accurate and timely queue time predictions offered for the available partitions can inform the favorable selection of partitions for running jobs. This potential is well understood as we see in the abundance of research studies that propose solutions for these tasks, including the work published in the last several years. These tasks are seemingly receptive to the Machine Learning (ML) solutions, considering that there is no shortage of training data where HPC centers over time run millions and millions of jobs. However, we study the existing research literature, as well as look for examples in the toolchains supported on the exemplar HPC facilities, and, surprisingly, do not find any practical solutions that are ready to be adopted. We interpret this as a manifestation of the shortage of UX/UI efforts that support HPC analytics and also as a sign that the research has not come to the consensus on solving these tasks. In this study, we aim to shed new light on the long-running task of job queue time prediction by exploring the utility of runtime predictions in improving prediction accuracy and, actually, predicting these two metrics together, in tandem. In other words, we show how runtime predictions become valuable input in the queue time modeling. We challenge the existing approaches to feature engineering for the queue time prediction and describe promising results we obtained for a large dataset of HPC jobs from a supercomputer at the National Renewable Energy Laboratory.

HPC↗

DOE OSTI2025

Tandem Predictions for HPC Jobs: Preprint

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Integrated Transmission-Distribution Multi-Period Switching for Wildfire Risk Mitigation: Improving Speed and Scalability with Distributed Optimization: Preprint

With increasingly severe wildfire conditions driven by climate change, utilities must manage the risk of wildfire ignitions from electric power lines. During "public safety power shutoff'" events, utilities de-energize power lines to reduce wildfire ignition risk, which may result in load shedding. Distributed energy resources provide flexibility that can help support the system to reduce load shedding when lines are de-energized. We investigate a coordinated transmission-distribution optimization problem that balances wildfire risk mitigation and load shedding. We model distribution systems that include battery energy storage systems which may support loads when transmission lines are de-energized. This multi-period integrated transmission-distribution optimal switching problem jointly optimizes line switching decisions, the generators' setpoints, load shedding, and the batteries' states of charge, resulting in significant computational challenges. To improve scalability, we decompose the problem over both space and time and apply a distributed optimization algorithm. Using a large-scale synthetic California test case with realistic distribution models and real wildfire risk data, we show that distributed optimization can solve large-scale multi-period switching problems that are otherwise intractable for centralized solvers. We also discuss challenges and future directions for improving the distributed algorithm's convergence performance as the number of time periods increases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2026

Hardware Aware Mitigation of Timing Side-Channel Vulnerabilities in Critical Infrastructure Software

Program runtime/timing attacks exploit variations in a program’s execution times to extract sensitive information from the program (e.g. encryption keys, sensitive variable data, intellectual property). State-of-the-art solutions to runtime sidechannel attacks attempt to balance the execution time of the sensitive code for different control flow paths to eliminate the timing leakage. However, during the mitigation process, most techniques do not consider the underlying hardware/device on which the target program is supposed to run on. This can lead to over-fixing (unnecessary extra operations), under-fixing (not solving the imbalance properly), and even failures. We propose DISARM, a joint hardware-software methodology (unlike any existing solution) for mitigating runtime side-channel vulnerabilities that utilizes timing values from real embedded devices to generate targeted software fixes. We implement DISARM to support C/C++/Java source codes and validate it across 22 standard benchmarks. DISARM outperforms state-of-the-art solutions such as PENDULUM and DifFuzzAR in terms of execution time overhead (up to −46%), code size overhead (up to −10%), and correctness (no failures) on five different embedded/edge devices.

Suha, Tasneem [University of Maine]↗

DOE OSTI2024

GAMPix: a novel fine-grained, low-noise and ultra-low power pixelated charge readout for TPCs

Here, we report on the development of a novel pixel charge readout system, Grid Activated Multi-scale pixel readout (GAMPix), which is under development for use in the GammaTPC gamma ray instrument concept. GammaTPC is being developed to optimize the use of liquid argon time projection chamber technology for gamma ray astrophysics, for which a fine grained low power charge readout is essential. GAMPix uses a new architecture with coarse and fine scale instrumented electrodes to solve the twin problems of loss of measured charge after diffusion, and high readout power. Fundamentally, it enables low noise and ultra low power charge readout at the spatial scale limited by diffusion in a time projection chamber, and has other possibly applications, including future DUNE modules.

Shutt, Tom↗

DOE OSTI2022

Adaptive Space-Time Methods for Large Scale Optimal Design

When modeling complex physical systems with advanced dynamics, such as shocks and singularities, many classic methods for solving partial differential equations can return inaccurate or unusable results. One way to resolve these complex dynamics is through r-adaptive refinement methods, in which a fixed number of mesh points are shifted to areas of high interest. The mesh refinement map can be found through the solution of the Monge-Ampére equation, a highly nonlinear partial differential equation. Due to its nonlinearity, the numerical solution of the Monge-Ampére equation is nontrivial and has previously required computationally expensive methods. In this report, we detail our novel optimization-based, multigrid-enabled solver for a low-order finite element approximation of the Monge-Ampére equation. This fast and scalable solver makes r-adaptive meshing more readily available for problems related to large-scale optimal design. Beyond mesh adaptivity, our report discusses additional applications where our fast solver for the Monge-Ampére equation could be easily applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2026

DISARM: Target Electronic Device Informed Mitigation of Software Runtime Side-Channel Vulnerabilities

Program runtime/timing attacks exploit variations in a program’s execution times to extract sensitive information from the program (e.g. encryption keys, sensitive variable data, intellectual property). State-of-the-art solutions to runtime side-channel attacks attempt to balance the execution time of the sensitive code for different control flow paths to eliminate the timing leakage. However, during the mitigation process, most techniques do not consider the underlying hardware/device on which the target program is supposed to run on. This can lead to over-fixing (unnecessary extra operations), under-fixing (not solving the imbalance properly), and even failures. Here, we propose DISARM, a joint hardware-software methodology (unlike any existing solution) for mitigating runtime side-channel vulnerabilities that utilizes timing values from real embedded devices to generate targeted software fixes. We implement DISARM to support C/C++/Java source codes and validate it across 22 standard benchmarks. DISARM outperforms state-of-the-art solutions such as PENDULUM and DifFuzzaR in terms of execution time overhead, code size overhead, and correctness on five different embedded/edge devices.

Timing/runtime side-channel↗

DOE OSTI2022

Panoramic Mapping of Phonon Transport from Ultrafast Electron Diffraction and Scientific Machine Learning

Abstract One central challenge in understanding phonon thermal transport is a lack of experimental tools to investigate frequency‐resolved phonon transport. Although recent advances in computation lead to frequency‐resolved information, it is hindered by unknown defects in bulk regions and at interfaces. Here, a framework that can uncover microscopic phonon transport information in heterostructures is presented, integrating state‐of‐the‐art ultrafast electron diffraction (UED) with advanced scientific machine learning (SciML). Taking advantage of the dual temporal and reciprocal‐space resolution in UED, and the ability of SciML to solve inverse problems involving coupled Boltzmann transport equations, the frequency‐dependent interfacial transmittance and frequency‐dependent relaxation times of the heterostructure from the diffraction patterns are reliably recovered. The framework is applied to experimental Au/Si UED data, and a transport pattern beyond the diffuse mismatch model is revealed, which further enables a direct reconstruction of real‐space, real‐time, frequency‐resolved phonon dynamics across the interface. The work provides a new pathway to probe interfacial phonon transport mechanisms with unprecedented details.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Entropy–Preserving and Entropy–Stable Relaxation IMEX and Multirate Time–Stepping Methods

In this work, we propose entropy-preserving and entropy-stable partitioned Runge–Kutta (RK) methods. In particular, we extend the explicit relaxation Runge–Kutta methods to IMEX–RK methods and a class of explicit second-order multirate methods for stiff problems arising from scale-separable or grid-induced stiffness in a system. The proposed approaches not only mitigate system stiffness but also fully support entropy-preserving and entropy-stability properties at a discrete level. The key idea of the relaxation approach is to adjust the step completion with a relaxation parameter so that the time-adjusted solution satisfies the entropy condition at a discrete level. The relaxation parameter is computed by solving a scalar nonlinear equation at each timestep in general; however, as for a quadratic entropy function, we theoretically derive the explicit form of the relaxation parameter and numerically confirm that the relaxation parameter works the Burgers equation. Several numerical results for ordinary differential equations and the Burgers equation are presented to demonstrate the entropy-conserving/stable behavior of these methods. We also compare the relaxation approach and the incremental direction technique for the Burgers equation with and without a limiter in the presence of shocks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Impurity gas monitoring using ultrasonic sensing and neural networks: forward and inverse problems

Ultrasonic sensing is a non-invasive technique for monitoring impurity gas composition in various industrial applications where safety and regulatory compliance are crucial. In this study, ultrasonic sensing and neural networks were used to analyze impurity gases (i.e., air and argon) in helium. An experimental platform was established to acquire ultrasonic data. In the forward problem, an artificial neural network (ANN) model was used to forecast the response and time-of-flight (TOF) based on the excitation, and argon and air concentrations. The inverse problem was solved using a convolutional neural network (CNN) to predict the argon and air concentrations given the ultrasonic response and excitation. The results showed that the ANN accurately predicted the ultrasonic response and the change in TOF with concentration. As the air concentration was increased from 0 to 9.8%, the TOF sensitivity to detect argon decreased by 39.8% and 16.1% from ANN and sound speed theory, respectively. The CNN demonstrated high accuracy in predicting concentrations for inputs in the testing dataset. The application of the trained CNN indicated that it over-predicts air concentration while under-predicting the argon concentration. To improve accuracy, the predicted air and argon concentrations should be corrected by -0.992% and 1.027% bias, respectively.

47 OTHER INSTRUMENTATION↗

DOE OSTI2025

Block segmentation in feature space for realtime object detection in high granularity images

Computer vision has applications in object detection, image recognition and classification, and object tracking. One of the challenges of computer vision is the presence of useful information at multiple distance scales. Filtering techniques may sacrifice details at small scales in order to prioritize the analysis of large-scale features of the image. We present a strategy for coarse-graining multidimensional data while maintaining fine-grained detail for subsequent analysis. The algorithm is based on fixed-size block segmentation in the feature space. We apply this strategy to solve the long-standing challenge of detecting particle trajectories at the Large Hadron Collider in real time.

Computer vision↗

DOE OSTI2020

GFiRe—Gauge Field integrator for Reheating

We present a new numerical algorithm and code, GFiRe, for solving the nonlinear evolution of Abelian gauge fields coupled to complex scalar fields in homogeneous and isotropic spacetimes. We adopt a hybrid approach to solving the system: the spatial derivatives are discretized using standard Lattice Gauge Field Theory techniques, whereas the time evolution of the fields and scale factor is implemented with explicit, composite, symplectic integrators. An important property of our compound algorithm is that the discretized Gauss constraint is respected exactly, regardless of the order of the symplectic integrator. This remains true even when the background expansion is computed “self-consistently”; that is, when the expansion history is computed using spatial averaged components of the energy momentum tensor in the simulation volume. Hence, our code can also be used in cases where the fields dominate the energy density of the universe, for example, during reheating after inflation. We test the algorithm in scenarios of reheating where the inflaton is a complex scalar field with a potential ∝(2|Φ| 2 - v 2 ) 2 and is coupled to an Abelian gauge field. Tracing the evolution of the system through complex dynamics (including resonant excitation of fields, backreaction, formation of solitons, and changes in the equation of state) in a self-consistently expanding universe, we find the energy conservation violation (<10 -4 ) to be very stable and the Gauss constraint violation (<10 -6 ) to be dominated by differencing noise.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Superposed metric for spinning black hole binaries approaching merger

Here, we construct an approximate metric that represents the spacetime of spinning binary black holes (BBH) approaching merger. We build the metric as an analytical superposition of two Kerr metrics in harmonic coordinates, where we transform each black hole term with time-dependent boosts describing an inspiral trajectory. The velocities and trajectories of the boost are obtained by solving the post-Newtonian (PN) equations of motion at 3.5 PN order. We analyze the spacetime scalars of the new metric and we show that it is an accurate approximation of Einstein’s field equations in vacuum for a BBH system in the inspiral regime. Furthermore, to prove the effectiveness of our approach, we test the metric in the context of a 3D general relativistic magnetohydrodynamical (GRMHD) simulation of accreting minidisks around the black holes. We compare our results with a previous well-tested spacetime construction based on the asymptotic matching method. We conclude that our new spacetime is well-suited for long-term GRMHD simulations of spinning binary black holes on their way to the merger.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Two-Stage Reinforcement Learning Policy Search for Grid-Interactive Building Control

This paper develops an intelligent grid-interactive building controller, which optimizes building operation during both normal hours and demand response (DR) events. To avoid costly on-demand computation and to adapt to non-linear building models, the controller utilizes reinforcement learning (RL) and makes real-time decisions based on a near-optimal control policy. Learning such a policy typically amounts to solving a hard non-convex optimization problem. We propose to address this problem with a novel global-local policy search method. In the first stage, an RL algorithm based on zero-order gradient estimation is leveraged to search for the optimal policy globally, due to its scalability and the potential to escape some poor performing local optima. The obtained policy is then fine-tuned locally to bring the first-stage solution closer to that of the original unsmoothed problem. Experiments on a simulated five-zone commercial building demonstrate the advantages of the proposed method over existing learning approaches. They also show that the learned control policy outperforms a pragmatic linear model predictive controller (MPC) and approaches the performance of an oracle MPC in testing scenarios. Using a state-of-the-art advanced computing system, we demonstrate that the controller can be learned and deployed within hours of training.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2022

Accelerated Deterministic Phonon Transport With Consistent Material Temperature and Intensities

Abstract We present a method for deterministically solving the frequency and temperature dependent phonon radiative transport (PRT) equation in the single-mode relaxation time (SMRT) approximation in the self-adjoint angular flux (SAAF) form. To handle the nonlinear coupling between the phonon intensities and the material temperature, we apply a linearization approach that is similar to one in thermal radiative transport. This procedure leads to the PRT equation with pseudo-scattering. The method presented includes acceleration of both the inner pseudo-scattering source iterations and outer temperature iteration with a gray diffusion synthetic acceleration (DSA) and Anderson acceleration, respectively. We use the finite-element method to discretize the PRT equation in space and the method of discrete ordinates (SN) for angular discretization. The proposed method is verified by a gray method of manufactured solutions problem and demonstrated on a problem using temperature and direction dependent multigroup data from lithium aluminate (LiAlO2). The iterative performance of the acceleration method in each test is then compared to the unaccelerated method.

Engineering↗

DOE OSTI2020

Science & Technology Review August 2020

At Lawrence Livermore National Laboratory, we focus on science and technology research to ensure our nation’s security. We also apply that expertise to solve other important national problems in energy, bioscience, and the environment. Science & Technology Review is published eight times a year to communicate, to a broad audience, the Laboratory’s scientific and technological accomplishments in fulfilling its primary missions. The publication’s goal is to help readers understand these accomplishments and appreciate their value to the individual citizen, the nation, and the world.

36 MATERIALS SCIENCE↗