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 181 records · Page 10

3D exemplar-based random walks for tooth segmentation from cone-beam computed tomography images

Purpose: Tooth segmentation is an essential step in acquiring patient-specific dental geometries from cone-beam computed tomography (CBCT) images. Tooth segmentation from CBCT images is still a challenging task considering the comparatively low image quality caused by the limited radiation dose, as well as structural ambiguities from intercuspation and nearby alveolar bones. The goal of this paper is to present and discuss the latest accomplishments in semisupervised tooth segmentation with adaptive 3D shape constraints. Methods: The authors propose a 3D exemplar-based random walk method of tooth segmentation from CBCT images. The proposed method integrates semisupervised label propagation and regularization by 3D exemplar registration. To begin with, the pure random walk method is to get an initial segmentation of the teeth, which tends to be erroneous because of the structural ambiguity of CBCT images. And then, as an iterative refinement, the authors conduct a regularization by using 3D exemplar registration, as well as label propagation by random walks with soft constraints, to improve the tooth segmentation. In the first stage of the iteration, 3D exemplars with well-defined topologies are adapted to fit the tooth contours, which are obtained from the random walks based segmentation. The soft constraints on voxel labeling are defined by shape-based foreground dentine probability acquired by the exemplar registration, as well as the appearance-based probability from a support vector machine (SVM) classifier. In the second stage, the labels of the volume-of-interest (VOI) are updated by the random walks with soft constraints. The two stages are optimized iteratively. Instead of the one-shot label propagation in the VOI, an iterative refinement process can achieve a reliable tooth segmentation by virtue of exemplar-based random walks with adaptive soft constraints. Results: The proposed method was applied for tooth segmentation of twenty clinically captured CBCT images. Three metrics, including the Dice similarity coefficient (DSC), the Jaccard similarity coefficient (JSC), and the mean surface deviation (MSD), were used to quantitatively analyze the segmentation of anterior teeth including incisors and canines, premolars, and molars. The segmentation of the anterior teeth achieved a DSC up to 98%, a JSC of 97%, and an MSD of 0.11 mm compared with manual segmentation. For the premolars, the average values of DSC, JSC, and MSD were 98%, 96%, and 0.12 mm, respectively. The proposed method yielded a DSC of 95%, a JSC of 89%, and an MSD of 0.26 mm for molars. Aside from the interactive definition of label priors by the user, automatic tooth segmentation can be achieved in an average of 1.18 min. Conclusions: The proposed technique enables an efficient and reliable tooth segmentation from CBCT images. This study makes it clinically practical to segment teeth from CBCT images, thus facilitating pre- and interoperative uses of dental morphologies in maxillofacial and orthodontic treatments.

60 APPLIED LIFE SCIENCES↗

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

Human Mammary Epithelial Cells Exhibit a Bimodal Correlated Random Walk Pattern

Organisms, at scales ranging from unicellular to mammals, have been known to exhibit foraging behavior described by random walks whose segments confirm to Lévy or exponential distributions. For the first time, we present evidence that single cells (mammary epithelial cells) that exist in multi-cellular organisms (humans) follow a bimodal correlated random walk (BCRW). Cellular tracks of MCF-10A pBabe, neuN and neuT random migration on 2-D plastic substrates, analyzed using bimodal analysis, were found to reveal the BCRW pattern. We find two types of exponentially distributed correlated flights (corresponding to what we refer to as the directional and re-orientation phases) each having its own correlation between move step-lengths within flights. The exponential distribution of flight lengths was confirmed using different analysis methods (logarithmic binning with normalization, survival frequency plots and maximum likelihood estimation). Because of the presence of non-uniform turn angle distribution of move step-lengths within a flight and two different types of flights, we propose that the epithelial random walk is a BCRW comprising of two alternating modes with varying degree of correlations, rather than a simple persistent random walk. A BCRW model rather than a simple persistent random walk correctly matches the super-diffusivity in the cell migration paths as indicated by simulations based on the BCRW model.

59 BASIC BIOLOGICAL SCIENCES↗

Averaged Description of Flow (Steady and Transient) and Nonreactive Solute Transport in Random Porous Media

