Polynomial Path Orders: A Maximal Model

This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experimental evidence our approach to the automated runtime complexity analysis is not only feasible, but compared to existing methods incredibly fast. As an application in the context of ICC we provide an order-theoretic characterisation of the polytime computable functions. To be precise, the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*

Subjective evaluation of an emerging theory of low-frequency sound source localization in closed acoustic spaces

An earlier reported theory of low-frequency sound-source localization within closed acoustic spaces proposed that virtual image acuity is strongly dependent on sufficient inter-arrival time between a direct sound and its first reflection. This current study aims to test the theory’s predictions by subjective experiment where participants are required to indicate perceived sound source direction, but without knowledge of loudspeaker location. Test signals of frequencies 40 Hz to 115 Hz take the form of either windowed sine or square waves. Results confirm broad agreement with theoretical expectations and support the conjecture, contrary to common expectation, that low-frequency sound localization within the context of closed acoustic spaces is possible, although strongly dependent on system configuration and size of a listening space

Global Precedence In Visual Search? Not So Fast: Evidence Instead For An Oblique Effect

The evidence from an earlier report of global precedence in visual search is reexamined, Two new experiments are reported. The results of the first experiment indicate that the confusability of oblique orientations (a class-2 oblique effect) rather than global precedence was responsible for the earlier results. The results of the second experiment show that the effect critically depends on the presence of heterogeneous distracters rather than on differences in raw processing speed for different spatial scales. The possible role of symmetry is discussed

Energy Efficient Scheduling of MapReduce Jobs

MapReduce is emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first introduced by Yao et al. [FOCS 1995]. We focus on the minimization of the total weighted completion time of a set of MapReduce jobs under a given budget of energy. Using a linear programming relaxation of our problem, we derive a polynomial time constant-factor approximation algorithm. We also propose a convex programming formulation that we combine with standard list scheduling policies, and we evaluate their performance using simulations.Comment: 22 page