Morton, Marcus, and Frankish (1976) defined "perceptual center," or "P-center," as a neutral term to describe that which is regular in a perceptually regular sequence of speech sounds_ This paper describes a paradigm for the determination of P-center location and the effect of various acoustic parameters on empirically determined P-center locations, It is shown that P-center location is affecte...

Compact Lie groups appear frequently in algebraic topology, but they are relatively rigid analytic objects, and partially for that reason are a challenge to understand homotopically. Since H. Hopf (and H-spaces) topologists have aspired to escape the analytic straitjacket by finding some homotopy theoretic concept which would capture enough of the idea of “compact Lie group” to lead to rich and...

Let G(V, E, W) be a graph with n-vertex-set V and m-edge-set E in which each edge e is associated with a positive distance W(e). The p-Center problem is to locate some kind of facilities at p vertices of G to minimize the maximum distance between any vertex and the nearest facility corresponding to that vertex. This paper proposes an additional practical constraint. We restrict that the p verti...

The k center problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality so that the maximum distance of any node to its nearest center is minimized In this paper we consider a generalization of this problem where given a number p we wish to place k centers so as to minimize the maximum distance of any ...

The p-hub center problem is to locate p hubs and to allocate non-hub nodes to hub nodes such that the maximum travel time (or distance) between any origin–destination pair is minimized. We address the p-hub center allocation problem, a subproblem of the location problem, where hub locations are given. We present complexity results and IP formulations for several versions of the problem. We esta...

Let G(V, E, W) be a graph n vertices and m edges, where each edge e is associated with a positive distance W(e). The traditional p-Center problem is to locate some kind of facilities at p vertices of G to minimize the maximum distance between any vertex and its nearest facility. This paper proposes a practical constraint: the subgraph induced by the p facility vertices must be connected and the...