A Statistical Test for Comparing Success Rates

Size: px
Start display at page:

Download "A Statistical Test for Comparing Success Rates"

Transcription

1 MIC2003: The Fifth Metaheuristics International Conference A Statistical Test for Comparing Success Rates Éric D. Taillard EIVD, University of Applied Sciences of Western Switzerland Route de Cheseaux 1, Case postale CH-1401 Yverdon-les-Bains, Switzerland Eric.Taillard@eivd.ch 1 Introduction Who was not once perplex when reading, in an article comparing two optimization methods, numerical results presented under the following form : We have tested our optimization method A on a set of n problem instances from the literature and we succeeded in solving a of these instances. The concurrent method B succeeded in solving only b of these instances. However, it has to be noted that method B was tested only on m over the n instances. Indeed, the reader has no answer to the basic question : Is a success rate of a/n significantly superior to a success rate of b/m?. Very often, the answer to this central question cannot be found in classical statistical tests, since the lasts require large sample sizes (at least about 15). Nevertheless, in combinatorial optimization, problem instances sets are frequently smaller than 15. Intuitively, the reader is perfectly convinced that a method A that succeeded in solving all 10 problem instances of a given set is better than a method B that solved none of them. On the contrary, the reader will not be really convinced if the problem set contains only 3 instances. However, supposing that the problem instances have been chosen independently from the solving methods, it can be shown that a 3/3 rate of success is significantly larger (with a confidence level higher than 98% ) than a 0/3 rate of success. It could be argued that larger problem sets must be used, so that standard statistical sets could be applied. Unfortunately this is not always possible. First, for real problems, collecting data for a single instance may take several weeks. Second, there are classical problem instances libraries (ORLIB [2], QAPLIB [3], TSPLIB [4]) that seldom propose more than 10 instances for a given problem size. Third, it can be noted that many optimization methods are very time consuming (for instance the code for the quadratic assignment problem of [1] which took the equivalent of 7 years CPU time on a sequential computer for solving instance Nug30). In such a case, it might be more interesting to estimate the performances of a method on few large problem instances than on a multitude of toys-instances.

2 110-2 MIC2003: The Fifth Metaheuristics International Conference 2 Standard statistical test The comparison of rate of successes for two populations A and B is traditionally done as follows : Let p a (respectively p b ) be the probability of success of population A (respectively population B) and random samples of size n (respectively m) are taken for the experiment. Then, the statistic U = X a /n X b /m (where X a and X b are random variables associated with successful experiments in populations A and B) hasthemeanp a p b and variance p a q a /n + p b q b /m, whereq a =1 p a and q b =1 p b. For conducting a statistical test, the null hypothesis is p a = p b = p, sothatu should have a mean of 0. If both n and m are large, U is approximately normally distributed and the common probability p can be estimated by ˆp = a+b m+n,whereaand b are the number of successes observed in populations A and B. The null hypothesis will be rejected (and p a will be considered to be higher than p b )ifφ(û) >α,whereα is the confidence level, Φ is the cumulative standard normal distribution and a/n b/m û = a+b n+m n+m a b n+m (1/n +1/m) Practically, if both n and m are higher than 14, the null hypothesis can be reasonably rejected if û>1.65(α = 95%), û>2.06(α = 98%), û>2.33(α = 99%), û>2.58(α =99.5%), û>3.09(α =99.9%). 3 A non parametric statistical test In order to answer the question : Does a observation of a criterion over a sample of size n represent a rate higher than b occurrences over a sample of size m?, it can be proceeded as follows : Null hypothesis : Let us suppose that the (unknown) rate p of occurrence of the criterion is the same for both sample (i.e. p a = p b = p). Under the null hypothesis, the probability S(p, a, n, b, m) toobservea successes or more in the first population (of size n) andb successes or less in the second population (of size m) is given by the product of two binomial distributions (Ci n = n! i! (n i)! and Cj m = m! j! (m j)! are the binomial coefficients) : n b S(p, a, n, b, m) =( Ci n p i (1 p) n i ) ( Cj m p j (1 p) m j ) i=a j=0 Alternate hypothesis : rate of method B. p a >p b i.e. the success rate of method A is higher than the success The null hypothesis has to be rejected with a confidence level α (and the alternate hypothesis accepted, i.e. an a/n rate will be considered higher than a b/m rate) if max S(p, a, n, b, m) 1 α 0<p<1

3 MIC2003: The Fifth Metaheuristics International Conference Examples Let us suppose that all n observations from the first sample where successes and all m observations from the second sample where failures (i.e. a = n and b = 0). Supposing that both populations have the same probability of success, S(p, n, n, 0,m)=p n (1 p) 0 p 0 (1 p) m = p n (1 p) m. The probability ˆp that maximizes S(p, n, n, 0,m) is given by solving the equation : ds(p, n, n, 0,m) dp = np n 1 (1 p) m mp n (1 p) m 1 =0 For the special case a = n and b = 0, the pooled estimate ˆp = a+b m+n is therefore the value that maximizes S(p, a, n, b, m) overp. For instance, if n =3andm =2,S(3/5, 3, 3, 0, 2) = 108/3125 < 5%. So a success rate of 3/3 is significantly higher (with confidence level of 95%) than a success rate of 0/2. Unfortunately, for arbitrary values of a, n, b and m, the pooled estimate is not the value that maximizes S(p, a, n, b, m) over p. For instance, S(3/7, 3, 4, 0, 3) < 4/100 and S( , 3, 4, 0, 3) > 4/100. This means that testing if a rate of 3/4 is significantly higher than a rate of 0/3 with a confidence level of 96% whould lead to an erroneous conclusion if the pool estimate is used. In general, the analytic expression of ˆp is at least hard to be found in practice. Therefore, we have numerically estimated ˆp and provide in Table 1 (and, respectively in Table 2), for various values of n and m and for a confidence level of 95% (respectively 99%), the most extreme couples (a, b) forwhichana/n rate of success is higher than a b/m rate. Reading the tables Let us suppose that the observed success rate of an optimization method A is 6/10 and the observed success rate of method B is 1/9 (meaning that a =6, n = 10, b =1,m =9). InTable1,entryn =10andm = 9 contains the couple (5,1), meaning that a 5/10 success rate is significantly higher than a 1/9 success rate at 95% confidence level. Since the success rate 6/10 > 5/10 it can be deduced that method A is significantly better than method B (at 95% confidence level). 5 Conclusions This article presents a non-parametric statistical test that is very interesting for those who want to compare different heuristic algorithms that do not necessarily end with feasible (or satisfying) solutions. This test has been specially designed for working with very small sample sizes, meaning that a substantial computational effort can be saved when conducting numerical experiments. When the sample sizes are lower than 15, standard statistical tests for comparing the success rates of two populations cannot be validly used. We have indeed observed that the standard statistical test abusively applied provides results that are erroneous. So it is for very high confidence rates, even if sample sizes are larger than 15. Therefore, a non parametric

