Probabilistic Motion Planning: Safety and Quantum Computing [Slides]
Abstract not provided.
42 ENGINEERING↗
SEARCH · Engineering Papers
Results for “mathematics computing”
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.
Seeing Objects in a Cluttered World: Computational Objectness from Motion in Video
Explore the source record for details and available documents.
Mathematics and Computing, Computer science↗
VnV: A Self Documenting Testing Framework for In-situ Verification and Validation in High Performance Computing Applications
Explore the source record for details and available documents.
96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
Teaching Freight Mode Choice Models New Tricks Using Interpretable Machine Learning Methods
Understanding and forecasting the intricate freight mode choice behavior under various industry, policy, and technology contexts is essential in freight planning and policymaking. Numerous models have been developed in prior studies to provide insights into freight mode selection, the majority of which use discrete choice models such as multinomial logit (MNL) models. However, logit models often rely on linear specifications of independent variables, despite potential nonlinear relationships in the data. Moreover, there often lacks a heuristic and efficient approach to identify such complex relationships to define the logit model specifications. To fill this gap, we developed an MNL model for freight mode choice using the insights from state-of-the- art machine learning (ML) models. ML models can capture the nonlinear nature of the complex decision-making process, and recent advances in 'explainable AI' have greatly improved their interpretability. The interpretable ML methods help enhance the performance of MNL models and advance knowledge of freight mode choice. Specifically, the influential factors and their relationship with individual modes are identified using SHapley Additive exPlanations (SHAP) to improve the MNL's performance. The workflow is demonstrated in a case study of Austin, Texas, and the SHAP results reveal multiple nonlinear relationships predicted by ML models. Incorporating those relationships into MNL model specifications improves the interpretability and accuracy of the MNL model compared to a conventional MNL model. Findings from this study can be used to guide freight planning and inform policymakers and practitioners on how key factors affect freight decision-making.
ADVANCED PROPULSION SYSTEMS,MATHEMATICS AND COMPUT↗
Neuromorphic scaling advantages for energy-efficient random walk computations
Neuromorphic computing, which aims to replicate the computational structure and architecture of the brain in synthetic hardware, has typically focused on artificial intelligence applications. What is less explored is whether such brain-inspired hardware can provide value beyond cognitive tasks. Here we show that the high degree of parallelism and configurability of spiking neuromorphic architectures makes them well suited to implement random walks via discrete-time Markov chains. Overall, these random walks are useful in Monte Carlo methods, which represent a fundamental computational tool for solving a wide range of numerical computing tasks. Using IBM’s TrueNorth and Intel’s Loihi neuromorphic computing platforms, we show that our neuromorphic computing algorithm for generating random walk approximations of diffusion offers advantages in energy-efficient computation compared with conventional approaches. We also show that our neuromorphic computing algorithm can be extended to more sophisticated jump-diffusion processes that are useful in a range of applications, including financial economics, particle physics and machine learning.
97 MATHEMATICS AND COMPUTING↗
Distributed Macroscopic Traffic Simulation with Open Traffic Models
This paper presents OTM-MPI, an extension of the Open Traffic Models platform (OTM) for running macroscopic traffic simulations in high-performance computing environments. OTM-MPI represents the first open-source, distributed-memory, macroscopic simulation model developed for modern high performance parallel machines and large networks. Macroscopic simulations are appropriate for studying regional traffic scenarios when aggregate trends are of interest, rather than individual vehicle traces. They are also appropriate for studying the routing behavior of classes of vehicles, such as app-informed vehicles. The network partitioning was performed with METIS. Inter-process communication was done with MPI (message-passing interface). Results are provided for two networks: one realistic network which was obtained from Open Street Maps for Chattanooga, TN, and another larger synthetic grid network. The software recorded a speedups of 198x using 256 cores for Chattanooga, and 475x with 1,024 cores for the synthetic network.
macro-scopic traffic simulation↗
A terminology for in situ visualization and analysis systems
The term "in situ processing" has evolved over the last decade to mean both a specific strategy for visualizing and analyzing data and an umbrella term for a processing paradigm. The resulting confusion makes it difficult for visualization and analysis scientists to communicate with each other and with their stakeholders. To address this problem, a group of over 50 experts convened with the goal of standardizing terminology. This paper summarizes their findings and proposes a new terminology for describing in situ systems. An important finding from this group was that in situ systems are best described via multiple, distinct axes: integration type, proximity, access, division of execution, operation controls, and output type. This paper discusses these axes, evaluates existing systems within the axes, and explores how currently used terms relate to the axes.
97 MATHEMATICS AND COMPUTING↗
Quantum approximate multi-objective optimization
The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
GPU-acceleration of tensor renormalization with PyTorch using CUDA
We show that numerical computations based on tensor renormalization group (TRG) methods can be significantly accelerated with PyTorch on graphics processing units (GPUs) by leveraging NVIDIA's Compute Unified Device Architecture (CUDA). Here we find improvement in the runtime and its scaling with bond dimension for two-dimensional systems. Our results establish that the utilization of GPU resources is essential for future precision computations with TRG.
97 MATHEMATICS AND COMPUTING↗
Multi-element flow-driven spectral chaos (ME-FSC) method for uncertainty quantification of dynamical systems
The flow-driven spectral chaos (FSC) is a recently developed method for tracking and quantifying uncertainties in the long-time response of stochastic dynamical systems using the spectral approach. The method uses a novel concept called enriched stochastic flow maps as a means to construct an evolving finite-dimensional random function space that is both accurate and computationally efficient in time. In this paper, we present a multi-element version of the FSC method (the ME-FSC method for short) to tackle (mainly) those dynamical systems that are inherently discontinuous over the probability space. In ME-FSC, the random domain is partitioned into several elements, and then the problem is solved separately on each random element using the FSC method. Subsequently, results are aggregated to compute the probability moments of interest using the law of total probability. To demonstrate the effectiveness of the ME-FSC method in dealing with discontinuities and long-time integration of stochastic dynamical systems, four representative numerical examples are presented in this paper, including the Van-der-Pol oscillator problem and the Kraichnan-Orszag three-mode problem. Results show that the ME-FSC method is capable of solving problems that have strong nonlinear dependencies over the probability space, both reliably and at low computational cost.
97 MATHEMATICS AND COMPUTING↗
Stabilized bases for high-order, interpolation semi-Lagrangian, element-based tracer transport
In a computational fluid model of the atmosphere, the advective transport of trace species, or tracers, can be computationally expensive. For efficiency, models often use semi-Lagrangian advection methods. High-order interpolation semi-Lagrangian (ISL) methods, in particular, can be extremely efficient, if the problem of property preservation specific to them can be addressed. Atmosphere models often use geometrically and logically nonuniform grids for efficiency and, as a result, element-based discretizations. Such grids and discretizations make stability a particular problem for ISL methods. Generally, high-order, element-based ISL methods that use the natural polynomial interpolant associated with a nodal finite-element discretization are unstable. Here, we derive new bases having order of accuracy up to nine, with positive nodal weights, that stabilize the element-based ISL method. We use these bases to construct the linear advection operator in the property-preserving Interpolation Semi-Lagrangian Element-based Transport (Islet) method. Then we discuss key software implementation details. Finally, we show performance results for the Energy Exascale Earth System Model's atmosphere dynamical core, comparing the original and new transport methods. These simulations used up to 27,600 Graphical Processing Units (GPU) on the Oak Ridge Leadership Computing Facility's Summit supercomputer.
97 MATHEMATICS AND COMPUTING↗
Sequential linear integer programming for integer optimal control with total variation regularization
We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.
97 MATHEMATICS AND COMPUTING↗
Benchmarking Information Scrambling
Information scrambling refers to the rapid spreading of initially localized information over an entire system, via the generation of global entanglement. This effect is usually detected by measuring a temporal decay of the out-of-time order correlators. However, in experiments, decays of these correlators suffer from fake positive signals from various sources, e.g., decoherence due to inevitable couplings to the environment, or errors that cause mismatches between the purported forward and backward evolutions. Here, in this Letter, we provide a simple and robust approach to single out the effect of genuine scrambling. This allows us to benchmark the scrambling process by quantifying the degree of the scrambling from the noisy backgrounds. We also demonstrate our protocol with simulations on IBM cloud-based quantum computers.
97 MATHEMATICS AND COMPUTING↗
Quantum Distributed Unit Commitment: An Application in Microgrids
The dawn of quantum computing brings on a revolution in the way combinatorially complex power system problems such as Unit Commitment are solved. The Unit Commitment problem complexity is expected to increase in the future because of the trend toward the increase of penetration of intermittent renewables. Even though quantum computing has proven effective for solving a host of problems, its applications for power systems’ problems have been rather limited. Here, in this paper, a quantum unit commitment is innovatively formulated and the quantum version of the decomposition and coordination alternate direction method of multipliers (ADMM) is established. The above is achieved by devising quantum algorithms and by exploiting the superposition and entanglement of quantum bits (qubits) for solving subproblems, which are then coordinated through ADMM to obtain feasible solutions. The main contributions of this paper include: 1) the innovative development of a quantum model for Unit Commitment; 2) development of decomposition and coordination-supported framework which paves the way for the utilization of limited quantum resources to potentially solve the large-scale discrete optimization problems; 3) devising the novel quantum distributed unit commitment (QDUC) to solve the problem in a larger scale than currently available quantum computers are capable of solving. The QDUC results are compared with those from its classical counterpart, which validate the efficacy of quantum computing.
97 MATHEMATICS AND COMPUTING↗
Adaptive Time Step Control for Multirate Infinitesimal Methods
Multirate methods have been used for decades to temporally evolve initial-value problems in which different components evolve on distinct time scales, and thus use of different step sizes for these components can result in increased computational efficiency. Generally, such methods select these different step sizes based on experimentation or stability considerations. For problems that evolve on a single time scale, adaptivity approaches that strive to control local temporal error are widely used to achieve numerical results of a desired accuracy with minimal computational effort, while alleviating the need for manual experimentation with different time step sizes. However, there is a notable gap in the publication record on the development of adaptive time step controllers for multirate methods. In this paper, we extend the single-rate controller work of Gustafsson [ACM Trans. Math. Software, 20 (1994), pp. 496-517] to the multirate method setting. Specifically, we develop controllers based on polynomial approximations to the principal error functions for both the "fast" and "slow" time scales within multirate infinitesimal (MRI) methods. We additionally investigate a variety of approaches for estimating the errors arising from each time scale within MRI methods. We then numerically evaluate the proposed multirate controllers and error estimation strategies on a range of multirate test problems, comparing their performance against an estimated optimal performance. Through this work, we combine the most performant of these approaches to arrive at a set of multirate adaptive time step controllers that robustly achieve desired solution accuracy with minimal computational effort.
97 MATHEMATICS AND COMPUTING↗
Multiphysics coupling in the Exascale computing project
Multiphysics coupling presents a significant challenge in terms of both computational accuracy and performance. Achieving high performance on coupled simulations can be particularly challenging in a high-performance computing context. The US Department of Energy Exascale Computing Project has the mission to prepare mission-relevant applications for the delivery of the exascale computers starting in 2023. Many of these applications require multiphysics coupling, and the implementations must be performant on exascale hardware. In this special issue we feature six articles performing advanced multiphysics coupling that span the computational science domains in the Exascale Computing Project.
97 MATHEMATICS AND COMPUTING↗
STNS01-4 BEE - FY20 P6-3: Release BEEWorkflowManager, BEETaskManager, and client application
Exascale Computing Project milestone highlight slide.
97 MATHEMATICS AND COMPUTING↗
Side Channel Considerations for AES Intermediate Rounds
We illustrate a theoretical side-channel analysis on the intermediate rounds of AES, using only the Hamming weights of the bytes registered after the S-box operation. Input and output state values are unknown. Simulations and a blind test were used to show the feasibility of the analysis under ideal conditions. General applicability of the idea and possible extensions are discussed, as well as limiting assumptions. Some implementation approaches are described in Appendix A, in the case of constrained computing capabilities (desktop or laptop).
97 MATHEMATICS AND COMPUTING↗