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 1,045 records · Page 58

Anomaly Detection in Dynamic Networks

Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the communication counts. In a sequential analysis, anomalous behavior is then identified from outlying behavior with respect to the fitted predictive probability models. Seasonality is again incorporated into the model and is treated as a changepoint model on the transition probabilities of a discrete time Markov process. Second stage analytics are then developed which combine anomalous edges to identify anomalous substructures in the network.

97 MATHEMATICS AND COMPUTING↗

Acquisition Performances Of QPSK Carrier-Tracking Loops

Report presents comparative study of acquisition performances of several types of carrier-signal-tracking loops for reception of quadrature phase-shift keying (QPSK) signals. Loops classified into three types: maximum a-posteriori, (MAP) estimation loop, Costas cross-over loop, and generalized Costas loop. Mathematical models developed. In-phase and quadrature signals generated numerically and processed according to loop algorithms. Results show though MAP loop produces smallest squaring loss at all signal-to-noise ratios, others sometimes exhibit shorter acquisition time and greater probability of acquisition.

Hinedi, Sami M.↗

Parsimonious Inference Information-Theoretic Foundations for a Complete Theory of Machine Learning (CIS-LDRD Project 218313 Final Technical Report)

This work examines how we may cast machine learning within a complete Bayesian framework to quantify and suppress explanatory complexity from first principles. Our investigation into both the philosophy and mathematics of rational belief leads us to emphasize the critical role of Bayesian inference in learning well-justified predictions within a rigorous and complete extended logic. The Bayesian framework allows us to coherently account for evidence in the learned plausibility of potential explanations. As an extended logic, the Bayesian paradigm regards probability as a notion of degrees of truth. In order to satisfy critical properties of probability as a coherent measure, as well as maintain consistency with binary propositional logic, we arrive at Bayes' Theorem as the only justifiable mechanism to update our beliefs to account for empiracle evidence. Yet, in the machine learning paradigm, where explanations are unconstrained algorithmic abstractions, we arrive at a critical challenge: Bayesian inference requires prior belief. Conventional approaches fail to yield a consistent framework in which we could compare prior plausibility among the infinities of potential choices in learning architectures. The difficulty of articulating well-justified prior belief over abstract models is the provinence of memorization in traditional machine learning training practices. This becomes exceptionally problematic in the context of limited datasets, when we wish to learn justifiable predictions from only a small amount of data.

97 MATHEMATICS AND COMPUTING↗

A generalized statistical complexity measure: Applications to quantum systems

A two-parameter family of complexity measures C-tilde{sup ({alpha},{beta})} based on the Renyi entropies is introduced and characterized by a detailed study of its mathematical properties. This family is the generalization of a continuous version of the Lopez-Ruiz-Mancini-Calbet complexity, which is recovered for {alpha}=1 and {beta}=2. These complexity measures are obtained by multiplying two quantities bringing global information on the probability distribution defining the system. When one of the parameters, {alpha} or {beta}, goes to infinity, one of the global factors becomes a local factor. For this special case, the complexity is calculated on different quantum systems: H-atom, harmonic oscillator, and square well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Long-Baseline Neutrino Oscillation Phenomenology

There is a large body of phenomenological work that quantifies the physics reach of future long baseline oscillation experiments. In this article we discuss what assumptions are made about each experiment's ability to predict its far detector signal and background statistics. To understand the difficulty associated with making background predictions even with a near detector, we also examine the current experience of the MINOS experiment, and its ability to predict its far detector signal and background fractions for its electron neutrino oscillation search. Finally, we discuss the program that is needed in order to get from the current state of the art in far detector predictions to what is required (or often simply assumed) for future generations of oscillation experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Kinetics of diffusion-controlled annihilation with sparse initial conditions

Here, we study diffusion-controlled single-species annihilation with sparse initial conditions. In this random process, particles undergo Brownian motion, and when two particles meet, both disappear. We also focus on sparse initial conditions where particles occupy a subspace of dimension δ that is embedded in a larger space of dimension d. Furthermore, we find that the co-dimension Δ = d - δ governs the behavior. All particles disappear when the co-dimension is sufficiently small, Δ ≤ 2; otherwise, a finite fraction of particles indefinitely survive. We establish the asymptotic behavior of the probability S(t) that a test particle survives until time t. When the subspace is a line, δ = 1, we find inverse logarithmic decay, $S\sim {(\mathrm{ln}t)}^{-1}$, in three dimensions, and a modified power-law decay, $S\sim (\mathrm{ln}t){t}^{-1/2}$, in two dimensions. In general, the survival probability decays algebraically when Δ < 2, and there is an inverse logarithmic decay at the critical co-dimension Δ = 2.

