Search NASA⌕ Search

SEARCH · Search NASA

Results for “Ensemble computing.”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,297 records · Page 72

Formation and retrieval of cell assemblies in a biologically realistic spiking neural network model of area CA3 in the mouse hippocampus

The hippocampal formation is critical for episodic memory, with area Cornu Ammonis 3 (CA3) a necessary substrate for auto-associative pattern completion. Recent theoretical and experimental evidence suggests that the formation and retrieval of cell assemblies enable these functions. Yet, how cell assemblies are formed and retrieved in a full-scale spiking neural network (SNN) of CA3 that incorporates the observed diversity of neurons and connections within this circuit is not well understood. Here, we demonstrate that a data-driven SNN model quantitatively reflecting the neuron type-specific population sizes, intrinsic electrophysiology, connectivity statistics, synaptic signaling, and long-term plasticity of the mouse CA3 is capable of robust auto-association and pattern completion via cell assemblies. Our results show that a broad range of assembly sizes could successfully and systematically retrieve patterns from heavily incomplete or corrupted cues after a limited number of presentations. Furthermore, performance was robust with respect to partial overlap of assemblies through shared cells, substantially enhancing memory capacity. These novel findings provide computational evidence that the specific biological properties of the CA3 circuit produce an effective neural substrate for associative learning in the mammalian brain.

hetero-association↗

Fantômas unconfined: global QCD fits with Bézier parameterizations

Fantômas is a C++ toolkit for exploring the parametrization dependence of parton distribution functions (PDFs) and other correlator functions in quantum chromodynamics (QCD). Fantômas facilitates the generation of adaptable polynomial parametrizations for PDFs, called metamorphs, to find best-fit PDF solutions and quantify the epistemic uncertainty associated with the parametrizations during their fitting. The method employs Bézier curves as universal approximators for a variety of PDF shapes. Integrated into the xFitter framework for the global QCD analysis, Fantômas provides a foundation for general models of PDFs, while reducing the computational time compared to the approaches utilizing traditional polynomial parametrizations as well as providing an interpretable alternative to neural-network-based models. This paper outlines the structure and practical usage of the Fantômas toolkit, including its inputs, outputs, and implementation within xFitter. It also provides a practical example of using Fantômas for uncertainty quantification as well as the combination of PDF fits into a single ensemble.

Bézier curves↗

Simultaneous inference of equation of state parameters and unknown data errors with uncertainty quantification via hierarchical Bayesian posterior maximization

Equations of state (EOSs) are a key component in running hydrodynamic simulations as they relate the thermodynamic states for the material. The Davis reactants EOS is commonly used for modeling high explosives (HEs), and the EOS model parameters are calibrated using material specific data. The calibrations are often performed with uncertainty quantification via Bayesian inference to account for uncertainty in the data and generate ensembles of likely parameters. However, there are relatively few HE data sets to use for calibration and many are historical and lack error information. In this work, we simultaneously calibrate the Davis reactants EOS model parameters and unknown data error terms for the high explosive PBX 9501. To quantify the uncertainty in the models and the data, we use a Bayesian framework for the calibration and compute the hierarchical Bayesian posterior distribution with both a posteriori maximization approach and Markov Chain Monte Carlo. In general, we find that, given our assumptions, the two approaches result in similar calibrated parameters, posterior covariance matrices, and insights about the parameters but that the posterior maximization requires far less computational resources.

97 MATHEMATICS AND COMPUTING↗

Average and dispersion of the luminosity-redshift relation in the concordance model

Starting from the luminosity-redshift relation recently given up to second order in the Poisson gauge, we calculate the effects of the realistic stochastic background of perturbations of the so-called concordance model on the combined light-cone and ensemble average of various functions of the luminosity distance, and on their variance, as functions of redshift. We apply a gauge-invariant light-cone averaging prescription which is free from infrared and ultraviolet divergences, making our results robust with respect to changes of the corresponding cutoffs. Our main conclusions, in part already anticipated in a recent letter for the case of a perturbation spectrum computed in the linear regime, are that such inhomogeneities not only cannot avoid the need for dark energy, but also cannot prevent, in principle, the determination of its parameters down to an accuracy of order 10{sup −3}−10{sup −5}, depending on the averaged observable and on the regime considered for the power spectrum. However, taking into account the appropriate corrections arising in the non-linear regime, we predict an irreducible scatter of the data approaching the 10% level which, for limited statistics, will necessarily limit the attainable precision. The predicted dispersion appears to be in good agreement with current observational estimates of the distance-modulus variance due to Doppler and lensing effects (at low and high redshifts, respectively), and represents a challenge for future precision measurements.

