Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Probabilities Mathematics”

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 433 records · Page 24

Analysis of quantum walks with time-varying coin on d-dimensional lattices

In this paper, we present a study of discrete time quantum walks whose underlying graph is a d-dimensional lattice. The dynamical behavior of these systems is of current interest because of their applications in quantum information theory as tools to design quantum algorithms. We assume that, at each step of the walk evolution, the coin transformation is allowed to change so that we can use it as a control variable to drive the evolution in a desired manner. We give an exact description of the possible evolutions and of the set of possible states that can be achieved with such a system. In particular, we show that it is possible to go from a state where there is probability 1 for the walker to be found in a vertex to a state where all the vertices have equal probability. We also prove a number of properties of the set of admissible states in terms of the number of steps needed to obtain them. We provide explicit algorithms for state transfer in low dimensional cases as well as results that allow to reduce algorithms on two-dimensional lattices to algorithms on the one-dimensional lattice, the cycle.

97 MATHEMATICS AND COMPUTING↗

A Note on Truncated Long-Range Percolation with Heavy Tails on Oriented Graphs

We consider oriented long-range percolation on a graph with vertex set ℤ{sup d}×ℤ{sub +} and directed edges of the form 〈(x,t),(x+y,t+1)〉, for x, y in ℤ{sup d} and t∈ℤ{sub +}. Any edge of this form is open with probability p{sub y}, independently for all edges. Under the assumption that the values p{sub y} do not vanish at infinity, we show that there is percolation even if all edges of length more than k are deleted, for k large enough. We also state the analogous result for a long-range contact process on ℤ{sup d}.

97 MATHEMATICS AND COMPUTING↗

The tunneling solutions of the time-dependent Schroedinger equation for a square-potential barrier

The exact tunneling solutions of the time-dependent Schroedinger equation with a square-potential barrier are derived using the continuous symmetry group G{sub S} for the partial differential equation. The infinitesimal generators and the elements for G{sub S} are represented and derived in the jet space. There exist six classes of wave functions. The representative (canonical) wave functions for the classes are labeled by the eigenvalue sets, whose elements arise partially from the reducibility of a Lie subgroup G{sub LS} of G{sub S} and partially from the separation of variables. Each eigenvalue set provides two or more time scales for the wave function. The ratio of two time scales can act as the duration of an intrinsic clock for the particle motion. The exact solutions of the time-dependent Schroedinger equation presented here can produce tunneling currents that are orders of magnitude larger than those produced by the energy eigenfunctions. The exact solutions show that tunneling current can be quantized under appropriate boundary conditions and tunneling probability can be affected by a transverse acceleration.

97 MATHEMATICS AND COMPUTING↗

Matrix interdiction problem

In the matrix interdiction problem, a real-valued matrix and an integer k is given. The objective is to remove k columns such that the sum over all rows of the maximum entry in each row is minimized. This combinatorial problem is closely related to bipartite network interdiction problem which can be applied to prioritize the border checkpoints in order to minimize the probability that an adversary can successfully cross the border. After introducing the matrix interdiction problem, we will prove the problem is NP-hard, and even NP-hard to approximate with an additive n{gamma} factor for a fixed constant {gamma}. We also present an algorithm for this problem that achieves a factor of (n-k) mUltiplicative approximation ratio.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Effect of stochasticity in mean field dynamo models

We present a comprehensive investigation into the effect of choosing the stochastic control parameters in a simplified-Parker dynamo model. Through considering the manifold of marginal stability, i.e., the region of parameter space where the mean growth rate is zero, we show that stochastic fluctuations are not prohibitive to dynamo. Furthermore, by directly comparing results obtained by periodic and Gaussian coloured noise alpha with identical characteristic time-scales and fluctuating amplitudes, we find that the transition to dynamo is significantly eased for stochastically fluctuating alpha. The effect of stochasticity in magnetic diffusion is also investigated, highlighting the importance of resonance between poloidal and toroidal magnetic fields on the growth rate. Furthermore, we show that probability density functions of the growth-rate, magnetic field, and magnetic energy can provide a wealth of useful information regarding the dynamo behaviour/intermittency. Finally, the statistical properties of the dynamo such as temporal correlation and fluctuating amplitude are found to be dependent on the distribution of the fluctuations in stocastic parameters.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum dynamics of attractive versus repulsive bosonic Josephson junctions: Bose-Hubbard and full-Hamiltonian results

The quantum dynamics of one-dimensional bosonic Josephson junctions with attractive and repulsive interparticle interactions is studied by using the Bose-Hubbard model and by numerically exact computations of the full many-body Hamiltonian. A symmetry present in the Bose-Hubbard Hamiltonian dictates an equivalence between the evolution in time of the survival probability and the fragmentation of attractive and repulsive Josephson junctions with attractive and repulsive interactions of equal magnitude. The full many-body Hamiltonian does not possess this symmetry and, consequently, the dynamics of the attractive and repulsive junctions are different.

