Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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 1,549 records · Page 86

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Adiabatic quantum computing has evolved in recent years from a theoretical field into an immensely practical area, a change partially sparked by D-Wave System’s quantum annealing hardware. These multimillion-dollar quantum annealers offer the potential to solve optimization problems millions of times faster than classical heuristics, prompting researchers at Google, NASA and Lockheed Martin to study how these computers can be applied to complex real-world problems such as NASA rover missions. Unfortunately, compiling (embedding) an optimization problem into the annealing hardware is itself a difficult optimization problem and a major bottleneck currently preventing widespread adoption. Additionally, while finding a single embedding is difficult, no generalized method is known for tuning embeddings to use minimal hardware resources. To address these barriers, we introduce a graph-theoretic framework for developing structured embedding algorithms. Using this framework, we introduce a biclique virtual hardware layer to provide a simplified interface to the physical hardware. Additionally, we exploit bipartite structure in quantum programs using odd cycle transversal (OCT) decompositions. By coupling an OCT-based embedding algorithm with new, generalized reduction methods, we develop a new baseline for embedding a wide range of optimization problems into fault-free D-Wave annealing hardware. Furthermore, to encourage the reuse and extension of these techniques, we provide an implementation of the framework and embedding algorithms.

97 MATHEMATICS AND COMPUTING↗

Automated beam placement for breast radiotherapy using a support vector machine based algorithm

Purpose: To develop an automated beam placement technique for whole breast radiotherapy using tangential beams. We seek to find optimal parameters for tangential beams to cover the whole ipsilateral breast (WB) and minimize the dose to the organs at risk (OARs). Methods: A support vector machine (SVM) based method is proposed to determine the optimal posterior plane of the tangential beams. Relative significances of including/avoiding the volumes of interests are incorporated into the cost function of the SVM. After finding the optimal 3-D plane that separates the whole breast (WB) and the included clinical target volumes (CTVs) from the OARs, the gantry angle, collimator angle, and posterior jaw size of the tangential beams are derived from the separating plane equation. Dosimetric measures of the treatment plans determined by the automated method are compared with those obtained by applying manual beam placement by the physicians. The method can be further extended to use multileaf collimator (MLC) blocking by optimizing posterior MLC positions. Results: The plans for 36 patients (23 prone- and 13 supine-treated) with left breast cancer were analyzed. Our algorithm reduced the volume of the heart that receives >500 cGy dose (V5) from 2.7 to 1.7 cm{sup 3} (p = 0.058) on average and the volume of the ipsilateral lung that receives >1000 cGy dose (V10) from 55.2 to 40.7 cm{sup 3} (p = 0.0013). The dose coverage as measured by volume receiving >95% of the prescription dose (V95%) of the WB without a 5 mm superficial layer decreases by only 0.74% (p = 0.0002) and the V95% for the tumor bed with 1.5 cm margin remains unchanged. Conclusions: This study has demonstrated the feasibility of using a SVM-based algorithm to determine optimal beam placement without a physician's intervention. The proposed method reduced the dose to OARs, especially for supine treated patients, without any relevant degradation of dose homogeneity and coverage in general.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Final Report: Sampling-Based Algorithms for Estimating Structure in Big Data.

The purpose of this project was to develop sampling-based algorithms to discover hidden struc- ture in massive data sets. Inferring structure in large data sets is an increasingly common task in many critical national security applications. These data sets come from myriad sources, such as network traffic, sensor data, and data generated by large-scale simulations. They are often so large that traditional data mining techniques are time consuming or even infeasible. To address this problem, we focus on a class of algorithms that do not compute an exact answer, but instead use sampling to compute an approximate answer using fewer resources. The particular class of algorithms that we focus on are streaming algorithms , so called because they are designed to handle high-throughput streams of data. Streaming algorithms have only a small amount of working storage - much less than the size of the full data stream - so they must necessarily use sampling to approximate the correct answer. We present two results: * A streaming algorithm called HyperHeadTail , that estimates the degree distribution of a graph (i.e., the distribution of the number of connections for each node in a network). The degree distribution is a fundamental graph property, but prior work on estimating the degree distribution in a streaming setting was impractical for many real-world application. We improve upon prior work by developing an algorithm that can handle streams with repeated edges, and graph structures that evolve over time. * An algorithm for the task of maintaining a weighted subsample of items in a stream, when the items must be sampled according to their weight, and the weights are dynamically changing. To our knowledge, this is the first such algorithm designed for dynamically evolving weights. We expect it may be useful as a building block for other streaming algorithms on dynamic data sets.