79 ASTRONOMY AND ASTROPHYSICS↗

RNAG: a new Gibbs sampler for predicting RNA secondary structure for unaligned sequences

Motivation: RNA secondary structure plays an important role in the function of many RNAs, and structural features are often key to their interaction with other cellular components. Thus, there has been considerable interest in the prediction of secondary structures for RNA families. In this article, we present a new global structural alignment algorithm, RNAG, to predict consensus secondary structures for unaligned sequences. It uses a blocked Gibbs sampling algorithm, which has a theoretical advantage in convergence time. This algorithm iteratively samples from the conditional probability distributions P(Structure | Alignment) and P(Alignment | Structure). Not surprisingly, there is considerable uncertainly in the high-dimensional space of this difficult problem, which has so far received limited attention in this field. We show how the samples drawn from this algorithm can be used to more fully characterize the posterior space and to assess the uncertainty of predictions. Results: Our analysis of three publically available datasets showed a substantial improvement in RNA structure prediction by RNAG over extant prediction methods. Additionally, our analysis of 17 RNA families showed that the RNAG sampled structures were generally compact around their ensemble centroids, and at least 11 families had at least two well-separated clusters of predicted structures. In general, the distance between a reference structure and our predicted structure was large relative to the variation among structures within an ensemble. Availability: The Perl implementation of the RNAG algorithm and the data necessary to reproduce the results described in Sections 3.1 and 3.2 are available at http://ccmbweb.ccv.brown.edu/rnag.html

59 BASIC BIOLOGICAL SCIENCES↗

Experimental validation benchmark data for CFD of transient convection from forced to natural with flow reversal on a vertical flat plate

Transient convection has been investigated experimentally for the purpose of providing Computational Fluid Dynamics (CFD) validation benchmark data. A specialized facility for validation benchmark experiments called the Rotatable Buoyancy Tunnel was used to acquire thermal and velocity measurements of flow over a smooth, vertical heated plate. The initial condition was forced convection downward with subsequent transition to mixed convection, ending with natural convection upward after a flow reversal. Data acquisition through the transient was repeated for ensemble-averaged results. With simple flow geometry, validation data were acquired at the benchmark level. All boundary conditions (BCs) were measured and their uncertainties quantified. Temperature profiles on all four walls and the inlet were measured, as well as as-built test section geometry. Inlet velocity profiles and turbulence levels were quantified using Particle Image Velocimetry. System Response Quantities (SRQs) were measured for comparison with CFD outputs and include velocity profiles, wall heat flux, and wall shear stress. Extra effort was invested in documenting and preserving the validation data. Details about the experimental facility, instrumentation, experimental procedure, materials, BCs, and SRQs are made available through this paper. As a result, the latter two are available for download and the other details are included in this work.

42 ENGINEERING↗

Scattering parameters for aspherical hydrometeors at microwave frequencies

Scattering parameters for ensembles of aspherical ice and liquid hydrometeors were calculated at Psi = 50 deg for frequencies of 37.0, 50.3, and 85.6 GHz. Hydrometeors were assumed to be oblate spheroids whose semiminor axes were aligned at Psi = 0 deg. The angle of 50 deg is determined by the viewing angle of recent satellite-borne radiometers. Backscattering phase functions and extinction coefficients at Psi = 0 deg were also computed at 18.0, 37.0, and 85.6 GHz to provide information for future nadir scanning radars. The hydrometeors were assumed to be characterized by Marshall-Palmer (1948) size distributions. The extended boundary condition method was used to calculate the extinction and backscattering coefficients as well as the albedo for single scattering and the asymmetry factor of the phase function. Results are fitted to simple functions of the rainfall rate. Some comparisons intended to illustrate the differences and similarities of these results with those obtained from equal volume spheres are also presented.

Kummerow, C.↗

Computation of disordered system from the first principles of classical mechanics and ℕℙ hard problem

We study the classical 1D Heisenberg spin glasses in the framework of nearest-neighboring model. Based on the Hamilton equations we obtained the system of recurrence equations which allows to perform node-by-node calculations of a spin-chain. It is shown that calculations from the first principles of classical mechanics lead to ℕℙ hard problem, that however in the limit of the statistical equilibrium can be calculated by ℙ algorithm. For the partition function of the ensemble a new representation is offered in the form of one-dimensional integral of spin-chains’ energy distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Krylov iterative methods and synthetic acceleration for transport in binary statistical media

