Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

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 415 records · Page 23

The Massive and Distant Clusters of WISE Survey. I. Survey Overview and a Catalog of >2000 Galaxy Clusters at z ≃ 1

We introduce the Massive and Distant Clusters of WISE Survey (MaDCoWS), a search for galaxy clusters at 0.7 ≲ z ≲ 1.5 based upon data from the Wide-field Infrared Survey Explorer (WISE) mission. MaDCoWS is the first cluster survey capable of discovering massive clusters at these redshifts over the full extragalactic sky. The search is divided into two regions—the region of the extragalactic sky covered by Pan-STARRS (δ > –30°) and the remainder of the southern extragalactic sky at δ < –30° for which shallower optical data from the SuperCOSMOS Sky Survey is available. Here, we describe the search algorithm, characterize the sample, and present the first MaDCoWS data release—catalogs of the 2433 highest amplitude detections in the WISE–Pan-STARRS region and the 250 highest amplitude detections in the WISE –SuperCOSMOS region. A total of 1723 of the detections from the WISE –Pan-STARRS sample have also been observed with the Spitzer Space Telescope , providing photometric redshifts and richnesses, and an additional 64 detections within the WISE –SuperCOSMOS region also have photometric redshifts and richnesses. Spectroscopic redshifts for 38 MaDCoWS clusters with IRAC photometry demonstrate that the photometric redshifts have an uncertainty of σ z /(1 + z) ≃ 0.036. Combining the richness measurements with Sunyaev–Zel'dovich observations of MaDCoWS clusters, we also present a preliminary mass–richness relation that can be used to infer the approximate mass distribution of the full sample. The estimated median mass for the WISE–Pan-STARRS catalog is ${M}_{500}={1.6}_{-0.8}^{+0.7}\times {10}^{14}\,{M}_{\odot }$, with the Sunyaev–Zel'dovich data confirming that we detect clusters with masses up to M 500 ~ 5 × 10 14 M ⊙ (M 200 ~ 10 15 M ⊙ ).

79 ASTRONOMY AND ASTROPHYSICS↗

Application of finite-element method in the computation of temperature with emphasis on radiative exchanges.

Analyses pertaining to the solution of heat transfer problems in combined modes based on the finite-element method are presented. Two elements - a triangular element employing two spatial variables and a multi-faceted bar element employing one spatial variable - with nonlinear radiation on the boundaries are detailed. The radiative effects considered on the diffuse-gray surface elements include: (1) directional radiant fluxes from distant sources, (2) radiative exchanges including surfaces of prescribed temperatures, and (3) radiative exchanges including elements whose temperatures are not known a priori. The nonlinear part of the boundary condition is treated in two different ways: (1) a consistent linearization method, and (2) a direct energy distribution method. Applications of these elements together with solution algorithms to three sample problems exhibit solution capability and obtainable accuracy.

Lee, H.-P.↗

An improved algorithm for evaluating trellis phase codes

A method is described for evaluating the minimum distance parameters of trellis phase codes, including CPFSK, partial response FM, and more importantly, coded CPM (continuous phase modulation) schemes. The algorithm provides dramatically faster execution times and lesser memory requirements than previous algorithms. Results of sample calculations and timing comparisons are included.

Mulligan, M. G.↗

An improved algorithm for evaluating trellis phase codes

A method is described for evaluating the minimum distance parameters of trellis phase codes, including CPFSK, partial response FM, and more importantly, coded CPM (continuous phase modulation) schemes. The algorithm provides dramatically faster execution times and lesser memory requirements than previous algorithms. Results of sample calculations and timing comparisons are included.

Mulligan, M. G.↗

Stereo image visualization of numerically simulated turbulence

