Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 235 records · Page 13

Comparison of the attempts of quantum discord and quantum entanglement to capture quantum correlations

Measurements of quantum systems disturb their states. To quantify this nonclassical characteristic, Zurek and Ollivier [Phys. Rev. Lett. 88, 017901 (2001)] introduced the quantum discord, a quantum correlation that can be nonzero even when entanglement in the system is zero. Discord has aroused great interest as a resource that is more robust against the effects of decoherence and offers the exponential speed-up of certain computational algorithms. Here, we study general two-level bipartite systems and give general results on the relationship between discord, entanglement, and linear entropy. We also identify the states for which discord takes a maximal value for a given entropy or entanglement, thus placing strong bounds on entanglement-discord and entropy-discord relations. We find out that although discord and entanglement are identical for pure states, they differ when generalized to mixed states as a result of the difference in the method of generalization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Plane wave transport method for low symmetry lattices and its application

The existing first-principles plane wave transport method implementation \cite{,choi-1,qe} has the limitation that it only allows transport directions along lattice vectors perpendicular to the basal plane formed by two other lattice vectors. We generalize the algorithm to low symmetry, nonorthogonal lattices thus allowing solution to problems in which the transport direction is not along any lattice vectors. As an application, we calculate the transmission and reflection coefficients, and determine interface resistance of various grain boundaries in crystalline copper.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Discrete gravity with local Lorentz invariance

A novel structure-preserving algorithm for general relativity in vacuum is derived from a lattice gauge theoretic discretization of the tetradic Palatini action. Here, the resulting model of discrete gravity is demonstrated to preserve local Lorentz invariance and symplectic structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phase Space Reconstruction from Accelerator Beam Measurements Using Neural Networks and Differentiable Simulations

Characterizing the phase space distribution of particle beams in accelerators is a central part of accelerator understanding and performance optimization. However, conventional reconstruction-based techniques either use simplifying assumptions or require specialized diagnostics to infer high-dimensional (> $2D$) beam properties. In this Letter, we introduce a general-purpose algorithm that combines neural networks with differentiable particle tracking to efficiently reconstruct high-dimensional phase space distributions without using specialized beam diagnostics or beam manipulations. Furthermore, we demonstrate that our algorithm accurately reconstructs detailed 4D phase space distributions with corresponding confidence intervals in both simulation and experiment using a single focusing quadrupole and diagnostic screen. This technique allows for the measurement of multiple correlated phase spaces simultaneously, which will enable simplified 6D phase space distribution reconstructions in the future.

47 OTHER INSTRUMENTATION↗

Opportunities for Price Manipulation by Aggregators in Electricity Markets

Aggregators of distributed generation are playing an increasingly crucial role in the integration of renewable energy in power systems. However, the intermittent nature of renewable generation makes market interactions of aggregators difficult to monitor and regulate, raising concerns about potential market manipulation by aggregators. In this paper, we study this issue by quantifying the profit an aggregator can obtain through strategic curtailment of generation in an electricity market. We show that, while the problem of maximizing the benefit from curtailment is hard in general, efficient algorithms exist when the topology of the network is radial (acyclic). Further, we highlight that significant increases in profit are possible via strategic curtailment in practical settings.

Azizan Ruhi, Navid (ORCID:0000000242992963)↗

A hybrid approach for rapid, accurate, and direct kilovoltage radiation dose calculations in CT voxel space

Purpose: To develop and validate a fast and accurate method that uses computed tomography (CT) voxel data to estimate absorbed radiation dose at a point of interest (POI) or series of POIs from a kilovoltage (kV) imaging procedure. Methods: The authors developed an approach that computes absorbed radiation dose at a POI by numerically evaluating the linear Boltzmann transport equation (LBTE) using a combination of deterministic and Monte Carlo (MC) techniques. This hybrid approach accounts for material heterogeneity with a level of accuracy comparable to the general MC algorithms. Also, the dose at a POI is computed within seconds using the Intel Core i7 CPU 920 2.67 GHz quad core architecture, and the calculations are performed using CT voxel data, making it flexible and feasible for clinical applications. To validate the method, the authors constructed and acquired a CT scan of a heterogeneous block phantom consisting of a succession of slab densities: Tissue (1.29 cm), bone (2.42 cm), lung (4.84 cm), bone (1.37 cm), and tissue (4.84 cm). Using the hybrid transport method, the authors computed the absorbed doses at a set of points along the central axis and x direction of the phantom for an isotropic 125 kVp photon spectral point source located along the central axis 92.7 cm above the phantom surface. The accuracy of the results was compared to those computed with MCNP, which was cross-validated with EGSnrc, and served as the benchmark for validation. Results: The error in the depth dose ranged from -1.45% to +1.39% with a mean and standard deviation of -0.12% and 0.66%, respectively. The error in the x profile ranged from -1.3% to +0.9%, with standard deviations of -0.3% and 0.5%, respectively. The number of photons required to achieve these results was 1x10{sup 6}. Conclusions: The voxel-based hybrid method evaluates the LBTE rapidly and accurately to estimate the absorbed x-ray dose at any POI or series of POIs from a kV imaging procedure.