In particle transport applications there are numerous physical constructs in which heterogeneities are randomly distributed. The quantity of interest in these problems is the ensemble average of the flux, or the average of the flux over all possible material 'realizations.' The Levermore-Pomraning closure assumes Markovian mixing statistics and allows a closed, coupled system of equations to be written for the ensemble averages of the flux in each material. Generally, binary statistical mixtures are considered in which there are two (homogeneous) materials and corresponding coupled equations. The solution process is iterative, but convergence may be slow as either or both materials approach the diffusion and/or atomic mix limits. A three-part acceleration scheme is devised to expedite convergence, particularly in the atomic mix-diffusion limit where computation is extremely slow. The iteration is first divided into a series of 'inner' material and source iterations to attenuate the diffusion and atomic mix error modes separately. Secondly, atomic mix synthetic acceleration is applied to the inner material iteration and S{sub 2} synthetic acceleration to the inner source iterations to offset the cost of doing several inner iterations per outer iteration. Finally, a Krylov iterative solver is wrapped around each iteration, inner and outer, to further expedite convergence. A spectral analysis is conducted and iteration counts and computing cost for the new two-step scheme are compared against those for a simple one-step iteration, to which a Krylov iterative method can also be applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lattice calculation of hadronic light-by-light contribution to the muon anomalous magnetic moment

The quark-connected part of the hadronic light-by-light scattering contribution to the muon’s anomalous magnetic moment is computed using lattice QCD with chiral fermions. Here we report several significant algorithmic improvements and demonstrate their effectiveness through specific calculations which show a reduction in statistical errors by more than an order of magnitude. The most realistic of these calculations is performed with a near-physical 171 MeV pion mass on a (4.6 fm) 3 spatial volume using the 32 3 ×64 Iwasaki+DSDR gauge ensemble of the RBC/UKQCD Collaboration.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Matlab Cluster Ensemble Toolbox

This is a Matlab toolbox for investigating the application of cluster ensembles to data classification, with the objective of improving the accuracy and/or speed of clustering. The toolbox divides the cluster ensemble problem into four areas, providing functionality for each. These include, (1) synthetic data generation, (2) clustering to generate individual data partitions and similarity matrices, (3) consensus function generation and final clustering to generate ensemble data partitioning, and (4) implementation of accuracy metrics. With regard to data generation, Gaussian data of arbitrary dimension can be generated. The kcenters algorithm can then be used to generate individual data partitions by either, (a) subsampling the data and clustering each subsample, or by (b) randomly initializing the algorithm and generating a clustering for each initialization. In either case an overall similarity matrix can be computed using a consensus function operating on the individual similarity matrices. A final clustering can be performed and performance metrics are provided for evaluation purposes.

De Sapio, Vincent↗

Simulation and Analysis of Hurricane-Driven Extreme Wave Climate Under Two Ocean Warming Scenarios

Ocean wave climate is an important area of research, particularly in the context of extremes driven by tropical cyclones (TC). We can now simulate global climate at resolutions sufficient to resolve TCs and for durations long enough to explore climatological changes. Both the devastating 2017 North Atlantic hurricane season and growing evidence for the connection between TC activity and increasing ocean temperature motivate investigation of possible future changes. We present two simulated 50-year global wave climate data sets under possible future warming scenarios characterized by +1.5°C and +2.0°C stabilized global mean temperatures that capture the effects of TCs. Differences in extreme wave climate between these possible scenarios and present-day conditions appear to be significant in many areas, particularly those affected by TCs. However, for computational feasibility, simulations of this kind rely on fixed sea surface temperatures, so we also investigate and elucidate effects from the lack of a dynamic ocean by simulating waves from a number of recent hurricanes and comparing output to observations. We conclude that atmosphere-only forcing is likely to result in an overestimate of extreme wind speeds and wave heights in TC-affected regions. More ensemble studies are needed to help elucidate detailed processes relevant to extreme wave climate, and important community projects such as the Coordinated Wave Climate Intercomparison Project (COWCLIP) should be supported.

54 ENVIRONMENTAL SCIENCES↗

Matlab Cluster Ensemble Toolbox v. 1.0

