Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 235 records · Page 13

Analysis of multipacting threshold sensitivity to the random distributions of the secondary electron yield parameters

The way multipacting develops, depends strongly on the secondary emission property of the surface material. The knowledge of secondary electron yield is crucial for accurate prediction of the multipacting threshold. Variations in secondary electron yield parameters from experimental measurements create uncertainty, stemming from handling and surface preparation, and these uncertainties significantly affect multipacting threshold predictions. Despite their significance, the previous studies on the multipacting phenomenon did not adequately address the effect of an assumed random distribution of the secondary emission parameters on the multipacting threshold. Therefore, this paper aims to provide a comprehensive statistical study on how the different random distributions of the secondary emission parameters and, as a result, the uncertainty in the secondary electron yield affect multipacting thresholds. We focus on three commonly used distributions, namely uniform, normal, and truncated normal distributions, to define the uncertainty of random inputs. We use the chaos polynomial expansion method to determine how much each of the random parameters contributes to the multipacting threshold uncertainty. Additionally, we calculate Sobol sensitivity indices to evaluate the impact of the individual parameters or groups of parameters on the model outputs and study how different random distributions of these parameters affected the Sobol index results.

physics↗

Nutritional status and random blood glucose, cholesterol and triglyceride test among Malaysian Army (MA) personnel in Kuala Lumpur

