Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and data structure”

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 469 records · Page 26

MO-F-CAMPUS-T-02: Optimizing Orientations of Hundreds of Intensity-Modulated Beams to Treat Multiple Brain Targets

Purpose: To investigate a new modulated beam orientation optimization (MBOO) approach maximizing treatment planning quality for the state-of-the-art flattening filter free (FFF) beam that has enabled rapid treatments of multiple brain targets. Methods: MBOO selects and optimizes a large number of intensity-modulated beams (400 or more) from all accessible beam angles surrounding a patient’s skull. The optimization algorithm was implemented on a standalone system that interfaced with the 3D Dicom images and structure sets. A standard published data set that consisted of 1 to 12 metastatic brain tumor combinations was selected for MBOO planning. The planning results from various coplanar and non-coplanar configurations via MBOO were then compared with the results obtained from a clinical volume modulated arc therapy (VMAT) delivery system (Truebeam RapidArc, Varian Oncology). Results: When planning a few number of targets (n<4), MBOO produced results equivalent to non-coplanar multi-arc VMAT planning in terms of target volume coverage and normal tissue sparing. For example, the 12-Gy and 4-Gy normal brain volumes for the 3-target plans differed by less than 1 mL ( 3.0 mLvs 3.8 mL; and 35.2 mL vs 36.3 mL, respectively) for MBOO versus VMAT. However, when planning a larger number of targets (n≥4), MBOO significantly reduced the dose to the normal brain as compared to VMAT, though the target volume coverage was equivalent. For example, the 12-Gy and 4-Gy normal brain volumes for the 12-target plans were 10.8 mL vs. 18.0 mL and 217.9 mL vs. 390.0 mL, respectively for the non-coplanar MBOO versus the non-coplanar VMAT treatment plans, yielding a reduction in volume of more than 60% for the case. Conclusion: MBOO is a unique approach for maximizing normal tissue sparing when treating a large number (n≥4) of brain tumors with FFF linear accelerators. Dr Ma and Dr Sahgal are currently on the board of international society of stereotactic radiosurgery. Dr Sahgal has received support for educational presentations from Elekta company.

60 APPLIED LIFE SCIENCES↗

Predictive Data Analytics Framework Using Advanced Test Reactor Acoustic Data

Although a nuclear reactor is a hostile environment for sensing and electrical communications, the reactor core is amenable to acoustic communication. An acoustic measurement infrastructure (AMI) has been installed at the Advanced Test Reactor (ATR) nozzle trench area to record acoustic signals that has the ability to capture different operating regime of the reactor. This AMI includes ATR in-pile structural components, coolant, acoustic receivers, primary coolant pumps (PCP) as signal sources, a data acquisition system, and signal-processing algorithms, enabling real-time. This report will discusses development of recursive Fast Fourier Transform approach to process in real-time acoustic signals, application of short time Fast Fourier Transform to the ATR brush data to understand the vibration level and to develop spectrograms for different primary coolant pump combinations. The combination of primary coolant pumps for normal and power axial locator mechanism of ATR are different and generates different signatures. These acoustic signatures were used to develop machine learning approaches to automatically classify different operating regimes. This lay the foundation for predictive analytic framework that can be leverage by ATR to optimize their operation and maintenance. The path forward involves continued engagement with ATR and expanded implementation of AMI and predictive framework at ATR and other facilities within INL and at other experimental reactors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Big Data in Reciprocal Space: Sliding Fast Fourier Transforms for Determining Periodicity

Significant advances in atomically resolved imaging of crystals and surfaces have occurred in the last decade allowing unprecedented insight into local crystal structures and periodicity. Yet, the analysis of the long-range periodicity from the local imaging data, critical to correlation of functional properties and chemistry to the local crystallography, remains a challenge. Here, we introduce a Sliding Fast Fourier Transform (FFT) filter to analyze atomically resolved images of in-situ grown La5/8Ca3/8MnO3 films. We demonstrate the ability of sliding FFT algorithm to differentiate two sub-lattices, resulting from a mixed-terminated surface. Principal Component Analysis (PCA) and Independent Component Analysis (ICA) of the Sliding FFT dataset reveal the distinct changes in crystallography, step edges and boundaries between the multiple sub-lattices. The method is universal for images with any periodicity, and is especially amenable to atomically resolved probe and electron-microscopy data for rapid identification of the sub-lattices present.

74 ATOMIC AND MOLECULAR PHYSICS↗

Super instruction architecture of petascale electronic structure software: the story

