Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomization”

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,207 records · Page 67

Seed classification with random forest models

Premise: To improve forest conservation monitoring, we developed a protocol to automatically count and identify the seeds of plant species with minimal resource requirements, making the process more efficient and less dependent on human operators. Methods and Results: Seeds from six North American conifer tree species were separated from leaf litter and imaged on a flatbed scanner. In the most successful species-classification approach, an ImageJ macro automatically extracted measurements for random forest classification in the software R. The method allows for good classification accuracy, and the same process can be used to train the model on other species. Conclusions: This protocol is an adaptable tool for efficient and consistent identification of seed species or potentially other objects. Automated seed classification is efficient and inexpensive, making it a practical solution that enhances the feasibility of large-scale monitoring projects in conservation biology.

59 BASIC BIOLOGICAL SCIENCES↗

A GPU Accelerated Mixed‐Precision Finite Difference Informed Random Walker (FDiRW) Solver for Strongly Inhomogeneous Diffusion Problems

In nature, many complex multi‐physics coupling problems exhibit significant diffusivity inhomogeneity, where one process occurs several orders of magnitude faster than others temporally. Simulating rapid diffusion alongside slower processes demands intensive computational resources due to the necessity for small time steps. To address these computational challenges, we have developed an efficient numerical solver named Finite Difference informed Random Walker (FDiRW). In this study, we propose a GPU‐accelerated, mixed‐precision configuration for the FDiRW solver to maximize efficiency through GPU multi‐threaded parallel computation and lower precision computation. Numerical evaluation results reveal that the proposed GPU‐accelerated mixed‐precision FDiRW solver can achieve a 117× speedup over the CPU baseline, while an additional 1.75× speedup is achieved by employing lower precision GPU computation. Notably, for large model sizes, the GPU‐accelerated mixed‐precision FDiRW solver demonstrates strong scaling with the number of nodes used in simulation. When simulating radionuclide absorption processes by porous wasteform particles with a medium‐sized model of 192 × 192 × 192, this approach reduces the total computational time to 10 min, enabling the simulation of larger systems with strongly inhomogeneous diffusivity.

97 MATHEMATICS AND COMPUTING↗

Effects of random forest modeling decisions on biogeochemical time series predictions

Abstract Random forests (RF) are an increasingly popular machine learning approach used to model biogeochemical processes in the Earth system. While RF models are robust to many assumptions that complicate deterministic models, there are several important parameterization decisions for appropriate use and optimal model fit. We explored the role that parameter decisions, including training/testing data splitting strategies, variable selection, and hyperparameters play on RF goodness‐of‐fit by constructing models using 1296 unique parameter combinations to predict concentrations of nitrate, a key nutrient for biogeochemical cycling in aquatic ecosystems. Models were built on long‐term, publicly available water quality and meteorology time series collected by the National Estuarine Research Reserve monitoring network for two contrasting ecosystems representing freshwater and brackish estuaries. We found that accounting for temporal dependence when splitting data into training and testing subsets was key for avoiding over‐estimation of model predictive power. In addition, variable selection, the ratio of training to testing data, and to a lesser degree, variables per split and number of trees, were significant parameters for optimizing RF goodness‐of‐fit. We also explored how model parameter decisions influenced interpretation of the relative importance of predictors to the model, and model predictor‐dependent variable relationships, with results suggesting that both data structure and model parameterization influence these factors. Because much of the current RF literature is written for the computational and statistical science communities, the primary goal of this study is to provide guidelines for aquatic scientists new to machine learning to apply RF techniques appropriately to aquatic biogeochemical datasets.

54 ENVIRONMENTAL SCIENCES↗

A mathematical assessment of the isolation random forest method for anomaly detection in big data

We present the mathematical analysis of the Isolation Random Forest Method (IRF Method) for anomaly detection, proposed by Liu F.T., Ting K.M. and Zhou Z. H. in their seminal work as a heuristic method for anomaly detection in Big Data. We prove that the IRF space can be endowed with a probability induced by the Isolation Tree algorithm (iTree). In this setting, the convergence of the IRF method is proved, using the Law of Large Numbers. Here, a couple of counterexamples are presented to show that the method is inconclusive and no certificate of quality can be given, when using it as a means to detect anomalies. Hence, an alternative version of the method is proposed whose mathematical foundation is fully justified. Furthermore, a criterion for choosing the number of sampled trees needed to guarantee confidence intervals of the numerical results is presented. Finally, numerical experiments are presented to compare the performance of the classic method with the proposed one.

97 MATHEMATICS AND COMPUTING↗

Identifying Nuclear Data Correlated Through Predicting Bias in Integral Experiments via Applying Principal Component Analysis to Random Forest

ABSTRACT Nuclear data (ND) are the input data for neutron‐transport simulations to answer questions related to nuclear technologies. Subsets of ND, here > 20,000 data points, are validated with respect to thousands of criticality experiments that represent various applications on a small scale. The aim of validation with these experiments is to find errors in ND or methods. The key challenge here is that several hundreds of ND are used to simulate one integral value. Hence, one cannot clearly identify what ND are leading to bias in criticality measurements. In fact, a mistake in one nuclear‐data observable can be compensated with an error in another, and the predicted criticality value would still be predicted in agreement with experimental data. Random forest (RF) was previously employed to predict bias in criticality measurements using sensitivities of simulated criticality experiments to ND. The SHapley Additive exPlanations (SHAP) metric was then applied to attribute the importance of each ND experiment and observable to bias prediction. This, however, did not highlight what ND were jointly related to predicting bias. This is important as it could inform us about where compensating errors in ND could hide. We tackle this shortcoming here by first decomposing the ND sensitivities to integral‐experiment simulations into principal components. Then we use principal component projections to predict bias via the RF and SHAP. The SHAP values and principal components are employed to reconstruct detailed SHAP values for each ND observable. We demonstrate that these extended SHAP bias predictions are more robust, less noisy, and more efficient. In addition, we show that this approach accounts for covariance in ND sensitivities and automates the identification of where compensating errors could hide in ND.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Discrete-Time Pricing and Optimal Exercise of American Perpetual Warrants in the Geometric Random Walk Model