74 ATOMIC AND MOLECULAR PHYSICS↗

Particle-based simulation approach for single-particle interference experiments: Application to double-slit experiments

We review recent progress in the development of event-by-event simulation algorithms that do not rely on concepts of quantum theory or probability theory but are nevertheless capable of reproducing the averages computed from quantum theory. The simulation approach is illustrated by applications to single-photon double-slit experiments. We demonstrate that it is possible to give a particle-only description of single-photon interference experiments without first solving a wave equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spontaneous decay rate of a dipole emitter in a strongly scattering disordered environment

We study the statistics of the fluorescence decay rate of a dipole emitter embedded in a strongly scattering medium. In the multiple-scattering regime, the probability of observing a decrease in the decay rate is substantial, as predicted by exact numerical simulations. The decrease originates from a reduction of the local density of optical states and is due to collective interactions and interferences. In the strong-scattering regime, signatures of recurrent scattering are visible in the behavior of the average decay rate.

74 ATOMIC AND MOLECULAR PHYSICS↗

The complete Heyting algebra of subsystems and contextuality

The finite set of subsystems of a finite quantum system with variables in Z(n), is studied as a Heyting algebra. The physical meaning of the logical connectives is discussed. It is shown that disjunction of subsystems is more general concept than superposition. Consequently, the quantum probabilities related to commuting projectors in the subsystems, are incompatible with associativity of the join in the Heyting algebra, unless if the variables belong to the same chain. This leads to contextuality, which in the present formalism has as contexts, the chains in the Heyting algebra. Logical Bell inequalities, which contain “Heyting factors,” are discussed. The formalism is also applied to the infinite set of all finite quantum systems, which is appropriately enlarged in order to become a complete Heyting algebra.

97 MATHEMATICS AND COMPUTING↗

Poly-Gaussian model of randomly rough surface in rarefied gas flow

Surface roughness is simulated by the model of non-Gaussian random process. Our results for the scattering of rarefied gas atoms from a rough surface using modified approach to the DSMC calculation of rarefied gas flow near a rough surface are developed and generalized applying the poly-Gaussian model representing probability density as the mixture of Gaussian densities. The transformation of the scattering function due to the roughness is characterized by the roughness operator. Simulating rough surface of the walls by the poly-Gaussian random field expressed as integrated Wiener process, we derive a representation of the roughness operator that can be applied in numerical DSMC methods as well as in analytical investigations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Characterization of intermittency in renewal processes: Application to earthquakes

We construct a one-dimensional piecewise linear intermittent map from the interevent time distribution for a given renewal process. Then, we characterize intermittency by the asymptotic behavior near the indifferent fixed point in the piecewise linear intermittent map. Thus, we provide a framework to understand a unified characterization of intermittency and also present the Lyapunov exponent for renewal processes. This method is applied to the occurrence of earthquakes using the Japan Meteorological Agency and the National Earthquake Information Center catalog. By analyzing the return map of interevent times, we find that interevent times are not independent and identically distributed random variables but that the conditional probability distribution functions in the tail obey the Weibull distribution.

58 GEOSCIENCES↗

Learning Canonical Embeddings for Unsupervised Shape Correspondence With Locally Linear Transformations

We present a new approach to unsupervised shape correspondence learning between pairs of point clouds. We make the first attempt to adapt the classical locally linear embedding algorithm (LLE)-originally designed for nonlinear dimensionality reduction-for shape correspondence. The key idea is to find dense correspondences between shapes by first obtaining high-dimensional neighborhood-preserving embeddings of low-dimensional point clouds and subsequently aligning the source and target embeddings using locally linear transformations. We demonstrate that learning the embedding using a new LLE-inspired point cloud reconstruction objective results in accurate shape correspondences. More specifically, the approach comprises an end-to-end learnable framework of extracting high-dimensional neighborhood-preserving embeddings, estimating locally linear transformations in the embedding space, and reconstructing shapes via divergence measure-based alignment of probability density functions built over reconstructed and target shapes. Our approach enforces embeddings of shapes in correspondence to lie in the same universal/canonical embedding space, which eventually helps regularize the learning process and leads to a simple nearest neighbors approach between shape embeddings for finding reliable correspondences. Comprehensive experiments show that the new method makes noticeable improvements over state-of-the-art approaches on standard shape correspondence benchmark datasets covering both human and nonhuman shapes.

deformation↗

The semi-Markov unreliability range evaluator program

