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 955 records · Page 53

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↗

Binary pseudo-random array standards for calibration of 3D optical surface profilers used for metrology with aspheric x-ray optics

High-accuracy surface metrology is vitally important in manufacturing ultra-high-quality free-form mirrors designed to manipulate x-ray light with nanometer-scale wavelengths. The current and potential capabilities of x˗ray mirror manufacturing are limited by inherent imperfections of the integrated metrology tools. Metrology tools are currently calibrated with super-polished flat test-standard/reference mirrors. This is acceptable for fabrication of slightly curved x-ray optics. However, for even moderately curved aspherical x-ray mirrors the flat-reference calibration is not sufficiently accurate. For micro-stitching interferometry developed for surface measurements with curved x-ray mirrors, the tool aberration errors are known to be transferred into the optical surface topography of x-ray mirrors. Our approach to improving metrology is to thoroughly calibrate the measuring tool and apply the results of the calibration to deconvolution of the measured data. Here we explore the application of a recently developed technique for calibrating the instrument transfer function (ITF) of 3D optical surface profilers to metrology with significantly curved x-ray optics. The technique, based on test standards patterned with two-dimensional (2D) binary pseudo-random arrays (BPRAs), employs the unique properties of the BPRA patterns in the spatial frequency domain. The inherent 2D power spectral density of the pattern has a deterministic white-noise-like character that allows direct determination of the ITF with uniform sensitivity over the entire spatial frequency range and field of view of an instrument. The high efficacy of the technique has been previously demonstrated in application to metrology with flat and slightly curved optics. Here, we concentrate on development of an efficient fabrication process for production of highly randomized (HR) BPRA test standards on flat and 500-mm spherical optical substrates. We also compare and discuss the results of the ITF calibration of an interferometric microscope when using the HR BPRA standards on flat and curved substrates.

Munechika, Keiko↗

Binary pseudo-random array standards for calibration of 3D optical surface profilers used for metrology with significantly curved x-ray optics

High-accuracy metrology is vitally important in manufacturing ultra-high-quality free-form mirrors designed to manipulate X-ray light with nanometer-scale wavelengths. The current capabilities and possibility for improvements in X-ray mirror manufacturing are limited by inherent imperfections of the integrated metrology tools. In the case of Fizeau interferometry, metrology tools are currently calibrated with super-polished flat test-standard/reference mirrors. This is acceptable for measuring slightly curved X-ray optics. However, for even moderately curved aspherical X-ray mirrors the flat-reference calibration is not sufficiently accurate and stitching Fizeau interferometer-based surface metrology is used to mitigate the problem. But still, the retrace and aberration errors, as well as the limited spatial resolution, described with the instrument transfer function (ITF), can be transferred into the optical surface topography of X-ray mirrors obtained in stitching metrology. For ITF calibration, we have developed an original technique, based on test standards structured as two-dimensional (2D) highly-randomized (HR) binary pseudo-random arrays (BPRAs). The technique employs the unique properties of the HR BPRA patterns in the spatial frequency domain., i.e. the inherent 2D power spectral density of the HR BPRA pattern has a deterministic white-noise-like character that allows direct determination of the ITF with uniform sensitivity over the entire spatial frequency range and field-of-view of an instrument. Here, we explore technological, metrological, and analytical aspects essential for calibration of the retrace and aberration errors of Fizeau interferometers using different types of tilted test samples, including a super-polished reference mirror for the re-trace calibration and the uniformly redundant array (URA) BPRA standards for the geometrical distortion (aberration) calibration. While the first method was previously demonstrated by researchers at DIAMOND Light Source, a method based on the URA BPRA is described and demonstrated here for the first time. We outline the design and fabrication process used in fabrication of URA BPRA test standards, and present the results of application of the URA BPRA standards demonstrating the high efficacy of our approach to geometrical distortion calibration of Fizeau interferometers. We also discuss the possible sources of unexpected peculiarities of the systematic errors, including an astigmatic character of the retrace error, observed with Fizeau interferometers at the Advanced Light Source X-Ray Optics Laboratory.

Munechika, Keiko↗

Development of a randomized 3D cell model for Monte Carlo microdosimetry simulations

Purpose: The objective of the current work was to develop an algorithm for growing a macroscopic tumor volume from individual randomized quasi-realistic cells. The major physical and chemical components of the cell need to be modeled. It is intended to import the tumor volume into GEANT4 (and potentially other Monte Carlo packages) to simulate ionization events within the cell regions. Methods: A MATLAB Copyright-Sign code was developed to produce a tumor coordinate system consisting of individual ellipsoidal cells randomized in their spatial coordinates, sizes, and rotations. An eigenvalue method using a mathematical equation to represent individual cells was used to detect overlapping cells. GEANT4 code was then developed to import the coordinate system into GEANT4 and populate it with individual cells of varying sizes and composed of the membrane, cytoplasm, reticulum, nucleus, and nucleolus. Each region is composed of chemically realistic materials. Results: The in-house developed MATLAB Copyright-Sign code was able to grow semi-realistic cell distributions ({approx}2 Multiplication-Sign 10{sup 8} cells in 1 cm{sup 3}) in under 36 h. The cell distribution can be used in any number of Monte Carlo particle tracking toolkits including GEANT4, which has been demonstrated in this work. Conclusions: Using the cell distribution and GEANT4, the authors were able to simulate ionization events in the individual cell components resulting from 80 keV gamma radiation (the code is applicable to other particles and a wide range of energies). This virtual microdosimetry tool will allow for a more complete picture of cell damage to be developed.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-E-CAMPUS-J-05: Quantitative Investigation of Random and Systematic Uncertainties From Hardware and Software Components in the Frameless 6DBrainLAB ExacTrac System