This is a Matlab toolbox for investigating the application of cluster ensembles to data classification, with the objective of improving the accuracy and/or speed of clustering. The toolbox divides the cluster ensemble problem into four areas, providing functionality for each. These include, (1) synthetic data generation, (2) clustering to generate individual data partitions and similarity matrices, (3) consensus function generation and final clustering to generate ensemble data partitioning, and (4) implementation of accuracy metrics. With regard to data generation, Gaussian data of arbitrary dimension can be generated. The kcenters algorithm can then be used to generate individual data partitions by either, (a) subsampling the data and clustering each subsample, or by (b) randomly initializing the algorithm and generating a clustering for each initialization. In either case an overall similarity matrix can be computed using a consensus function operating on the individual similarity matrices. A final clustering can be performed and performance metrics are provided for evaluation purposes.

Source record↗

Minimum-error quantum distinguishability bounds from matrix monotone functions: A comment on 'Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds' [J. Math. Phys. 50, 032106 (2009)]

Matrix monotonicity is used to obtain upper bounds on minimum-error distinguishability of arbitrary ensembles of mixed quantum states. This generalizes one direction of a two-sided bound recently obtained by the author [J. Tyson, J. Math. Phys. 50, 032106 (2009)]. It is shown that the previously obtained special case has unique properties.

97 MATHEMATICS AND COMPUTING↗

Computational studies of x-ray scattering from three-dimensionally-aligned asymmetric-top molecules

We theoretically and numerically analyze x-ray scattering from asymmetric-top molecules three-dimensionally aligned using elliptically polarized laser light. A rigid-rotor model is assumed. The principal axes of the polarizability tensor are assumed to coincide with the principal axes of the moment of inertia tensor. Several symmetries in the Hamiltonian are identified and exploited to enhance the efficiency of solving the time-dependent Schroedinger equation for each rotational state initially populated in a thermal ensemble. Using a phase-retrieval algorithm, the feasibility of structure reconstruction from a quasiadiabatically aligned sample is illustrated for the organic molecule naphthalene. The spatial resolution achievable strongly depends on the laser parameters, the initial rotational temperature, and the x-ray pulse duration. We demonstrate that for a laser peak intensity of 5 TW/cm{sup 2}, a laser pulse duration of 100 ps, a rotational temperature of 10 mK, and an x-ray pulse duration of 1 ps, the molecular structure may be probed at a resolution of 1 A ring .

74 ATOMIC AND MOLECULAR PHYSICS↗

A learning-based data-driven forecast approach for predicting future reservoir performance

Quantification of the predictive uncertainty of subsurface models has long been investigated. The traditional workflow is to calibrate prior models to match observed data, and then use the posterior models to simulate future system performance. Not only are these procedures computationally expensive, but they also have issues in maintaining geological model constraints during the calibration step. Data space inversion (DSI) was introduced recently to predict future system performance without the iterative history matching or model calibration step. In general, DSI approaches seek to establish a statistical relationship between the observed and forecast variables, as well as to quantify the predictive uncertainty of the forecast variables, by using an ensemble of uncalibrated prior models. Existing DSI approaches all require a number of complex transformation and mapping operations, which may deter their widespread use. Here in this study, we introduce a new and simpler DSI approach, the learning-based, data-driven forecast approach (LDFA), by combining dimension reduction and machine learning techniques to quickly provide accurate forecast results and reliably quantify corresponding uncertainty in the results. Our LDFA framework is demonstrated using two supervised learning algorithms, artificial neural network (ANN) and support vector regression (SVR), on two representative examples from reservoir engineering and geological carbon storage. Results suggest that our approach provides accurate forecast results (e.g., future oil production rate or cumulative injected CO 2 ) and reasonable predictive uncertainty intervals. Our framework is generic and may be applied to other surface and subsurface problems.

42 ENGINEERING↗

MSU Disentanglement Analysis Software

This software is used to disentangle the forced-versus-unforced components of tropospheric temperature change over the satellite era (after 1979) using maps of surface temperature change as a predictor. In general, the software assembles training datasets (from pre-computed surface temperature trend maps and domain averaged tropospheric warming rates), trains statistical/machine learning (ML) algorithms, applies the trained statistical/ML model to climate model data and observations, and then saves the results. A leave-one-out approach is used in which the statistical/ML models are iteratively trained on (N- 1) climate model and then applied to the remaining climate model (and observations). Each model includes a large ensemble (i.e., >10) of model simulations. The software relies on scikit-learn ridge regression, PLS regression, and neural network algorithms.

Po-Chedley, StephenD↗