Stereo imaging techniques are used in the current study to analyze the results of a direct Navier-Stokes simulation of a turbulent boundary layer. Coherent structures embedded within the unsteady, highly three-dimensional turbulent flow fields are significantly enhanced through the use of stereo computer graphic renderings. In the paper, the geometrical foundations of two different methods for generating stereo images are reviewed. Sufficient detail is provided to enable readers to code stereo display algorithms from scratch. The effects of varying the geometric parameters of the stereo algorithm are demonstrated. Sample image pairs from animations of the turbulence numerical simulation are presented in color. Stereo imagery, especially when used with time-evolving data, provides new insight into the physical processes responsible for the generation an maintenance of turbulence within boundary layers.

Robinson, Stephen K.↗

State estimation for spacecraft power systems

A state estimator appropriate for spacecraft power systems is presented. Phasor voltage and current measurements are used to determine the system state. A weighted least squares algorithm with a multireference transmission cable model is used. Bad data are identified and resolved. Once the bad data have been identified, they are removed from the measurement set and the system state can be estimated from the remaining data. An observability analysis is performed on the remaining measurements to determine if the system state can be found from the reduced measurement set. An example of the algorithm for a sample spacecraft power system is presented.

Williamson, Susan H.↗

Discrete time learning control in nonlinear systems

In this paper digital learning control methods are developed primarily for use in single-input, single-output nonlinear dynamic systems. Conditions for convergence of the basic form of learning control based on integral control concepts are given, and shown to be satisfied by a large class of nonlinear problems. It is shown that it is not the gross nonlinearities of the differential equations that matter in the convergence, but rather the much smaller nonlinearities that can manifest themselves during the short time interval of one sample time. New algorithms are developed that eliminate restrictions on the size of the learning gain, and on knowledge of the appropriate sign of the learning gain, for convergence to zero error in tracking a feasible desired output trajectory. It is shown that one of the new algorithms can give guaranteed convergence in the presence of actuator saturation constraints, and indicate when the requested trajectory is beyond the actuator capabilities.

Longman, Richard W.↗

A self-learning rule base for command following in dynamical systems

In this paper, a self-learning Rule Base for command following in dynamical systems is presented. The learning is accomplished though reinforcement learning using an associative memory called SAM. The main advantage of SAM is that it is a function approximator with explicit storage of training samples. A learning algorithm patterned after the dynamic programming is proposed. Two artificially created, unstable dynamical systems are used for testing, and the Rule Base was used to generate a feedback control to improve the command following ability of the otherwise uncontrolled systems. The numerical results are very encouraging. The controlled systems exhibit a more stable behavior and a better capability to follow reference commands. The rules resulting from the reinforcement learning are explicitly stored and they can be modified or augmented by human experts. Due to overlapping storage scheme of SAM, the stored rules are similar to fuzzy rules.

Tsai, Wei K.↗

Two MODIS Aerosol Products Over Ocean on the Terra and Aqua CERES SSF Datasets

Over ocean, two aerosol products are reported on the Terra and Aqua CERES SSFs. Both are derived from MODIS, but using different sampling and aerosol algorithms. This study briefly summarizes these products, and compares using 2 weeks of global Terra data from 15-21 December 2000, and 1-7 June 2001.

Ignatov, Alexander↗

A Distributive, Non-Destructive, Real-Time Approach to Snowpack Monitoring

This invention is designed to ascertain the snow water equivalence (SWE) of snowpacks with better spatial and temporal resolutions than present techniques. The approach is ground-based, as opposed to some techniques that are air-based. In addition, the approach is compact, non-destructive, and can be communicated with remotely, and thus can be deployed in areas not possible with current methods. Presently there are two principal ground-based techniques for obtaining SWE measurements. The first is manual snow core measurements of the snowpack. This approach is labor-intensive, destructive, and has poor temporal resolution. The second approach is to deploy a large (e.g., 3x3 m) snowpillow, which requires significant infrastructure, is potentially hazardous [uses a approximately equal to 200-gallon (approximately equal to 760-L) antifreeze-filled bladder], and requires deployment in a large, flat area. High deployment costs necessitate few installations, thus yielding poor spatial resolution of data. Both approaches have limited usefulness in complex and/or avalanche-prone terrains. This approach is compact, non-destructive to the snowpack, provides high temporal resolution data, and due to potential low cost, can be deployed with high spatial resolution. The invention consists of three primary components: a robust wireless network and computing platform designed for harsh climates, new SWE sensing strategies, and algorithms for smart sampling, data logging, and SWE computation.

