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 829 records · Page 46

On Collisions Times of ‘Self-Sorting’ Interacting Particles in One-Dimension with Random Initial Positions and Velocities

We investigate a one-dimensional system of N particles, initially distributed with random positions and velocities, interacting through binary collisions. The collision rule is such that there is a time after which the N particles do not interact and become sorted according to their velocities. When the collisions are elastic, we derive asymptotic distributions for the final collision time of a single particle and the final collision time of the system as the number of particles approaches infinity, under different assumptions for the initial distributions of the particles’ positions and velocities. For comparison, a numerical investigation is carried out to determine how a non-elastic collision rule, which conserves neither momentum nor energy, affects the median collision time of a particle and the median final collision time of the system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lifshits Tails for Randomly Twisted Quantum Waveguides

We consider the Dirichlet Laplacian H{sub γ} on a 3D twisted waveguide with random Anderson-type twisting γ. We introduce the integrated density of states N{sub γ} for the operator H{sub γ}, and investigate the Lifshits tails of N{sub γ}, i.e. the asymptotic behavior of N{sub γ}(E) as E↓infsupp dN{sub γ}. In particular, we study the dependence of the Lifshits exponent on the decay rate of the single-site twisting at infinity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constant-Length Random Substitutions and Gibbs Measures

This work is devoted to the study of processes generated by random substitutions over a finite alphabet. We prove, under mild conditions on the substitution’s rule, the existence of a unique process which remains invariant under the substitution, and which exhibits a polynomial decay of correlations. For constant-length substitutions, we go further by proving that the invariant state is precisely a Gibbs measure which can be obtained as the projective limit of its natural Markovian approximations. We end up the paper by studying a class of substitutions whose invariant state is the unique Gibbs measure for a hierarchical two-body interaction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diameters of Random Distance Graphs

This paper contains an almost exhaustive description of all cases where a distance random graph asymptotically almost surely has diameter 1, 2, or greater than 2.

97 MATHEMATICS AND COMPUTING↗

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗

An asymmetric hybrid cryptosystem using equal modulus and random decomposition in hybrid transform domain

In this paper, an asymmetric hybrid cryptosystem with coherent superposition, equal modulus and random decomposition in hybrid transform domain is proposed. To further strengthen the security of the cryptosystem, a hyperchaotic system is used as a pixel-swapping procedure. The hybrid transform is generated by utilizing fractional Fourier transform of various orders and Walsh transform. The hyperchaotic framework’s parameters and starting conditions alongside the fractional orders of the fractional Fourier transform extend the key-space and consequently give extra strength to the proposed cryptosystem. The designed cryptosystem has an extended key-space to avoid any brute-force attack and is non-linear in nature. The scheme is validated on gray-scale images. Computer based simulations have been performed to verify the validity and the performance of the proposed cryptosystem against different types of attacks. Results demonstrate that the proposed cryptosystem not only offers higher protection against noise attacks but is also invulnerable to special attack.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exploring the impact of walk–bike infrastructure, safety perception, and built-environment on active transportation mode choice: a random parameter model using New York City commuter data

Here, this study finds the effects of traffic safety, walk-bike network facilities, and land use attributes on walk and bicycle mode choice decision in the New York City for home-to-work commute. Applying the flexible econometric structure of random parameter models, we capture the heterogeneity in the decision making process and simulate scenarios considering improvement in walk-bike infrastructure such as sidewalk width and length of bike lane. Our results indicate that increasing sidewalk width, total length of bike lane, and proportion of protected bike lane will increase the likelihood of more people taking active transportation mode This suggests that the local authorities and planning agencies to invest more on building and maintaining the infrastructure for pedestrians. Furthermore, improvement in traffic safety by reducing traffic crashes involving pedestrians and bicyclists will increase the likelihood of taking active transportation modes. Our results also show positive correlation between number of non-motorized trips by the other family members and the likelihood to choose active transportation mode. The findings will help to make smart investment decisions in context of building sustainable transportation systems accounting for active transportation.

42 ENGINEERING↗

Efficient computation of basic sums for random polydispersed composites

The main goal of the paper was to develop algorithms and methods for computation of basic sums, the mathematical objects of great importance in computational materials science having applications to description of the representative volume element (RVE) and to the effective properties of 2D composites. The previously used algorithm had the exponential complexity. We propose a linearly complex algorithm. All the presented algorithms can be easily implemented in modern scientific computing packages, while maintaining both efficient calculations and a high level of abstraction. The proposed approach is applied to derivation of a polynomial approximation of the effective conductivity formula for 2D random material with non-overlapping circular inclusions with normally distributed radii. The obtained formulas are applied to the optimal packing problem of disks on the plane.

