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 739 records · Page 41

Oscillations and random walk of the soliton core in a fuzzy dark matter halo

We report that a fuzzy dark matter halo consists of a soliton core close to the center and a Navarro-Frenk-White–like density profile in the outer region. Previous investigations found that the soliton core exhibits temporal oscillations and random walk excursions around the halo center. Analyzing a set of numerical simulations, we show that both phenomena can be understood as the results of wave interference - a suitable superposition of the ground (solitonic) state and excited states in a fixed potential suffices to account for the main features of these phenomena. Such an eigenmode analysis can shed light on the evolution of a satellite halo undergoing tidal disruption. As the outer halo is stripped away, reducing the amplitudes of the excited states, the ground state evolves adiabatically. This suggests diminished soliton oscillations and random walk excursions, an effect to consider in deducing constraints from stellar heating.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral form factors of clean and random quantum Ising chains

We compute the spectral form factor of two integrable quantum-critical many-body systems in one spatial dimension. The spectral form factor of the quantum Ising chain is periodic in time in the scaling limit described by a conformal field theory; we also compute corrections from lattice effects and deviation from criticality. Iin this work, criticality in the random Ising chain is described by rare regions associated with a strong randomness fixed point, and these control the long-time limit of the spectral form factor.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Precise algorithm to generate random sequential adsorption of hard polygons at saturation

Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a "saturation'' limit. Although this limit has attracted particular research interest, the majority of past studies could only probe this limit by extrapolation. We have previously found an algorithm to reach this limit using finite computational time for spherical particles, and could thus determine the saturation density of spheres with high accuracy. Here in this paper, we generalize this algorithm to generate saturated RSA packings of two-dimensional polygons. We also calculate the saturation density for regular polygons of three to ten sides, and obtain results that are consistent with previous, extrapolation-based studies.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Effect of Mach number and volume fraction in air-shock interacting with a bed of randomly distributed spherical particles

Shock-particle interaction is a fundamental problem in many engineering applications, with the dynamics being heavily influenced by the incident-shock Mach number and the particle volume fraction. In this paper we present fully resolved inviscid simulations of an incident-shock wave traveling through a bed of randomly distributed spherical particles. We vary the strength of the incident shock along with the particle volume fraction in order to study the complex wave interaction during shock-particle interaction. In this study we are interested in the early-time behavior during which the particles do not move and hence in our simulations all the particles are fixed in space. We compute the streamwise average of flow field quantities to generate the x - t contour plots to study the unsteady oscillations inside the particle bed. We observe that the transmitted shock slows down under certain conditions and it is partly due to tortuosity and partly due to weakening caused by energy dissipation. We also present the force histories of the streamwise drag and lift forces for all the particles. The random distribution of particles leads to high variability in the drag force experienced by the particles. We compute the mean peak drag force as a function of the streamwise location to study the mean behavior of the transmitted shock. Based on our findings, we propose simple modifications to improve the current point-particle models used in Euler-Lagrange simulations of shock interacting with a bed of particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Shock interacting with a random array of stationary particles underwater

Accurately predicting the force experienced by particles within a random bed during shock traversal is a challenging problem. In this paper, particle-resolved inviscid simulations of shock propagation over randomly distributed beds are performed, with the goal of quantifying the force on individual particles. Water was considered the continuum material, and then results were compared with previous research completed in air and the differences resulting from these different mediums were examined. Simulations were conducted for four different combinations of incident Mach number and bed volume fraction with the particles remaining stationary. Additionally, time-resolved streamwise and transverse force coefficients were calculated for each particle in the bed. It was observed that while the average force coefficient was similar to that of an isolated particle, the force on individual particles was substantially different. An important observation was that the inviscid drag force on some particles remained consistently positive, but others consistently negative even long after the passage of the shock. This persistent force on the particle was attributed to the potential flow fields that result from neighbors' specific locations upstream and downstream. Similar behavior was observed in the transverse force, with particles experiencing sustained force in the same lateral direction. These persistent forces are inviscid quasisteady contributions which with the viscous counterpart will play an essential role in the particle's long-term dispersion if allowed to move in response to the force.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Phase Diagram of a Three-Dimensional Antiferromagnet with Random Magnetic Anisotropy

Three-dimensional (3D) antiferromagnets with random magnetic anisotropy (RMA) that were experimentally studied to date have competing two-dimensional and three-dimensional exchange interactions which can obscure the authentic effects of RMA. The magnetic phase diagram of Fe x Ni 1-x F 2 epitaxial thin films with true random single-ion anisotropy was deduced from magnetometry and neutron scattering measurements and analyzed using mean field theory. Regions with uniaxial, oblique and easy plane anisotropies were identified. A RMA-induced glass region was discovered where a Griffiths-like breakdown of long-range spin order occurs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite-Time Teleportation Phase Transition in Random Quantum Circuits