Purpose: To evaluate setup accuracy and quantify individual systematic and random errors for the various hardware and software components of the frameless 6D-BrainLAB ExacTrac system. Methods: 35 patients with cranial lesions, some with multiple isocenters (50 total lesions treated in 1, 3, 5 fractions), were investigated. All patients were simulated with a rigid head-and-neck mask and the BrainLAB localizer. CT images were transferred to the IPLAN treatment planning system where optimized plans were generated using stereotactic reference frame based on the localizer. The patients were setup initially with infrared (IR) positioning ExacTrac system. Stereoscopic X-ray images (XC: X-ray Correction) were registered to their corresponding digitally-reconstructed-radiographs, based on bony anatomy matching, to calculate 6D-translational and rotational (Lateral, Longitudinal, Vertical, Pitch, Roll, Yaw) shifts. XC combines systematic errors of the mask, localizer, image registration, frame, and IR. If shifts were below tolerance (0.7 mm translational and 1 degree rotational), treatment was initiated; otherwise corrections were applied and additional X-rays were acquired to verify patient position (XV: X-ray Verification). Statistical analysis was used to extract systematic and random errors of the different components of the 6D-ExacTrac system and evaluate the cumulative setup accuracy. Results: Mask systematic errors (translational; rotational) were the largest and varied from one patient to another in the range (−15 to 4mm; −2.5 to 2.5degree) obtained from mean of XC for each patient. Setup uncertainty in IR positioning (0.97,2.47,1.62mm;0.65,0.84,0.96degree) was extracted from standard-deviation of XC. Combined systematic errors of the frame and localizer (0.32,−0.42,−1.21mm; −0.27,0.34,0.26degree) was extracted from mean of means of XC distributions. Final patient setup uncertainty was obtained from the standard deviations of XV (0.57,0.77,0.67mm,0.39,0.35,0.30degree). Conclusion: Statistical analysis was used to calculate cumulative and individual systematic errors from the different hardware and software components of the 6D-ExacTrac-system. Patients were treated with cumulative errors (<1mm,<1degree) with XV image guidance.

60 APPLIED LIFE SCIENCES↗

SU-C-207B-05: Tissue Segmentation of Computed Tomography Images Using a Random Forest Algorithm: A Feasibility Study

Purpose: Develop an automated Random Forest algorithm for tissue segmentation of CT examinations. Methods: Seven materials were classified for segmentation: background, lung/internal gas, fat, muscle, solid organ parenchyma, blood/contrast, and bone using Matlab and the Trainable Weka Segmentation (TWS) plugin of FIJI. The following classifier feature filters of TWS were investigated: minimum, maximum, mean, and variance each evaluated over a pixel radius of 2n, (n = 0–4). Also noise reduction and edge preserving filters, Gaussian, bilateral, Kuwahara, and anisotropic diffusion, were evaluated. The algorithm used 200 trees with 2 features per node. A training data set was established using an anonymized patient’s (male, 20 yr, 72 kg) chest-abdomen-pelvis CT examination. To establish segmentation ground truth, the training data were manually segmented using Eclipse planning software, and an intra-observer reproducibility test was conducted. Six additional patient data sets were segmented based on classifier data generated from the training data. Accuracy of segmentation was determined by calculating the Dice similarity coefficient (DSC) between manual and auto segmented images. Results: The optimized autosegmentation algorithm resulted in 16 features calculated using maximum, mean, variance, and Gaussian blur filters with kernel radii of 1, 2, and 4 pixels, in addition to the original CT number, and Kuwahara filter (linear kernel of 19 pixels). Ground truth had a DSC of 0.94 (range: 0.90–0.99) for adult and 0.92 (range: 0.85–0.99) for pediatric data sets across all seven segmentation classes. The automated algorithm produced segmentation with an average DSC of 0.85 ± 0.04 (range: 0.81–1.00) for the adult patients, and 0.86 ± 0.03 (range: 0.80–0.99) for the pediatric patients. Conclusion: The TWS Random Forest auto-segmentation algorithm was optimized for CT environment, and able to segment seven material classes over a range of body habitus and CT protocol parameters with an average DSC of 0.86 ± 0.04 (range: 0.80–0.99).

60 APPLIED LIFE SCIENCES↗

Micromagnetism in a planar system with a random magnetic anisotropy and two-dimensional magnetic correlations

The hysteresis loops and the micromagnetic structure of a ferromagnetic nanolayer with a randomly oriented local easy magnetization axis and two-dimensional magnetization correlations are studied using a micromagnetic simulation. The properties and the micromagnetic structure of the nanolayer are determined by the competition between the anisotropy and exchange energies and by the dipole–dipole interaction energy. The magnetic microstructure can be described as an ensemble of stochastic magnetic domains and topological magnetization defects. Dipole–dipole interaction suppresses the formation of topological magnetization defects. The topological defects in the magnetic microstructure can cause a sharper change in the coercive force with the crystallite size than that predicted by the random magnetic anisotropy model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite. The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.

97 MATHEMATICS AND COMPUTING↗

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