In previous papers (Shvidler and Karasaki, 1999, 2001, 2005, and 2008) we presented and analyzed an approach for finding the general forms of exactly averaged equations of flow and transport in porous media. We studied systems of basic equations for steady flow with sources in unbounded domains with stochastically homogeneous conductivity fields. A brief analysis of exactly averaged equations of nonsteady flow and nonreactive solute transport was also presented. At the core of this approach is the existence of appropriate random Green's functions. For example, we showed that in the case of a 3-dimensional unbounded domain the existence of appropriate random Green's functions is sufficient for finding the exact nonlocal averaged equations for flow velocity using the operator with a unique kernel-vector. Examination of random fields with global symmetry (isotropy, transversal isotropy and orthotropy) makes it possible to describe significantly different types of averaged equations with nonlocal unique operators. It is evident that the existence of random Green's functions for physical linear processes is equivalent to assuming the existence of some linear random operators for appropriate stochastic equations. If we restricted ourselves to this assumption only, as we have done in this paper, we can study the processes in any dimensional bounded or unbounded fields and in addition, cases in which the random fields of conductivity and porosity are stochastically nonhomogeneous, nonglobally symmetrical, etc.. It is clear that examining more general cases involves significant difficulty and constricts the analysis of structural types for the processes being studied. Nevertheless, we show that we obtain the essential information regarding averaged equations for steady and transient flow, as well as for solute transport.

54 ENVIRONMENTAL SCIENCES↗

Effective Field Theory of Random Quantum Circuits

Quantum circuits have been widely used as a platform to simulate generic quantum many-body systems. In particular, random quantum circuits provide a means to probe universal features of many-body quantum chaos and ergodicity. Some such features have already been experimentally demonstrated in noisy intermediate-scale quantum (NISQ) devices. On the theory side, properties of random quantum circuits have been studied on a case-by-case basis and for certain specific systems, and a hallmark of quantum chaos—universal Wigner–Dyson level statistics—has been derived. This work develops an effective field theory for a large class of random quantum circuits. The theory has the form of a replica sigma model and is similar to the low-energy approach to diffusion in disordered systems. The method is used to explicitly derive the universal random matrix behavior of a large family of random circuits. In particular, we rederive the Wigner–Dyson spectral statistics of the brickwork circuit model by Chan, De Luca, and Chalker [Phys. Rev. X 8, 041019 (2018)] and show within the same calculation that its various permutations and higher-dimensional generalizations preserve the universal level statistics. Finally, we use the replica sigma model framework to rederive the Weingarten calculus, which is a method of evaluating integrals of polynomials of matrix elements with respect to the Haar measure over compact groups and has many applications in the study of quantum circuits. The effective field theory derived here provides both a method to quantitatively characterize the quantum dynamics of random Floquet systems (e.g., calculating operator and entanglement spreading) and a path to understanding the general fundamental mechanism behind quantum chaos and thermalization in these systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Synthesis and Characterization of Methacrylamide-Based Block Random Copolymers via Amine Functionalization of Polystyrene- Block -Poly(Pentafluorophenyl Methacrylate) Toward Enhanced Amenability to Manufacturing Criteria in Nanolithography

Recent interest in manipulating the chemistry of block copolymers (BCPs) to manage the covarying properties necessary to meet manufacturing criteria in nanolithography has resulted in the development and expansion of the A-block-(B-random-C) BCP architecture, where the random block allows for the decoupling of thermodynamic and wetting properties. Previous reports of such BCPs have used click chemistry to create the desired random block, but all such instances possess additional functional groups that are susceptible to undesirable side reactions upon annealing, such as cross-linking and surface grafting. This study reports the substitution reaction of polystyrene-block-poly(pentafluorophenyl methacrylate) (PS-b-PPFMA) with primary amines. The resulting methacrylamide structure of the functionalized random block has only an amide linkage between the attached functional group and the polymer backbone, thereby omitting any sources of side reactions within the BCP. The outcomes of this report also demonstrate the enhanced thermal stability of these materials by virtue of their stable amide bonds. A range of random copolymer compositions is assessed to develop BCPs in which the random block has approximately the same surface energy as the PS block. These BCPs can self-assemble into perpendicular lamellae and are therefore promising candidates for directed self-assembly.

block copolymers↗

Dose and Fractionation in Radiation Therapy of Curative Intent for Non-Small Cell Lung Cancer: Meta-Analysis of Randomized Trials

