Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “RANDOMNESS”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Reduction of display artifacts by random sampling

The application of random-sampling techniques to remove visible artifacts (such as flicker, moire patterns, and paradoxical motion) introduced in TV-type displays by discrete sequential scanning is discussed and demonstrated. Sequential-scanning artifacts are described; the window of visibility defined in spatiotemporal frequency space by Watson and Ahumada (1982 and 1983) and Watson et al. (1983) is explained; the basic principles of random sampling are reviewed and illustrated by the case of the human retina; and it is proposed that the sampling artifacts can be replaced by random noise, which can then be shifted to frequency-space regions outside the window of visibility. Vertical sequential, single-random-sequence, and continuously renewed random-sequence plotting displays generating 128 points at update rates up to 130 Hz are applied to images of stationary and moving lines, and best results are obtained with the single random sequence for the stationary lines and with the renewed random sequence for the moving lines.

Ahumada, A. J., Jr.↗
DOE OSTI2024

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↗
DOE OSTI2022

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↗
NASA NTRS2016

Electromagnetic Scattering by Fully Ordered and Quasi-Random Rigid Particulate Samples

In this paper we have analyzed circumstances under which a rigid particulate sample can behave optically as a true discrete random medium consisting of particles randomly moving relative to each other during measurement. To this end, we applied the numerically exact superposition T-matrix method to model far-field scattering characteristics of fully ordered and quasi-randomly arranged rigid multiparticle groups in fixed and random orientations. We have shown that, in and of itself, averaging optical observables over movements of a rigid sample as a whole is insufficient unless it is combined with a quasi-random arrangement of the constituent particles in the sample. Otherwise, certain scattering effects typical of discrete random media (including some manifestations of coherent backscattering) may not be accurately replicated.

Radiative transfer↗
DOE OSTI2025

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↗
DOE OSTI2026

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↗
DOE OSTI2022

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↗
DOE OSTI2024

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↗
DOE OSTI2023

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↗
DOE OSTI2024

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↗
DOE OSTI2022

Ch3MS-RF: a random forest model for chemical characterization and improved quantification of unidentified atmospheric organics detected by chromatography–mass spectrometry techniques

Abstract. The chemical composition of ambient organic aerosols plays a critical role in driving their climate and health-relevant properties and holds important clues to the sources and formation mechanisms of secondary aerosol material. In most ambient atmospheric environments, this composition remains incompletely characterized, with the number of identifiable species consistently outnumbered by those that have no mass spectral matches in the literature or the National Institute of Standards and Technology/National Institutes of Health/Environmental Protection Agency (NIST/NIH/EPA) mass spectral databases, making them nearly impossible to definitively identify. This creates significant challenges in utilizing the full analytical capabilities of techniques which separate and generate spectra for complex environmental samples. In this work, we develop the use of machine learning techniques to quantify and characterize novel, or unidentifiable, organic material. This work introduces Ch3MS-RF (Chemical Characterization by Chromatography–Mass Spectrometry Random Forest Modeling), an open-source, R-based software tool, for efficient machine-learning-enabled characterization of compounds separated in chromatography–mass spectrometry applications but not identifiable by comparison to mass spectral databases. A random forest model is trained and tested on a known 130 component representative external standard to predict the response factors of novel environmental organics based on position in volatility–polarity space and mass spectrum, enabling the reproducible, efficient, and optimized quantification of novel environmental species. Quantification accuracy on a reserved 20 % test set randomly split from the external standard compound list indicates that random forest modeling significantly outperforms the commonly used methods in both precision and accuracy, with a median response factor percent error of −2 %, for modeled response factors, compared to > 15 %, for typically used proxy assignment-based methods. Chemical properties modeling, evaluated on the same reserved 20 % test set and an extrapolation set of species identified in ambient organic aerosol samples collected in the Amazon rainforest, also demonstrate robust performance. Extrapolation set property prediction mean absolute errors for carbon number, oxygen to carbon ratio (O : C), average carbon oxidation state (OSc‾), and vapor pressure are 1.8, 0.15, 0.25, and 1.0 (log(atm)), respectively. Extrapolation set out-of-sample R2 for all properties modeled are above 0.75, with the exception of vapor pressure. While predictive performance for vapor pressure is less robust compared to the other chemical properties modeled, random-forest-based modeling was significantly more accurate than other commonly used methods of vapor pressure prediction, decreasing the mean vapor pressure prediction error to 0.24 (log(atm)) from 0.55 (log(atm)) (chromatography-based vapor pressure prediction) and 1.2 (log(atm)) (chemical formula-based vapor pressure prediction). The random forest model significantly advances an untargeted analysis of the full scope of chemical speciation yielded by two-dimensional gas chromatography (GCxGC-MS) techniques and can be applied to gas chromatography coupled with electron ionization mass spectrometry (GC-MS) as well. It enables the accurate estimation of key chemical properties commonly utilized in the atmospheric chemistry community, which may be used to more efficiently identify important tracers for further individual analysis and to characterize compound populations uniquely formed under specific ambient conditions.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1977

Random and systematic measurement errors in acoustic impedance as determined by the transmission line method

The effect of random and systematic errors associated with the measurement of normal incidence acoustic impedance in a zero-mean-flow environment was investigated by the transmission line method. The influence of random measurement errors in the reflection coefficients and pressure minima positions was investigated by computing fractional standard deviations of the normalized impedance. Both the standard techniques of random process theory and a simplified technique were used. Over a wavelength range of 68 to 10 cm random measurement errors in the reflection coefficients and pressure minima positions could be described adequately by normal probability distributions with standard deviations of 0.001 and 0.0098 cm, respectively. An error propagation technique based on the observed concentration of the probability density functions was found to give essentially the same results but with a computation time of about 1 percent of that required for the standard technique. The results suggest that careful experimental design reduces the effect of random measurement errors to insignificant levels for moderate ranges of test specimen impedance component magnitudes. Most of the observed random scatter can be attributed to lack of control by the mounting arrangement over mechanical boundary conditions of the test sample.