97 MATHEMATICS AND COMPUTING↗

Theory of flapping flight

Before attempting to construct a human-powered aircraft, the aviator will first try to post himself theoretically on the possible method of operating the flapping wings. This report will present a graphic and mathematical method, which renders it possible to determine the power required, so far as it can be done on the basis of the wing dimensions. We will first consider the form of the flight path through the air. The simplest form is probably the curve of ordinary wave motion. After finding the flight curve, we must next determine the change in the angle of attack while passing through the different phases of the wave.

FLAPPING FLIGHT↗

Representing Complex Systems as Graphs for Debugging and Predictive Maintenance-Preliminary Thoughts

Representing complex systems as graphs enables use of mathematical tools to identify faults or predict failures. Graph nodes correspond to individual modules or subsystems, and edges link coupled system parts. ‘Probes’ measure the node outputs, monitoring the system health for unexpected behavior. Assuming one cannot probe every point, within a system, the fault correlates to a region—not necessarily the specific location. Bayesian networks trained to understand fault patterns can accurately identify the source. The diagnostic tool described aides debugging by pinpointing system failure causes. For predictive maintenance, probe data develop probability distribution functions describing subsystem mean time to failure. Unit lifetime can be estimated through these probability distributions. Two approaches include using Bayesian classifiers to infer the system failure source and developing maintenance schedules by treating systems as collections of random variables. When failure behavior does not follow a closed form function, use of similarity models is proposed.

97 MATHEMATICS AND COMPUTING↗

Homogenization limit for a multiband effective mass model in heterostructures

We study the homogenization limit of a multiband model that describes the quantum mechanical motion of an electron in a quasi-periodic crystal. In this approach, the distance among the atoms that constitute the material (lattice parameter) is considered a small quantity. Our model include the description of materials with variable chemical composition, intergrowth compounds, and heterostructures. We derive the effective multiband evolution system in the framework of the kp approach. We study the well posedness of the mathematical problem. We compare the effective mass model with the standard kp models for uniform and non-uniforms crystals. We show that in the limit of vanishing lattice parameter, the particle density obtained by the effective mass model, converges to the exact probability density of the particle.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing Reliabilities Of Ceramic Components Subject To Fracture

CARES calculates fast-fracture reliability or failure probability of macroscopically isotropic ceramic components. Program uses results from commercial structural-analysis program (MSC/NASTRAN or ANSYS) to evaluate reliability of component in presence of inherent surface- and/or volume-type flaws. Computes measure of reliability by use of finite-element mathematical model applicable to multiple materials in sense model made function of statistical characterizations of many ceramic materials. Reliability analysis uses element stress, temperature, area, and volume outputs, obtained from two-dimensional shell and three-dimensional solid isoparametric or axisymmetric finite elements. Written in FORTRAN 77.

Nemeth, N. N.↗

A mixed-integer conic programming formulation for computing the flexibility index under multivariate gaussian uncertainty

We present a methodology for computing the flexibility index when uncertainty is characterized using multivariate Gaussian random variables. Our approach computes the flexibility index by solving a mixed-integer conic program (MICP). This methodology directly characterizes ellipsoidal sets to capture correlations in contrast to previous methodologies that employ approximations. We also show that, under a Gaussian representation, the flexibility index can be used to obtain a lower bound for the so-called stochastic flexibility index (i.e., the probability of having feasible operation). Our results also show that the methodology can be generalized to capture different types of uncertainty sets.

97 MATHEMATICS AND COMPUTING↗

Quantitative Detection of Single Molecules in Fluorescence Microscopy Images