97 MATHEMATICS AND COMPUTING↗

Robust and optimal alignment of high-dimensional data using maximum likelihood estimation through a random sample consensus framework

Abstract Correcting spatial orientations of groups of high-dimensional data sets such that they are all in a consistent coordinate system is often a time-consuming and error-prone process. Automation of this process can be accomplished by using Generalized Procrustes Analysis to estimate the relative orientations among a population of high-dimensional data sets. A least squares Procrustes solution is applied through a maximum likelihood estimation and random sample consensus framework for robustness. The likelihood model is comprised of a mixture distribution where inliers are modeled using t -distribution and outliers from a uniform distribution. Applications will focus on a synthetic data set that emulates triaxial acceleration data and also real shock data from a population of triaxial accelerometers. Outliers represent either non-rigid body responses, environmental noise, and/or sensor and data acquisition issues. The intended application for the methodology is to robustly automate the rotation of populations of experimentally collected triaxial accelerometer data sets to a single global coordinate system.

LOSAC↗

The maximum relaxation time of a random walk

In this paper, we show the minimum spectral gap of the normalized Laplacian over all simple, connected graphs on n vertices is ( 1 + o ( 1 ) ) 54 n 3 . This minimum is achieved asymptotically by a double kite graph. Consequently, this leads to sharp upper bounds for the maximum relaxation time of a random walk, settling a conjecture of Aldous and Fill. We also improve an eigenvalue–diameter inequality by giving a new lower bound for the spectral gap of the normalized Laplacian. Finally, this eigenvalue lower bound is asymptotically best possible.

97 MATHEMATICS AND COMPUTING↗

Depinning of a discrete elastic string from a two-dimensional random array of weak pinning points

The present work is essentially concerned with the development of statistical theory for the low temperature dislocation glide in concentrated solid solutions where atom-sized obstacles impede plastic flow. In connection with such a problem, we compute analytically the external force required to drag an elastic string along a discrete two-dimensional square lattice, where some obstacles have been randomly distributed. Some numerical simulations allow us to demonstrate the remarkable agreement between simulations and theory for an obstacle density ranging from 1% to 50% and for lattices with different aspect ratios. The theory proves efficient on the condition that the obstacle-chain interaction remains sufficiently weak compared to the string stiffness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stationary point analysis of the one-dimensional lattice Landau gauge fixing functional, aka random phase XY Hamiltonian

Research Highlights: > Exact results for all stationary points of some high-dimensional function are given. > They are interpreted as Gribov copies of a lattice Landau gauge fixing functional. > The Gribov ambiguity and the Neuberger problem in compact U(1) are illustrated. > Stationary points are used to discuss a criterion on the absence of phase transitions. - Abstract: We study the stationary points of what is known as the lattice Landau gauge fixing functional in one-dimensional compact U(1) lattice gauge theory, or as the Hamiltonian of the one-dimensional random phase XY model in statistical physics. An analytic solution of all stationary points is derived for lattices with an odd number of lattice sites and periodic boundary conditions. In the context of lattice gauge theory, these stationary points and their indices are used to compute the gauge fixing partition function, making reference in particular to the Neuberger problem. Interpreted as stationary points of the one-dimensional XY Hamiltonian, the solutions and their Hessian determinants allow us to evaluate a criterion which makes predictions on the existence of phase transitions and the corresponding critical energies in the thermodynamic limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A finite-time exponent for random Ehrenfest gas

We consider the motion of a system of free particles moving on a plane with regular hard polygonal scatterers arranged in a random manner. Calling this the Ehrenfest gas, which is known to have a zero Lyapunov exponent, we propose a finite-time exponent to characterize its dynamics. As the number of sides of the polygon goes to infinity, when polygon tends to a circle, we recover the usual Lyapunov exponent for the Lorentz gas from the exponent proposed here. To obtain this result, we generalize the reflection law of a beam of rays incident on a polygonal scatterer in a way that the formula for the circular scatterer is recovered in the limit of infinite number of vertices. Thus, chaos emerges from pseudochaos in an appropriate limit. - Highlights: • We present a finite-time exponent for particles moving in a plane containing polygonal scatterers. • The exponent found recovers the Lyapunov exponent in the limit of the polygon becoming a circle. • Our findings unify pseudointegrable and chaotic scattering via a generalized collision rule. • Stretch and fold:shuffle and cut :: Lyapunov:finite-time exponent :: fluid:granular mixing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