An American option (or, warrant) is the right, but not the obligation, to purchase or sell an underlying equity at any time up to a predetermined expiration date for a predetermined amount. A perpetual American option differs from a plain American option in that it does not expire. In this study, we solve the optimal stopping problem of a perpetual American option (both call and put) in discrete time using linear programming duality. Under the assumption that the underlying stock price follows a discrete time and discrete state Markov process, namely a geometric random walk, we formulate the pricing problem as an infinite dimensional linear programming (LP) problem using the excessive-majorant property of the value function. This formulation allows us to solve complementary slackness conditions in closed-form, revealing an optimal stopping strategy which highlights the set of stock-prices where the option should be exercised. The analysis for the call option reveals that such a critical value exists only in some cases, depending on a combination of state-transition probabilities and the economic discount factor (i.e., the prevailing interest rate) whereas it ceases to be an issue for the put.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bogoliubov Theory for a Superfluid Bose Gas Flowing in a Random Potential: Stability and Critical Velocity

We investigate the stability and critical velocity of a weakly interacting Bose gas flowing in a random potential. By applying the Bogoliubov theory to a disordered Bose system with a steady flow, the condensate density and the superfluid density are determined as functions of the disorder strength, flow velocity, and temperature. The critical velocity, at which the steady flow becomes unstable, is calculated from the spectrum of hydrodynamic excitation. We also show that in two dimensions the critical velocity strongly depends on the system size.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DG-IMEX Stochastic Galerkin Schemes for Linear Transport Equation with Random Inputs and Diffusive Scalings

In this paper, we consider the linear transport equation under diffusive scaling and with random inputs. The method is based on the generalized polynomial chaos approach in the stochastic Galerkin framework. Several theoretical aspects will be addressed. Additionally, a uniform numerical stability with respect to the Knudsen number ϵ, and a uniform in ϵ error estimate is given. For temporal and spatial discretizations, we apply the implicit–explicit scheme under the micro–macro decomposition framework and the discontinuous Galerkin method, as proposed in Jang et al. (SIAM J Numer Anal 52:2048–2072, 2014) for deterministic problem. Lastly, we provide a rigorous proof of the stochastic asymptotic-preserving (sAP) property. Extensive numerical experiments that validate the accuracy and sAP of the method are conducted.

97 MATHEMATICS AND COMPUTING↗

Effects of the Random Crystal Field on the Phase Diagrams and the Magnetic Properties of a Spin-1 Blume-Capel Nanoisland

The phase diagrams and the magnetic properties of a spin-1 Blume-Capel nanoisland are investigated by the use of the effective-field theory based on the probability distribution technique. The influence of the random crystal field and the system parameters on the critical behaviors of the nanoisland are examined. The results show that the system can exhibit a first-order phase transition, a tricritical point, and a re-entrant or even a double re-entrant phenomenon.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Contact Processes with Random Recovery Rates and Edge Weights on Complete Graphs

In this paper we are concerned with the contact process with random recovery rates and edge weights on the complete graph with n vertices. We show that the model has a critical value which is inversely proportional to the product of the mean of the edge weight and the mean of the inverse of the recovery rate. In the subcritical case, the process dies out before an amount of time with order O(log n) with high probability as n→+∞. In the supercritical case, the process survives for an amount of time with order exp {O(n)} with high probability as n→+∞.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On Collisions Times of ‘Self-Sorting’ Interacting Particles in One-Dimension with Random Initial Positions and Velocities

We investigate a one-dimensional system of N particles, initially distributed with random positions and velocities, interacting through binary collisions. The collision rule is such that there is a time after which the N particles do not interact and become sorted according to their velocities. When the collisions are elastic, we derive asymptotic distributions for the final collision time of a single particle and the final collision time of the system as the number of particles approaches infinity, under different assumptions for the initial distributions of the particles’ positions and velocities. For comparison, a numerical investigation is carried out to determine how a non-elastic collision rule, which conserves neither momentum nor energy, affects the median collision time of a particle and the median final collision time of the system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lifshits Tails for Randomly Twisted Quantum Waveguides

We consider the Dirichlet Laplacian H{sub γ} on a 3D twisted waveguide with random Anderson-type twisting γ. We introduce the integrated density of states N{sub γ} for the operator H{sub γ}, and investigate the Lifshits tails of N{sub γ}, i.e. the asymptotic behavior of N{sub γ}(E) as E↓infsupp dN{sub γ}. In particular, we study the dependence of the Lifshits exponent on the decay rate of the single-site twisting at infinity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constant-Length Random Substitutions and Gibbs Measures

This work is devoted to the study of processes generated by random substitutions over a finite alphabet. We prove, under mild conditions on the substitution’s rule, the existence of a unique process which remains invariant under the substitution, and which exhibits a polynomial decay of correlations. For constant-length substitutions, we go further by proving that the invariant state is precisely a Gibbs measure which can be obtained as the projective limit of its natural Markovian approximations. We end up the paper by studying a class of substitutions whose invariant state is the unique Gibbs measure for a hierarchical two-body interaction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diameters of Random Distance Graphs

This paper contains an almost exhaustive description of all cases where a distance random graph asymptotically almost surely has diameter 1, 2, or greater than 2.

97 MATHEMATICS AND COMPUTING↗