We design two performance measures for a planar locomotion robot, modeled closely after the Platonic Beast. The first measure is proportional to the total motion of all joints during locomotion of the robot. This is a rough approximation to the energy consumption of the robot. The second measure determines the maximal speed of locomotion, for given limits on the joint speeds. We compute optimal...

This paper introduces Bayesian classiication, measurement of classiication costs by loss functionals and methods for estimation of loss when the true classiication rules are unknown. Cross-validation and several bootstrap methods are reviewed and compared using two artiicial examples.

Taking an information-processing view of organizations, we address the need for building a robust set of performance measures for Edge Organizations (EOs). Alberts and Hayes in Power to the Edge: Command, Control in the Information Age conceptualized EOs as informationintensive entities whose performance is directly related to their ability for agile information processing. We ask the question,...

While precision and recall have served the information extraction community well as two separate measures of system performance, we show that the F -measure, the weighted harmonic mean of precision and recall, exhibits certain undesirable behaviors. To overcome these limitations, we define an error measure, the slot error rate, which combines the different types of error directly, without havin...

[x]i = (x (0) 0 , . . . , x (k−1) 0 , x (0) 1 , . . . , x (k−1) 1 , . . . , x (0) i−1, . . . , x (k−1) i−1 ), [y]i = (y (0) 0 , . . . , y (n−1) 0 , y (0) 1 , . . . , y (n−1) 1 , . . . , y (0) i−1, . . . , y (n−1) i−1 ). The column distance function (CDF) di is the minimum Hamming distance between all pairs of output sequences truncated at length i given that the input sequences differ in the fi...