60 APPLIED LIFE SCIENCES↗

Avatar Tools

Supervised machine learning is the process of using past experience to predict the future. "Ensembles" are a machine-learning meta-method that can be applied to most machine learning algorithms. Ensembles generally greatly improve accuracy, reduce or remove most of the design issues presented by machine learning, and are admirably suited to parallel and distributed computation. The Avatar Tools codes are an implementation of ensembles specifically for decision trees. Some features that distinguish Avatar Tools from other "ensembles for decision trees" codes are: (1) Does the bookkeeping necessary for out of bag (OOB) validation. (2) Can use OOB validation to automatically determine optimal ensemble size. (3) Provides an MPI-based parallel implementation, for distributed operation. (4) Provides convenient tools for cross-validation, to assess the accuracy provided by a training set. SAND2020-3858 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Siefert, Christopher↗

Learning Planar Ising Models Software

Learning Planar Ising Models is a software package written in Matlab for learning relationships among variable in a dataset using graphical models. The software package implements a generally-applicable algorithm for learning planar Ising models from any multivariate dataset. The code provides an algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. The software includes demonstrations of the algorithm in simulations and for applications on publicly available datasets. Details of the algorithm, demonstration simulations, and applications are given in Johnson, et al; 2016. Reference: Johnson, J. K., Oyen, D., Chertkov, M., and Netrapalli, P. (2016). Learning planar Ising models. Journal of Machine Learning Research.

Oyen, Diane↗

Automated Identification of Characteristic Droplet Size Distributions in Stratocumulus Clouds Utilizing a Data Clustering Algorithm

Abstract Droplet-level interactions in clouds are often parameterized by a modified gamma fitted to a “global” droplet size distribution. Do “local” droplet size distributions of relevance to microphysical processes look like these average distributions? This paper describes an algorithm to search and classify characteristic size distributions within a cloud. The approach combines hypothesis testing, specifically, the Kolmogorov–Smirnov (KS) test, and a widely used class of machine learning algorithms for identifying clusters of samples with similar properties: density-based spatial clustering of applications with noise (DBSCAN) is used as the specific example for illustration. The two-sample KS test does not presume any specific distribution, is parameter free, and avoids biases from binning. Importantly, the number of clusters is not an input parameter of the DBSCAN-type algorithms but is independently determined in an unsupervised fashion. As implemented, it works on an abstract space from the KS test results, and hence spatial correlation is not required for a cluster. The method is explored using data obtained from the Holographic Detector for Clouds (HOLODEC) deployed during the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) field campaign. The algorithm identifies evidence of the existence of clusters of nearly identical local size distributions. It is found that cloud segments have as few as one and as many as seven characteristic size distributions. To validate the algorithm’s robustness, it is tested on a synthetic dataset and successfully identifies the predefined distributions at plausible noise levels. The algorithm is general and is expected to be useful in other applications, such as remote sensing of cloud and rain properties. Significance Statement A typical cloud can have billions of drops spread over tens or hundreds of kilometers in space. Keeping track of the sizes, positions, and interactions of all of these droplets is impractical, and, as such, information about the relative abundance of large and small drops is typically quantified with a “size distribution.” Droplets in a cloud interact locally, however, so this work is motivated by the question of whether the cloud droplet size distribution is different in different parts of a cloud. A new method, based on hypothesis testing and machine learning, determines how many different size distributions are contained in a given cloud. This is important because the size distribution describes processes such as cloud droplet growth and light transmission through clouds.

54 ENVIRONMENTAL SCIENCES↗

MULTI-OBJECTIVE ONLINE OPTIMIZATION OF BEAM LIFETIME AT APS