Frolik, Jeff↗

Modeling the Swift BAT Trigger Algorithm with Machine Learning

To draw inferences about gamma-ray burst (GRB) source populations based on Swift observations, it is essential to understand the detection efficiency of the Swift burst alert telescope (BAT). This study considers the problem of modeling the Swift BAT triggering algorithm for long GRBs, a computationally expensive procedure, and models it using machine learning algorithms. A large sample of simulated GRBs from Lien et al. (2014) is used to train various models: random forests, boosted decision trees (with AdaBoost), support vector machines, and artificial neural networks. The best models have accuracies of approximately greater than 97% (approximately less than 3% error), which is a significant improvement on a cut in GRB flux which has an accuracy of 89:6% (10:4% error). These models are then used to measure the detection efficiency of Swift as a function of redshift z, which is used to perform Bayesian parameter estimation on the GRB rate distribution. We find a local GRB rate density of eta(sub 0) approximately 0.48(+0.41/-0.23) Gpc(exp -3) yr(exp -1) with power-law indices of eta(sub 1) approximately 1.7(+0.6/-0.5) and eta(sub 2) approximately -5.9(+5.7/-0.1) for GRBs above and below a break point of z(sub 1) approximately 6.8(+2.8/-3.2). This methodology is able to improve upon earlier studies by more accurately modeling Swift detection and using this for fully Bayesian model fitting. The code used in this is analysis is publicly available online.

gamma rays: general↗

Analyzing and Predicting Effort Associated with Finding and Fixing Software Faults

Context: Software developers spend a significant amount of time fixing faults. However, not many papers have addressed the actual effort needed to fix software faults. Objective: The objective of this paper is twofold: (1) analysis of the effort needed to fix software faults and how it was affected by several factors and (2) prediction of the level of fix implementation effort based on the information provided in software change requests. Method: The work is based on data related to 1200 failures, extracted from the change tracking system of a large NASA mission. The analysis includes descriptive and inferential statistics. Predictions are made using three supervised machine learning algorithms and three sampling techniques aimed at addressing the imbalanced data problem. Results: Our results show that (1) 83% of the total fix implementation effort was associated with only 20% of failures. (2) Both safety critical failures and post-release failures required three times more effort to fix compared to non-critical and pre-release counterparts, respectively. (3) Failures with fixes spread across multiple components or across multiple types of software artifacts required more effort. The spread across artifacts was more costly than spread across components. (4) Surprisingly, some types of faults associated with later life-cycle activities did not require significant effort. (5) The level of fix implementation effort was predicted with 73% overall accuracy using the original, imbalanced data. Using oversampling techniques improved the overall accuracy up to 77%. More importantly, oversampling significantly improved the prediction of the high level effort, from 31% to around 85%. Conclusions: This paper shows the importance of tying software failures to changes made to fix all associated faults, in one or more software components and/or in one or more software artifacts, and the benefit of studying how the spread of faults and other factors affect the fix implementation effort.

software fix implementation effort↗

Modeling the Swift Bat Trigger Algorithm with Machine Learning

