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 55 records · Page 3

Practical Probabilistic Programming

Recent advances in probabilistic programming languages (PPLs) have provided the capability for exact inference: computing a closed-form probability distribution for a given probabilistic program. In particular, the new language Roulette uses a language oriented programming (LOP) approach, wherein analysts build new programming languages on top of a set of primitives provided by Roulette, which then translates these structures into a weighted model counting problem which can be solved by automated reasoning tools. However, because Roulette provides few convenience features, developing these new languages is challenging even for expert users. We developed a standard library of common probability functions for Roulette with the goal of improved usability. This included approximation of continuous probability density functions using discrete probability mass functions. We demonstrated this approach by modeling a cosmic ray striking a RAM controller. We found that Roulette provides a powerful interface for highly expressive probabilistic programs to be generated. In collaboration with the NNSA Advanced Simulation and Computing program, which resulted in development of a tool called Circulette, we were able to model complex circuits expressed in Verilog using probabilistic programs with an expressivity not previously possible. Our research question that motivated the development of a Roulette standard library was to determine whether non-experts could use a PPL to model relevant problems regarding radiation effects on microelectronics. This standard library improved the expressivity of Roulette by implementing common probability density functions, mathematical operators on distributions, and support for empirical distributions. While Roulette is a powerful modeling language, the untyped, LOP approach makes error messages difficult to understand and requires expert aid. We recommend further research on Roulette, especially with its error messages, to enable improved usability. At the same time, this project demonstrated that for users familiar with Roulette and the LOP approach, Roulette provides powerful new capabilities that can be integrated with other Sandia modeling capabilities.

97 MATHEMATICS AND COMPUTING↗

Wave propagation in a random medium

A simple technique is used to derive statistical characterizations of the perturbations imposed upon a wave (plane, spherical or beamed) propagating through a random medium. The method is essentially physical rather than mathematical, and is probably equivalent to the Rytov method. The limitations of the method are discussed in some detail; in general they are restrictive only for optical paths longer than a few hundred meters, and for paths at the lower microwave frequencies. Situations treated include arbitrary path geometries, finite transmitting and receiving apertures, and anisotropic media. Results include, in addition to the usual statistical quantities, time-lagged functions, mixed functions involving amplitude and phase fluctuations, angle-of-arrival covariances, frequency covariances, and other higher-order quantities.

Lee, R. W.↗

Safe Onboard Guidance and Control Under Probabilistic Uncertainty

An algorithm was developed that determines the fuel-optimal spacecraft guidance trajectory that takes into account uncertainty, in order to guarantee that mission safety constraints are satisfied with the required probability. The algorithm uses convex optimization to solve for the optimal trajectory. Convex optimization is amenable to onboard solution due to its excellent convergence properties. The algorithm is novel because, unlike prior approaches, it does not require time-consuming evaluation of multivariate probability densities. Instead, it uses a new mathematical bounding approach to ensure that probability constraints are satisfied, and it is shown that the resulting optimization is convex. Empirical results show that the approach is many orders of magnitude less conservative than existing set conversion techniques, for a small penalty in computation time.

Blackmore, Lars James↗

Finding Bounded Rational Equilibria: Iterative Focusing - Part 1

A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality characterizing all real-world players. A recurring issue in statistical physics is how best to approximate joint probability distributions with decoupled (and therefore far more tractable) distributions. It has recently been shown that the same information theoretic mathematical structure, known as Probability Collectives (PC) underlies both issues. This relationship between statistical physics and game theory allows techniques and insights from the one field to be applied to the other. In particular, PC provides a formal model-independent definition of the degree of rationality of a player and of bounded rationality equilibria. This pair of papers extends previous work on PC by introducing new computational approaches to effectively find bounded rationality equilibria of common-interest (team) games.

Wolpert, David H.↗

Finding Bounded Rational Equilibria: Alternative Lagrangians and Uncountable Move Spaces - Part 2

A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality characterizing all real-world players. A recurring issue in statistical physics is how best to approximate joint probability distributions with decoupled (and therefore far more tractable) distributions. It has recently been shown that the same information theoretic mathematical structure, known as Probability Collectives (PC) underlies both issues. This relationship between statistical physics and game theory allows techniques and insights &om the one field to be applied to the other. In particular, PC provides a formal model-independent definition of the degree of rationality of a player and of bounded rationality equilibria. This pair of papers extends previous work on PC by introducing new computational approaches to effectively find bounded rationality equilibria of common-interest (team) games.

Wolpert, David H.↗

On quantum vs. classical probability

Quantum theory shares with classical probability theory many important properties. I show that this common core regards at least the following six areas, and I provide details on each of these: the logic of propositions, symmetry, probabilities, composition of systems, state preparation and reductionism. The essential distinction between classical and quantum theory, on the other hand, is shown to be joint decidability versus smoothness; for the latter in particular I supply ample explanation and motivation. Finally, I argue that beyond quantum theory there are no other generalisations of classical probability theory that are relevant to physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Stability of a Linear System of Difference Equations with Random Parameters

We study the asymptotic behavior of solutions to a linear system of difference equation whose right-hand side at each time moment depends not only on the value at the previous moment, but also on a random parameter that takes its values in a given set. We obtain conditions of the Lyapunov stability and the asymptotic stability of the equilibrium position that are valid for all values of the random parameter or with probability 1.