The SURE program is a design/validation tool for ultrareliable computer system architectures. The system uses simple algebraic formulas to compute accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. The mathematical formulas used in the program were derived from a mathematical theorem proven by Allan White under contract to NASA Langley Research Center. This mathematical theorem is discussed along with the user interface to the SURE program.

Butler, R. W.↗

Space Mathematics: A Resource for Secondary School Teachers

A collection of mathematical problems related to NASA space science projects is presented. In developing the examples and problems, attention was given to preserving the authenticity and significance of the original setting while keeping the level of mathematics within the secondary school curriculum. Computation and measurement, algebra, geometry, probability and statistics, exponential and logarithmic functions, trigonometry, matrix algebra, conic sections, and calculus are among the areas addressed.

Kastner, Bernice↗

Semi-Markov Unreliability Range Evaluator

Semi-Markov Unreliability Range Evaluator, SURE, computer program is software tool for analysis of reconfigurable, fault-tolerant systems. Traditional reliability analyses based on aggregates of fault-handling and fault-occurrence models. SURE provides efficient means for calculating accurate upper and lower bounds for probabilities of death states for large class of semi-Markov mathematical models, and not merely those reduced to critical-pair architectures.

Butler, Ricky W.↗

The Investigation Of Carbon Contamination And Sputtering Effects Of Xenon Ion Thrusters

The Electro-Physics Branch of the NASA Glenn Research Center investigates the effect of atomic oxygen, environmental durability of high performance power materials and surfaces, and low earth orbit. One of its current projects involves the analysis of ion thrusters. Ion thrusters are devices that initiate a beam of ions to a target area. The type of ion thruster that I have been working with this Summer of 2004 emits positively charged Xenon (Xe(+)) atoms through two grids, the screen grid and the accelerator grid, after it enters an ionization chamber. Insulators are used to mechanically hold and separate these two grids. A propellant isolator, an instrument that closely resembles insulators, is placed in front of the ionization chamber. Both the insulator and isolator are made with a ceramic compound and filled with insulating beads. The main difference between the two devices is that the propellant isolator allows gas to flow through, in this case, the gas is Xe(+) and the insulators do not. In order to avoid carbon deposits and other contaminating chemicals to settle on the insulators and propellant isolator, a metal shadow shield is placed around them. These shadow shields function as a protectant and can be shaped in numerous configurations. Part of my job responsibility this summer is to investigate the effectiveness of different shadow shields that are utilized on three different ion engines: the NSTAR (NASA Solar Electric Propulsion Technology Application Readiness), JIMO (Jupiter Icy Moons Orbiter), and NEXIS (Nuclear Electric Xenon Ion System). Using calculus and other mathematical tactics, I was asked to find the total flux of carbon contamination that was able to pass the protectant shadow shield. I familiarized myself with the software program, MathCad2004, to help perform some mathematical computations such as complex integration. Another method of studying the probability of contamination is by experimental simulation. After attaining the precise parameters of the actual shadow shields, I created replicas of three types of shadow shielding to be used to undergo testing. It will be placed in a machine that produces carbon atoms at a high temperature of 200 C. or beam is aimed at a targeted material. As a result of this collision, atoms and other particles are ejected out of the target surface. Another part of my internship consisted of research on sputter ejection, or the angle distribution of sputtered material. This research entailed finding the past results of sputter ejection investigation as well as creating another type of mock simulation. Other minor projects include calculating the path of Xe(+) gas through the insulating beads of the isolators and assisting my mentor in collecting data for his paper for the Joint Propulsion Conference & Exhibit to be held July 11-14,2004 in Fort Lauderdale, Florida.

Prak, Moline K.↗

Model-Based Method for Sensor Validation

Fault detection, diagnosis, and prognosis are essential tasks in the operation of autonomous spacecraft, instruments, and in situ platforms. One of NASA s key mission requirements is robust state estimation. Sensing, using a wide range of sensors and sensor fusion approaches, plays a central role in robust state estimation, and there is a need to diagnose sensor failure as well as component failure. Sensor validation can be considered to be part of the larger effort of improving reliability and safety. The standard methods for solving the sensor validation problem are based on probabilistic analysis of the system, from which the method based on Bayesian networks is most popular. Therefore, these methods can only predict the most probable faulty sensors, which are subject to the initial probabilities defined for the failures. The method developed in this work is based on a model-based approach and provides the faulty sensors (if any), which can be logically inferred from the model of the system and the sensor readings (observations). The method is also more suitable for the systems when it is hard, or even impossible, to find the probability functions of the system. The method starts by a new mathematical description of the problem and develops a very efficient and systematic algorithm for its solution. The method builds on the concepts of analytical redundant relations (ARRs).

Vatan, Farrokh↗