Theoretical methods in chemistry lead to algorithms for the computation of electronic energies and other properties of electronic wave functions that require large numbers of floating point operations and involve large data sets. Thus, computational chemists are very interested in using massively parallel computer systems and in particular the new petascale systems. In this paper we discuss a new programming paradigm that was developed at the Quantum Theory Project to construct electronic structure software that can scale to large numbers of cores of the order of 100,000 and beyond to solve problems in materials engineering relevant to the problems facing society today.

Chemistry↗

Reverse Monte Carlo modeling for low-dimensional systems

Reverse Monte Carlo (RMC) is one of the commonly used approaches for modeling total scattering data. However, to extend the capability of the RMC method for refining the structure of nanomaterials, the dimensionality and finite size need to be considered when calculating the pair distribution function (PDF). To achieve this, the simulation box must be set up to remove the periodic boundary condition in one, two or three of the dimensions. This then requires a correction to be applied for the difference in number density between the real system and the simulation box. In certain circumstances an analytical correction for the uncorrelated pairings of atoms is also applied. The validity and applicability of our methodology is demonstrated by applying the algorithms to simulate the PDF patterns of carbon systems with various dimensions, and also by using them to fit experimental data of CuO nanoparticles. This alternative approach for characterizing the local structure of nano-systems with the total scattering technique will be made available via the RMCProfile package. The theoretical formulation and detailed explanation of the analytical corrections for low-dimensional systems – 2D nanosheets, 1D nanowires and 0D nanoparticles – is also given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmarking the PCMCI Causal Discovery Algorithm for Spatiotemporal Systems

Causal discovery algorithms construct hypothesized causal graphs that depict causal dependencies among variables in observational data. While powerful, the accuracy of these algorithms is highly sensitive to the underlying dynamics of the system in ways that have not been fully characterized in the literature. In this report, we benchmark the PCMCI causal discovery algorithm in its application to gridded spatiotemporal systems. Effectively computing grid-level causal graphs on large grids will enable analysis of the causal impacts of transient and mobile spatial phenomena in large systems, such as the Earth’s climate. We evaluate the performance of PCMCI with a set of structural causal models, using simulated spatial vector autoregressive processes in one- and two-dimensions. We develop computational and analytical tools for characterizing these processes and their associated causal graphs. Our findings suggest that direct application of PCMCI is not suitable for the analysis of dynamical spatiotemporal gridded systems, such as climatological data, without significant preprocessing and downscaling of the data. PCMCI requires unrealistic sample sizes to achieve acceptable performance on even modestly sized problems and suffers from a notable curse of dimensionality. This work suggests that, even under generous structural assumptions, significant additional algorithmic improvements are needed before causal discovery algorithms can be reliably applied to grid-level outputs of earth system models.

54 ENVIRONMENTAL SCIENCES↗

Wind turbine blade shear web disbond detection using rotor blade operational sensing and data analysis

A wind turbine blade's structural dynamic response is simulated and analyzed with the goal of characterizing the presence and severity of a shear web disbond. Computer models of a 5 MW offshore utility-scale wind turbine were created to develop effective algorithms for detecting such damage. Through data analysis and with the use of blade measurements, a shear web disbond was quantified according to its length. An aerodynamic sensitivity study was conducted to ensure robustness of the detection algorithms. In all analyses, the blade's flap-wise acceleration and root-pitching moment were the clearest indicators of the presence and severity of a shear web disbond. A combination of blade and non-blade measurements was formulated into a final algorithm for the detection and quantification of the disbond. Here, the probability of detection was 100% for the optimized wind speed ranges in laminar, 30% horizontal shear and 60% horizontal shear conditions.

54 ENVIRONMENTAL SCIENCES↗

Dark matter voids in the SDSS galaxy survey

What do we know about voids in the dark matter distribution given the Sloan Digital Sky Survey (SDSS) and assuming the ΛCDM model? Recent application of the Bayesian inference algorithm BORG to the SDSS Data Release 7 main galaxy sample has generated detailed Eulerian and Lagrangian representations of the large-scale structure as well as the possibility to accurately quantify corresponding uncertainties. Building upon these results, we present constrained catalogs of voids in the Sloan volume, aiming at a physical representation of dark matter underdensities and at the alleviation of the problems due to sparsity and biasing on galaxy void catalogs. To do so, we generate data-constrained reconstructions of the presently observed large-scale structure using a fully non-linear gravitational model. We then find and analyze void candidates using the VIDE toolkit. Our methodology therefore predicts the properties of voids based on fusing prior information from simulations and data constraints. For usual void statistics (number function, ellipticity distribution and radial density profile), all the results obtained are in agreement with dark matter simulations. Our dark matter void candidates probe a deeper void hierarchy than voids directly based on the observed galaxies alone. The use of our catalogs therefore opens the way to high-precision void cosmology at the level of the dark matter field. We will make the void catalogs used in this work available at http://www.cosmicvoids.net.