To draw inferences about gamma-ray burst (GRB) source populations based on Swift observations, it is essential to understand the detection efficiency of the Swift burst alert telescope (BAT). This study considers the problem of modeling the Swift / BAT triggering algorithm for long GRBs, a computationally expensive procedure, and models it using machine learning algorithms. A large sample of simulated GRBs from Lien et al. is used to train various models: random forests, boosted decision trees (with AdaBoost), support vector machines, and artificial neural networks. The best models have accuracies of greater than or equal to 97 percent (less than or equal to 3 percent error), which is a significant improvement on a cut in GRB flux, which has an accuracy of 89.6 percent (10.4 percent error). These models are then used to measure the detection efficiency of Swift as a function of redshift z, which is used to perform Bayesian parameter estimation on the GRB rate distribution. We find a local GRB rate density of n (sub 0) approaching 0.48 (sup plus 0.41) (sub minus 0.23) per cubic gigaparsecs per year with power-law indices of n (sub 1) approaching 1.7 (sup plus 0.6) (sub minus 0.5) and n (sub 2) approaching minus 5.9 (sup plus 5.7) (sub minus 0.1) for GRBs above and below a break point of z (redshift) (sub 1) approaching 6.8 (sup plus 2.8) (sub minus 3.2). This methodology is able to improve upon earlier studies by more accurately modeling Swift detection and using this for fully Bayesian model fitting.

gamma-ray burst: general – gamma-rays: general â↗

Combining Data with Physical Knowledge for Uncertainty Quantification in Certification and Reliability Analysis

Unifying empirical data with predictive models can enable engineering cost-savings through certification by analysis and reliability-based design. Both concepts require rigorous uncertainty quantification (UQ) and robust understanding and treatment of relevant physics. Combining sampling-based UQ algorithms with high-fidelity simulations creates a computational bottleneck that is often alleviated through the use of machine learning (ML). ML can be used to create computationally efficient surrogates for simulations of complex or high-dimensional physical interactions (e.g., multi-phase interactions associated with melt pools in laser powder bed fusion or spatially-dependent material properties in functionally graded materials). However, negative side effects of ML may include a lack of interpretability and negative correlation between event rarity and simulation accuracy due to a lack of training data. As such, it is important to infuse ML algorithms with physics-based guardrails to provide confidence in their predictions. This talk will provide a brief review of recent NASA research at this intersection of physics-based simulation, ML, and UQ with a focus on certification and reliability analysis.

uncertainty quantification↗

Event-by-Event Fission with FREYA

The recently developed code FREYA (Fission Reaction Event Yield Algorithm) generates large samples of complete fission events, consisting of two receding product nuclei as well as a number of neutrons and photons, all with complete kinematic information. Thus it is possible to calculate arbitrary correlation observables whose behavior may provide unique insight into the fission process. The presentation first discusses the present status of FREYA, which has now been extended up to energies where pre-equilibrium emission becomes significant and one or more neutrons may be emitted prior to fission. Concentrating on {sup 239}Pu(n,f), we discuss the neutron multiplicity correlations, the dependence of the neutron energy spectrum on the neutron multiplicity, and the relationship between the fragment kinetic energy and the number of neutrons and their energies. We also briefly suggest novel fission observables that could be measured with modern detectors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

C-SAW: a framework for graph sampling and random walk on GPUs

Many applications require to learn, mine, analyze and visualize large-scale graphs. These graphs are often too large to be addressed efficiently using conventional graph processing technologies. Fortunately, recent research efforts find out graph sampling and random walk, which significantly reduce the size of original graphs, can benefit the tasks of learning, mining, analyzing and visualizing large graphs by capturing the desirable graph properties. This paper introduces C-SAW, the first framework that accelerates Sampling and Random Walk framework on GPUs. Particularly, C-SAW makes three contributions: First, our framework provides a generic API which allows users to implement a wide range of sampling and random walk algorithms with ease. Second, offloading this framework on GPU, we introduce warp-centric parallel selection, and two novel optimizations for collision migration. Third, towards supporting graphs that exceed the GPU memory capacity, we introduce efficient data transfer optimizations for out-of-memory and multi-GPU sampling, such as workload-aware scheduling and batched multi-instance sampling. Taken together, our framework constantly outperforms the state of the art projects in addition to the capability of supporting a wide range of sampling and random walk algorithms.

97 MATHEMATICS AND COMPUTING↗