In this study, a comparison of features for discriminating between different music performers playing the same piece is presented. Based on a series of statistical experiments on a data set of piano pieces played by 22 performers, it is shown that the deviation from the performance norm (average performance) is better able to reveal the performers’ individualities in comparison to the deviation...

Problems of detecting two (or one of two) irregular coins x and y among a set of n coins are considered. The testing device is such that it returns feedback 1 if x belongs to the test set and y does not, while it returns feedback 0 otherwise. We present a lower bound on the worst-case number of tests necessary to nd one of the two irregular coins as well as on the worst-case number of tests to ...

We study the problem of finding a point in the relative interior of the optimal face of a linear program. We prove that in the worst case such a point can be obtained in O(n3L) arithmetic operations. This complexity is the same as the complexity for solving a linear program. We also show how to find such a point in practice. We report and discuss computational results obtained for the linear pr...

This paper addresses the problem of reducing the size of test sets for regression testing and test output inspection Since regression testing requires the execution of some and in the worst case all test cases reducing the number of tests can have a large bene t Additionally testers generally have to examine the output of each test case both during initial and regression testing Since this is d...

We present a unconditional deterministic primality proving algorithm for Cullen numbers. The expected running time and the worst case running time of the algorithm are Õ(logN) bit operations and Õ(logN) bit operations, respectively.