With the rising trend of obesity among the general population, it is also important to assess the obesity and health status among military population. The aim of this study was to determine the prevalence of overweight and obesity among Malaysian Army (MA) personnel as well as the relationship between selected socio-demographics factors, antropometric profiles, body composition and random blood test value. A cross sectional study involving 378 male military personnel aged between 20 to 48 years old was conducted at two MA bases in Kuala Lumpur between November and December 2012. Antropometric measurements included height, weight and waist circumference (WC). Body fat percentage was measured using bioelectrical impedance analysis method (Tanita TBF-300A). Mean height, weight, BMI, WC, body fat percentage, age, monthly income and duration of service were 1.71 ± 0.6 m, 71.7 ± 12.2 kg, 24.6 ± 4.1 kg/m{sup 2}, 87.0 ± 10.0 cm, 23.4 ± 6.6%, 29.1 ± 5.5 years, RM 2115.12 ± 860.70 and 9.9 ± 5.6 years respectively. According to WHO (1998) classification of BMI, 3.2% of the subjects were underweight, 54.8% normal, 32.8% overweight and 9.3% obese. It was obeserved that 40.2% of the subjects had waist circumference value of 90 cm or more and were considered high risk for diebetes and cardiovascular diseases. This study found that BMI was highly correlated with weight (r=0.925, p<0.05), WC (r=0.852, p<0.05) and body fat percentage. Body fat percentage also show high correlation with weight (r=0.759, p<0.05) and WC (r=0.768, p<0.05. The result from 173 of 378 subjects that were selected for random blood test found that 4.6%, 3.5% and 26.0% had diabetes, high cholesterol and high triglyceride respectively. There was a weak correlation between random blood glucose level with weight (r=0.221, p<0.05), BMI (r=0.243, p<0.05), WC (r=0.298, p<0.05), body fat percentage (r=0.163, p<0.05) and age (r=0.223, p<0.05). Random blood cholesterol level had significant correlation with weight (r=0.284, p<0.05), BMI (r=0.260, p<0.05), WC (r=0.362, p<0.05) and body fat percentage (r=0.313, p<0.05). It was also noted that random blood triglyceride level was significantly correlated with weight (r=0.223, p<0.05), BMI (r=0.312, p<0.05), WC (r=0.288, p<0.05), body fat percentage (r=0.287, p<0.05) and age (r=0.268 p<0.05). These results call for attention to the existence of overweight and obesity as well as the risk of non-communicable diseases among military population. Therefore, future intervention from the aspect of nutritional education and health awareness can benefit thus optimizing the health status of MA military personnel.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A family of random walks with generalized Dirichlet steps

We analyze a class of continuous time random walks in R{sup d},d≥2, with uniformly distributed directions. The steps performed by these processes are distributed according to a generalized Dirichlet law. Given the number of changes of orientation, we provide the analytic form of the probability density function of the position (X{sub {sub d}}(t),t>0) reached, at time t > 0, by the random motion. In particular, we analyze the case of random walks with two steps. In general, it is a hard task to obtain the explicit probability distributions for the process (X{sub {sub d}}(t),t>0). Nevertheless, for suitable values for the basic parameters of the generalized Dirichlet probability distribution, we are able to derive the explicit conditional density functions of (X{sub {sub d}}(t),t>0). Furthermore, in some cases, by exploiting the fractional Poisson process, the unconditional probability distributions of the random walk are obtained. This paper extends in a more general setting, the random walks with Dirichlet displacements introduced in some previous papers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Structured sequences emerge from random pool when replicated by templated ligation

The central question in the origin of life is to understand how structure can emerge from randomness. The Eigen theory of replication states, for sequences that are copied one base at a time, that the replication fidelity has to surpass an error threshold to avoid that replicated specific sequences become random because of the incorporated replication errors [M. Eigen, Naturwissenschaften 58 (10), 465–523 (1971)]. Here, we showed that linking short oligomers from a random sequence pool in a templated ligation reaction reduced the sequence space of product strands. We started from 12-mer oligonucleotides with two bases in all possible combinations and triggered enzymatic ligation under temperature cycles. Surprisingly, we found the robust creation of long, highly structured sequences with low entropy. At the ligation site, complementary and alternating sequence patterns developed. However, between the ligation sites, we found either an A-rich or a T-rich sequence within a single oligonucleotide. Our modeling suggests that avoidance of hairpins was the likely cause for these two complementary sequence pools. What emerged was a network of complementary sequences that acted both as templates and substrates of the reaction. This self-selecting ligation reaction could be restarted by only a few majority sequences. The findings showed that replication by random templated ligation from a random sequence input will lead to a highly structured, long, and nonrandom sequence pool. This is a favorable starting point for a subsequent Darwinian evolution searching for higher catalytic functions in an RNA world scenario.

60 APPLIED LIFE SCIENCES↗

Random permutations fix a worst case for cyclic coordinate descent

Abstract Variants of the coordinate descent approach for minimizing a nonlinear function are distinguished in part by the order in which coordinates are considered for relaxation. Three common orderings are cyclic (CCD), in which we cycle through the components of $x$ in order; randomized (RCD), in which the component to update is selected randomly and independently at each iteration; and random-permutations cyclic (RPCD), which differs from CCD only in that a random permutation is applied to the variables at the start of each cycle. Known convergence guarantees are weaker for CCD and RPCD than for RCD, though in most practical cases, computational performance is similar among all these variants. There is a certain type of quadratic function for which CCD is significantly slower than for RCD; a recent paper by Sun & Ye (2016, Worst-case complexity of cyclic coordinate descent: $O(n^2)$ gap with randomized version. Technical Report. Stanford, CA: Department of Management Science and Engineering, Stanford University. arXiv:1604.07130) has explored the poor behavior of CCD on functions of this type. The RPCD approach performs well on these functions, even better than RCD in a certain regime. This paper explains the good behavior of RPCD with a tight analysis.

Lee, Ching-pei↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Comparison of quantum advantage experiments using random circuit sampling

Random circuit sampling, the task of sampling bit strings from a random unitary operator, has been implemented to demonstrate quantum advantage on the Sycamore quantum processor with 53 qubits and on the Zuchongzhi quantum processor with 56 and 61 qubits. Recently, it was claimed that classical computers using tensor network simulation could catch on to current noisy quantum processors for random circuit sampling. While the linear cross-entropy benchmark fidelity was used to certify all these claims, it may not capture statistical properties of outputs in detail. Here, we compare the bit strings sampled from classical computers using tensor network simulation by Pan et al. [F. Pan, K. Chen, and P. Zhang, Phys. Rev. Lett. 129, 090502 (2022)] and by Kalachev et al. [G. Kalachev, P. Panteleev, P. Zhou, and M.-H. Yung, arXiv:2112.15083] with the bit strings from the Sycamore quantum processor. It is shown that all of Kalachev et al.'s samples passed the NIST random number tests. The heat maps of bit strings show that Pan et al.'s and Kalachev et al.'s samples are quite different from the Sycamore or Zuchongzhi samples. The analysis with the Marchenko-Pastur distribution and the Wasssertein distances demonstrates that Kalachev et al.'s samples are statistically closer to the Sycamore samples than Pan et al.'s while the three datasets have similar values for the linear cross-entropy fidelity. In conclusion, our finding implies that further study is needed to certify or beat the claims of quantum advantage using random circuit sampling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement phase transitions in random stabilizer tensor networks

Here we explore a class of random tensor network models with “stabilizer” local tensors which we name random stabilizer tensor networks (RSTNs). For RSTNs defined on a two-dimensional square lattice, we perform extensive numerical studies of entanglement phase transitions between volume-law and area-law entangled phases of the one-dimensional boundary states. These transitions occur when either (a) the bond dimension D of the constituent tensors is varied or (b) the tensor network is subject to random breaking of bulk bonds, implemented by forced measurements. In the absence of broken bonds, we find that the RSTN supports a volume-law entangled boundary state with bond dimension D ≥ 3 where D is a prime number, and an area-law entangled boundary state for D = 2. Upon breaking bonds at random in the bulk with probability p, there exists a critical measurement rate p c for each D ≥ 3 above which the boundary state becomes area-law entangled. To explore the conformal invariance at these entanglement transitions for different prime D, we consider tensor networks on a finite rectangular geometry with a variety of boundary conditions, and extract universal operator scaling dimensions via extensive numerical calculations of the entanglement entropy, mutual information, and mutual negativity at their respective critical points. Our results at large D approach known universal data of percolation conformal field theory, while showing clear discrepancies at smaller D, suggesting a distinct entanglement transition universality class for each prime D. We further study universal entanglement properties in the volume-law phase and demonstrate quantitative agreement with the recently proposed description in terms of a directed polymer in a random environment.

36 MATERIALS SCIENCE↗

Entanglement spectrum of a random partition: Connection with the localization transition

We study the entanglement spectrum of a translationally invariant lattice system under a random partition, implemented by choosing each site to be in one subsystem with probability p ϵ[0,1]. We apply this random partitioning to a translationally invariant (i.e., clean) topological state, and argue on general grounds that the corresponding entanglement spectrum captures the universal behavior about its disorder-driven transition to a trivial localized phase. Specifically, as a function of the partitioning probability p , the entanglement Hamiltonian H A must go through a topological phase transition driven by the percolation of a random network of edge states. For example, we analytically derive the entanglement Hamiltonian for a one-dimensional topological superconductor under a random partition, and demonstrate that its phase diagram includes transitions between Griffiths phases. We discuss potential advantages of studying disorder-driven topological phase transitions via the entanglement spectra of random partitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optical information transfer through random unknown diffusers using electronic encoding and diffractive decoding

Free-space optical information transfer through diffusive media is critical in many applications, such as biomedical devices and optical communication, but remains challenging due to random, unknown perturbations in the optical path. We demonstrate an optical diffractive decoder with electronic encoding to accurately transfer the optical information of interest, corresponding to, e.g., any arbitrary input object or message, through unknown random phase diffusers along the optical path. This hybrid electronic-optical model, trained using supervised learning, comprises a convolutional neural network-based electronic encoder and successive passive diffractive layers that are jointly optimized. After their joint training using deep learning, our hybrid model can transfer optical information through unknown phase diffusers, demonstrating generalization to new random diffusers never seen before. The resulting electronic-encoder and optical-decoder model was experimentally validated using a 3D-printed diffractive network that axially spans <70λ, where λ = 0.75 mm is the illumination wavelength in the terahertz spectrum, carrying the desired optical information through random unknown diffusers. The presented framework can be physically scaled to operate at different parts of the electromagnetic spectrum, without retraining its components, and would offer low-power and compact solutions for optical information transfer in free space through unknown random diffusive media.

36 MATERIALS SCIENCE↗

Combining Random Mutagenesis and Metabolic Engineering for Enhanced Tryptophan Production in Synechocystis sp. Strain PCC 6803

Tryptophan (Trp) is an essential aromatic amino acid that has value as an animal feed supplement, as the amount found in plant-based sources is insufficient. An alternative to production by engineered microbial fermentation is to have tryptophan biosynthesized by a photosynthetic microorganism that could replace or supplement both the plant and industrially used microbes. We selected Synechocystis sp. strain PCC 6803, a model cyanobacterium, as the host and studied metabolic engineering and random mutagenesis approaches. Previous work on engineering heterotrophic microbes for improved Trp titers has targeted allosteric feedback regulation in enzymes 3-deoxy-d-arabinoheptulosonate 7-phosphate synthase (DAHPS) and anthranilate synthase (AS) as major bottlenecks in the shikimate pathway. In this work, the genes encoding feedback-resistant enzymes from Escherichia coli, aroG fbr and trpE fbr , were overexpressed in the host wild-type (WT) strain. Separately, the WT strain was subjected to random mutagenesis and selection using an amino acid analog to isolate tryptophan-overproducing strains. The randomly mutagenized strains were sequenced in order to identify the mutations that resulted in the desirable phenotypes. Interestingly, the tryptophan overproducers had mutations in the gene encoding chorismate mutase (CM), which catalyzes the conversion of chorismate to prephenate. The best tryptophan overproducer from random mutagenesis was selected as a host for metabolic engineering where aroG fbr and trpE fbr were overexpressed. The best strain developed produced 212 ± 23 mg/liter of tryptophan after 10 days of photoautotrophic growth under 3% (vol/vol) CO2. We demonstrated that a combination of random mutagenesis and metabolic engineering was superior to either individual approach.

59 BASIC BIOLOGICAL SCIENCES↗

Scalable Extended Dynamic Mode Decomposition Using Random Kernel Approximation

The Koopman operator is a linear, infinite-dimensional operator that governs the dynamics of system observables; extended dynamic mode decomposition (EDMD) is a data-driven method for approximating the Koopman operator using functions (features) of the system state snapshots. This paper investigates an approach to EDMD in which the features used provide random approximations to a particular kernel function. The objective of this is computational economy for large data sets: EDMD is generally ill-suited for problems with large state dimension, and its dual kernel formulation (KDMD) is well-suited for such problems only if the number of data snapshots is relatively small. We discuss two specific methods for generating features: random Fourier features and the Nÿstrom method. The first method is a data-independent method for translation-invariant kernels only and involves random sampling in feature space; the second method is a data-dependent empirical method that may be used for any kernel and involves random sampling of data. We first discuss how these ideas may be applied in an EDMD context, as well as a means for adaptively adding random Fourier features. As a result, we demonstrate these methods on two example problems and conclude with an analysis of the relative benefits and drawbacks of each method.

59 BASIC BIOLOGICAL SCIENCES↗

A Domain Decomposition Model Reduction Method for Linear Convection-Diffusion Equations with Random Coefficients

We developed a domain decomposition model reduction method for linear steady- state convection-diffusion equations with random coefficients. Of particular interest to this effort are the diffusion equation with random diffusivity and the convection-dominated transport equation with random velocity. We investigated two types of random fields, i.e., colored noises and discrete white noises, both of which can lead to high-dimensional parametric dependence in practice. The motivation is to exploit domain decomposition to reduce the parametric dimension of local problems in subdomains, such that an entire parametric map can be approximated with a small number of expensive partial differential equation (PDE) simulations. The new method combines domain decomposition with model reduction and sparse polynomial approximation, so as to simultaneously handle the high dimensionality and irregular behavior of the PDEs under consideration. Here, the advantages of our method lie in three aspects: (i) online-offline decomposition, i.e., the online cost is independent of the size of the triangle mesh; (ii) sparse approximation of operators involving nonaffine high-dimensional random fields; (iii) an effective strategy to capture irregular behaviors, e.g., sharp transitions of the PDE solutions. Two numerical examples are provided to demonstrate the advantageous performance of our method.

97 MATHEMATICS AND COMPUTING↗

Quantum Random Number Generator (QRNG)

The Los Alamos Quantum Random Number Generator (QRNG) is a hardware-based, high-performance Random Number Generator capable of generating 200 Mbit/s or more of true random numbers. Like flipping a coin, it is very much random and essential for information security like encrypting data on the internet, checking email, or purchasing something from an online vendor. The device harvests entropy from fluctuations in an optical source that arise from quantum mechanical properties of light. Qrypt, Inc., a company launched in 2017, began making strategic investments and developing partnerships to advance cutting-edge quantum hardware solutions. One of those key investments was licensing QRNG from Los Alamos and subsequently collaborating with advanced quantum materials and technology researcher Dr. Raymond Newell to create high-quality random keys at scale.

97 MATHEMATICS AND COMPUTING↗

Randomized measurement protocols for lattice gauge theories

Randomized measurement protocols, including classical shadows, entanglement tomography, and randomized benchmarking are powerful techniques to estimate observables, perform state tomography, or extract the entanglement properties of quantum states. While unraveling the intricate structure of quantum states is generally difficult and resource-intensive, quantum systems in nature are often tightly constrained by symmetries. Furthermore, this can be leveraged by the symmetry-conscious randomized measurement schemes we propose, yielding clear advantages over symmetry-blind randomization such as reducing measurement costs, enabling symmetry-based error mitigation in experiments, allowing differentiated measurement of (lattice) gauge theory entanglement structure, and, potentially, the verification of topologically ordered states in existing and near-term experiments. Crucially, unlike symmetry-blind randomized measurement protocols, these latter tasks can be performed without relearning symmetries via full reconstruction of the density matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum random number generator

A quantum random number generator (QRNG) and a photon generator for a QRNG are provided. The photon generator may be operated in a spontaneous mode below a lasing threshold to emit photons. Photons emitted from the photon generator may have at least one random characteristic, which may be monitored by the QRNG to generate a random number. In one embodiment, the photon generator may include a photon emitter and an amplifier coupled to the photon emitter. The amplifier may enable the photon generator to be used in the QRNG without introducing significant bias in the random number and may enable multiplexing of multiple random numbers. The amplifier may also desensitize the photon generator to fluctuations in power supplied thereto while operating in the spontaneous mode. In one embodiment, the photon emitter and amplifier may be a tapered diode amplifier.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient reversible uniform and non-uniform random number generation in UNU.RAN

Reversible random number generations are useful in large-scale fault-tolerant parallel computations and parallel discrete event simulations that are based on reversible computation. The Universal Non-Uniform Random Number Generator (UNU.RAN) is one of the popular random number generators used in the simulation community, but the generators are forward-only in nature. In this paper, we develop new reverse algorithm for the default uniform random number generator algorithm of UNU.RAN and also a few nonuniform random generators that use the Transform Density Reduction (TDR) method. We verify the correctness of reversals of our algorithms and also provide performance results to demonstrate reverse computing runtime adds little overheads relative to its forward counterpart.

Yoginath, Srikanth↗

Devices and methods for increasing the speed and efficiency at which a computer is capable of modeling a plurality of random walkers using a density 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, wherein the virtual space comprises a plurality of vertices and wherein the different locations are ones of the plurality of vertices. A corresponding set of neurons in a spiking neural network is assigned to a corresponding vertex such that there is a correspondence between sets of neurons and the plurality of vertices, wherein a spiking neural network comprising a plurality of sets of spiking neurons is established. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network, wherein executing includes tracking how many virtual random walkers are at each vertex at a given time increment.

Aimone, James Bradley↗