In this paper, online optimization of beam lifetime at the APS (Advanced Photon Source) storage ring is presented. A general genetic algorithm (GA) is developed and employed for some online optimizations in the APS storage ring. Sextupole magnets in 40 sectors of the APS storage ring are employed as variables for the online nonlinear beam dynamics optimization. The algorithm employs several optimization objectives and is designed to run with topup mode or beam current decay mode. Up to 50\% improvement of beam lifetime is demonstrated, without affecting the transverse beam sizes and other relevant parameters. In some cases, the top-up injection efficiency is also improved.

APS↗

Multi-Reactor Transmutation Analysis Utility (MRTAU,alpha1): Verification

Multi-Reactor Transmutation Utility (MRTAU) is a general depletion/decay algorithm under development at INL to support quick assessment of off-normal fuel cycle scenarios of similar nature to well studied reactor and fuel cycle concepts for which isotopic and cross-section data exists. MRTAU has been used in the past for scoping calculations to determine actinide composition evolution over the course of multiple recycles in Light Water Reactor Mixed Oxide and Sodium cooled Fast Reactor. In these applications, various actinide partitioning scenarios of interest were considered. The code has recently been expanded to include fission product generation, depletion and isotopic evolution over multiple recycles. The capability was added to investigate potential partial separations and/or limited recycling technologies such as Melt-Refining, AIROX, DUPIC or other fuel recycle technology where the recycled fuel stream is not completely decontaminated of fission products prior to being re-irradiated in a subsequent reactor pass. This report documents the code's solution methodology and algorithm as well as its solution accuracy compared to the SCALE6.0 software suite.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DoE Phase II SBIR: Spectrally-Assisted Vehicle Tracking

The goal of this Phase II SBIR is to develop a prototype software package to demonstrate spectrally-aided vehicle tracking performance. The primary application is to demonstrate improved target vehicle tracking performance in complex environments where traditional spatial tracker systems may show reduced performance. Example scenarios in Figure 1 include a) the target vehicle obscured by a large structure for an extended period of time, or b), the target engaging in extreme maneuvers amongst other civilian vehicles. The target information derived from spatial processing is unable to differentiate between the green versus the red vehicle. Spectral signature exploitation enables comparison of new candidate targets with existing track signatures. The ambiguity in this confusing scenario is resolved by folding spectral analysis results into each target nomination and association processes. Figure 3 shows a number of example spectral signatures from a variety of natural and man-made materials. The work performed over the two-year effort was divided into three general areas: algorithm refinement, software prototype development, and prototype performance demonstration. The tasks performed under this Phase II to accomplish the program goals were as follows: 1. Acquire relevant vehicle target datasets to support prototype. 2. Refine algorithms for target spectral feature exploitation. 3. Implement a prototype multi-hypothesis target tracking software package. 4. Demonstrate and quantify tracking performance using relevant data.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Tools and Models for Integrating Multiple Cellular Networks

In this grant, we have systematically investigated the integrated networks, which are responsible for the coordination of activity between metabolic pathways in prokaryotes. We have developed several computational tools to analyze the topology of the integrated networks consisting of metabolic, regulatory, and physical interaction networks. The tools are all open-source, and they are available to download from Github, and can be incorporated in the Knowledgebase. Here, we summarize our work as follow. Understanding the topology of the integrated networks is the first step toward understanding its dynamics and evolution. For Aim 1 of this grant, we have developed a novel algorithm to determine and measure the hierarchical structure of transcriptional regulatory networks [1]. The hierarchy captures the direction of information flow in the network. The algorithm is generally applicable to regulatory networks in prokaryotes, yeast and higher organisms. Integrated datasets are extremely beneficial in understanding the biology of a system in a compact manner due to the conflation of multiple layers of information. Therefore for Aim 2 of this grant, we have developed several tools and carried out analysis for integrating system-wide genomic information. To make use of the structural data, we have developed DynaSIN for protein-protein interactions networks with various dynamical interfaces [2]. We then examined the association between network topology with phenotypic effects such as gene essentiality. In particular, we have organized E. coli and S. cerevisiae transcriptional regulatory networks into hierarchies. We then correlated gene phenotypic effects by tinkering with different layers to elucidate which layers were more tolerant to perturbations [3]. In the context of evolution, we also developed a workflow to guide the comparison between different types of biological networks across various species using the concept of rewiring [4], and Furthermore, we have developed CRIT for correlation analysis in systems biology [5]. For Aim 3, we have further investigated the scaling relationship that the number of Transcription Factors (TFs) in a genome is proportional to the square of the total number of genes. We have extended the analysis from transcription factors to various classes of functional categories, and from individual categories to joint distribution [6]. By introducing a new analytical framework, we have generalized the original toolbox model to take into account of metabolic network with arbitrary network topology [7].