97 MATHEMATICS AND COMPUTING↗

Calibration of Reduced Dynamic Models of Power Systems using Phasor Measurement Unit (PMU) Data

Accuracy of a power system dynamic model is essential to the secure and efficient operation of the system. Lower confidence on model accuracy usually leads to conservative operation and lowers asset usage. To improve model accuracy, identification algorithms have been developed to calibrate parameters of individual components using measurement data from staged tests. To facilitate online dynamic studies for large power system interconnections, this paper proposes a model reduction and calibration approach using phasor measurement unit (PMU) data. First, a model reduction method is used to reduce the number of dynamic components. Then, a calibration algorithm is developed to estimate parameters of the reduced model. This approach will help to maintain an accurate dynamic model suitable for online dynamic studies. The performance of the proposed method is verified through simulation studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Algorithm advances and applications of time‐dependent first‐principles simulations for ultrafast dynamics

Abstract Far from equilibrium phenomenon is a central theme of contemporary material research. Such phenomenon can exhibit itself in atomic structure and dynamics, but very often it also happens as non‐equilibrium phenomenon in the electronic structure. In ab initio material simulation, density functional theory (DFT) has played an essential role in studying electronic ground state problems. For excited states, besides many‐body perturbation theory, another powerful tool is the time dependent DFT (TDDFT) method. In particular, the real‐time TDDFT (rt‐TDDFT) method can be used to simulate many non‐equilibrium phenomena directly. Here we introduce our works on some algorithm advances based on our recently rt‐TDDFT method. This method uses the plane‐wave basis set, and significantly accelerates its efficiency by increasing the time step from 0.1–1 as in traditional methods to 0.2–0.5 fs. The noncollinear magnetic moments and spin–orbit coupling have also been included in our rt‐TDDFT method. Furthermore, a Boltzmann‐TDDFT algorithm has been developed to solve the hot carrier overheating problem in Ehrenfest dynamics, and a natural orbital branching algorithm has been developed to overcome the mean‐field approximation in Ehrenfest dynamics nuclear trajectory, thus allows stochastic multiple paths in chemical reactions. Utilizing these methods, we have studied the photoinduced ultrafast demagnetization, ultrafast phase transition, energy transfer between plasmon and hot carriers, as well as the high‐energy ion implantation and low‐energy atomic diffusion in semiconductors. We believe the tools as the ones introduced here can enable us to study a wide range of phenomena which are of great interest in modern day material research. This article is categorized under: Structure and Mechanism > Computational Materials Science Electronic Structure Theory > Ab Initio Electronic Structure Methods Electronic Structure Theory > Density Functional Theory

Liu, Wen‐Hao↗

The Pandora multi-algorithm approach to automated pattern recognition of cosmic-ray muon and neutrino events in the MicroBooNE detector

The development and operation of Liquid-Argon Time-Projection Chambers for neutrino physics has created a need for new approaches to pattern recognition in order to fully exploit the imaging capabilities offered by this technology. Whereas the human brain can excel at identifying features in the recorded events, it is a significant challenge to develop an automated, algorithmic solution. The Pandora Software Development Kit provides functionality to aid the design and implementation of pattern-recognition algorithms. It promotes the use of a multi-algorithm approach to pattern recognition, in which individual algorithms each address a specific task in a particular topology. Many tens of algorithms then carefully build up a picture of the event and, together, provide a robust automated pattern-recognition solution. This paper describes details of the chain of over one hundred Pandora algorithms and tools used to reconstruct cosmic-ray muon and neutrino events in the MicroBooNE detector. Metrics that assess the current pattern-recognition performance are presented for simulated MicroBooNE events, using a selection of final-state event topologies.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Forecasting district-scale energy dynamics through integrating building network and long short-term memory learning algorithm

With the development of data-driven techniques, building energy prediction on a district level has attracted increasing attention in recent years for revealing energy use patterns and reduction potentials. However, data acquisition in large building groups is difficult and adjacent buildings also interact with each other. To reduce data cost and incorporate the inter-building impact with the data-driven building energy model, this study proposes a deep learning predictive approach that fuses the building network model with a long short-term memory learning model for district-scale building energy modeling. The building network was constructed based on correlations between the energy use intensity of buildings, which can significantly reduce the computational complexity of the deep learning models for energy dynamic prediction. Five typical building groups with energy use data from 2015 to 2018 on two institutional campuses were selected to perform the validation experiment with TensorFlow. Based on the prediction error assessments, the results suggest that for total building energy use intensity prediction, the proposed model can achieve a mean absolute percentage error of 6.66% and a root mean square error of 0.36 kWh/m 2 , compared to 12.05% and 0.63 kWh/m 2 of the conventional artificial neural network model and to 11.06% and 0.89 kWh/m 2 for the support vector regression model.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A fast algorithm for sparse matrix computations related to inversion