79 ASTRONOMY AND ASTROPHYSICS↗

Robust Computation of Morse-Smale Complexes of Bilinear Functions

The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, existing algorithms to compute the MS complex are restricted to either piecewise linear or discrete scalar fields. This paper presents a new combinatorial algorithm to compute MS complexes for two dimensional piecewise bilinear functions defined on quadrilateral meshes. We derive a new invariant of the gradient flow within a bilinear cell and use it to develop a provably correct computation which is unaffected by numerical instabilities. This includes a combinatorial algorithm to detect and classify critical points as well as a way to determine the asymptotes of cell-based saddles and their intersection with cell edges. Finally, we introduce a simple data structure to compute and store integral lines on quadrilateral meshes which by construction prevents intersections and enables us to enforce constraints on the gradient flow to preserve known invariants.

97 MATHEMATICS AND COMPUTING↗

X-ray tomography of large objects with limited measurement angle

In this paper we present an efficient implementation of an algorithm for reconstructing a 3D volume from limited angle projection data, based on statistical inversion theory. We demonstrate the strength of the method for detecting structural defects in large composite aerospace components, whose dimensions prevent acquiring measurements over the full circle. In comparison with a number of other tomographic reconstruction methods that can be applied to the limited angle case, such as tomosynthesis or simultaneous algebraic reconstruction technique (SART), we achieve superior depth resolution with reduced noise and artifacts.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Filling data analysis gaps in time-resolved crystallography by machine learning

There is a growing understanding of the structural dynamics of biological molecules fueled by x-ray crystallography experiments. Time-resolved serial femtosecond crystallography (TR-SFX) with x-ray Free Electron Lasers allows the measurement of ultrafast structural changes in proteins. Nevertheless, this technique comes with some limitations. One major challenge is the quality of data from TR-SFX measurements, which often faces issues like data sparsity, partial recording of Bragg reflections, timing errors, and pixel noise. To overcome these difficulties, conventionally, large volumes of data are collected and grouped into a few temporal bins. The data in each bin are then averaged and paired with the mean of their corresponding jittered timestamps. This procedure provides one structure per bin, resulting in a limited number of averaged structures for the entire time interval spanned by the experiment. Therefore, the information on ultrafast structural dynamics at high temporal resolution is lost. This has initiated research for advanced methods of analyzing experimental TR-SFX data beyond the standard binning and averaging method. To address this problem, we use a machine learning algorithm called Nonlinear Laplacian Spectral Analysis (NLSA), which has emerged as a promising technique for studying the dynamics of complex systems. In this work, we demonstrate the power of this algorithm using synthetic x-ray diffraction snapshots from a protein with significant data incompleteness, timing uncertainties, and noise. Our study confirms that NLSA is a suitable approach that effectively mitigates the effects of these artifacts in TR-SFX data and recovers accurate structural dynamics information hidden in such data.

Trujillo, Justin (ORCID:0000000285505360)↗

Deformable complex network for refining low-resolution X-ray structures

A new refinement algorithm called the deformable complex network that combines a novel angular network-based restraint with a deformable elastic network model in the target function has been developed to aid in structural refinement in macromolecular X-ray crystallography. In macromolecular X-ray crystallography, building more accurate atomic models based on lower resolution experimental diffraction data remains a great challenge. Previous studies have used a deformable elastic network (DEN) model to aid in low-resolution structural refinement. In this study, the development of a new refinement algorithm called the deformable complex network (DCN) is reported that combines a novel angular network-based restraint with the DEN model in the target function. Testing of DCN on a wide range of low-resolution structures demonstrated that it constantly leads to significantly improved structural models as judged by multiple refinement criteria, thus representing a new effective refinement tool for low-resolution structural determination.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DES science portal: Computing photometric redshifts

We present the Dark Energy Survey (DES) Science Portal, an integratedweb-based data interface designed to facilitate scientific analysis. Wedemonstrate how the Portal can provide a reliable environment to accesscomplete data sets, provide validation algorithms and metrics in the case ofmultiple methods and training configurations, and maintain the provenancebetween the different steps of a complex calculation, while ensuringreproducibility of the results. We use the estimation of DES photometricredshifts (photo-$z$s) as an example. A significant challenge facingphotometric surveys for cosmological purposes, such as DES, is the need toproduce reliable redshift estimates. The choice between competing algorithmsand configurations and the maintenance of an up-to-date spectroscopic databaseto build training sets, for example, are complex tasks when dealing with largeamounts of data that are regularly updated and constantly growing. We show howthe DES Science Portal can be used to train and validate several photo-$z$algorithms using the DES first year (Y1A1) data. The photo-$z$s estimated inthe Portal are used to feed the creation of catalogs for scientific workflows.While the DES collaboration is still developing techniques to obtain precisephoto-$z$s, having a structured framework like the one presented here iscritical for the systematic vetting of DES algorithmic improvements and theconsistent production of photo-$z$s in future DES releases.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Nucleotide Docking: Prediction of Reactant State Complexes for Ribonuclease Enzymes

