The unequal area facility layout problem has been studied using several distance metrics in the objective function, most commonly rectilinear distance and Euclidean distance between departmental centroids. This paper modifies the distance metric to consider material travel along the perimeter of the departments to and from input/output locations. This perimeter distance metric is used in the ob...

Causal models are used to predict individuals' probability judgments on the taxicab problem of Tversky and Kahneman (1982). Predictions are based on the hypothesis that judgments take into account only those variables that are judged causally relevant. Two versions of the problem were tested, one with and one without causally-relevant base rates. The results showed that causal models were able ...

It is well known that G. H. Hardy travelled in a taxicab numbered 1729 to an English nursing home to visit his bedridden colleague S. Ramanujan. Hardy was disappointed that his cab had such a mundane number, but to his surprise when he mentioned this to Ramanujan, the brilliant Indian mathematician found 1729 to be quite interesting, for it is the smallest integer that has two distinct represen...

In this paper we prove the optimality of an aggregation procedure. We prove lower bounds for aggregation of model selection type of M density estimators for the Kullback-Leibler divergence (KL), the Hellinger’s distance and the L1-distance. The lower bound, with respect to the KL distance, can be achieved by the on-line type estimate suggested, among others, by Yang (2000a). Combining these res...

To find occurrences of melodic segments, such as themes, phrases and motifs, in musical works, a well-performing similarity measure is needed to support human analysis of large music corpora. We evaluate the performance of a range of melodic similarity measures to find occurrences of phrases in folk song melodies. We compare the similarity measures correlation distance, city-block distance, Euc...

We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified p vertices become the p-maxian with respect to the new edge lengths. This problem is called the inverse p-maxian problem on trees. Gassner proposed efficient combinatorial alogrithm to solve the the inverse 1-maxian problem on trees in 2008. For the problem with p ≥ 2, we claim that the...