In this paper, the Bayesian, Neyman-Pearson and Competitive Neyman-Pearson detection approaches are analyzed using a perceptually modified Ephraim-Malah (PEM) model, based on which a few practical voice activity detectors are developed. The voice activity detection is treated as a composite hypothesis testing problem with a free parameter formed by the prior signal-to-noise ratio (SNR). It is r...

The paper investigates the “widest cleft”, as Savage put it, between frequencists in the foundation of modern statistics: that opposing R.A. Fisher to Jerzy Neyman and Egon Pearson. Apart from deep personal confrontation through their lives, these scientists could not agree on methodology, on definitions, on concepts and on tools. Their premises and their conclusions widely differed and the two...

J. Neyman used stochastic processes extensively in his applied work. One example is the Fix and Neyman (F-N) competing risks model (1951) that uses finite homogeneous Markov processes to analyse clinical trials with breast cancer patients. We revisit the F-N model, and compare it with the Kaplan-Meier (K-M) formulation for right censored data. The comparison offers a way to generalize the K-M f...

Given any $$\alpha \in [0,1]$$ , an $$ -constant-sum game (abbreviated as -CS game) on a finite set of players, N, is function that assigns real number to coalition $$S\subseteq N$$ such the sum worth S and its complementary $$N\backslash S$$ times grand coalition. This class contains constant-sum games Khmelnitskaya (Int J Game Theory 32:223–227, 2003) (for = 1$$ ) threats (Kohlberg Neyman, Ga...