Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “bayesian”

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,387 records · Page 77

Bayesian approach to the study of white dwarf binaries in LISA data: The application of a reversible jump Markov chain Monte Carlo method

The Laser Interferometer Space Antenna (LISA) defines new demands on data analysis efforts in its all-sky gravitational wave survey, recording simultaneously thousands of galactic compact object binary foreground sources and tens to hundreds of background sources like binary black hole mergers and extreme-mass ratio inspirals. We approach this problem with an adaptive and fully automatic Reversible Jump Markov Chain Monte Carlo sampler, able to sample from the joint posterior density function (as established by Bayes theorem) for a given mixture of signals ''out of the box'', handling the total number of signals as an additional unknown parameter beside the unknown parameters of each individual source and the noise floor. We show in examples from the LISA Mock Data Challenge implementing the full response of LISA in its TDI description that this sampler is able to extract monochromatic Double White Dwarf signals out of colored instrumental noise and additional foreground and background noise successfully in a global fitting approach. We introduce 2 examples with fixed number of signals (MCMC sampling), and 1 example with unknown number of signals (RJ-MCMC), the latter further promoting the idea behind an experimental adaptation of the model indicator proposal densities in the main sampling stage. We note that the experienced runtimes and degeneracies in parameter extraction limit the shown examples to the extraction of a low but realistic number of signals.

79 ASTRONOMY AND ASTROPHYSICS↗

Proactive Frequency Stability Scheme via Bayesian Filters and Synchrophasors

Underfrequency (UF) load shedding schemes are traditionally implemented in two ways: One approach is based on manual load shedding, with system operators requesting loads to be shed ahead of anticipated stressful operating conditions. Manual load shedding is usually done through phone calls. The second method is automatic load shedding via underfrequency relays. Using static static settings, these schemes can be designed to operate in stages and drop previously identified loads. The main limitation of traditional load shedding schemes is that they are reactive and leave little room for optimized corrective actions. This work presents a proactive and automatic underfrequency load shedding solution for power systems. Measurements are captured via phasor measurement units (PMUs) at relatively low sampling rates of 30 Hz. These measurements are then processed by particle filters who predict the future state of the system's frequency. Based on these predictions excess load is determined and shed. Comparative case studies are performed in simulated environments. Easy-to-implement models, without hard-to-derive parameters, highlight potential aspects for real-life implementation.

Paramo, Gian↗

A New Approach to Distributed Hypothesis Testing and Non-Bayesian Learning: Improved Learning Rate and Byzantine-Resilience

Here, we study a setting where a group of agents, each receiving partially informative private signals, seek to collaboratively learn the true underlying state of the world (from a finite set of hypotheses) that generates their joint observation profiles. To solve this problem, we propose a distributed learning rule that differs fundamentally from existing approaches, in that it does not employ any form of “belief-averaging”. Instead, agents update their beliefs based on a min-rule. Under standard assumptions on the observation model and the network structure, we establish that each agent learns the truth asymptotically almost surely. As our main contribution, we prove that with probability 1, each false hypothesis is ruled out by every agent exponentially fast, at a network-independent rate that is strictly larger than existing rates. We then develop a computationally-efficient variant of our learning rule that is provably resilient to agents who do not behave as expected (as represented by a Byzantine adversary model) and deliberately try to spread misinformation.

42 ENGINEERING↗