We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G{sup r} and G{sup <} for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors stay at a reasonable level.

97 MATHEMATICS AND COMPUTING↗

Performance assessment of a real water source heat pump within a hardware-in-the-loop (HIL) testing environment

Over the last decade, the global fight against climate change through electrification has led to an increase in research on building heating, ventilation, and air conditioning (HVAC) systems that utilize intelligent control algorithms to provide demand-side grid service while also maintaining the thermal comfort of building occupants. As the pivotal point between building electricity consumption and indoor thermal comfort, high-efficiency electrical vapor-compression heat pumps are at the center of these emerging studies, and various grid-interactive and occupant-comfort control algorithms have been developed for them. The impact of these algorithms on heat pump operation and performance when subjected to different weather conditions, building loads, and grid requests calls for investigation and verification via experimental testing with actual heat pumps integrated with real-time building and grid responses. This study introduces a Water-Source Heat Pump (WSHP) Hardware-in-The-Loop (HIL) Test Facility that is the first of its kind. This testbed utilizes a 2-ton variable speed water-to-air heat pump that is capable of interacting with a virtual environment currently comprised of an EnergyPlus (E+) building simulation, an agent-based occupant behavioral model, and a single U-tube ground-loop heat exchanger (GLHE) model. Detailed descriptions of the testbed’s physical design and operation, virtual environment, as well as their mutual communication is provided. An uncertainty analysis is also performed under manufacturer specified heating and cooling design conditions. This analysis shows that the total load across the WSHP’s demand side heat exchanger, i.e., the sum of its latent and sensible components, can be measured with a relative uncertainty of ± 10.4% and ± 3.6% in cooling and heating mode respectively. The WSHP’s coefficient of performance (COP) can be measured with relative uncertainties of ± 10.4% in cooling mode, and ± 3.7% in heating mode. A preliminary 24-h experimental demonstration is then performed utilizing the DOE prototype small commercial office building model in E+. The simulation takes place in Atlanta, GA on the date of 08/26/15 from 12:00 AM to 11:59 PM using TMY3 weather data. Here, the results from this demonstration show that over the course of this experiment the simulated outputs of zone dry-bulb temperature, zone humidity ratio, and WSHP inlet water temperature can be tracked by testbed emulators up to a root mean squared error (RMSE) of ± 0.27 °C, ± 0.376 g/kg, and ± 0.85 °C respectively. The WSHP’s dynamic behavioral characteristics and performance are also captured, and correspond well with the authors’ previous understanding of heat pump efficiency as a function of evaporator and condenser fluid inlet conditions respectively.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Inhomogeneous phase shifting: an algorithm for nonconstant phase displacements

In this work, we have developed a different algorithm than the classical one on phase-shifting interferometry. These algorithms typically use constant or homogeneous phase displacements and they can be quite accurate and insensitive to detuning, taking appropriate weight factors in the formula to recover the wrapped phase. However, these algorithms have not been considered with variable or inhomogeneous displacements. We have generalized these formulas and obtained some expressions for an implementation with variable displacements and ways to get partially insensitive algorithms with respect to these arbitrary error shifts.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of an Outdoor Temperature Based Control Algorithm for Residential Mechanical Ventilation Control

The Incremental Ventilation Energy (IVE) model developed in this study combines the output of simple air exchange models with a limited set of housing characteristics to estimate the associated change in energy demand of homes. The IVE model was designed specifically to enable modellers to use existing databases of housing characteristics to determine the impact of ventilation policy change on a population scale. The IVE model estimates of energy change when applied to US homes with limited parameterisation are shown to be comparable to the estimates of a well-validated, complex residential energy model.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

In Situ Machine Learning for Intelligent Data Capture on Exascale Platforms. Final Report