Ribonuclease enzymes (RNases) play key roles in the maturation and metabolism of all RNA molecules. Computational simulations of the processes involved can help to elucidate the underlying enzymatic mechanism and is often employed in a synergistic approach together with biochemical experiments. Theoretical calculations require atomistic details regarding the starting geometries of the molecules involved, which, in the absence of crystallographic data, can only be achieved from computational docking studies. Fortunately, docking algorithms have improved tremendously in recent years, so that reliable structures of enzyme-ligand complexes can now be successfully obtained from computation. However, most docking programs are not particularly optimized for nucleotide docking. In order to assist our studies on the cleavage of RNA by the two most important ribonuclease enzymes, RNase A and RNase H, we evaluated four docking tools - MOE2009, Glide 5.5, QXP-Flo+0802, and Autodock 4.0 - for their ability to simulate complexes between these enzymes and RNA oligomers. To validate our results, we analyzed the docking results with respect to the known key interactions between the protein and the nucleotide. In addition, we compared the predicted complexes with X-ray structures of the mutated enzyme as well as with structures obtained from previous calculations. In this manner, we were able to prepare the desired reaction state complex so that it could be used as the starting structure for further DFT/B3LYP QM/MM reaction mechanism studies.

59 BASIC BIOLOGICAL SCIENCES↗

Experimental Nuclear Reaction Data Uncertainties: Basic Concepts and Documentation

This paper has been written to provide experimental nuclear data researchers and data compilers with practical guidance on dealing with experimental nuclear reaction data uncertainties. It outlines some of the properties of random variables as well as principles of data uncertainty estimation, and illustrates them by means of simple examples which are relevant to the field of nuclear data. Emphasis is placed on the importance of generating mathematical models (or algorithms) that can adequately represent individual experiments for the purpose of estimating uncertainties in their results. Several types of uncertainties typically encountered in nuclear data experiments are discussed. The requirements and procedures for reporting information on measurement uncertainties for neutron reaction data, so that they will be useful in practical applications, are addressed. Consideration is given to the challenges and opportunities offered by reports, conference proceedings, journal articles, and computer libraries as vehicles for reporting and documenting numerical experimental data. Finally, contemporary formats used to compile reported experimental covariance data in the widely used library EXFOR are discussed, and several samples of EXFOR files are presented to demonstrate their use.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An automated miniature robotic vehicle inspection system

A novel, autonomous reconfigurable robotic inspection system for quantitative NDE mapping is presented. The system consists of a fleet of wireless (802.11g) miniature robotic vehicles, each approximately 175 × 125 × 85 mm with magnetic wheels that enable them to inspect industrial structures such as storage tanks, chimneys and large diameter pipe work. The robots carry one of a number of payloads including a two channel MFL sensor, a 5 MHz dry coupled UT thickness wheel probe and a machine vision camera that images the surface. The system creates an NDE map of the structure overlaying results onto a 3D model in real time. The authors provide an overview of the robot design, data fusion algorithms (positioning and NDE) and visualization software.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the rejection-based algorithm for simulation and analysis of large-scale reaction networks

Stochastic simulation for in silico studies of large biochemical networks requires a great amount of computational time. We recently proposed a new exact simulation algorithm, called the rejection-based stochastic simulation algorithm (RSSA) [Thanh et al., J. Chem. Phys. 141(13), 134116 (2014)], to improve simulation performance by postponing and collapsing as much as possible the propensity updates. In this paper, we analyze the performance of this algorithm in detail, and improve it for simulating large-scale biochemical reaction networks. We also present a new algorithm, called simultaneous RSSA (SRSSA), which generates many independent trajectories simultaneously for the analysis of the biochemical behavior. SRSSA improves simulation performance by utilizing a single data structure across simulations to select reaction firings and forming trajectories. The memory requirement for building and storing the data structure is thus independent of the number of trajectories. The updating of the data structure when needed is performed collectively in a single operation across the simulations. The trajectories generated by SRSSA are exact and independent of each other by exploiting the rejection-based mechanism. We test our new improvement on real biological systems with a wide range of reaction networks to demonstrate its applicability and efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