How long does it take to entangle two distant qubits in a quantum circuit evolved by generic unitary dynamics? Here, we show that if the time evolution is followed by measurements of all but two infinitely separated test qubits, then the entanglement between them can undergo a phase transition and become nonzero at a finite critical time t c . The fidelity of teleporting a quantum state from an input qubit to an infinitely distant output qubit shows the same critical onset. Specifically, these finite-time transitions occur in short-range interacting two-dimensional random unitary circuits and in sufficiently long-range interacting one-dimensional circuits. The phase transition is understood by mapping the random continuous-time evolution to a finite-temperature thermal state of an effective spin Hamiltonian, where the inverse temperature equals the evolution time in the circuit. In this framework, the entanglement between two distant qubits at times t > t c corresponds to the emergence of long-range ferromagnetic spin correlations below the critical temperature. We verify these predictions using numerical simulation of Clifford circuits and propose potential realizations in existing platforms for quantum simulation.

36 MATERIALS SCIENCE↗

Explainable machine learning for hydrogen diffusion in metals and random binary alloys

Hydrogen diffusion in metals and alloys plays an important role in the discovery of new materials for fuel cell and energy storage technology. While analytic models use hand-selected features that have clear physical ties to hydrogen diffusion, they often lack accuracy when making quantitative predictions. Machine learning models are capable of making accurate predictions, but their inner workings are obscured, rendering it unclear which physical features are truly important. To develop interpretable machine learning models to predict the activation energies of hydrogen diffusion in metals and random binary alloys, we create a database for physical and chemical properties of the species and use it to fit six machine learning models. Our models achieve root-mean-squared errors between 98–119 meV on the testing data and accurately predict that elemental Ru has a large activation energy, while elemental Cr and Fe have small activation energies. By analyzing the feature importances of these fitted models, we identify relevant physical properties for predicting hydrogen diffusivity. While metrics for measuring the individual feature importances for machine learning models exist, correlations between the features lead to disagreement between models and limit the conclusions that can be drawn. Instead grouped feature importance, formed by combining the features via their correlations, agree across the six models and reveal that the two groups containing the packing factor and electronic specific heat are particularly significant for predicting hydrogen diffusion in metals and random binary alloys. In conclusion, this framework allows us to interpret machine learning models and enables rapid screening of new materials with the desired rates of hydrogen diffusion.

36 MATERIALS SCIENCE↗

Random forest prediction of crystal structure from electron diffraction patterns incorporating multiple scattering

Diffraction is the most common method to solve for unknown or partially known crystal structures. However, it remains a challenge to determine the crystal structure of a new material that may have nanoscale size or heterogeneities. Here, in this study, we train an architecture of hierarchical random forest models capable of predicting the crystal system, space group, and lattice parameters from one or more unknown two-dimensional electron diffraction patterns. Our initial model correctly identifies the crystal system of a simulated electron diffraction pattern from a 20-nm-thick specimen of arbitrary orientation 67% of the time. We achieve a topline accuracy of 79% when aggregating predictions from ten patterns of the same material but different zone axes. The space group and lattice predictions range from 70% to 90% accuracy and median errors of 0.01-0.5Å, respectively, for cubic, hexagonal, trigonal, and tetragonal crystal systems while being less reliable on orthorhombic and monoclinic systems. We apply this architecture to a four-dimensional scanning transmission electron microscopy scan of gold nanoparticles, where it accurately predicts the crystal structure and lattice constants. These random forest models can be used to significantly accelerate the analysis of electron diffraction patterns, particularly in the case of unknown crystal structures. Additionally, due to the speed of inference, these models could be integrated into live transmission electron microscopy experiments, allowing real-Time labeling of a specimen.

36 MATERIALS SCIENCE↗

Random singlet-like state in the dimer-based triangular antiferromagnet Ba 6 Y 2 Rh 2 Ti 2 O 17 − δ

We present the magnetic, thermodynamic, and muon spin relaxation ( μ SR ) results of the dimer-based triangular antiferromagnet Ba 6 Y 2 Rh 2 Ti 2 O 17 − δ . The magnetic susceptibility data show the sub-Curie-Weiss behavior χ ( T ) ∝ T − α χ below 100 K, suggesting random magnetism. The isothermal magnetization results reveal the presence of weakly interacting structural orphan spins about 6.1 % at 2 K, arising from the oxygen deficiency. The comprehensive μ SR experiments exhibit the coexisting relaxing and nonrelaxing components along with the thermally activated behavior in the muon spin relaxation rate, reflecting the fluctuating orphan spins in the dimer singlet background. In addition, we observe the scaling behavior of M ( H , T ) in H / T and P z ( t ) in t / H LF with the scaling exponents α χ = α M = 0.75 and α μ = 0.72 , respectively, but not for the magnetic specific heat data. The failure of the scaling relation in C m ( H , T ) / T implies low-energy excitations dressed by the conventional orphan spins. Based on these observations, we find that the magnetic ground state resembles random singlets and discuss the possible configurations of the spin dimer unit Rh 2 O 9 . Our results shed light on the role of quenched disorder in the dimer-based frustrated magnets. Published by the American Physical Society 2024

