Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational statistics”

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 721 records · Page 40

The Magnetospheric Source Region of the Bright Proton Aurora

The bright proton aurora is generally understood to be the projection of the Central Plasma Sheet where there is sufficient particle energy to cause auroral luminosity and strong pitch angle scattering (presumably due to field line curvature). This region is often interpreted as the transition region between dipolar and tail-like magnetic topologies. The location of auroral features relative to the peak in the proton aurora has been used, for example, to argue that the substorm onset arc lies on field lines that thread this transition region. In this paper, we present statistics of proton aurora luminosity computed from Time History of Events and Macroscale Interactions in Substorms electrostatic analyzer measurements for various radial distances in the magnetotail. These results are compared to ground observations of proton auroral luminosity and used to derive a statistical source region of the bright proton aurora.

Spanswick, E.↗

Using computers to analyze continuous data.

Dynamic field measurements often involve large quantities of continuous data, which must be analyzed and interpreted to obtain meaningful information. The processing can often be accomplished by tape-recording the data in analog form, performing off-line digitalization, and using the result as an input to statistical programs on a digital computer. A time series analysis was used to obtain power spectral density (PSD) curves to identify dominant frequencies. Representative PSD plots were obtained for STOL aircraft during cruise. Vibrational energy was clearly concentrated below 0.1 Hz, and was much higher in the vertical than in the lateral direction.

Catherines, J. J.↗

Majorana-based quantum computing in nanowire devices

The boundary of one-dimensional topological superconductors might lead to the appearance of Majorana zero modes, whose nontrivial exchange statistics can be used for quantum computing. In branched nanowire networks, one can exchange Majorana modes by time dependently tuning topologically nontrivial parameter regions. In this paper, we simulate the exchange of four Majorana modes in T-shaped junctions made out of $\textit{p}$-wave superconducting Rashba wires. Specifically, we derive concrete experimental predictions for (quasi-)adiabatic braiding times and determine geometric conditions for successful Majorana exchange processes. Moreover, we prove that, in the adiabatic limit, the gating time needs to be smaller than the inverse of the squared superconducting order parameter and scales linearly with the gating potential. Furthermore, we show how to circumvent the formation of additional Majorana modes in branched nanowire systems, arising at wire intersection points of narrow junctions. Finally, we propose a multiqubit setup, allowing for universal quantum computing.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multi-Model Future Typical Meteorological (fTMY) Weather Files for nearly every US County

Exploring climate-induced impacts on building energy consumption can provide valuable insights for sustainable energy planning and environmental management in the face of a changing climate. By utilizing future weather data statistically downscaled from the Intergovernmental Panel on Climate Change (IPCC) General Circulation Models (GCMs) from 2020-2100, this paper presents a broadening industry-consensus approach for generating future Typical Meteorological Year (fTMY) weather files through a combination of statistical downscaling and high-performance computing that generalizes across decades, multiple locations for a region, and varying climate models. Furthermore, these fTMY files have been generated for 3,128 US counties for capturing potential weather on a 20-year basis.

Building↗

Application of Variance Reduction Techniques in RMC Burnup and Thermal-Hydraulic Coupled Calculation

