Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Near-optimal routing of noisy quantum states

Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.

Sadlier III, Ronald↗
DOE OSTI2014

Control algorithms for dynamic attenuators

Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2014

SU-D-12A-05: Iterative Reconstruction Techniques to Enable Intrinsic Respiratory Gated CT in Mice

Purpose: Longitudinal studies of lung function in mice need the ability to image different phases of ventilation in free-breathing mice using retrospective gating. However, retrospective gating often produces under-sampled and uneven angular samples, resulting in severe reconstruction artifacts when using traditional FDK based reconstruction algorithms. We wanted to demonstrate the utility of iterative reconstruction method to enable intrinsic respiratory gating in small-animal CT. Methods: Free-breathing mice were imaged using a Siemens Inveon PET/micro-CT system. Evenly distributed projection images were acquired at 360 angles. Retrospective respiratory gating was performed using an intrinsic marker based on the average intensity in a region covering the diaphragm. Projections were classified into 4 and 6 phases (finer temporal resolution) resulting in 138 and 67 projections respectively. Reconstruction was carried out using 3 Methods: conventional FDK, iterative penalized least-square (PWLS) with total variation (TV), and PWLS with edge-preserving penalty. The performance of the methods was compared using contrast-to-noise (CNR) in a region of interest (ROI). Line profile through a specific region was plotted to evaluate the preserving of edges. Results: In both the cases with 4 and 6 phases, inadequate and non-uniform angular sampling results in artifacts using conventional FDK. However, such artifacts are minimized using both the iterative methods. Using both 4 and 6 phases, the iterative techniques outperformed FDK in terms of CNR and maintaining sharp edges. This is further evidenced especially with increased artifacts using FDK for 6 phases. Conclusion: This work indicates fewer artifacts and better image details can be achieved with iterative reconstruction methods in non-uniform under-sampled reconstruction. Using iterative methods can enable free-breathing intrinsic respiratory gating in small-animal CT. Further studies are needed to compare the computational complexity for large datasets.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

Dose reconstruction for real-time patient-specific dose estimation in CT

Purpose: Many recent computed tomography (CT) dose reduction approaches belong to one of three categories: statistical reconstruction algorithms, efficient x-ray detectors, and optimized CT acquisition schemes with precise control over the x-ray distribution. The latter category could greatly benefit from fast and accurate methods for dose estimation, which would enable real-time patient-specific protocol optimization. Methods: The authors present a new method for volumetrically reconstructing absorbed dose on a per-voxel basis, directly from the actual CT images. The authors’ specific implementation combines a distance-driven pencil-beam approach to model the first-order x-ray interactions with a set of Gaussian convolution kernels to model the higher-order x-ray interactions. The authors performed a number of 3D simulation experiments comparing the proposed method to a Monte Carlo based ground truth. Results: The authors’ results indicate that the proposed approach offers a good trade-off between accuracy and computational efficiency. The images show a good qualitative correspondence to Monte Carlo estimates. Preliminary quantitative results show errors below 10%, except in bone regions, where the authors see a bigger model mismatch. The computational complexity is similar to that of a low-resolution filtered-backprojection algorithm. Conclusions: The authors present a method for analytic dose reconstruction in CT, similar to the techniques used in radiation therapy planning with megavoltage energies. Future work will include refinements of the proposed method to improve the accuracy as well as a more extensive validation study. The proposed method is not intended to replace methods that track individual x-ray photons, but the authors expect that it may prove useful in applications where real-time patient-specific dose estimation is required.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

Calculation of the Influence of the Ion Current Density and Temperature on the Accumulation Kinetics of Point Defects under the Irradiation of Si with Light Ions

Numerical calculations of the accumulation kinetics of point defects—vacancies and divacancies—under the irradiation of Si with ions having masses of M{sub 1} ≤ 31 amu and energies of E ≤ 100 keV under various irradiation conditions are performed. The previously proposed diffusion-coagulation model is used without application of the “weak diffusion” approximation, which was performed during its analytical implementation. The main peculiarities of the dependences of the concentrations of vacancies and divacancies on the dose, ion-current density, and temperature under irradiation are analyzed. A physical interpretation of these results is given. The developed computing complex is rather flexible and makes it possible to analyze the influence of model input parameters by means of their variation and include additional processes into consideration if necessary.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗
DOE OSTI2020

