scholarly journals A Neyman-Pearson Proper Way to Universal Testing of Multiple Hypotheses Formed by Groups of Distributions

Author(s):  
Evgueni Haroutunian ◽  
Aram Yesayan

The asymptotically optimal Neyman-Pearson procedures of detection for models characterized by M discrete probability distributions arranged into K, 2 ≤ K ≤ M groups considered as hypotheses are investigated. The sequence of tests based on a growing number of observations is logarithmically asymptotically optimal (LAO) when a certain part of the given error probability exponents (reliabilities) provides positives values for all other reliabilities. LAO tests sequences for some models of objects, including cases, when rejection of decision may be permitted, and when part, or all given error probabilities decrease subexponentially with an increase in the of number of experiments, are desined. For all reliabilities of such tests single-letter characterizations are obtained. A simple case with three distributions and two hypotheses is considered.

2018 ◽  
pp. 110-114
Author(s):  
Evgueni Haroutunian ◽  
Aram Yesayan ◽  
Narine Harutyunyan

Multiple statistical hypotheses testing with possibility of rejecting of decisionis considered for model consisting of two dependent objects characterized by joint discrete probability distribution. The matrix of error probabilities exponents (reliabilities) of asymptotically optimal tests is studied.


Author(s):  
Louis-Claude Canon ◽  
Aurélie Kong Win Chang ◽  
Yves Robert ◽  
Frédéric Vivien

This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an efficient heuristic which is shown to outperform standard approaches when running simulations for a variety of useful distribution laws.


1997 ◽  
Vol 1 (2) ◽  
pp. 151-157 ◽  
Author(s):  
Anwar H. Joarder ◽  
Munir Mahmood

An inductive method has been presented for finding Stirling numbers of the second kind. Applications to some discrete probability distributions for finding higher order moments have been discussed.


Author(s):  
Rubén Darío Santiago Acosta ◽  
Ernesto Manuel Hernández Cooper ◽  
Faustino Yescas Martinez

Sign in / Sign up

Export Citation Format

Share Document