In reactor analog simulation, the Monte Carlo method has relatively high fidelity since it can reduce calculation errors resulting from using approximation methods by describing complex geometry and neutron energy spectra. The Monte Carlo method is, in essence, a stochastic simulation of the neutron transport process, and statistical uncertainty of all the computed results must be provided. In large-scale reactor computation, this method can accurately estimate integral quantities such as the effective multiplication factor (K{sub eff}), and it can limit the uncertainty within an acceptable range via reasonably selecting simulation particles. Nevertheless, it faces great challenges in estimating local quantities like neutron flux and fission power, with uncertainty of estimators beyond acceptance. To decrease the uncertainty of local quantities by increasing simulation particles may cost much time and reduce efficiency. The main reasons are as follows. Firstly, the scale of reactors is so large that common pressurized water reactors have tens of thousands of lattice cells; secondly, uneven distribution of neutron flux and fission power causes uneven distribution of uncertainty. Smith K. puts forward the 95/95 principle to estimate whether uncertainty calculated with Monte Carlo Code satisfies the requirement. According to the principle, with a confidence level of 95%, statistical errors of power density in more than 95% of the regions should be less than 1%. To meet the requirement of the principle, the uniform fission site (UFS) method is raised currently. UFS aims at redistributing fission sources to uniformize the fission source sampling, which can make statistical variance distribution more uniform. This method, which is easy to use, will not obviously increase computation time. Many studies show that UFS has a good variance reduction effect in Monte Carlo criticality calculation, but less attention is paid to its performance in burnup calculation and thermal-hydraulic coupled calculation. Uncertainty arising from the Monte Carlo method has a large impact on burnup calculation and thermal-hydraulic coupled calculation. Variance propagates between burnup steps and between iterative steps of coupled calculation, which causes asymmetry of results of the physical symmetrical regions and instability of coupled iterative convergence errors. To further verify the effect of UFS, this study uses it in the RMC (the Reactor Monte Carlo code) burnup calculation module and the neutronics/thermohydraulics coupled calculation module, and conducts two-dimensional pressurized water reactor burnup calculation and BEAVRS benchmark thermalhydraulic coupled calculation. In this way, it verifies the improvement effect of UFS on variance propagation. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗

Nonelastic nuclear reactions and accompanying gamma radiation

Several aspects of nonelastic nuclear reactions which proceed through the formation of a compound nucleus are dealt with. The full statistical model and the partial statistical model are described and computer programs based on these models are presented along with operating instructions and input and output for sample problems. A theoretical development of the expression for the reaction cross section for the hybrid case which involves a combination of the continuum aspects of the full statistical model with the discrete level aspects of the partial statistical model is presented. Cross sections for level excitation and gamma production by neutron inelastic scattering from the nuclei Al-27, Fe-56, Si-28, and Pb-208 are calculated and compared with avaliable experimental data.

Snow, R.↗

Machine Learning Algorithms for Matching Theories, Simulations, and Observations in Cosmology (Final Project)

The search for simple and elegant equations to explain and predict observable natural phenomena has been a driving force in scientific theory for several centuries. The great successes of Newton's laws, Maxwell's equations, the Schrodinger equation, and the theory of General Relativity have encouraged this perspective, and perhaps a beautiful equation comprising a “theory of everything” remains to be discovered. But now scientists are grappling with systems of ever-increasing complexity, fraught with nonlinearity, and with the quantities of interest often only indirectly observed. Nature may resist a simple description, and the most important discoveries of the next century may be complex theories with countless variables and parameters. The era of big data opens up a promising new approach to scientific discovery in this setting. The predictions of modern theories, even if complex or nonlinear, can be examined through detailed and computationally-intensive simulations that take days or weeks to run and fill petabytes of disk space. The upcoming generation of scientific instruments will provide petabytes of observations at unprecedented resolution and depth. The challenge is to compare data to simulations so as to test theories and identify those that best match the observations. The data are numerous and rich but are subject to noise and various systematic biases. The simulations are large and detailed but are so costly that the effective sample size is small. Moreover, the mapping from data to simulation to the parameters of interest is typically complicated and ill-conditioned. Although these challenges, and the solutions we propose, apply across the sciences, we will ground our efforts by focusing on cosmology. Here, we are truly entering the era of big data in several senses. Ever larger experiments survey larger and larger cosmological volumes, resulting in enormous amounts of pixel data to process and extract the information of cosmological interest. These include large imaging surveys, which collect all the light in broad wavelength ranges over significant fractions of the sky, and spectroscopic surveys, which measure the light as a function of wavelength to map out 3D distances. These experiments are designed to shed light on the big unanswered questions in cosmology. Distilling the petabytes of data into observed quantities for comparison with theory is a daunting task. But these large experiments do not only result in large amounts of data to analyze: if we wish to compare to theories of physics, then we need increasingly extensive predictions for the observed quantities as well, which requires ever-larger cosmological simulations that take substantial -- and at times prohibitive -- computational resources to produce. Our goal is to develop statistical and machine learning methods for using observed and simulated data to advance machine learning with applications cosmology. In particular, we focus our research efforts on the following tasks: The challenge for automated science is that it is computationally impossible and statistically dangerous to consider every possible model in order to find the best one. We will develop Bayesian Optimization based active-learning methods that accelerate both the execution of the simulations and the search for best-fitting parameters. The key idea is to make the simulations adaptive -- across resolutions, time, and parameters -- using the data to search as the simulation runs; Most ML methods operate on simple finite dimensional feature vectors. However, many cosmology and other science applications require ML methods that can operate on more complex objects as inputs or outputs such as functions, distributions, or sets and point clouds. Our goal is to develop efficient ML methods for this problem and demonstrate their applicability in Cosmology, Astrophysics, and other science problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Three-dimensional time dependent computation of turbulent flow