Purpose: The optimum dose and fractionation in radiation therapy of curative intent for non-small cell lung cancer remains uncertain. We undertook a published data meta-analysis of randomized trials to examine whether radiation therapy regimens with higher time-corrected biologically equivalent doses resulted in longer survival, either when given alone or when given with chemotherapy. Methods and Materials: Eligible studies were randomized comparisons of 2 or more radiation therapy regimens, with other treatments identical. Median survival ratios were calculated for each comparison and pooled. Results: 3795 patients in 25 randomized comparisons of radiation therapy dose were studied. The median survival ratio, higher versus lower corrected dose, was 1.13 (95% confidence interval [CI] 1.04-1.22) when radiation therapy was given alone and 0.83 (95% CI 0.71-0.97) when it was given with concurrent chemotherapy (P for difference=.001). In comparisons of radiation therapy given alone, the survival benefit increased with increasing dose difference between randomized treatment arms (P for trend=.004). The benefit increased with increasing dose in the lower-dose arm (P for trend=.01) without reaching a level beyond which no further survival benefit was achieved. The survival benefit did not differ significantly between randomized comparisons where the higher-dose arm was hyperfractionated and those where it was not. There was heterogeneity in the median survival ratio by geographic region (P<.001), average age at randomization (P<.001), and year trial started (P for trend=.004), but not for proportion of patients with squamous cell carcinoma (P=.2). Conclusions: In trials with concurrent chemotherapy, higher radiation therapy doses resulted in poorer survival, possibly caused, at least in part, by high levels of toxicity. Where radiation therapy was given without chemotherapy, progressively higher radiation therapy doses resulted in progressively longer survival, and no upper dose level was found above which there was no further benefit. These findings support the consideration of further radiation therapy dose escalation trials, making use of modern treatment methods to reduce toxicity.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Microphase Separation of Randomly Linked Branched Polystyrene/Polylactic Acid for Formation of Cocontinuous Nanostructures

Cocontinuous polymeric nanomaterials have gained attention for their ability to preserve distinct properties of constituent microphases within a single material. Randomly linked copolymer networks have shown very wide stability windows for disordered cocontinuous phases (extending over ≈ 30 wt % in composition), but the reliance on a network architecture prevents subsequent solution- or melt-processing. Furthermore, the key factors contributing to cocontinuity have remained unclear. We recently found that randomly linked star copolymers (RSCs) can exhibit a cocontinuous window as wide as 25 wt % in the case of 4-arm stars, suggesting that while a network architecture is not essential for the formation of disordered cocontinuous phases, the presence of random elastic forces in such architectures may indeed facilitate their formation. In addition, the behavior was found to be highly sensitive to arm number, with 6-arm RSCs exhibiting almost no cocontinuous phase. These results raised a key mechanistic question regarding the contribution of random elastic forces, originating from strands that bridge between junctions, in stabilizing disordered cocontinuous phases. In the current study, we synthesized randomly linked branched copolymers (RBCs) of polystyrene (PS) and poly(D,L-lactic acid) (PLA), which represent an intermediate architecture between networks and stars. This approach allows for the introduction of elastic contributions from strands bridging between different junctions, while still maintaining the processability advantages of a non-network architecture. The cocontinuous regions of the PS/PLA RBCs, with varying polymer and linker functionalities (f p and f l , respectively), were characterized by small-angle X-ray scattering, gravimetry, and scanning electron microscopy. We found that the cocontinuous windows of RBCs typically expanded with increasing elastic contributions and exhibited reduced sensitivity to junction-functionality compared to RSCs. Notably, RBCs with f p = 1.50 and f l = 3, which had large molecular weights due to proximity to the gel point, achieved a cocontinuous window of ≈ 34 wt %, which is almost twice as wide as analogous 3-arm RSCs and comparable to randomly linked networks. Leveraging this robust cocontinuity and solution-processability, we fabricated a film of interconnected nanoporous PS.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Achieving Highly Durable Random Alloy Nanocatalysts through Intermetallic Cores

Pt catalysts are widely studied for the oxygen reduction reaction, but their cost and susceptibility to poisoning limit their use. A strategy to address both problems is to incorporate a second transition metal to form a bimetallic alloy; however, the durability of such catalysts can be hampered by leaching of non-noble metal components. Here, we show that random alloyed surfaces can be stabilized to achieve high durability by depositing the alloyed phase on top of intermetallic seeds using a model system with PdCu cores and PtCu shells. Specifically, random alloyed PtCu shells were deposited on PdCu seeds that were either the atomically random face-centered cubic phase (FCC A1, Fm$\bar{3}$m) or the atomically ordered CsCl-like phase (B2, Pm$\bar{3}$m). Precise control over crystallite size, particle shape, and composition allowed for comparison of these two core@shell PdCu@PtCu catalysts and the effects of the core phase on electrocatalytic durability. Indeed, the nanocatalyst with the intermetallic core saw only an 18% decrease in activity after stability testing (and minimal Cu leaching), whereas the nanocatalyst with the random alloy core saw a 58% decrease (and greater Cu leaching). The origin of this enhanced durability was probed by classical molecular dynamics simulations of model catalysts, with good agreement between model and experiment. Although many random alloy and intermetallic nanocatalysts have been evaluated, this study directly compares random alloy and intermetallic cores for electrocatalysis with the enhanced durability achieved with the intermetallic cores likely general to other core@shell nanocatalysts.