09 BIOMASS FUELS↗

The Coal-Seq III Consortium. Advancing the Science of CO 2 Sequestration in Coal Seam and Gas Shale Reservoirs

The Coal-Seq consortium is a government-industry collaborative that was initially launched in 2000 as a U.S. Department of Energy sponsored investigation into CO2 sequestration in deep, unmineable coal seams. The consortium’s objective aimed to advancing industry’s understanding of complex coalbed methane and gas shale reservoir behavior in the presence of multi-component gases via laboratory experiments, theoretical model development and field validation studies. Research from this collaborative effort was utilized to produce modules to enhance reservoir simulation and modeling capabilities to assess the technical and economic potential for CO2 storage and enhanced coalbed methane recovery in coal basins. Coal-Seq Phase 3 expands upon the learnings garnered from Phase 1 & 2, which has led to further investigation into refined model development related to multicomponent equations-of-state, sorption and diffusion behavior, geomechanical and permeability studies, technical and economic feasibility studies for major international coal basins the extension of the work to gas shale reservoirs, and continued global technology exchange. The first research objective assesses changes in coal and shale properties with exposure to CO2 under field replicated conditions. Results indicate that no significant weakening occurs when coal and shale were exposed to CO2, therefore, there was no need to account for mechanical weakening of coal due to the injection of CO2 for modeling. The second major research objective evaluates cleat, Cp, and matrix, Cm, swelling/shrinkage compressibility under field replicated conditions. The experimental studies found that both Cp and Cm vary due to changes in reservoir pressure during injection and depletion under field replicated conditions. Using laboratory data from this study, a compressibility model was developed to predict the pore-volume compressibility, Cp, and the matrix compressibility, Cm, of coal and shale, which was applied to modeling software to enhance model robustness. Research was also conducted to improve algorithms and generalized adsorption models to facilitate realistic simulation of CO2 sequestration in coal seams and shale gas reservoirs. The interaction among water and the adsorbed gases, carbon dioxide (CO2), methane (CH4), and nitrogen (N2) in coalbeds is examined using experimental in situ laboratory techniques to comprehensively model CBM production and CO2 sequestration in coals. An equation of state (EOS) module was developed which is capable of predicting the density of pure components and mixtures involving the wet CBM gases CH4, CO2, and N2 at typical reservoir condition, and is used to inform CO2 injection models. The final research objective examined the effects adsorbed CO2 has on coal strength and permeability. This research studied the weakening or failure of coal by the adsorption of CO2 from empirically derived gas production data to develop models for advanced modeling of permeability changes during CO2 sequestration. The results of this research effort have been used to construct a new and improved model for assessing changes in permeability of coal reservoirs due CO2 injection. The modules developed from these studies and knowledge learned are applied to field validation and basin assessment studies. These data were used to assess the flow and storage of CO2 in a shale reservoir, test newly developed code against large-scale projects, and conduct a basin-oriented review of coal storage potential in the San Juan Basin. The storage potential and flow of CO2 was modeled for shale sequestration of a proprietary Marcellus Shale horizontal gas production well using COMET3 simulation software. Simulation results from five model runs indicate that stored CO2 quantities are linked to the duration of primary production preceding injection. Matrix CO2 saturation is observed to increase in each shale zone after injection with an increase in primary production, and the size of the CO2 plume is also observed to increase in size the longer initial production is sustained. The simulation modules developed around the Coal-Seq experimental work are also incorporated into a pre-existing large-scale numerical simulation model of the Pump Canyon CO2-ECBM pilot in the San Juan Basin. The new model was applied to re-history match the data set to explore the improvements made in permeability prediction against previously published data sets and to validate this module. The assessment of the new data, however, indicates that the impact of the variable Cp is negligible on the overall behavior of the coal for CO2 storage purposes. Applying these new modules, the San Juan Basin and the Marcellus Shale are assessed for their technical ECBM/AGR and CO2 storage potential and the economic potential of these operations. The San Juan Basin was divided into 4 unique geographic zones based on production history, and the Marcellus was divided into nine. Each was assessed based upon each zone’s properties, and simulations were run to assess the potential of full Basin development. Models of a fully developed San Juan Basin suggest the potential for up to 104 Tcf of CO2 storage, and 12.3 Tcf of methane recovery. The Marcellus models suggest 1,248 Tcf of CO2 storage and 924 Tcf of AGR. The economics are deemed favorable where credits cover the cost of CO2 in the San Juan Basin, and in many cases in the Marcellus, but to maximize storage potential, credits need to extend to pay the operator to store CO2.