The three-dimensional, primitive equations of motion are solved numerically for the case of isotropic box turbulence and the distortion of homogeneous turbulence by irrotational plane strain at large Reynolds numbers. A Gaussian filter is applied to governing equations to define the large scale field. This gives rise to additional second order computed scale stresses (Leonard stresses). The residual stresses are simulated through an eddy viscosity. Uniform grids are used, with a fourth order differencing scheme in space and a second order Adams-Bashforth predictor for explicit time stepping. The results are compared to the experiments and statistical information extracted from the computer generated data.

Kwak, D.↗

Simulation and study of small numbers of random events

Random events were simulated by computer and subjected to various statistical methods to extract important parameters. Various forms of curve fitting were explored, such as least squares, least distance from a line, maximum likelihood. Problems considered were dead time, exponential decay, and spectrum extraction from cosmic ray data using binned data and data from individual events. Computer programs, mostly of an iterative nature, were developed to do these simulations and extractions and are partially listed as appendices. The mathematical basis for the compuer programs is given.

Shelton, R. D.↗

Statistical model of exotic rotational correlations in emergent space-time

A statistical model is formulated to compute exotic rotational correlations that arise as inertial frames and causal structure emerge on large scales from entangled Planck scale quantum systems. Noncommutative quantum dynamics are represented by random transverse displacements that respect causal symmetry. Entanglement is represented by covariance of these displacements in Planck scale intervals defined by future null cones of events on an observer's world line. Light that propagates in a nonradial direction inherits a projected component of the exotic rotational correlation that accumulates as a random walk in phase. A calculation of the projection and accumulation leads to exact predictions for statistical properties of exotic Planck scale correlations in an interferometer of any configuration. The cross-covariance for two nearly co-located interferometers is shown to depart only slightly from the autocovariance. Specific examples are computed for configurations that approximate realistic experiments, and show that the model can be rigorously tested.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Statistical versus nonstatistical temperature inversion methods

Vertical temperature profiles are derived from radiation measurements by inverting the integral equation of radiative transfer. Because of the nonuniqueness of the solution, the particular temperature profile obtained depends on the numerical inversion technique used and the type of auxiliary information incorporated in the solution. The choice of an inversion algorithm depends on many factors; including the speed and size of computer, the availability of representative statistics, and the accuracy of initial data. Results are presented for a numerical study comparing two contrasting inversion methods: the statistical-matrix inversion method and the nonstatistical-iterative method. These were found to be the most applicable to the problem of determining atmospheric temperature profiles. Tradeoffs between the two methods are discussed.

Smith, W. L.↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗

Gauging Variational Inference

Computing partition function is the most important statistical inference task arising in applications of Graphical Models (GM). Since it is computationally intractable, approximate methods have been used to resolve the issue in practice, where meanfield (MF) and belief propagation (BP) are arguably the most popular and successful approaches of a variational type. In this paper, we propose two new variational schemes, coined Gauged-MF (G-MF) and Gauged-BP (G-BP), improving MF and BP, respectively. Both provide lower bounds for the partition function by utilizing the so-called gauge transformation which modifies factors of GM while keeping the partition function invariant. Moreover, we prove that both G-MF and G-BP are exact for GMs with a single loop of a special structure, even though the bare MF and BP perform badly in this case. Our extensive experiments, on complete GMs of relatively small size and on large GM (up-to 300 variables) confirm that the newly proposed algorithms outperform and generalize MF and BP.