4 110-4 MIC2003: The Fifth Metaheuristics International Conference n m (3,0) (4,0) (5,0) (5,0) (6,0) (7,0) (7,0) (8,0) (9,0) (9,0) (10,0) (11,0) (11,0) (14,1) (15,1) 3 (2,0) (3,0) (3,0) (4,0) (4,0) (5,0) (5,0) (6,0) (6,0) (7,0) (7,0) (8,0) (9,0) (9,0) (5,1) (6,1) (7,1) (8,1) (8,1) (9,1) (10,1) (11,1) (12,1) (12,1) (13,1) (2,0) (3,0) (3,0) (3,0) (4,0) (4,0) (5,0) (5,0) (5,0) (6,0) (6,0) (7,0) (7,0) (8,0) 4 (3,1) (4,1) (5,1) (5,1) (6,1) (7,1) (7,1) (8,1) (9,1) (9,1) (10,1) (11,1) (11,1) (6,2) (7,2) (8,2) (9,2) (10,2) (11,2) (12,2) (12,2) (13,2) (14,2) (2,0) (2,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (6,0) (6,0) (7,0) 5 (3,1) (4,1) (4,1) (5,1) (5,1) (6,1) (6,1) (7,1) (8,1) (8,1) (9,1) (9,1) (10,1) (4,2) (5,2) (6,2) (7,2) (7,2) (8,2) (9,2) (10,2) (10,2) (11,2) (12,2) (12,2) (8,3) (9,3) (10,3) (11,3) (12,3) (13,3) (14,3) (15,3) (2,0) (2,0) (2,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (5,0) (6,0) (2,1) (3,1) (3,1) (4,1) (4,1) (5,1) (5,1) (6,1) (6,1) (7,1) (7,1) (8,1) (8,1) (9,1) 6 (3,2) (4,2) (5,2) (5,2) (6,2) (7,2) (7,2) (8,2) (9,2) (9,2) (10,2) (11,2) (11,2) (5,3) (6,3) (7,3) (8,3) (9,3) (9,3) (10,3) (11,3) (12,3) (12,3) (13,3) (10,4) (11,4) (12,4) (13,4) (14,4) (15,4) (2,0) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (2,1) (3,1) (3,1) (4,1) (4,1) (4,1) (5,1) (5,1) (6,1) (6,1) (7,1) (7,1) (7,1) (8,1) 7 (3,2) (4,2) (4,2) (5,2) (6,2) (6,2) (7,2) (7,2) (8,2) (8,2) (9,2) (10,2) (10,2) (4,3) (5,3) (6,3) (6,3) (7,3) (8,3) (9,3) (9,3) (10,3) (11,3) (11,3) (12,3) (6,4) (7,4) (8,4) (9,4) (10,4) (10,4) (11,4) (12,4) (13,4) (14,4) (11,5) (12,5) (13,5) (14,5) (15,5) (2,0) (2,0) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (5,0) (5,0) (2,1) (3,1) (3,1) (3,1) (4,1) (4,1) (5,1) (5,1) (5,1) (6,1) (6,1) (6,1) (7,1) (7,1) (3,2) (4,2) (4,2) (5,2) (5,2) (6,2) (6,2) (7,2) (7,2) (8,2) (8,2) (9,2) (9,2) 8 (3,3) (4,3) (5,3) (5,3) (6,3) (7,3) (7,3) (8,3) (9,3) (9,3) (10,3) (10,3) (11,3) (5,4) (6,4) (7,4) (8,4) (8,4) (9,4) (10,4) (10,4) (11,4) (12,4) (13,4) (7,5) (8,5) (9,5) (10,5) (11,5) (12,5) (12,5) (13,5) (14,5) (13,6) (14,6) (15,6) (2,0) (2,0) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (4,0) (2,1) (2,1) (3,1) (3,1) (4,1) (4,1) (4,1) (5,1) (5,1) (5,1) (6,1) (6,1) (6,1) (7,1) (2,2) (3,2) (3,2) (4,2) (4,2) (5,2) (5,2) (6,2) (6,2) (7,2) (7,2) (8,2) (8,2) (9,2) 9 (3,3) (4,3) (4,3) (5,3) (6,3) (6,3) (7,3) (7,3) (8,3) (9,3) (9,3) (10,3) (10,3) (4,4) (5,4) (6,4) (6,4) (7,4) (8,4) (8,4) (9,4) (10,4) (10,4) (11,4) (12,4) (5,5) (6,5) (7,5) (8,5) (9,5) (9,5) (10,5) (11,5) (12,5) (12,5) (13,5) (8,6) (9,6) (10,6) (11,6) (12,6) (13,6) (14,6) (14,6) (15,7) (2,0) (2,0) (2,0) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (2,1) (2,1) (3,1) (3,1) (3,1) (4,1) (4,1) (4,1) (5,1) (5,1) (5,1) (6,1) (6,1) (6,1) (2,2) (3,2) (3,2) (4,2) (4,2) (5,2) (5,2) (5,2) (6,2) (6,2) (7,2) (7,2) (8,2) (8,2) 10 (3,3) (4,3) (4,3) (5,3) (5,3) (6,3) (6,3) (7,3) (7,3) (8,3) (9,3) (9,3) (10,3) (3,4) (4,4) (5,4) (5,4) (6,4) (7,4) (7,4) (8,4) (9,4) (9,4) (10,4) (10,4) (11,4) (4,5) (5,5) (6,5) (7,5) (7,5) (8,5) (9,5) (9,5) (10,5) (11,5) (12,5) (12,5) (6,6) (7,6) (8,6) (9,6) (10,6) (10,6) (11,6) (12,6) (13,6) (14,6) (9,7) (10,7) (11,7) (12,7) (13,7) (14,7) (15,7) (2,0) (2,0) (2,0) (2,0) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (2,1) (2,1) (3,1) (3,1) (3,1) (3,1) (4,1) (4,1) (4,1) (5,1) (5,1) (5,1) (6,1) (6,1) (2,2) (3,2) (3,2) (4,2) (4,2) (4,2) (5,2) (5,2) (5,2) (6,2) (6,2) (7,2) (7,2) (7,2) (3,3) (4,3) (4,3) (5,3) (5,3) (6,3) (6,3) (7,3) (7,3) (7,3) (8,3) (8,3) (9,3) 11 (3,4) (4,4) (5,4) (5,4) (6,4) (6,4) (7,4) (7,4) (8,4) (9,4) (9,4) (10,4) (10,4) (4,5) (5,5) (6,5) (6,5) (7,5) (8,5) (8,5) (9,5) (10,5) (10,5) (11,5) (12,5) (5,6) (6,6) (7,6) (8,6) (8,6) (9,6) (10,6) (11,6) (11,6) (12,6) (13,6) (7,7) (8,7) (9,7) (10,7) (11,7) (11,7) (12,7) (13,7) (14,7) (10,8) (11,8) (12,8) (13,8) (14,8) (15,8) (2,0) (2,0) (2,0) (2,0) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (2,1) (2,1) (3,1) (3,1) (3,1) (3,1) (4,1) (4,1) (4,1) (4,1) (5,1) (5,1) (5,1) (5,1) (2,2) (3,2) (3,2) (3,2) (4,2) (4,2) (4,2) (5,2) (5,2) (6,2) (6,2) (6,2) (7,2) (7,2) (2,3) (3,3) (3,3) (4,3) (4,3) (5,3) (5,3) (6,3) (6,3) (7,3) (7,3) (8,3) (8,3) (8,3) 12 (3,4) (4,4) (4,4) (5,4) (5,4) (6,4) (7,4) (7,4) (8,4) (8,4) (9,4) (9,4) (10,4) (3,5) (4,5) (5,5) (5,5) (6,5) (7,5) (7,5) (8,5) (8,5) (9,5) (10,5) (10,5) (11,5) (4,6) (5,6) (6,6) (7,6) (7,6) (8,6) (9,6) (9,6) (10,6) (11,6) (11,6) (12,6) (5,7) (6,7) (7,7) (8,7) (9,7) (9,7) (10,7) (11,7) (12,7) (12,7) (13,7) (7,8) (8,8) (9,8) (10,8) (11,8) (12,8) (12,8) (13,8) (14,8) (11,9) (12,9) (13,9) (14,9) (15,9) (2,0) (2,0) (2,0) (2,0) (2,0) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (3,0) (3,0) (4,0) (2,1) (2,1) (2,1) (3,1) (3,1) (3,1) (3,1) (4,1) (4,1) (4,1) (4,1) (5,1) (5,1) (5,1) (2,2) (3,2) (3,2) (3,2) (4,2) (4,2) (4,2) (5,2) (5,2) (5,2) (6,2) (6,2) (6,2) (7,2) (2,3) (3,3) (3,3) (4,3) (4,3) (5,3) (5,3) (5,3) (6,3) (6,3) (7,3) (7,3) (8,3) (8,3) (3,4) (4,4) (4,4) (5,4) (5,4) (6,4) (6,4) (7,4) (7,4) (8,4) (8,4) (9,4) (9,4) 13 (3,5) (4,5) (5,5) (5,5) (6,5) (6,5) (7,5) (8,5) (8,5) (9,5) (9,5) (10,5) (10,5) (4,6) (5,6) (6,6) (6,6) (7,6) (8,6) (8,6) (9,6) (10,6) (10,6) (11,6) (11,6) (5,7) (6,7) (7,7) (7,7) (8,7) (9,7) (10,7) (10,7) (11,7) (12,7) (13,7) (6,8) (7,8) (8,8) (9,8) (10,8) (10,8) (11,8) (12,8) (13,8) (13,8) (8,9) (9,9) (10,9) (11,9) (12,9) (13,9) (14,9) (14,9) (12,10) (13,10) (14,10) (15,10) Table 1: Couples (a, b) for which a success rate a/n is significantly higher than a successes rate b/m, for a confidence level of 95%.

5 MIC2003: The Fifth Metaheuristics International Conference n m (7,0) (8,0) (9,0) (10,0) (11,0) (12,0) (12,0) (13,0) (14,0) 3 (4,0) (5,0) (6,0) (7,0) (7,0) (8,0) (9,0) (9,0) (10,0) (11,0) (11,0) (12,0) (12,1) (13,1) (14,1) (15,1) 4 (3,0) (4,0) (5,0) (5,0) (6,0) (6,0) (7,0) (8,0) (8,0) (9,0) (9,0) (10,0) (11,0) (6,1) (7,1) (8,1) (9,1) (10,1) (11,1) (11,1) (12,1) (13,1) (14,1) (3,0) (4,0) (4,0) (5,0) (5,0) (6,0) (6,0) (7,0) (7,0) (8,0) (8,0) (9,0) (9,0) 5 (5,1) (6,1) (7,1) (7,1) (8,1) (9,1) (10,1) (10,1) (11,1) (12,1) (12,1) (9,2) (10,2) (11,2) (12,2) (13,2) (14,2) (14,2) (3,0) (3,0) (4,0) (4,0) (5,0) (5,0) (6,0) (6,0) (7,0) (7,0) (8,0) (8,0) (9,0) 6 (4,1) (5,1) (6,1) (6,1) (7,1) (8,1) (8,1) (9,1) (9,1) (10,1) (11,1) (11,1) (6,2) (7,2) (8,2) (9,2) (10,2) (10,2) (11,2) (12,2) (13,2) (13,2) (11,3) (12,3) (13,3) (14,3) (15,3) (2,0) (3,0) (3,0) (4,0) (4,0) (5,0) (5,0) (5,0) (6,0) (6,0) (7,0) (7,0) (7,0) (8,0) (4,1) (5,1) (5,1) (6,1) (6,1) (7,1) (8,1) (8,1) (9,1) (9,1) (10,1) (10,1) 7 (5,2) (6,2) (7,2) (8,2) (8,2) (9,2) (10,2) (10,2) (11,2) (12,2) (12,2) (8,3) (9,3) (10,3) (11,3) (12,3) (12,3) (13,3) (14,3) (13,4) (14,4) (15,4) (2,0) (3,0) (3,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (6,0) (6,0) (6,0) (7,0) (7,0) (3,1) (4,1) (4,1) (5,1) (6,1) (6,1) (7,1) (7,1) (8,1) (8,1) (9,1) (9,1) (10,1) 8 (4,2) (5,2) (6,2) (6,2) (7,2) (8,2) (8,2) (9,2) (10,2) (10,2) (11,2) (12,2) (6,3) (7,3) (8,3) (9,3) (9,3) (10,3) (11,3) (12,3) (12,3) (13,3) (9,4) (10,4) (11,4) (12,4) (13,4) (14,4) (14,4) (15,5) (2,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (6,0) (6,0) (6,0) (7,0) (3,1) (4,1) (4,1) (5,1) (5,1) (6,1) (6,1) (7,1) (7,1) (8,1) (8,1) (9,1) (9,1) 9 (4,2) (5,2) (6,2) (6,2) (7,2) (7,2) (8,2) (9,2) (9,2) (10,2) (10,2) (11,2) (5,3) (6,3) (7,3) (8,3) (8,3) (9,3) (10,3) (10,3) (11,3) (12,3) (12,3) (7,4) (8,4) (9,4) (10,4) (11,4) (11,4) (12,4) (13,4) (14,4) (10,5) (11,5) (12,5) (13,5) (14,5) (15,5) (2,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (6,0) (6,0) (6,0) (3,1) (4,1) (4,1) (5,1) (5,1) (5,1) (6,1) (6,1) (7,1) (7,1) (8,1) (8,1) (9,1) (4,2) (5,2) (5,2) (6,2) (6,2) (7,2) (8,2) (8,2) (9,2) (9,2) (10,2) (10,2) 10 (5,3) (6,3) (7,3) (7,3) (8,3) (9,3) (9,3) (10,3) (10,3) (11,3) (12,3) (6,4) (7,4) (8,4) (9,4) (9,4) (10,4) (11,4) (12,4) (12,4) (13,4) (8,5) (9,5) (10,5) (11,5) (12,5) (13,5) (13,5) (14,5) (12,6) (13,6) (14,6) (15,6) (2,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (5,0) (6,0) (6,0) (3,1) (4,1) (4,1) (4,1) (5,1) (5,1) (6,1) (6,1) (6,1) (7,1) (7,1) (8,1) (8,1) (3,2) (4,2) (5,2) (5,2) (6,2) (6,2) (7,2) (7,2) (8,2) (8,2) (9,2) (9,2) (10,2) 11 (4,3) (5,3) (6,3) (6,3) (7,3) (8,3) (8,3) (9,3) (9,3) (10,3) (11,3) (11,3) (5,4) (6,4) (7,4) (8,4) (8,4) (9,4) (10,4) (10,4) (11,4) (12,4) (12,4) (7,5) (8,5) (9,5) (10,5) (10,5) (11,5) (12,5) (13,5) (13,5) (9,6) (10,6) (11,6) (12,6) (13,6) (14,6) (14,6) (13,7) (14,7) (15,7) (2,0) (2,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (5,0) (6,0) (3,1) (3,1) (4,1) (4,1) (5,1) (5,1) (5,1) (6,1) (6,1) (7,1) (7,1) (7,1) (8,1) (3,2) (4,2) (4,2) (5,2) (5,2) (6,2) (6,2) (7,2) (7,2) (8,2) (8,2) (9,2) (9,2) (4,3) (5,3) (5,3) (6,3) (7,3) (7,3) (8,3) (8,3) (9,3) (9,3) (10,3) (11,3) 12 (5,4) (6,4) (7,4) (7,4) (8,4) (9,4) (9,4) (10,4) (11,4) (11,4) (12,4) (6,5) (7,5) (8,5) (9,5) (9,5) (10,5) (11,5) (11,5) (12,5) (13,5) (8,6) (9,6) (10,6) (11,6) (12,6) (12,6) (13,6) (14,6) (10,7) (11,7) (12,7) (13,7) (14,7) (15,7) (14,8) (15,8) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (5,0) (2,1) (3,1) (3,1) (4,1) (4,1) (4,1) (5,1) (5,1) (6,1) (6,1) (6,1) (7,1) (7,1) (7,1) (3,2) (4,2) (4,2) (5,2) (5,2) (6,2) (6,2) (7,2) (7,2) (7,2) (8,2) (8,2) (9,2) (4,3) (5,3) (5,3) (6,3) (6,3) (7,3) (7,3) (8,3) (9,3) (9,3) (10,3) (10,3) 13 (4,4) (5,4) (6,4) (6,4) (7,4) (8,4) (8,4) (9,4) (9,4) (10,4) (11,4) (11,4) (5,5) (6,5) (7,5) (8,5) (8,5) (9,5) (10,5) (10,5) (11,5) (12,5) (12,5) (7,6) (8,6) (9,6) (10,6) (10,6) (11,6) (12,6) (13,6) (13,6) (8,7) (9,7) (10,7) (11,7) (12,7) (13,7) (13,7) (14,7) (11,8) (12,8) (13,8) (14,8) (15,8) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (2,1) (3,1) (3,1) (4,1) (4,1) (4,1) (5,1) (5,1) (5,1) (6,1) (6,1) (6,1) (7,1) (7,1) (3,2) (4,2) (4,2) (5,2) (5,2) (5,2) (6,2) (6,2) (7,2) (7,2) (8,2) (8,2) (8,2) (3,3) (4,3) (5,3) (5,3) (6,3) (6,3) (7,3) (7,3) (8,3) (8,3) (9,3) (9,3) (10,3) 14 (4,4) (5,4) (6,4) (6,4) (7,4) (7,4) (8,4) (9,4) (9,4) (10,4) (10,4) (11,4) (5,5) (6,5) (7,5) (7,5) (8,5) (9,5) (9,5) (10,5) (11,5) (11,5) (12,5) (6,6) (7,6) (8,6) (9,6) (9,6) (10,6) (11,6) (11,6) (12,6) (13,6) (7,7) (8,7) (9,7) (10,7) (11,7) (11,7) (12,7) (13,7) (14,7) (9,8) (10,8) (11,8) (12,8) (13,8) (14,8) (14,8) (12,9) (13,9) (14,9) (15,9) (2,0) (2,0) (3,0) (3,0) (3,0) (3,0) (3,0) (4,0) (4,0) (4,0) (4,0) (5,0) (5,0) (5,0) (2,1) (3,1) (3,1) (3,1) (4,1) (4,1) (4,1) (5,1) (5,1) (5,1) (6,1) (6,1) (6,1) (7,1) (3,2) (4,2) (4,2) (4,2) (5,2) (5,2) (6,2) (6,2) (6,2) (7,2) (7,2) (8,2) (8,2) (3,3) (4,3) (4,3) (5,3) (5,3) (6,3) (6,3) (7,3) (7,3) (8,3) (8,3) (9,3) (9,3) (4,4) (5,4) (5,4) (6,4) (7,4) (7,4) (8,4) (8,4) (9,4) (9,4) (10,4) (10,4) 15 (5,5) (6,5) (6,5) (7,5) (8,5) (8,5) (9,5) (10,5) (10,5) (11,5) (11,5) (5,6) (6,6) (7,6) (8,6) (8,6) (9,6) (10,6) (10,6) (11,6) (12,6) (12,6) (7,7) (8,7) (9,7) (10,7) (10,7) (11,7) (12,7) (12,7) (13,7) (8,8) (9,8) (10,8) (11,8) (12,8) (12,8) (13,8) (14,8) (10,9) (11,9) (12,9) (13,9) (14,9) (15,9) (13,10) (14,10) (15,10) Table 2: Couples (a, b) for which a success rate a/n is significantly higher than a successes rate b/m, for a confidence level of 99%.

6 110-6 MIC2003: The Fifth Metaheuristics International Conference test has been developed. This test is more accurate and can be applied for any sample sizes, but it requires relatively heavy computations. So, pre-computed values for 95% and 99% confidence levels have been tabulated in the present article. The computation of confidence levels can also be done online at the URL : When the sample sizes are at least 15, we have observed that the probability of rejecting the null hypothesis when the last is true for the standard test almost always over estimates the corresponding value obtained with the non parametric test. This means that the standard test very seldom reject the null hypothesis when it has to be accepted, according to the non parametric test. Let us mention that, very often, the standard test strongly over estimates the value of the probability of the null hypothesis, meaning that the non parametric test proposed is more powerful than the standard one. 6 Acknowledgements The author would like to thank F. Taillard and J. Zuber for comments and discussions on early versions of the article as well as A. Løkketangen for asking the embarrassing questions about the comparison of methods for the satisfiability problem that have led to the development of the present statistical test. The online implementation for computing the statistical test is due to Ph. Wälti. The present work is supported by the strategic founds of the Applied University of Western Switzerland, grant LQF References [1] K.M. Anstreicher, N.W. Brixius, J.-P. Goux and J. Linderoth, Solving large quadratic assignment problems on computational grids, to appear in Mathematical Programming, Series B, Currently available on the Web from [2] J.E. Beasley, OR-Library: distributing test problems by electronic mail, Journal of the Operational Research Society 41(11), 1990, pp [3] R.E. Burkard, S.E. Karisch and F. Rendl, QAPLIB A Quadratic Assignment Problem Library, Journal of Global Optimization 10, pp , [4] G. Reinelt, TSPLIB : sample instances for the TSP (and related problems) from various sources and of various types. Available on the web :

One-Sample Z: C1, C2, C3, C4, C5, C6, C7, C8,... The assumed standard deviation = 110

One-Sample Z: C1, C2, C3, C4, C5, C6, C7, C8,... The assumed standard deviation = 110 SMAM 314 Computer Assignment 3 1.Suppose n = 100 lightbulbs are selected at random from a large population.. Assume that the light bulbs put on test until they fail. Assume that for the population of light

More information

Most typical tests can also be done as permutation tests. For example: Two sample tests (e.g., t-test, MWU test)

Most typical tests can also be done as permutation tests. For example: Two sample tests (e.g., t-test, MWU test) Permutation tests: Permutation tests are a large group of statistical procedures. Most typical tests can also be done as permutation tests. For example: Two sample tests (e.g., t-test, MWU test) Three

More information

Math 58. Rumbos Fall Solutions to Exam Give thorough answers to the following questions:

Math 58. Rumbos Fall Solutions to Exam Give thorough answers to the following questions: Math 58. Rumbos Fall 2008 1 Solutions to Exam 2 1. Give thorough answers to the following questions: (a) Define a Bernoulli trial. Answer: A Bernoulli trial is a random experiment with two possible, mutually

More information

Jednoczynnikowa analiza wariancji (ANOVA)

Jednoczynnikowa analiza wariancji (ANOVA) Wydział Matematyki Jednoczynnikowa analiza wariancji (ANOVA) Wykład 07 Example 1 An accounting firm has developed three methods to guide its seasonal employees in preparing individual income tax returns.

More information

Statistical Hypothesis Testing

Statistical Hypothesis Testing Statistical Hypothesis Testing Statistical Hypothesis Testing is a kind of inference Given a sample, say something about the population Examples: Given a sample of classifications by a decision tree, test

More information

A1 = Chess A2 = Non-Chess B1 = Male B2 = Female

A1 = Chess A2 = Non-Chess B1 = Male B2 = Female Chapter IV 4.0Analysis And Interpretation Of The Data In this chapter, the analysis of the data of two hundred chess and non chess players of Hyderabad has been analysed.for this study 200 samples were

More information

Name: Exam 01 (Midterm Part 2 Take Home, Open Everything)

Name: Exam 01 (Midterm Part 2 Take Home, Open Everything) Name: Exam 01 (Midterm Part 2 Take Home, Open Everything) To help you budget your time, questions are marked with *s. One * indicates a straightforward question testing foundational knowledge. Two ** indicate

More information

MATRIX SAMPLING DESIGNS FOR THE YEAR2000 CENSUS. Alfredo Navarro and Richard A. Griffin l Alfredo Navarro, Bureau of the Census, Washington DC 20233

MATRIX SAMPLING DESIGNS FOR THE YEAR2000 CENSUS. Alfredo Navarro and Richard A. Griffin l Alfredo Navarro, Bureau of the Census, Washington DC 20233 MATRIX SAMPLING DESIGNS FOR THE YEAR2000 CENSUS Alfredo Navarro and Richard A. Griffin l Alfredo Navarro, Bureau of the Census, Washington DC 20233 I. Introduction and Background Over the past fifty years,

More information

Econ 172A - Slides from Lecture 18

Econ 172A - Slides from Lecture 18 1 Econ 172A - Slides from Lecture 18 Joel Sobel December 4, 2012 2 Announcements 8-10 this evening (December 4) in York Hall 2262 I ll run a review session here (Solis 107) from 12:30-2 on Saturday. Quiz

More information

IE 361 Module 13. Control Charts for Counts ("Attributes Data") Reading: Section 3.3 of Statistical Quality Assurance Methods for Engineers

IE 361 Module 13. Control Charts for Counts (Attributes Data) Reading: Section 3.3 of Statistical Quality Assurance Methods for Engineers IE 361 Module 13 Control Charts for Counts ("Attributes Data") Reading: Section 3.3 of Statistical Quality Assurance Methods for Engineers Prof. Steve Vardeman and Prof. Max Morris Iowa State University

More information

Lesson 1 6. Algebra: Variables and Expression. Students will be able to evaluate algebraic expressions.

Lesson 1 6. Algebra: Variables and Expression. Students will be able to evaluate algebraic expressions. Lesson 1 6 Algebra: Variables and Expression Students will be able to evaluate algebraic expressions. P1 Represent and analyze patterns, rules and functions with words, tables, graphs and simple variable

More information

Laboratory 1: Uncertainty Analysis

Laboratory 1: Uncertainty Analysis University of Alabama Department of Physics and Astronomy PH101 / LeClair May 26, 2014 Laboratory 1: Uncertainty Analysis Hypothesis: A statistical analysis including both mean and standard deviation can

More information

A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks

A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks MIC2005: The Sixth Metaheuristics International Conference??-1 A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks Clayton Commander Carlos A.S. Oliveira Panos M. Pardalos Mauricio

More information

Dynamic Analog Testing via ATE Digital Test Channels

Dynamic Analog Testing via ATE Digital Test Channels Dynamic nalog Testing via TE Digital Test Channels CC Su, CS Chang, HW Huang, DS Tu, CL Lee+, Jerry CH Lin* Dept of Electrical and Control Engr ational Chiao Tung University Dept of Electronic Engr ational

More information

The fundamentals of detection theory

The fundamentals of detection theory Advanced Signal Processing: The fundamentals of detection theory Side 1 of 18 Index of contents: Advanced Signal Processing: The fundamentals of detection theory... 3 1 Problem Statements... 3 2 Detection

More information

Rating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems

Rating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems Rating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems Bahare Fatemi, Seyed Mehran Kazemi, Nazanin Mehrasa International Science Index, Computer and Information Engineering waset.org/publication/9999524

More information

Solutions 2: Probability and Counting

Solutions 2: Probability and Counting Massachusetts Institute of Technology MITES 18 Physics III Solutions : Probability and Counting Due Tuesday July 3 at 11:59PM under Fernando Rendon s door Preface: The basic methods of probability and

More information

Urn Sampling Without Replacement: Enumerative Combinatorics In R

Urn Sampling Without Replacement: Enumerative Combinatorics In R Urn Sampling Without Replacement: Enumerative Combinatorics In R Robin K. S. Hankin Auckland University of Technology Abstract This vignette is based on Hankin (2007). This short paper introduces a code

More information

A Factorial Representation of Permutations and Its Application to Flow-Shop Scheduling

A Factorial Representation of Permutations and Its Application to Flow-Shop Scheduling Systems and Computers in Japan, Vol. 38, No. 1, 2007 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol. J85-D-I, No. 5, May 2002, pp. 411 423 A Factorial Representation of Permutations and Its

More information

How Many Imputations are Really Needed? Some Practical Clarifications of Multiple Imputation Theory

How Many Imputations are Really Needed? Some Practical Clarifications of Multiple Imputation Theory Prev Sci (2007) 8:206 213 DOI 10.1007/s11121-007-0070-9 How Many Imputations are Really Needed? Some Practical Clarifications of Multiple Imputation Theory John W. Graham & Allison E. Olchowski & Tamika

More information

Burst Error Correction Method Based on Arithmetic Weighted Checksums

Burst Error Correction Method Based on Arithmetic Weighted Checksums Engineering, 0, 4, 768-773 http://dxdoiorg/0436/eng04098 Published Online November 0 (http://wwwscirporg/journal/eng) Burst Error Correction Method Based on Arithmetic Weighted Checksums Saleh Al-Omar,

More information

Aesthetically Pleasing Azulejo Patterns

Aesthetically Pleasing Azulejo Patterns Bridges 2009: Mathematics, Music, Art, Architecture, Culture Aesthetically Pleasing Azulejo Patterns Russell Jay Hendel Mathematics Department, Room 312 Towson University 7800 York Road Towson, MD, 21252,

More information

On the GNSS integer ambiguity success rate

On the GNSS integer ambiguity success rate On the GNSS integer ambiguity success rate P.J.G. Teunissen Mathematical Geodesy and Positioning Faculty of Civil Engineering and Geosciences Introduction Global Navigation Satellite System (GNSS) ambiguity

More information

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. B) Blood type Frequency

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. B) Blood type Frequency MATH 1342 Final Exam Review Name Construct a frequency distribution for the given qualitative data. 1) The blood types for 40 people who agreed to participate in a medical study were as follows. 1) O A

More information

STAT Statistics I Midterm Exam One. Good Luck!

STAT Statistics I Midterm Exam One. Good Luck! STAT 515 - Statistics I Midterm Exam One Name: Instruction: You can use a calculator that has no connection to the Internet. Books, notes, cellphones, and computers are NOT allowed in the test. There are

More information

A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS

A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS C. COMMANDER, C.A.S. OLIVEIRA, P.M. PARDALOS, AND M.G.C. RESENDE ABSTRACT. Ad hoc networks are composed of a set of wireless

More information

XLVI Pesquisa Operacional na Gestão da Segurança Pública

XLVI Pesquisa Operacional na Gestão da Segurança Pública HEURISTIC SEARCH METHOD BASED ON BETTING THEORY Pedro Demasi Federal University of Rio de Janeiro, Informactics Graduate Program Rua Athos da Silveira Ramos, 274 CCMN/NCE Cidade Universitária Ilha do Fundão

More information

A Brief Examination of Current and a Proposed Fine Frequency Estimator Using Three DFT Samples

A Brief Examination of Current and a Proposed Fine Frequency Estimator Using Three DFT Samples A Brief Examination of Current and a Proposed Fine Frequency Estimator Using Three DFT Samples Eric Jacobsen Anchor Hill Communications June, 2015 Introduction and History The practice of fine frequency

More information

2359 (i.e. 11:59:00 pm) on 4/16/18 via Blackboard

2359 (i.e. 11:59:00 pm) on 4/16/18 via Blackboard CS 109: Introduction to Computer Science Goodney Spring 2018 Homework Assignment 4 Assigned: 4/2/18 via Blackboard Due: 2359 (i.e. 11:59:00 pm) on 4/16/18 via Blackboard Notes: a. This is the fourth homework

More information

FROM BLIND SOURCE SEPARATION TO BLIND SOURCE CANCELLATION IN THE UNDERDETERMINED CASE: A NEW APPROACH BASED ON TIME-FREQUENCY ANALYSIS

FROM BLIND SOURCE SEPARATION TO BLIND SOURCE CANCELLATION IN THE UNDERDETERMINED CASE: A NEW APPROACH BASED ON TIME-FREQUENCY ANALYSIS ' FROM BLIND SOURCE SEPARATION TO BLIND SOURCE CANCELLATION IN THE UNDERDETERMINED CASE: A NEW APPROACH BASED ON TIME-FREQUENCY ANALYSIS Frédéric Abrard and Yannick Deville Laboratoire d Acoustique, de

More information

Proceedings Statistical Evaluation of the Positioning Error in Sequential Localization Techniques for Sensor Networks

Proceedings Statistical Evaluation of the Positioning Error in Sequential Localization Techniques for Sensor Networks Proceedings Statistical Evaluation of the Positioning Error in Sequential Localization Techniques for Sensor Networks Cesar Vargas-Rosales *, Yasuo Maidana, Rafaela Villalpando-Hernandez and Leyre Azpilicueta

More information

STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES

STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES FLORIAN BREUER and JOHN MICHAEL ROBSON Abstract We introduce a game called Squares where the single player is presented with a pattern of black and white

More information

Solutions to Odd-Numbered End-of-Chapter Exercises: Chapter 13

Solutions to Odd-Numbered End-of-Chapter Exercises: Chapter 13 Introduction to Econometrics (3 rd Updated Edition by James H. Stock and Mark W. Watson Solutions to Odd-Numbered End-of-Chapter Exercises: Chapter 13 (This version July 0, 014 Stock/Watson - Introduction

More information

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining

More information

Construction of SARIMAXmodels

Construction of SARIMAXmodels SYSTEMS ANALYSIS LABORATORY Construction of SARIMAXmodels using MATLAB Mat-2.4108 Independent research projects in applied mathematics Antti Savelainen, 63220J 9/25/2009 Contents 1 Introduction...3 2 Existing

More information

Research Article A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks

Research Article A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010, Article ID 578370, 8 pages doi:10.1155/2010/578370 Research Article A New Iterated Local Search Algorithm

More information

Game Theory and Randomized Algorithms

Game Theory and Randomized Algorithms Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international

More information

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players). Game Theory Refresher Muriel Niederle February 3, 2009 1. Definition of a Game We start by rst de ning what a game is. A game consists of: A set of players (here for simplicity only 2 players, all generalized

More information

Please Turn Over Page 1 of 7

Please Turn Over Page 1 of 7 . Page 1 of 7 ANSWER ALL QUESTIONS Question 1: (25 Marks) A random sample of 35 homeowners was taken from the village Penville and their ages were recorded. 25 31 40 50 62 70 99 75 65 50 41 31 25 26 31

More information

Optimal Yahtzee performance in multi-player games

Optimal Yahtzee performance in multi-player games Optimal Yahtzee performance in multi-player games Andreas Serra aserra@kth.se Kai Widell Niigata kaiwn@kth.se April 12, 2013 Abstract Yahtzee is a game with a moderately large search space, dependent on

More information

Jong C. Park Computer Science Division, KAIST

Jong C. Park Computer Science Division, KAIST Jong C. Park Computer Science Division, KAIST Today s Topics Basic Principles Permutations and Combinations Algorithms for Generating Permutations Generalized Permutations and Combinations Binomial Coefficients

More information

A Sliding Window PDA for Asynchronous CDMA, and a Proposal for Deliberate Asynchronicity

A Sliding Window PDA for Asynchronous CDMA, and a Proposal for Deliberate Asynchronicity 1970 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 12, DECEMBER 2003 A Sliding Window PDA for Asynchronous CDMA, and a Proposal for Deliberate Asynchronicity Jie Luo, Member, IEEE, Krishna R. Pattipati,

More information

Probability. Engr. Jeffrey T. Dellosa.

Probability. Engr. Jeffrey T. Dellosa. Probability Engr. Jeffrey T. Dellosa Email: jtdellosa@gmail.com Outline Probability 2.1 Sample Space 2.2 Events 2.3 Counting Sample Points 2.4 Probability of an Event 2.5 Additive Rules 2.6 Conditional

More information

Variations on the Two Envelopes Problem

Variations on the Two Envelopes Problem Variations on the Two Envelopes Problem Panagiotis Tsikogiannopoulos pantsik@yahoo.gr Abstract There are many papers written on the Two Envelopes Problem that usually study some of its variations. In this

More information

ANGLE MODULATED SIMULATED KALMAN FILTER ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS

ANGLE MODULATED SIMULATED KALMAN FILTER ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS ANGLE MODULATED SIMULATED KALMAN FILTER ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS Zulkifli Md Yusof 1, Zuwairie Ibrahim 1, Ismail Ibrahim 1, Kamil Zakwan Mohd Azmi 1, Nor Azlina Ab Aziz 2, Nor

More information

CIS 2033 Lecture 6, Spring 2017

CIS 2033 Lecture 6, Spring 2017 CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,

More information

Lectures 15/16 ANOVA. ANOVA Tests. Analysis of Variance. >ANOVA stands for ANalysis Of VAriance >ANOVA allows us to:

Lectures 15/16 ANOVA. ANOVA Tests. Analysis of Variance. >ANOVA stands for ANalysis Of VAriance >ANOVA allows us to: Lectures 5/6 Analysis of Variance ANOVA >ANOVA stands for ANalysis Of VAriance >ANOVA allows us to: Do multiple tests at one time more than two groups Test for multiple effects simultaneously more than

More information

Techniques for Generating Sudoku Instances

Techniques for Generating Sudoku Instances Chapter Techniques for Generating Sudoku Instances Overview Sudoku puzzles become worldwide popular among many players in different intellectual levels. In this chapter, we are going to discuss different

More information

December 12, FGCU Invitational Mathematics Competition Statistics Team

December 12, FGCU Invitational Mathematics Competition Statistics Team 1 Directions You will have 4 minutes to answer each question. The scoring will be 16 points for a correct response in the 1 st minute, 12 points for a correct response in the 2 nd minute, 8 points for

More information

Ground Target Signal Simulation by Real Signal Data Modification

Ground Target Signal Simulation by Real Signal Data Modification Ground Target Signal Simulation by Real Signal Data Modification Witold CZARNECKI MUT Military University of Technology ul.s.kaliskiego 2, 00-908 Warszawa Poland w.czarnecki@tele.pw.edu.pl SUMMARY Simulation

More information

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors

We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists 3,500 108,000 1.7 M Open access books available International authors and editors Downloads Our

More information

Permutations with short monotone subsequences

Permutations with short monotone subsequences Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres

More information

A New Standard for Radiographic Acceptance Criteria for Steel Castings: Gage R&R Study

A New Standard for Radiographic Acceptance Criteria for Steel Castings: Gage R&R Study Hardin, R.A., and Beckermann, C., A New Standard for Radiographic Acceptance Criteria for Steel Castings: Gage rd SFSA Technical and Operating Conference, Paper No..6, Steel Founders' R&R Study, in at

More information

Project summary. Key findings, Winter: Key findings, Spring:

Project summary. Key findings, Winter: Key findings, Spring: Summary report: Assessing Rusty Blackbird habitat suitability on wintering grounds and during spring migration using a large citizen-science dataset Brian S. Evans Smithsonian Migratory Bird Center October

More information

Remember that represents the set of all permutations of {1, 2,... n}

Remember that represents the set of all permutations of {1, 2,... n} 20180918 Remember that represents the set of all permutations of {1, 2,... n} There are some basic facts about that we need to have in hand: 1. Closure: If and then 2. Associativity: If and and then 3.

More information

Basic Probability Concepts

Basic Probability Concepts 6.1 Basic Probability Concepts How likely is rain tomorrow? What are the chances that you will pass your driving test on the first attempt? What are the odds that the flight will be on time when you go

More information

Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods

Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods Ravi Kothari, Diptesh Ghosh P&QM Area, IIM Ahmedabad, Vastrapur, Ahmedabad 380015, Gujarat, INDIA

More information

Sampling Terminology. all possible entities (known or unknown) of a group being studied. MKT 450. MARKETING TOOLS Buyer Behavior and Market Analysis

Sampling Terminology. all possible entities (known or unknown) of a group being studied. MKT 450. MARKETING TOOLS Buyer Behavior and Market Analysis Sampling Terminology MARKETING TOOLS Buyer Behavior and Market Analysis Population all possible entities (known or unknown) of a group being studied. Sampling Procedures Census study containing data from

More information

A Winning Strategy for the Game of Antonim

A Winning Strategy for the Game of Antonim A Winning Strategy for the Game of Antonim arxiv:1506.01042v1 [math.co] 1 Jun 2015 Zachary Silbernick Robert Campbell June 4, 2015 Abstract The game of Antonim is a variant of the game Nim, with the additional

More information

Human Reconstruction of Digitized Graphical Signals

Human Reconstruction of Digitized Graphical Signals Proceedings of the International MultiConference of Engineers and Computer Scientists 8 Vol II IMECS 8, March -, 8, Hong Kong Human Reconstruction of Digitized Graphical s Coskun DIZMEN,, and Errol R.

More information

Possible responses to the 2015 AP Statistics Free Resposne questions, Draft #2. You can access the questions here at AP Central.

Possible responses to the 2015 AP Statistics Free Resposne questions, Draft #2. You can access the questions here at AP Central. Possible responses to the 2015 AP Statistics Free Resposne questions, Draft #2. You can access the questions here at AP Central. Note: I construct these as a service for both students and teachers to start

More information

Do Populations Conform to the Law of Anomalous Numbers?

Do Populations Conform to the Law of Anomalous Numbers? Do Populations Conform to the Law of Anomalous Numbers? Frédéric SANDRON* The first significant digit of a number is its leftmost non-zero digit. For example, the first significant digit of the number

More information

FAULT DIAGNOSIS AND RECONFIGURATION IN FLIGHT CONTROL SYSTEMS

FAULT DIAGNOSIS AND RECONFIGURATION IN FLIGHT CONTROL SYSTEMS FAULT DIAGNOSIS AND RECONFIGURATION IN FLIGHT CONTROL SYSTEMS by CHINGIZ HAJIYEV Istanbul Technical University, Turkey and FIKRET CALISKAN Istanbul Technical University, Turkey Kluwer Academic Publishers

More information

Math 3338: Probability (Fall 2006)

Math 3338: Probability (Fall 2006) Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/7 2.3 Counting Techniques (III) - Partitions Probability p.2/7 Partitioned

More information

Mehrdad Amirghasemi a* Reza Zamani a

Mehrdad Amirghasemi a* Reza Zamani a The roles of evolutionary computation, fitness landscape, constructive methods and local searches in the development of adaptive systems for infrastructure planning Mehrdad Amirghasemi a* Reza Zamani a

More information

Prediction of Cluster System Load Using Artificial Neural Networks

Prediction of Cluster System Load Using Artificial Neural Networks Prediction of Cluster System Load Using Artificial Neural Networks Y.S. Artamonov 1 1 Samara National Research University, 34 Moskovskoe Shosse, 443086, Samara, Russia Abstract Currently, a wide range

More information

Application of QAP in Modulation Diversity (MoDiv) Design

Application of QAP in Modulation Diversity (MoDiv) Design Application of QAP in Modulation Diversity (MoDiv) Design Hans D Mittelmann School of Mathematical and Statistical Sciences Arizona State University INFORMS Annual Meeting Philadelphia, PA 4 November 2015

More information

1 of 5 7/16/2009 6:57 AM Virtual Laboratories > 13. Games of Chance > 1 2 3 4 5 6 7 8 9 10 11 3. Simple Dice Games In this section, we will analyze several simple games played with dice--poker dice, chuck-a-luck,

More information

Name: Exam 01 (Midterm Part 2 take home, open everything)

Name: Exam 01 (Midterm Part 2 take home, open everything) Name: Exam 01 (Midterm Part 2 take home, open everything) To help you budget your time, questions are marked with *s. One * indicates a straightforward question testing foundational knowledge. Two ** indicate

More information

Shuffled Complex Evolution

Shuffled Complex Evolution Shuffled Complex Evolution Shuffled Complex Evolution An Evolutionary algorithm That performs local and global search A solution evolves locally through a memetic evolution (Local search) This local search

More information

Initialisation improvement in engineering feedforward ANN models.

Initialisation improvement in engineering feedforward ANN models. Initialisation improvement in engineering feedforward ANN models. A. Krimpenis and G.-C. Vosniakos National Technical University of Athens, School of Mechanical Engineering, Manufacturing Technology Division,

More information

SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS

SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #G04 SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS Vincent D. Blondel Department of Mathematical Engineering, Université catholique

More information

Modulation Classification based on Modified Kolmogorov-Smirnov Test

Modulation Classification based on Modified Kolmogorov-Smirnov Test Modulation Classification based on Modified Kolmogorov-Smirnov Test Ali Waqar Azim, Syed Safwan Khalid, Shafayat Abrar ENSIMAG, Institut Polytechnique de Grenoble, 38406, Grenoble, France Email: ali-waqar.azim@ensimag.grenoble-inp.fr

More information

Chapter 19. Inference about a Population Proportion. BPS - 5th Ed. Chapter 19 1

Chapter 19. Inference about a Population Proportion. BPS - 5th Ed. Chapter 19 1 Chapter 19 Inference about a Population Proportion BPS - 5th Ed. Chapter 19 1 Proportions The proportion of a population that has some outcome ( success ) is p. The proportion of successes in a sample

More information

DSP First Lab 08: Frequency Response: Bandpass and Nulling Filters

DSP First Lab 08: Frequency Response: Bandpass and Nulling Filters DSP First Lab 08: Frequency Response: Bandpass and Nulling Filters Pre-Lab and Warm-Up: You should read at least the Pre-Lab and Warm-up sections of this lab assignment and go over all exercises in the

More information

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6 CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3

More information

S Simulation program SEAMCAT

S Simulation program SEAMCAT S-72.333 Post Graduate Course in Radiocommunications Spring 2001 Simulation program SEAMCAT (The Spectrum Engineering Advanced Monte Carlo Analysis Tool) Pekka Ollikainen pekka.ollikainen@thk.fi Page 1

More information

ECE313 Summer Problem Set 4. Reading: RVs, mean, variance, and coniditional probability

ECE313 Summer Problem Set 4. Reading: RVs, mean, variance, and coniditional probability ECE Summer 0 Problem Set Reading: RVs, mean, variance, and coniditional probability Quiz Date: This Friday Note: It is very important that you solve the problems first and check the solutions afterwards.

More information

On Surfaces of Revolution whose Mean Curvature is Constant

On Surfaces of Revolution whose Mean Curvature is Constant On Surfaces of Revolution whose Mean Curvature is Constant Ch. Delaunay May 4, 2002 When one seeks a surface of given area enclosing a maximal volume, one finds that the equation this surface must satisfy

More information

Player Speed vs. Wild Pokémon Encounter Frequency in Pokémon SoulSilver Joshua and AP Statistics, pd. 3B

Player Speed vs. Wild Pokémon Encounter Frequency in Pokémon SoulSilver Joshua and AP Statistics, pd. 3B Player Speed vs. Wild Pokémon Encounter Frequency in Pokémon SoulSilver Joshua and AP Statistics, pd. 3B In the newest iterations of Nintendo s famous Pokémon franchise, Pokémon HeartGold and SoulSilver

More information

Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2)

Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2) Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2) Yu (Larry) Chen School of Economics, Nanjing University Fall 2015 Extensive Form Game I It uses game tree to represent the games.

More information

SOLUTIONS TO PROBLEM SET 5. Section 9.1

SOLUTIONS TO PROBLEM SET 5. Section 9.1 SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3

More information

Optimal Multicast Routing in Ad Hoc Networks

Optimal Multicast Routing in Ad Hoc Networks Mat-2.108 Independent esearch Projects in Applied Mathematics Optimal Multicast outing in Ad Hoc Networks Juha Leino 47032J Juha.Leino@hut.fi 1st December 2002 Contents 1 Introduction 2 2 Optimal Multicasting

More information

Author: Yih-Yih Lin. Correspondence: Yih-Yih Lin Hewlett-Packard Company MR Forest Street Marlboro, MA USA

Author: Yih-Yih Lin. Correspondence: Yih-Yih Lin Hewlett-Packard Company MR Forest Street Marlboro, MA USA 4 th European LS-DYNA Users Conference MPP / Linux Cluster / Hardware I A Correlation Study between MPP LS-DYNA Performance and Various Interconnection Networks a Quantitative Approach for Determining

More information

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition SF2972: Game theory Mark Voorneveld, mark.voorneveld@hhs.se Topic 1: defining games and strategies Drawing a game tree is usually the most informative way to represent an extensive form game. Here is one

More information

Genealogical trees, coalescent theory, and the analysis of genetic polymorphisms

Genealogical trees, coalescent theory, and the analysis of genetic polymorphisms Genealogical trees, coalescent theory, and the analysis of genetic polymorphisms Magnus Nordborg University of Southern California The importance of history Genetic polymorphism data represent the outcome

More information

Experiments on Alternatives to Minimax

Experiments on Alternatives to Minimax Experiments on Alternatives to Minimax Dana Nau University of Maryland Paul Purdom Indiana University April 23, 1993 Chun-Hung Tzeng Ball State University Abstract In the field of Artificial Intelligence,

More information

INTEGRATED COVERAGE MEASUREMENT SAMPLE DESIGN FOR CENSUS 2000 DRESS REHEARSAL

INTEGRATED COVERAGE MEASUREMENT SAMPLE DESIGN FOR CENSUS 2000 DRESS REHEARSAL INTEGRATED COVERAGE MEASUREMENT SAMPLE DESIGN FOR CENSUS 2000 DRESS REHEARSAL David McGrath, Robert Sands, U.S. Bureau of the Census David McGrath, Room 2121, Bldg 2, Bureau of the Census, Washington,

More information

VENTILATION CONTROL OF THE BLANKA TUNNEL: A MATHEMATICAL PROGRAMMING APPROACH

VENTILATION CONTROL OF THE BLANKA TUNNEL: A MATHEMATICAL PROGRAMMING APPROACH - 19 - VENTILATION CONTROL OF THE BLANKA TUNNEL: A MATHEMATICAL PROGRAMMING APPROACH Pořízek J. 1, Zápařka J. 1, Ferkl L. 1 Satra, Czech Republic Feramat Cybernetics, Czech Republic ABSTRACT The Blanka

More information

CS188 Spring 2014 Section 3: Games

CS188 Spring 2014 Section 3: Games CS188 Spring 2014 Section 3: Games 1 Nearly Zero Sum Games The standard Minimax algorithm calculates worst-case values in a zero-sum two player game, i.e. a game in which for all terminal states s, the

More information

Electronically Steerable planer Phased Array Antenna

Electronically Steerable planer Phased Array Antenna Electronically Steerable planer Phased Array Antenna Amandeep Kaur Department of Electronics and Communication Technology, Guru Nanak Dev University, Amritsar, India Abstract- A planar phased-array antenna

More information

The Galaxy. Christopher Gutierrez, Brenda Garcia, Katrina Nieh. August 18, 2012

The Galaxy. Christopher Gutierrez, Brenda Garcia, Katrina Nieh. August 18, 2012 The Galaxy Christopher Gutierrez, Brenda Garcia, Katrina Nieh August 18, 2012 1 Abstract The game Galaxy has yet to be solved and the optimal strategy is unknown. Solving the game boards would contribute

More information

Modulation Design For MIMO HARQ Channel

Modulation Design For MIMO HARQ Channel Modulation Design For MIMO HARQ Channel Hans D Mittelmann School of Mathematical and Statistical Sciences Arizona State University INFORMS Annual Meeting Nashville, TN 16 November 2016 This is joint work

More information

Design of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan

Design of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan Design of intelligent surveillance systems: a game theoretic case Nicola Basilico Department of Computer Science University of Milan Outline Introduction to Game Theory and solution concepts Game definition

More information

Comparison of Two Alternative Movement Algorithms for Agent Based Distillations

Comparison of Two Alternative Movement Algorithms for Agent Based Distillations Comparison of Two Alternative Movement Algorithms for Agent Based Distillations Dion Grieger Land Operations Division Defence Science and Technology Organisation ABSTRACT This paper examines two movement

More information

Image Encryption Based on the Modified Triple- DES Cryptosystem

Image Encryption Based on the Modified Triple- DES Cryptosystem International Mathematical Forum, Vol. 7, 2012, no. 59, 2929-2942 Image Encryption Based on the Modified Triple- DES Cryptosystem V. M. SILVA-GARCÍA 1, R. FLORES-CARAPIA 2, I. LÓPEZ-YAÑEZ 3 and C. RENTERÍA-MÁRQUEZ

More information

Chapter 1 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.

Chapter 1 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal. 1 Relations This book starts with one of its most abstract topics, so don't let the abstract nature deter you. Relations are quite simple but like virtually all simple mathematical concepts they have their

More information

Permutation and Randomization Tests 1

Permutation and Randomization Tests 1 Permutation and 1 STA442/2101 Fall 2012 1 See last slide for copyright information. 1 / 19 Overview 1 Permutation Tests 2 2 / 19 The lady and the tea From Fisher s The design of experiments, first published

More information

2011, Stat-Ease, Inc.

2011, Stat-Ease, Inc. Practical Aspects of Algorithmic Design of Physical Experiments from an Engineer s perspective Pat Whitcomb Stat-Ease Ease, Inc. 612.746.2036 fax 612.746.2056 pat@statease.com www.statease.com Statistics

More information

AN EVALUATION OF TWO ALTERNATIVES TO MINIMAX. Dana Nau 1 Computer Science Department University of Maryland College Park, MD 20742

AN EVALUATION OF TWO ALTERNATIVES TO MINIMAX. Dana Nau 1 Computer Science Department University of Maryland College Park, MD 20742 Uncertainty in Artificial Intelligence L.N. Kanal and J.F. Lemmer (Editors) Elsevier Science Publishers B.V. (North-Holland), 1986 505 AN EVALUATION OF TWO ALTERNATIVES TO MINIMAX Dana Nau 1 University

More information