Improving inference with matrix elements and machine learning

Particle physics processes bring together a high-energy amplitude described by quantum field theory and nonperturbative effects and detector interactions described by complex computer simulations. We review some recently developed multivariate inference techniques that leverage this structure and combine matrix-element information with machine learning. Automated by the MadMiner package, the new techniques have been applied to multiple problems in particle physics, allowing for stronger limits than traditional analysis methods and showing their potential to improve the sensitivity of the LHC legacy measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2017

DReAM: Demand Response Architecture for Multi-level District Heating and Cooling Networks

In this paper, we exploit the inherent hierarchy of heat exchangers in District Heating and Cooling (DHC) networks and propose DReAM, a novel Demand Response (DR) architecture for Multi-level DHC networks. DReAM serves to economize system operation while still respecting comfort requirements of individual consumers. Contrary to many present day DR schemes that work on a consumer level granularity, DReAM works at a level of hierarchy above buildings, i.e. substations that supply heat to a group of buildings. This improves the overall DR scalability and reduce the computational complexity. In the first step of the proposed approach, mathematical models of individual substations and their downstream networks are abstracted into appropriately constructed low-complexity structural forms. In the second step, this abstracted information is employed by the utility to perform DR optimization that determines the optimal heat inflow to individual substations rather than buildings, in order to achieve the targeted objectives across the network. We validate the proposed DReAM framework through experimental results under different scenarios on a test network.

Bhattacharya, Saptarshi↗
DOE OSTI2014

spammpack, Version 2013-06-18

This library is an implementation of the Sparse Approximate Matrix Multiplication (SpAMM) algorithm introduced. It provides a matrix data type, and an approximate matrix product, which exhibits linear scaling computational complexity for matrices with decay. The product error and the performance of the multiply can be tuned by choosing an appropriate tolerance. The library can be compiled for serial execution or parallel execution on shared memory systems with an OpenMP capable compiler

Source record↗
DOE OSTI2019

Contraction Optimizer v1.0

Code to perform operation count minimization for the evaluation of a large number of tensor contractions. A possible application is the efficient evaluation of correlation functions in lattice QCD calculations, where a reduction of computational complexity by an order of magnitude is achieved

Walker-Loud, Andre↗
DOE OSTI2012

Sensor Authentication: Embedded Processor Code

Described is the c code running on the embedded Microchip 32bit PIC32MX575F256H located on the INL developed noise analysis circuit board. The code performs the following functions: -Controls the noise analysis circuit board preamplifier voltage gains of 1, 10, 100, 000 -Initializes the analog to digital conversion hardware, input channel selection, Fast Fourier Transform (FFT) function, USB communications interface, and internal memory allocations -Initiates high resolution 4096 point 200 kHz data acquisition -Computes complex 2048 point FFT and FFT magnitude. -Services Host command set -Transfers raw data to Host -Transfers FFT result to host -Communication error checking

Svoboda, John↗
DOE OSTI2024

OpenStudio® HPXML workflow [SWR-25-13]

OpenStudio-HPXML allows running residential EnergyPlus™ simulations using an HPXML file for the building description. It is intended to be used by user interfaces or other automated software workflows that automatically produce the HPXML file. OpenStudio-HPXML can accommodate a wide range of different building technologies and geometries. End-to-end simulations typically run in 3-10 seconds, depending on complexity, computer platform and speed, etc. For more information on running simulations, generating HPXML files with the appropriate inputs to run EnergyPlus, etc., please visit the documentation linked below. https://openstudio-hpxml.readthedocs.io/en/latest

Horowitz, Scott↗
DOE OSTI2021

Non-intrusive nonlinear model reduction via machine learning approximations to low-dimensional operators