01 COAL, LIGNITE, AND PEAT↗

Final Report: Quantification of Uncertainty in Extreme Scale Computations (QUEST)

QUEST (\url{www.quest-scidac.org}) is a SciDAC Institute that is focused on uncertainty quantification (UQ) in large-scale scientific computations. Our goals are to (1) advance the state of the art in UQ mathematics, algorithms, and software; and (2) provide modeling, algorithmic, and general UQ expertise, together with software tools, to other SciDAC projects, thereby enabling and guiding a broad range of UQ activities in their respective contexts. QUEST is a collaboration among six institutions (Sandia National Laboratories, Los Alamos National Laboratory, the University of Southern California, Massachusetts Institute of Technology, the University of Texas at Austin, and Duke University) with a history of joint UQ research. Our vision encompasses all aspects of UQ in leadership-class computing. This includes the well-founded setup of UQ problems; characterization of the input space given available data/information; local and global sensitivity analysis; adaptive dimensionality and order reduction; forward and inverse propagation of uncertainty; handling of application code failures, missing data, and hardware/software fault tolerance; and model inadequacy, comparison, validation, selection, and averaging. The nature of the UQ problem requires the seamless combination of data, models, and information across this landscape in a manner that provides a self-consistent quantification of requisite uncertainties in predictions from computational models. Accordingly, our UQ methods and tools span an interdisciplinary space across applied math, information theory, and statistics. The MIT QUEST effort centers on statistical inference and methods for surrogate or reduced-order modeling. MIT personnel have been responsible for the development of adaptive sampling methods, methods for approximating computationally intensive models, and software for both forward uncertainty propagation and statistical inverse problems. A key software product of the MIT QUEST effort is the MIT Uncertainty Quantification library, called MUQ (\url{muq.mit.edu}).

97 MATHEMATICS AND COMPUTING↗

A search for resonant Z pair production

I describe a search for anomalous production of Z pairs through a new massive resonance X in 2.5-2.9 fb -1 of p$\bar{p}$ collisions at √s = 1.96 TeV using the CDFII Detector at the Fermilab Tevatron. I reconstruct Z pairs through their decays to electrons, muons, and quarks. To achieve perhaps the most efficient lepton reconstruction ever used at CDF, I apply a thorough understanding of the detector and new reconstruction software heavily revised for this purpose. In particular, I have designed and employ new general-purpose algorithms for tracking at large η in order to increase muon acceptance. Upon analyzing the unblinded signal samples, I observe no X → ZZ candidates and set upper limits on the production cross section using a Kaluza-Klein graviton-like acceptance.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A general higher-order remap algorithm for ALE calculations

A numerical technique for solving the equations of fluid dynamics with arbitrary mesh motion is presented. The three phases of the Arbitrary Lagrangian Eulerian (ALE) methodology are outlined: the Lagrangian phase, grid relaxation phase and remap phase. The Lagrangian phase follows a well known approach from the HEMP code; in addition the strain rate andflow divergence are calculated in a consistent manner according to Margolin. A donor cell method from the SALE code forms the basis of the remap step, but unlike SALE a higher order correction based on monotone gradients is also added to the remap. Four test problems were explored to evaluate the fidelity of these numerical techniques, as implemented in a simple test code, written in the C programming language, called Cercion. Novel cell-centered data structures are used in Cercion to reduce the complexity of the programming and maximize the efficiency of memory usage. The locations of the shock and contact discontinuity in the Riemann shock tube problem are well captured. Cercion demonstrates a high degree of symmetry when calculating the Sedov blast wave solution, with a peak density at the shock front that is similar to the value determined by the RAGE code. For a flyer plate test problem both Cercion and FLAG give virtually the same velocity temporal profile at the target-vacuum interface. When calculating a cylindrical implosion of a steel shell, Cercion and FLAG agree well and the Cercion results are insensitive to the use of ALE.

36 MATERIALS SCIENCE↗

New Effective Multithreaded Matching Algorithms

Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of less quality. We present a new simple 1 2 -approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1 2 -approximation algorithm on almost all inputs and also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.

matching, parallel algorithms↗