In many dynamic systems, interesting events occur locally in time and space. Examples of such systems include ignition events in combustion simulations, material fractures in mechanics simulations, and extreme weather events in climate simulations. Due to memory constraints and data I/O costs, current simulation workflows save data at regularly spaced time-steps, at a fixed rate determined before the start of the simulation. Often this mode of operation results in missed events of interest, necessitating a simulation restart from before an event occurred with more frequent data saves. This data saving workflow is grossly inefficient and is already a bottleneck in the computing process. We propose to develop machine learning algorithms that can detect when interesting dynamical events are occurring, triggering data saves. These machine learning algorithms will perform in situ anomaly detection to flag regions with different dynamical properties than those previously recorded. The adaptive data saves would be local in time and space to match the event of interest, thereby enabling a much more efficient workflow that will reduce data I/O costs and data storage memory requirements. The algorithms will be tested on two applications: auto-ignition simulations and climate simulations. A critical component of this project will be developing machine learning algorithms that can be deployed efficiently in situ on HPC platforms with out-of-the-box functionality. The development of in situ machine learning methods to detect anomalous events would enable a more efficient and effective workflow, in which all the relevant data are saved in a single simulation run, without re-starts or scientist intervention.

42 ENGINEERING↗

High performance graphics processor based computed tomography reconstruction algorithms for nuclear and other large scale applications.

The goal of this work is to develop a fast computed tomography (CT) reconstruction algorithm based on graphics processing units (GPU) that achieves significant improvement over traditional central processing unit (CPU) based implementations. The main challenge in developing a CT algorithm that is capable of handling very large datasets is parallelizing the algorithm in such a way that data transfer does not hinder performance of the reconstruction algorithm. General Purpose Graphics Processing (GPGPU) is a new technology that the Science and Technology (S&T) community is starting to adopt in many fields where CPU-based computing is the norm. GPGPU programming requires a new approach to algorithm development that utilizes massively multi-threaded environments. Multi-threaded algorithms in general are difficult to optimize since performance bottlenecks occur that are non-existent in single-threaded algorithms such as memory latencies. If an efficient GPU-based CT reconstruction algorithm can be developed; computational times could be improved by a factor of 20. Additionally, cost benefits will be realized as commodity graphics hardware could potentially replace expensive supercomputers and high-end workstations. This project will take advantage of the CUDA programming environment and attempt to parallelize the task in such a way that multiple slices of the reconstruction volume are computed simultaneously. This work will also take advantage of the GPU memory by utilizing asynchronous memory transfers, GPU texture memory, and (when possible) pinned host memory so that the memory transfer bottleneck inherent to GPGPU is amortized. Additionally, this work will take advantage of GPU-specific hardware (i.e. fast texture memory, pixel-pipelines, hardware interpolators, and varying memory hierarchy) that will allow for additional performance improvements.

97 MATHEMATICS AND COMPUTING↗

TH-A-BRF-08: Deformable Registration of MRI and CT Images for MRI-Guided Radiation Therapy

Purpose: To evaluate the quality of a commercially available MRI-CT image registration algorithm and then develop a method to improve the performance of this algorithm for MRI-guided prostate radiotherapy. Methods: Prostate contours were delineated on ten pairs of MRI and CT images using Eclipse. Each pair of MRI and CT images was registered with an intensity-based B-spline algorithm implemented in Velocity. A rectangular prism that contains the prostate volume was partitioned into a tetrahedral mesh which was aligned to the CT image. A finite element method (FEM) was developed on the mesh with the boundary constraints assigned from the Velocity generated displacement vector field (DVF). The resultant FEM displacements were used to adjust the Velocity DVF within the prism. Point correspondences between the CT and MR images identified within the prism could be used as additional boundary constraints to enforce the model deformation. The FEM deformation field is smooth in the interior of the prism, and equal to the Velocity displacements at the boundary of the prism. To evaluate the Velocity and FEM registration results, three criteria were used: prostate volume conservation and center consistence under contour mapping, and unbalanced energy of their deformation maps. Results: With the DVFs generated by the Velocity and FEM simulations, the prostate contours were warped from MRI to CT images. With the Velocity DVFs, the prostate volumes changed 10.2% on average, in contrast to 1.8% induced by the FEM DVFs. The average of the center deviations was 0.36 and 0.27 cm, and the unbalance energy was 2.65 and 0.38 mJ/cc3 for the Velocity and FEM registrations, respectively. Conclusion: The adaptive FEM method developed can be used to reduce the error of the MIbased registration algorithm implemented in Velocity in the prostate region, and consequently may help improve the quality of MRI-guided radiation therapy.

60 APPLIED LIFE SCIENCES↗

A fast double template convolution isocenter evaluation algorithm with subpixel accuracy