Lee, Wonjun (ORCID:000000034848852X)↗

Saturation and Recurrence of Quantum Complexity in Random Local Quantum Dynamics

Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing—in studying the dynamics of quantum many-body systems and the long-time properties of anti–de Sitter black holes. In this context, Brown and Susskind [] conjectured that the complexity of a chaotic quantum system grows linearly in time up to times exponential in the system size, saturating at a maximal value, and remaining maximally complex until undergoing recurrences at doubly exponential times. In this work, we prove the saturation and recurrence of complexity in two models of chaotic time evolutions based on (i) random local quantum circuits and (ii) stochastic local Hamiltonian evolution. Our results advance an understanding of the long-time behavior of chaotic quantum systems and could shed light on the physics of black-hole interiors. From a technical perspective, our results are based on establishing new quantitative connections between the Haar measure and high-degree approximate designs, as well as the fact that random quantum circuits of sufficiently high depth converge to approximate designs. Published by the American Physical Society 2024

Oszmaniec, Michał (ORCID:0000000249466835)↗

Fully Scalable Randomized Benchmarking Without Motion Reversal

We introduce , a protocol that streamlines traditional RB by using circuits consisting almost entirely of independent identically distributed (IID) layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor-product eigenstates of random Pauli operators through random circuits with IID layers. Unlike existing RB methods, BiRB does not use motion reversal circuits—i.e., circuits that implement the identity (or a Pauli) operator—which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely used RB methods. Published by the American Physical Society 2024

Hines, Jordan (ORCID:0000000151267256)↗

Improving the chances of successful protein structure determination with a random forest classifier

Using an extended set of protein features calculated separately for protein surface and interior, a new version of XtalPred based on a random forest classifier achieves a significant improvement in predicting the success of structure determination from the primary amino-acid sequence. Obtaining diffraction quality crystals remains one of the major bottlenecks in structural biology. The ability to predict the chances of crystallization from the amino-acid sequence of the protein can, at least partly, address this problem by allowing a crystallographer to select homologs that are more likely to succeed and/or to modify the sequence of the target to avoid features that are detrimental to successful crystallization. In 2007, the now widely used XtalPred algorithm [Slabinski et al. (2007 ▶), Protein Sci.16, 2472–2482] was developed. XtalPred classifies proteins into five ‘crystallization classes’ based on a simple statistical analysis of the physicochemical features of a protein. Here, towards the same goal, advanced machine-learning methods are applied and, in addition, the predictive potential of additional protein features such as predicted surface ruggedness, hydrophobicity, side-chain entropy of surface residues and amino-acid composition of the predicted protein surface are tested. The new XtalPred-RF (random forest) achieves significant improvement of the prediction of crystallization success over the original XtalPred. To illustrate this, XtalPred-RF was tested by revisiting target selection from 271 Pfam families targeted by the Joint Center for Structural Genomics (JCSG) in PSI-2, and it was estimated that the number of targets entered into the protein-production and crystallization pipeline could have been reduced by 30% without lowering the number of families for which the first structures were solved. The prediction improvement depends on the subset of targets used as a testing set and reaches 100% (i.e. twofold) for the top class of predicted targets.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

EGBTER: Capturing Degree Distribution, Clustering Coefficients, and Community Structure in a Single Random Graph Model

Random graph models are important constructs for data analytic applications as well as pure mathematical developments, as they provide capabilities for network synthesis and principled analysis. Several models have been developed with the aim of faithfully preserving important graph metrics and substructures. With the goal of capturing degree distribution, clustering coefficient, and communities in a single random graph model, we propose a new model to address shortcomings in a progression of network modeling capabilities. The Block Two-Level Erdos-Rényi (BTER) model of Seshadhri et aI., designed to allow prescription of expected degree and clustering coefficient distributions, neglects community modeling, while the Generalized BTER (GBTER) model of Bridges et aI., designed to add community modeling capabilities to BTER, struggles to faithfully represent all three characteristics simultaneously. In this work, we fit BTER and two GBTER configurations to several real-world networks and compare the results with that of our new model, the Extended GBTER (EGBTER) model. Our results support that EBGTER adds a community-modeling flexibility to BTER, while retaining a satisfactory level of accuracy in terms of degree and clustering coefficient. Our insights and empirical testing of previous models as well as the new model are novel contributions to the literature.