36 MATERIALS SCIENCE↗

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

97 MATHEMATICS AND COMPUTING↗

Poly(norbornene) anion conductive membranes: homopolymer, block copolymer and random copolymer properties and performance

It has previously been shown that phase-separated block copolymers with non-ion conducting (hydrophobic) blocks and ion conducting (hydrophilic) blocks can form efficient ion conducting channels with high ionic mobility and conductivity. Block copolymers can provide a means for phase segregation and ion channel formation while homopolymers and random copolymers have been shown to have lower ion mobility. In this study, the properties of poly(norbornene) based anion exchange membranes (AEMs) comprising homopolymers, block copolymers, and random copolymers with high ion-exchange capacity (IEC) (3.48–4.55 meq. g -1 ) have been investigated and compared. The polymers were cross-linked with N,N,N',N'-tetramethyl-1,6-hexanediamine before casting the membranes to avoid excessive water swelling due to high water uptake. It was shown that high ionic conductivity can be achieved in both random copolymers and homopolymers even in the absence of microphase-separated structures. For example, the conductivity of a random copolymer was 194 mS cm -1 at 80 °C, which was comparable to the block copolymer, 201 mS cm -1 at 80 °C. The H 2 /O 2 fuel cell performance of random copolymer composite membranes showed a peak power density of 3.05 W cm -2 and peak current density of 7.85 A cm -2 at 80 °C compared to block copolymer membranes (peak power density of 3.21 W cm -2 and peak current density of 8.27 A cm -2 at 80 °C). It is more critical that high water transport be achieved in AEMs than achieving a phase-segregated morphology. Finally, the homopolymer, block copolymer, and random copolymer membranes showed <1.35% degradation after aging in 1 M NaOH at 80 °C for 1000 h.

08 HYDROGEN↗

Time series, correlation matrices and random matrix models

In this set of five lectures the authors have presented techniques to analyze open classical and quantum systems using correlation matrices. For diverse reasons we shall see that random matrices play an important role to describe a null hypothesis or a minimum information hypothesis for the description of a quantum system or subsystem. In the former case various forms of correlation matrices of time series associated with the classical observables of some system. The fact that such series are necessarily finite, inevitably introduces noise and this finite time influence lead to a random or stochastic component in these time series. By consequence random correlation matrices have a random component, and corresponding ensembles are used. In the latter we use random matrices to describe high temperature environment or uncontrolled perturbations, ensembles of differing chaotic systems etc. The common theme of the lectures is thus the importance of random matrix theory in a wide range of fields in and around physics.

97 MATHEMATICS AND COMPUTING↗

Confinement, reduced entanglement, and spin-glass order in a random quantum spin-ice model

In this work, we study an effective spin model derived perturbatively from a random transverse-field Ising model on the pyrochlore lattice. The model consists of spin configurations on the pyrochlore lattice, restricted to the spin-ice subspace, with spins interacting with random Ising exchange couplings as well as ring exchanges along the hexagons of the lattice. This model is studied by exact diagonalization up to N=64 site systems. Furthermore, we calculate spin-glass correlation functions and local entanglement entropy S T between spins in a single tetrahedron and the rest of the system. We find that the model undergoes two phase transitions. At weak randomness the model is in a quantum spin-ice phase where S T =ln 6. Increasing randomness, at low transverse fields, first leads to a frozen phase, with long-range spin-glass order and S T =ln 2 corresponding to the Cat states associated with Ising order. Further increase in randomness leads to a random resonating-hexagon phase with a frozen backbone of spins and a broad distribution of entanglement entropies. The implications of these studies for non-Kramers rare-earth pyrochlores are discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Enhancing superconducting critical current by randomness