Abstract Although projection-based reduced-order models (ROMs) for parameterized nonlinear dynamical systems have demonstrated exciting results across a range of applications, their broad adoption has been limited by their intrusivity: implementing such a reduced-order model typically requires significant modifications to the underlying simulation code. To address this, we propose a method that enables traditionally intrusive reduced-order models to be accurately approximated in a non-intrusive manner. Specifically, the approach approximates the low-dimensional operators associated with projection-based reduced-order models (ROMs) using modern machine-learning regression techniques. The only requirement of the simulation code is the ability to export the velocity given the state and parameters; this functionality is used to train the approximated low-dimensional operators. In addition to enabling nonintrusivity, we demonstrate that the approach also leads to very low computational complexity, achieving up to $$10^3{\times }$$ 10 3 × in run time. We demonstrate the effectiveness of the proposed technique on two types of PDEs. The domain of applications include both parabolic and hyperbolic PDEs, regardless of the dimension of full-order models (FOMs).

42 ENGINEERING↗
DOE OSTI2024

Forward variable selection enables fast and accurate dynamic system identification with Karhunen-Loève decomposed Gaussian processes

A promising approach for scalable Gaussian processes (GPs) is the Karhunen-Loève (KL) decomposition, in which the GP kernel is represented by a set of basis functions which are the eigenfunctions of the kernel operator. Such decomposed kernels have the potential to be very fast, and do not depend on the selection of a reduced set of inducing points. However KL decompositions lead to high dimensionality, and variable selection thus becomes paramount. This paper reports a new method of forward variable selection, enabled by the ordered nature of the basis functions in the KL expansion of the Bayesian Smoothing Spline ANOVA kernel (BSS-ANOVA), coupled with fast Gibbs sampling in a fully Bayesian approach. It quickly and effectively limits the number of terms, yielding a method with competitive accuracies, training and inference times for tabular datasets of low feature set dimensionality. Theoretical computational complexities are O ( N P 2 ) in training and O ( P ) per point in inference, where N is the number of instances and P the number of expansion terms. The inference speed and accuracy makes the method especially useful for dynamic systems identification, by modeling the dynamics in the tangent space as a static problem, then integrating the learned dynamics using a high-order scheme. The methods are demonstrated on two dynamic datasets: a ‘Susceptible, Infected, Recovered’ (SIR) toy problem, along with the experimental ‘Cascaded Tanks’ benchmark dataset. Comparisons on the static prediction of time derivatives are made with a random forest (RF), a residual neural network (ResNet), and the Orthogonal Additive Kernel (OAK) inducing points scalable GP, while for the timeseries prediction comparisons are made with LSTM and GRU recurrent neural networks (RNNs) along with the SINDy package.

Hayes, Kyle↗
DOE OSTI2011

Secure Data Transfer Guidance for Industrial Control and SCADA Systems

This document was developed to provide guidance for the implementation of secure data transfer in a complex computational infrastructure representative of the electric power and oil and natural gas enterprises and the control systems they implement. For the past 20 years the cyber security community has focused on preventative measures intended to keep systems secure by providing a hard outer shell that is difficult to penetrate. Over time, the hard exterior, soft interior focus changed to focus on defense-in-depth adding multiple layers of protection, introducing intrusion detection systems, more effective incident response and cleanup, and many other security measures. Despite much larger expenditures and more layers of defense, successful attacks have only increased in number and severity. Consequently, it is time to re-focus the conventional approach to cyber security. While it is still important to implement measures to keep intruders out, a new protection paradigm is warranted that is aimed at discovering attempted or real compromises as early as possible. Put simply, organizations should take as fact that they have been, are now, or will be compromised. These compromises may be intended to steal information for financial gain as in the theft of intellectual property or credentials that lead to the theft of financial resources, or to lie silent until instructed to cause physical or electronic damage and/or denial of services. This change in outlook has been recently confirmed by the National Security Agency [19]. The discovery of attempted and actual compromises requires an increased focus on monitoring events by manual and/or automated log monitoring, detecting unauthorized changes to a system's hardware and/or software, detecting intrusions, and/or discovering the exfiltration of sensitive information and/or attempts to send inappropriate commands to ICS/SCADA (Industrial Control System/Supervisory Control And Data Acquisition) systems.