Parrott, T. L.↗
NASA NTRS1981

Reliability-based optimization under random vibration environment

A methodology of formulating the optimum design problem for structural systems with random parameters and subjected to random vibration as a mathematical programming problem is presented. The proposed method is applied to the optimum design of a cantilever beam with a tip mass and a truss structure supporting a water tank. The excitations are assumed to be Gaussian processes and the geometric and material properties are taken to be normally distributed random variables. The probabilistic constraints are specified for individual failure modes since it is easier to specify the reliability level for each failure mode keeping in view the consequences of failure in that particular mode. The time parameter appearing in the random vibration based constraints is eliminated by replacing the probabilities of failure by suitable upper bounds. The numerical results demonstrate the feasibility and effectiveness of applying the reliability-based design concepts to structures with random parameters and operating in random vibration environment.

Rao, S. S.↗
NASA NTRS1987

Probabilistic SSME blades structural response under random pulse loading

The purpose is to develop models of random impacts on a Space Shuttle Main Engine (SSME) turbopump blade and to predict the probabilistic structural response of the blade to these impacts. The random loading is caused by the impact of debris. The probabilistic structural response is characterized by distribution functions for stress and displacements as functions of the loading parameters which determine the random pulse model. These parameters include pulse arrival, amplitude, and location. The analysis can be extended to predict level crossing rates. This requires knowledge of the joint distribution of the response and its derivative. The model of random impacts chosen allows the pulse arrivals, pulse amplitudes, and pulse locations to be random. Specifically, the pulse arrivals are assumed to be governed by a Poisson process, which is characterized by a mean arrival rate. The pulse intensity is modelled as a normally distributed random variable with a zero mean chosen independently at each arrival. The standard deviation of the distribution is a measure of pulse intensity. Several different models were used for the pulse locations. For example, three points near the blade tip were chosen at which pulses were allowed to arrive with equal probability. Again, the locations were chosen independently at each arrival. The structural response was analyzed both by direct Monte Carlo simulation and by a semi-analytical method.

Shiao, Michael↗
NASA NTRS1986

Numerical solution of random singular integral equation appearing in crack problems

The solution of several elasticity problems, and particularly crack problems, can be reduced to the solution of one-dimensional singular integral equations with a Cauchy-type kernel or to a system of uncoupled singular integral equations. Here a method for the numerical solution of random singular integral equations of Cauchy type is presented. The solution technique involves a Chebyshev series approximation, the coefficients of which are the solutions of a system of random linear equations. This method is applied to the problem of periodic array of straight cracks inside an infinite isotropic elastic medium and subjected to a nonuniform pressure distribution along the crack edges. The statistical properties of the random solution are evaluated numerically, and the random solution is used to determine the values of the stress-intensity factors at the crack tips. The error, expressed as the difference between the mean of the random solution and the deterministic solution, is established. Values of stress-intensity factors at the crack tip for different random input functions are presented.

Sambandham, M.↗
NASA NTRS1999

Lower Bounds for Phase Estimation of PSK Packets with Random Phase

In this paper, we derive new Cramer-Rao bounds (CRBs) for the estimation of phase from a block of random M-PSK (M=2,4,8) symbols where the phase to be estimated is a random variable. Existing bounds for 2 and 4-PSK which model the phase as non-random are extended to obtain a new 8-PSK CRB. The new random phase bounds are compared to the new 8-PSK and existing 2,4-PSK bounds which model the phase as non-random. We see that the random phase CRBs more accurately model the behavior if the phase, as normally happens, is suppose to be constrained to the interval [-pi/M,pi/M).

Drake, Jeffrey↗
NASA NTRS2008

Random Testing and Model Checking: Building a Common Framework for Nondeterministic Exploration

Two popular forms of dynamic analysis, random testing and explicit-state software model checking, are perhaps best viewed as search strategies for exploring the state spaces introduced by nondeterminism in program inputs. We present an approach that enables this nondeterminism to be expressed in the SPIN model checker's PROMELA language, and then lets users generate either model checkers or random testers from a single harness for a tested C program. Our approach makes it easy to compare model checking and random testing for models with precisely the same input ranges and probabilities and allows us to mix random testing with model checking's exhaustive exploration of non-determinism. The PROMELA language, as intended in its design, serves as a convenient notation for expressing nondeterminism and mixing random choices with nondeterministic choices. We present and discuss a comparison of random testing and model checking. The results derive from using our framework to test a C program with an effectively infinite state space, a module in JPL's next Mars rover mission. More generally, we show how the ability of the SPIN model checker to call C code can be used to extend SPIN's features, and hope to inspire others to use the same methods to implement dynamic analyses that can make use of efficient state storage, matching, and backtracking.

dynamic analysis↗
DOE OSTI2022

Devices and methods for increasing the speed and efficiency at which a computer is capable of modeling a plurality of random walkers using a particle method

A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers. The method includes defining a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space. The method also includes either assigning a corresponding set of ringed neurons in a spiking neural network to a corresponding virtual random walker, or assigning a corresponding set of ringed neurons to a point in the virtual space. Movement of a given virtual random walker is tracked by decoding differences between states of individual neurons in a corresponding given set of ringed neurons. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network.

Aimone, James Bradley↗