El-Daghar, Omar↗

RanCompute: Computational Security in Embedded Devices via Random Input and Output Encodings

An embedded device in an insecure environment is subject to additional security risk through capture and reverse-engineering by a capable adversary. If this device contains a microchip performing sensitive computations, capture of the chip may leak functionality to an adversary. In this paper we propose a novel method in which we randomly encode the input operands and the outputs of a computation, thus not revealing the arithmetic operations being performed. The operations are sequenced in a graph representing the overall application. Once the initialization values are overwritten and lost, the results of these computations are indecipherable by the device performing the calculations as well as by any adversary. The result is transmitted back to a secure server which has stored the initialization values and so can decode the results which appear random to the adversary.

Embedded computing↗

Efficient and Collision-Free Anticipative Cruise Control in Randomly Mixed Strings

Connected intelligent vehicle following can improve safety and efficiency compared to today's road transport, but real traffic in the near future will not provide an ideal setting for its deployment. Unconnected human-driven vehicles will follow variable behavior patterns that combine with differences in dynamic capability to create heterogeneous scenarios. In this paper, connected automated vehicles employ model predictive control for following in traffic that may include both heavy and passenger vehicles at quasi-random positions. Adding further realism, some quasi-randomly mixed vehicles are completely unconnected and equipped with the reactive intelligent driver model using pseudorandom parameters. A mixed-integer quadratic programming formulation adapts the predictive algorithm to diverse powertrain operating point constraints. The preceding vehicle's control input is estimated from velocity and brake light observations and used to probabilistically generate a preview for the ego vehicle. Here, a terminal constraint designed using particle kinematics prevents collisions due to shortsightedness. Results are simulated at various heavy and predictive vehicle concentrations in the presence of packet loss. Linear fuel economy improvements between 1.4% and 1.9% per 10% increase in predictive vehicle penetration rate are shown.

33 ADVANCED PROPULSION SYSTEMS↗

Split‐dose 4‐L polyethylene glycol regimen for patients with previous colorectal surgery in bowel preparation before colonoscopy: A randomized, controlled, single‐blind study

OBJECTIVE We aimed to investigate the efficacy of a split‐dose 4‐L polyethylene glycol (PEG) regimen for the quality of bowel preparation in Asian patients with previous colorectal surgery for colorectal cancer (CRC). METHODS This was a prospective, single‐center, randomized controlled, endoscopist‐blinded study. Patients with previous colorectal surgery for CRC were randomly allocated to a routine, morning‐only 2‐L PEG (2‐MO) group or a split‐dose 4‐L PEG (4‐SD) group. The primary outcome was a successful bowel preparation rate. Secondary outcomes were polyp detection rate (PDR), adenoma detection rate (ADR), patient compliance, satisfaction, tolerance, willingness to repeat the preparation and difficulty of the bowel preparation process. RESULTS In total, 187 patients were included (93 in the 2‐MO group, 94 in the 4‐SD group) in this study. The rate of successful bowel preparation in the 4‐SD group was higher than in the 2‐MO group (89.4% vs 66.7%, P < 0.001) in an intention‐to‐treat analysis according to the Aronchick score. Patients’ satisfaction with the bowel preparation process in the 4‐SD group was superior to that in the 2‐MO group (93.4% vs 82.2%, P = 0.021). No significant differences were detected in PDR, ADR, patient compliance, tolerance, willingness to repeat the preparation or difficulty of the bowel preparation process. CONCLUSIONS The 4‐SD PEG regimen was superior to a routine, morning‐only 2‐L PEG preparation for bowel preparation in an Asian population with previous colorectal surgery.

Liu, Zhu↗

Simple effective conservative treatment of uncertainty from sparse samples of random functions

This paper examines the variability of predicted responses when multiple stress-strain curves (reflecting variability from replicate material tests) are propagated through a finite element model of a ductile steel can being slowly crushed. Over 140 response quantities of interest (including displacements, stresses, strains, and calculated measures of material damage) are tracked in the simulations. Each response quantity’s behavior varies according to the particular stress-strain curves used for the materials in the model. We desire to estimate response variability when only a few stress-strain curve samples are available from material testing. Propagation of just a few samples will usually result in significantly underestimated response uncertainty relative to propagation of a much larger population that adequately samples the presiding random-function source. A simple classical statistical method, Tolerance Intervals, is tested for effectively treating sparse stress-strain curve data. The method is found to perform well on the highly nonlinear input-to-output response mappings and non-standard response distributions in the can-crush problem. The results and discussion in this paper support a proposition that the method will apply similarly well for other sparsely sampled random variable or function data, whether from experiments or models. Finally, the simple Tolerance Interval method is also demonstrated to be very economical.

36 MATERIALS SCIENCE↗