Ever wondered if it was a good time to call your spouse, child, or friend? Do you sometimes just want to know if they are on their way to meet you? With Peek you can request the activity state (e.g. walking, in-vehicle, at-rest) and location of a phone when needed. Context is sent back automatically to people on the phone owner's pre-approved Peek contact list. The person being peeked at receives a notification that provides awareness of who peeked at them and when.https://dl.acm.org/ft_gateway.cfm?id=2442024&dwn=1
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this,  introduced systemic computation, a model of interacting systems with natural characteristics. Following this work, here we introduce the first platform implementing such computation, including programming language, compiler and virtual machine. To investigate their use we then provide an implementation of a genetic algorithm applied to the travelling salesman problem and also explore how SC enables self-adaptation with the minimum of additional code.https://dl.acm.org/ft_gateway.cfm?id=1274037&dwn=1
We present what we believe is the first attempt to physically reconstruct the exploratory mechanism of genetic regulatory networks. Feedback plays a crucial role during developmental processes and its mechanisms have recently become much clearer due to evidence from evolutionary developmental biology. We believe that without similar mechanisms of interaction and feedback, digital genomes cannot guide themselves across functional search spaces in a way that fully exploits a domain's resources, particularly in the complex search domains of real-world physics. Our architecture is designed to let evolution utilise feedback as part of its mechanism of exploration.https://dl.acm.org/ft_gateway.cfm?id=1277154&dwn=1
This paper presents a kinetic data structure (KDS) for solutions to the all nearest neighbors problem and the closest pair problem in the plane. For a set P of n moving points where the trajectory of each point is an algebraic function of constant maximum degree s, our kinetic algorithm uses O(n) space and O(n log n) preprocessing time, and processes O(n2β22s+2(n)log n) events with total processing time O(n2β22s+2(n)log2 n), where βs(n) is an extremely slow-growing function. In terms of the KDS performance criteria, our KDS is efficient, responsive (in an amortized sense), and compact.
Our deterministic kinetic algorithm for the all nearest neighbors problem improves by an O(log2 n) factor the previous randomized kinetic algorithm by Agarwal, Kaplan, and Sharir. The improvement is obtained by using a new sparse graph representation, the Pie Delaunay graph, to reduce the problem to one-dimensional range searching, as opposed to using two-dimensional range searching as in the previous work.https://dl.acm.org/ft_gateway.cfm?id=2462378&dwn=1
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, we initiate the idea of quantizing clustering algorithms by using variations on a celebrated quantum algorithm due to Grover. After having introduced this novel approach to unsupervised learning, we illustrate it with a quantized version of three standard algorithms: divisive clustering, k-medians and an algorithm for the construction of a neighbourhood graph. We obtain a significant speedup compared to the classical approach.https://dl.acm.org/ft_gateway.cfm?id=1273497&dwn=1