03 NATURAL GAS↗
DOE OSTI2012

Oak Ridge National Laboratory Annual Sustainability Report 2010-2011

The mission of Oak Ridge National Laboratory (ORNL) is to deliver scientific discoveries and technical breakthroughs that will accelerate the development and deployment of solutions in clean energy and global security, and in doing so create economic opportunity for the nation. To execute this mission, ORNL integrates and applies distinctive core capabilities that provide it with signature strengths in neutron scattering, advanced materials, high-performance computing, and nuclear science and engineering. The intended outcome is to produce transformational innovations that will enable a 21st century industrial revolution. Managed by UT-Battelle, a partnership of the University of Tennessee (UT) and Battelle Memorial Institute, ORNL was established in 1943 to support the Manhattan Project. From an early focus on chemical technology and reactor development, ORNL’s research and development (R&D) portfolio broadened to include programs supporting DOE missions in scientific discovery and innovation, clean energy, and nuclear security. Today, as DOE’s largest science and energy laboratory, ORNL is engaged in programs and partnerships that leverage major national investments in critical research infrastructure, including the world’s foremost resources for neutron sciences, the Spallation Neutron Source (SNS) and the High Flux Isotope Reactor (HFIR), and the nation’s most powerful scientific computing complex. ORNL also manages the U.S. ITER project for DOE. Each year, ORNL hosts thousands of facility users and visiting scientists, many of whom perform work at its 10 user facilities, and supports the development of the next generation of scientific and technical talent. ORNL has a staff of about 4,400 and an annual budget of more than $\$$1.6 billion. The Laboratory’s extensive capabilities for scientific discovery and innovation are applied to the delivery of mission outcomes for DOE and other sponsors.

Lapsa, Melissa Voss↗
DOE OSTI2011

Applying graph partitioning methods in measurement-based dynamic load balancing

Load imbalance leads to an increasing waste of resources as an application is scaled to more and more processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. However, finding near-optimal solutions to this problem for complex computational science and engineering applications is becoming increasingly important. Charm++, a migratable objects based programming model, provides a measurement-based dynamic load balancing framework. This framework instruments and then migrates over-decomposed objects to balance computational load and communication at runtime. This paper explores the use of graph partitioning algorithms, traditionally used for partitioning physical domains/meshes, for measurement-based dynamic load balancing of parallel applications. In particular, we present repartitioning methods developed in a graph partitioning toolbox called SCOTCH that consider the previous mapping to minimize migration costs. We also discuss a new imbalance reduction algorithm for graphs with irregular load distributions. We compare several load balancing algorithms using microbenchmarks on Intrepid and Ranger and evaluate the effect of communication, number of cores and number of objects on the benefit achieved from load balancing. New algorithms developed in SCOTCH lead to better performance compared to the METIS partitioners for several cases, both in terms of the application execution time and fewer number of objects migrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Data Assimilation - Advances and Applications

This presentation provides an overview of data assimilation (model calibration) for complex computer experiments. Calibration refers to the process of probabilistically constraining uncertain physics/engineering model inputs to be consistent with observed experimental data. An initial probability distribution for these parameters is updated using the experimental information. Utilization of surrogate models and empirical adjustment for model form error in code calibration form the basis for the statistical methodology considered. The role of probabilistic code calibration in supporting code validation is discussed. Incorporation of model form uncertainty in rigorous uncertainty quantification (UQ) analyses is also addressed. Design criteria used within a batch sequential design algorithm are introduced for efficiently achieving predictive maturity and improved code calibration. Predictive maturity refers to obtaining stable predictive inference with calibrated computer codes. These approaches allow for augmentation of initial experiment designs for collecting new physical data. A standard framework for data assimilation is presented and techniques for updating the posterior distribution of the state variables based on particle filtering and the ensemble Kalman filter are introduced.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