The key ingredient of high critical currents in a type-II superconductor is defect sites that pin vortices. Here, we demonstrate that a random pinscape, an overlooked pinning system in nanopatterned superconductors, can lead to a substantially larger critical current enhancement at high magnetic fields than an ordered array of vortex pin sites. We reveal that the better performance of a random pinscape is due to the variation of the local density of its pinning sites, which mitigates the motion of vortices. This is confirmed by achieving even higher enhancement of the critical current through a conformally mapped random pinscape, where the distribution of the local density of pinning sites is further enlarged. Our findings highlight the potential of random pinscapes in enhancing the superconducting critical currents of applied superconductors in which random pin sites of nanoscale defects emerging in the materials synthesis process or through ex-situ irradiation are the only practical choice for large-scale production. Our results may also stimulate research on effects of a random pinscape in other complementary systems such as colloidal crystals, Bose-Einstein condensates, and Luttinger liquids.

36 MATERIALS SCIENCE↗

Damage Spreading in Spatial and Small-world Random Boolean Networks

The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\bar{K} \ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

Lu, Qiming↗

RGM: Random Geological Model Generation Package

This Fortran code is to accompany a manuscript to be submitted to Computers & Geosciences, a high-impact, peer-reviewed journal in computer methods for geosciences research. This Fortran code focuses on generation of synthetic geological models using a multi-randomization strategy. Generating high-fidelity synthetic geological models, including realistic seismic reflector migration images, faults, salt bodies, and relative geological time images, is the key for many supervised machine learning methods that aim to delineate faults and other geological properties of interest from seismic migration images. Our package contains two major functionalities: generating 2D synthetic random geological models and generating 3D synthetic random geological models. In each step of the generation process, we set random values for key properties of a geological model to improve the fidelity of the resulting geological model. The package also includes example codes on how to use the random geological model generation subroutines. We name this package RGM – Random Geological Model generation package.

Gao, Kai↗

Exploring Randomly Wired Neural Networks for Climate Model Emulation

Exploring the climate impacts of various anthropogenic emissions scenarios is key to making informed decisions for climate change mitigation and adaptation. State-of-the-art Earth system models can provide detailed insight into these impacts but have a large associated computational cost on a per-scenario basis. This large computational burden has driven recent interest in developing cheap machine learning models for the task of climate model emulation. In this paper, we explore the efficacy of randomly wired neural networks for this task. We describe how they can be constructed and compare them with their standard feedforward counterparts using the ClimateBench dataset. Specifically, we replace the serially connected dense layers in multilayer perceptrons, convolutional neural networks, and convolutional long short-term memory networks with randomly wired dense layers and assess the impact on model performance for models with 1 million and 10 million parameters. We find that models with less-complex architectures see the greatest performance improvement with the addition of random wiring (up to 30.4% for multilayer perceptrons). Furthermore, of 24 different model architecture, parameter count, and prediction task combinations, only one had a statistically significant performance deficit in randomly wired networks relative to their standard counterparts, with 14 cases showing statistically significant improvement. We also find no significant difference in prediction speed between networks with standard feedforward dense layers and those with randomly wired layers. These findings indicate that randomly wired neural networks may be suitable direct replacements for traditional dense layers in many standard models.

54 ENVIRONMENTAL SCIENCES↗

FORESTR: Finding, Organizing, Representing, Explaining, Summarizing, and Thinning Random forests

Random forests have become popular models used for data driven predictions. As a result, random forests are currently used or being considered for high-consequence mission applications in national security, such as the prediction of yield from optical signals and malware detection. While random forests may provide accurate predictions, the complexity of the algorithm causes a lack of interpretability. Random forests are an ensemble of regression or decision trees. Individual regression and decision trees are interpretable, but ensembles are inherently difficult to interpret due to the compilation of many models. We aim to increase the interpretability of random forests by finding patterns in the ensemble of trees that can be used to “thin” (or remove) trees. As a starting point, in this report, we develop a new distance metric for quantifying the similarity between trees based on their topologies (i.e., shapes). We base the metric on a novel distance metric for graphs that is a proper mathematical distance, is invariant to transformations, has registration between graphs, and computes topological evolutions between graphs. We use the tree distance metric to compute tree statistics such as a “mean tree” and to identify clusters of trees. We apply the developed methodology to a toy dataset and a mission relevant product inspection dataset to demonstrate how the metric can provide insight into random forests. Furthermore, we discuss the limitations of the approach and ideas for future research into how the metric could be used as a thinning tool to develop less complex models.

97 MATHEMATICS AND COMPUTING↗