Fluorescence imaging and counting of single molecules adsorbed or bound to surfaces are being employed in a number of quantitative analysis applications. Reliable molecular counts with knowledge of counting uncertainties, both false-positive and false-negative probabilities, are critical to these applications. By counting stationary single molecules on a surface, spatial criteria may be applied to the image analysis to improve confidence in detection, which is especially critical when detecting single fluorescent labels. In this work, we describe a simple approach to incorporating spatial criteria for counting single molecules by using an intensity threshold to locate regions with multiple, adjacent intense pixels, where the size of these regions is guided by the point-spread function of the microscope. By requiring multiple, spatially correlated bright pixels, false-positive events resulting from random samples of background noise are minimized. The reliability of detection is established by quantitative knowledge of the distributions of background and signals. By measuring and modeling both the background and single-molecule intensity distributions, false-positive and false-negative detection probabilities are estimated for arbitrary threshold parameters by using combinatorial statistics. From this theory, detection parameters can be optimized to minimize false-positive and false-negative probabilities, which can be calculated explicitly. For detection of single rhodamine 6G molecules at a threshold set at 2.5 times the standard deviation above background, the false-negative probability was only 1.5%, determined from distributions of single-molecule intensities on well-populated surfaces, and the false-positive probability from background noise was 2.8 spots per 50 × 50 μm image. Furthermore, the false-positive events compare favorably with theoretical probabilities calculated using combinatorial statistical analysis and simulated false-positive events counted in images of random noise.

36 MATERIALS SCIENCE↗

Fusing geophysical signatures of locally recorded surface explosions to improve blast detection

We recorded acoustic, seismic and radio-frequency signatures of 70 solid charge (~2–12 kg) surface explosions (shots) at local distances (0.1–1.5 km) to determine if such signals could be fused for blast monitoring. We observed that each geophysical signature was sufficiently repeatable between similar shots to be identifiable with multichannel correlation detectors. Using template signals from a large explosion, we then processed heavily contaminated data recording a smaller shot with these detectors, and missed or marginally detected the resultant target signals. By then fusing the p-values of these statistics through Fisher's combined probability test, we clearly identified the same explosion signals at thresholds consistent with the false alarm on noise rates of the correlation detectors. This resulting Fisher test thereby provided high-probability detections, zero false alarms and higher theoretical detection capability.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Modeling Buried Object Brightness and Visibility for Ground Penetrating Radar

Comparing the observed brightness of various buried objects is a straightforward way to characterize the performance of a ground penetrating radar (GPR) system. However, a limitation arises. A simple comparison of buried object brightness values does not disentangle the effects of the GPR system itself from the system's operating environment and the objects being observed. Therefore, with brightness values exhibiting an unknown synthesis of systemic, environmental, and object factors, GPR system analysis becomes a convoluted affair. In this work, we use an experimentally collected dataset of over 25,000 object observations from five different multistatic radar arrays to develop models of buried object brightness and control for these various effects. Additionally, our modeling efforts provide a means for quantifying the relative brightness of GPR systems, the objects they detect, and the physical properties of those objects that influence observed brightness. To evaluate the models' performance on new object observations, we repeatedly simulate fitting them to half the dataset and predicting the observed brightness values of the unseen half. In addition, we introduce a method for estimating the probability that individual observations constitute a visible object, which aids in failure analysis, performance characterization, and dataset cleaning.

97 MATHEMATICS AND COMPUTING↗

A Bootstrap Approach to Quantifying Reliabilities and Uncertainties of Complex Systems

While much work has been done in analyzing margins and uncertainties at the component level, a gap exists in NNSA methodology relating component level reliabilities and uncertainties to system level reliability and uncertainty. This paper shows how component level reliability data can be combined via a bootstrap analysis to estimate system level reliabilities and uncertainties. The performance of the bootstrap for this problem is validated through simulation studies. This paper extends the original work of Crowder by including sensitivity analyses related to changes in samples sizes and component failure probabilities. The use of the bootstrap as a decision-making tool is thus developed by quantifying the effect of such changes on system reliability.

97 MATHEMATICS AND COMPUTING↗

Detection of anomalous events

A system is described for receiving a stream of events and scoring the events based on anomalousness and maliciousness (or other classification). The system can include a plurality of anomaly detectors that together implement an algorithm to identify low-probability events and detect atypical traffic patterns. The anomaly detector provides for comparability of disparate sources of data (e.g., network flow data and firewall logs.) Additionally, the anomaly detector allows for regulatability, meaning that the algorithm can be user configurable to adjust a number of false alerts. The anomaly detector can be used for a variety of probability density functions, including normal Gaussian distributions, irregular distributions, as well as functions associated with continuous or discrete variables.

97 MATHEMATICS AND COMPUTING↗