97 MATHEMATICS AND COMPUTING↗

Unambiguous discrimination of mixed quantum states: Optimal solution and case study

We present a generic study of the unambiguous discrimination between two mixed quantum states. We derive operational optimality conditions and show that the optimal measurements can be classified according to their rank. In Hilbert space dimensions less than or equal to 5, this leads to the complete optimal solution. We demonstrate our method with a physical example, namely, the unambiguous comparison of n quantum states, and find the optimal success probability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-walk-based search and centrality

We study the discrete-time quantum-walk-based search for a marked vertex on a graph. By considering various structures in which not all vertices are equivalent, we investigate the relationship between the successful search probability and the position of the marked vertex, in particular, its centrality. We find that the maximum value of the search probability does not necessarily increase as the marked vertex becomes more central, and we investigate an interesting relationship between the frequency of the successful search probability and the centrality of the marked vertex.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal phase estimation with arbitrary a priori knowledge

The optimal-phase estimation strategy is derived when partial a priori knowledge on the estimated phase is available. The solution is found with the help of the most famous result from the entanglement theory: the positive partial transpose criterion. The structure of the optimal measurements, estimators, and the optimal probe states is analyzed. This Rapid Communication provides a unified framework bridging the gap in the literature on the subject which until now dealt almost exclusively with two extreme cases: almost perfect knowledge (local approach based on Fisher information) and no a priori knowledge (global approach based on covariant measurements). Special attention is paid to a natural a priori probability distribution arising from a diffusion process.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Complete characterization of post-selected quantum statistics using weak measurement tomography

The reconstruction of quantum states from a sufficient set of experimental data can be achieved with arbitrarily weak measurement interactions. Since such weak measurements have negligible back action, the quantum state reconstruction is also valid for the postselected subensembles usually considered in weak measurement paradoxes. It is shown that postselection can then be identified with a statistical decomposition of the initial density matrix into transient density matrices conditioned by the anticipated measurement outcomes. This result indicates that it is possible to ascribe the properties determined by the final measurement outcome to each individual quantum system before the measurement has taken place. The 'collapse' of the pure state wave function in a measurement can then be understood in terms of the classical 'collapse' of a probability distribution as new information becomes available.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Most probable wave function of a single free-moving particle

We develop the most probable wave functions for a single free quantum particle given its momentum and energy by imposing its quantum probability density to maximize Shannon information entropy. We show that there is a class of solutions in which the quantum probability density is self-trapped with finite-size spatial support, uniformly moving, hence keeping its form unchanged.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-walk approach to searching on fractal structures

We study continuous-time quantum walks mimicking the quantum search based on Grover's procedure. This allows us to consider structures, that is, databases, with arbitrary topological arrangements of their entries. We show that the topological structure of the database plays a crucial role by analyzing, both analytically and numerically, the transition from the ground to the first excited state of the Hamiltonian associated with different (fractal) structures. Additionally, we use the probability of successfully finding a specific target as another indicator of the importance of the topological structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unitary-process discrimination with error margin

We investigate a discrimination scheme between unitary processes. By introducing a margin for the probability of an erroneous guess, this scheme interpolates the two standard discrimination schemes: minimum-error and unambiguous discrimination. We present solutions for two cases. One is the case of two unitary processes with general prior probabilities. The other is the case with a group symmetry: The processes comprise a projective representation of a finite group. In the latter case, we found that unambiguous discrimination is a kind of 'all or nothing': The maximum success probability is either 0 or 1. We also thoroughly analyze how entanglement with an auxiliary system improves discrimination performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quadratic exponential vectors

We give a necessary and sufficient condition for the existence of a quadratic exponential vector with test function in L{sup 2}(R{sup d}) intersection L{sup {infinity}}(R{sup d}). We prove the linear independence and totality, in the quadratic Fock space, of these vectors. Using a technique different from the one used by Accardi et al. [Quantum Probability and Infinite Dimensional Analysis, Vol. 25, p. 262, (2009)], we also extend, to a more general class of test functions, the explicit form of the scalar product between two such vectors.

97 MATHEMATICS AND COMPUTING↗

Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution

This study deals with multiobjective fuzzy stochastic linear programming problems with uncertainty probability distribution which are defined as fuzzy assertions by ambiguous experts. The problem formulation has been presented and the two solutions strategies are; the fuzzy transformation via ranking function and the stochastic transformation when α{sup –}. cut technique and linguistic hedges are used in the uncertainty probability distribution. The development of Sen’s method is employed to find a compromise solution, supported by illustrative numerical example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tunnelling of relativistic particles from new type black hole in new massive gravity

In the framework of the three dimensional New Massive Gravity theory introduced by Bergshoeff, Hohm and Townsend, we analyze the behavior of relativistic spin-1/2 and spin-0 particles in the New-type Black Hole backgroud, solution of the New Massive Gravity.We solve Dirac equation for spin-1/2 and Klein-Gordon equation for spin-0. Using Hamilton-Jacobi method, we discuss tunnelling probability and Hawking temperature of the spin-1/2 and spin-0 particles for the black hole. We observe that the tunnelling probability and Hawking temperature are same for the spin-1/2 and spin-0.

79 ASTRONOMY AND ASTROPHYSICS↗