97 MATHEMATICS AND COMPUTING↗

A Study of Particle Beam Spin Dynamics for High Precision Experiments

In the search for physics beyond the Standard Model, high precision experiments to measure fundamental properties of particles are an important frontier. One group of such measurements involves magnetic dipole moment (MDM) values as well as searching for an electric dipole moment (EDM), both of which could provide insights about how particles interact with their environment at the quantum level and if there are undiscovered new particles. For these types of high precision experiments, minimizing statistical uncertainties in the measurements plays a critical role. \\ \indent This work leverages computer simulations to quantify the effects of statistical uncertainty for experiments investigating spin dynamics. In it, analysis of beam properties and lattice design effects on the polarization of the beam is performed. As a case study, the beam lines that will provide polarized muon beams to the Fermilab Muon \emph{g}-2 experiment are analyzed to determine the effects of correlations between the phase space variables and the overall polarization of the muon beam.

43 PARTICLE ACCELERATORS↗

Iterative reconstruction using a Monte Carlo based system transfer matrix for dedicated breast positron emission tomography

To maximize sensitivity, it is desirable that ring Positron Emission Tomography (PET) systems dedicated for imaging the breast have a small bore. Unfortunately, due to parallax error this causes substantial degradation in spatial resolution for objects near the periphery of the breast. In this work, a framework for computing and incorporating an accurate system matrix into iterative reconstruction is presented in an effort to reduce spatial resolution degradation towards the periphery of the breast. The GATE Monte Carlo Simulation software was utilized to accurately model the system matrix for a breast PET system. A strategy for increasing the count statistics in the system matrix computation and for reducing the system element storage space was used by calculating only a subset of matrix elements and then estimating the rest of the elements by using the geometric symmetry of the cylindrical scanner. To implement this strategy, polar voxel basis functions were used to represent the object, resulting in a block-circulant system matrix. Simulation studies using a breast PET scanner model with ring geometry demonstrated improved contrast at 45% reduced noise level and 1.5 to 3 times resolution performance improvement when compared to MLEM reconstruction using a simple line-integral model. The GATE based system matrix reconstruction technique promises to improve resolution and noise performance and reduce image distortion at FOV periphery compared to line-integral based system matrix reconstruction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physical Validation of TRMM TMI and PR Monthly Rain Products Over Oklahoma

The Tropical Rainfall Measuring Mission (TRMM) provides monthly rainfall estimates using data collected by the TRMM satellite. These estimates cover a substantial fraction of the earth's surface. The physical validation of TRMM estimates involves corroborating the accuracy of spaceborne estimates of areal rainfall by inferring errors and biases from ground-based rain estimates. The TRMM error budget consists of two major sources of error: retrieval and sampling. Sampling errors are intrinsic to the process of estimating monthly rainfall and occur because the satellite extrapolates monthly rainfall from a small subset of measurements collected only during satellite overpasses. Retrieval errors, on the other hand, are related to the process of collecting measurements while the satellite is overhead. One of the big challenges confronting the TRMM validation effort is how to best estimate these two main components of the TRMM error budget, which are not easily decoupled. This four-year study computed bulk sampling and retrieval errors for the TRMM microwave imager (TMI) and the precipitation radar (PR) by applying a technique that sub-samples gauge data at TRMM overpass times. Gridded monthly rain estimates are then computed from the monthly bulk statistics of the collected samples, providing a sensor-dependent gauge rain estimate that is assumed to include a TRMM equivalent sampling error. The sub-sampled gauge rain estimates are then used in conjunction with the monthly satellite and gauge (without sub- sampling) estimates to decouple retrieval and sampling errors. The computed mean sampling errors for the TMI and PR were 5.9% and 7.796, respectively, in good agreement with theoretical predictions. The PR year-to-year retrieval biases exceeded corresponding TMI biases, but it was found that these differences were partially due to negative TMI biases during cold months and positive TMI biases during warm months.

Fisher, Brad L.↗