Purpose: To design a fast Winston Lutz (fWL) algorithm for accurate analysis of radiation isocenter from images without edge detection or center of mass calculations. Methods: An algorithm has been developed to implement the Winston Lutz test for mechanical/radiation isocenter agreement using an electronic portal imaging device (EPID). The algorithm detects the position of the radiation shadow of a tungsten ball within a stereotactic cone. The fWL algorithm employs a double convolution to independently find the position of the sphere and cone centers. Subpixel estimation is used to achieve high accuracy. Results of the algorithm were compared to (1) a human observer with template guidance and (2) an edge detection/center of mass (edCOM) algorithm. Testing was performed with high resolution (0.05mm/px, film) and low resolution (0.78mm/px, EPID) image sets. Results: Sphere and cone center relative positions were calculated with the fWL algorithm for high resolution test images with an accuracy of 0.002{+-}0.061 mm compared to 0.042{+-}0.294 mm for the human observer, and 0.003{+-}0.038 mm for the edCOM algorithm. The fWL algorithm required 0.01 s per image compared to 5 s for the edCOM algorithm and 20 s for the human observer. For lower resolution images the fWL algorithm localized the centers with an accuracy of 0.083{+-}0.12 mm compared to 0.03{+-}0.5514 mm for the edCOM algorithm. Conclusions: A fast (subsecond) subpixel algorithm has been developed that can accurately determine the center locations of the ball and cone in Winston Lutz test images without edge detection or COM calculations.

60 APPLIED LIFE SCIENCES↗

Algorithms for X-Ray Imaging of Single Particles

Our group develops image reconstruction algorithms and applies them to data collected with x-ray sources (synchrotron, XFEL) and electron microscopes. Some of the challenges we face are (1) extremely low signal levels and noise, (2) missing information (phase, sample orientation), and (3) large, very sparse datasets. We have made significant progress in all three of these areas in our DOE project. This final report highlights two results produced during the extension of the project that proved to be spectacular successes. Publications and software products generated over the entire project period are listed at the end of the report.

97 MATHEMATICS AND COMPUTING↗

A new augmentation based algorithm for extracting maximal chordal subgraphs

If every cycle of a graph is chordal length greater than three then it contains an edge between non-adjacent vertices. Chordal graphs are of interest both theoretically, since they admit polynomial time solutions to a range of NP-hard graph problems, and practically, since they arise in many applications including sparse linear algebra, computer vision, and computational biology. A maximal chordal subgraph is a chordal subgraph that is not a proper subgraph of any other chordal subgraph. Existing algorithms for computing maximal chordal subgraphs depend on dynamically ordering the vertices, which is an inherently sequential process and therefore limits the algorithms’ parallelizability. In our paper we explore techniques to develop a scalable parallel algorithm for extracting a maximal chordal subgraph. We demonstrate that an earlier attempt at developing a parallel algorithm may induce a non-optimal vertex ordering and is therefore not guaranteed to terminate with a maximal chordal subgraph. We then give a new algorithm that first computes and then repeatedly augments a spanning chordal subgraph. After proving that the algorithm terminates with a maximal chordal subgraph, we then demonstrate that this algorithm is more amenable to parallelization and that the parallel version also terminates with a maximal chordal subgraph. That said, the complexity of the new algorithm is higher than that of the previous parallel algorithm, although the earlier algorithm computes a chordal subgraph which is not guaranteed to be maximal. Finally, we experimented with our augmentation-based algorithm on both synthetic and real-world graphs. We provide scalability results and also explore the effect of different choices for the initial spanning chordal subgraph on both the running time and on the number of edges in the maximal chordal subgraph.

97 MATHEMATICS AND COMPUTING↗

Spectral anomaly methods for aerial detection using KUT nuisance rejection

Aerial detection combines all the challenges of standoff detection with all the difficulties of mobile survey, including large and varying standoff distances and abrupt and significant changes in background. Critical issues for aerial detection include land-water interfaces, rapidly changing KUT backgrounds, and varying down scatter with altitude changes. To address these issues a spectral anomaly method has been adapted to aerial detection. The NSCRAD (Nuisance-Rejection Spectral Comparison Ratio) algorithm was initially developed at PNNL for medium resolution detectors. The algorithm has been used for a range of ground-based detection applications, including ground-based detection, portal monitoring, and OSI applications. The method used in NSCRAD includes both optimized energy windows for detection of threat sources and a nuisance rejection capability. Additionally, the spectral anomaly method was optimized in this work for aerial detection systems to increase the probability of detection of threat sources in aerial search while using the nuisance rejection capability to minimize false alarms from rapidly changing aerial background. The adaptation of NSCRAD for aerial detection includes re-optimization of energy windows, adapting KUT nuisance rejection for aerial backgrounds, development of new methods for background tracking and adjustment of tracking and detection thresholds.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