In this paper we study the problem of determining optimal paths in a dynamic, 2-D environment. We present a novel cell decomposition approach which generates optimal paths based on a number of di erent optimality criteria, including time-optimal, distance-optimal (shortest paths), and costoptimal paths based on a combination of time and distance. After mapping the dynamic, 2-D environment to a ...

A graph G = (V,E) is called a hyper-ring with N nodes (N -HR for short) if V = {0, ..., N − 1} and E = {{u, v}|v − u modulo N is a power of 2}. The following results are shown. We prove that the node-connectivity κ of an N -HR is equal to its degree, say δ, by presenting an algorithm for the explicit construction of δ node-disjoint paths connecting nodes s and t. The length of these paths is bo...

Challenges for precise indoor geolocation cannot be overcome by using the existing RF models for multipath components (MPC). These models were designed for communication applications without specific attention to relation among the physical distance between the transmitter and the receiver and characteristics of MPCs pertinent to indoor geolocation applications. In this paper, we propose a nove...

This paper builds on Hornstein’s (2005) proposal that Merge (Chomsky, 1995) can be split up into the more basic operations Concatenate and Label. This opens up the possibility that Concatenate applies without Label to generate flat structures, an option which Hornstein & Nunes (2005) explore for encoding adjuncts. The central claim is that Label is not needed as a syntactic primitive if a long ...

Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors with which it directly communicates. Many previous algorithms for distributed topology control have assumed an ability at each node to deduce some location-based information such as the direction and the distance of its n...

Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address this is to augment the whole communication path with network awareness by using “bridging” components that are capable of caching, protocol conversion, transcoding, etc. While several such path-based approaches have been...

We consider the communication complexity of Hamming distance two strings. Bille et al. [SPIRE 2018] considered longest common prefix (LCP) problem in setting where parties have their strings a compressed form, i.e., represented by Lempel-Ziv 77 factorization (LZ77) with/without self-references. present randomized public-coin protocol for joint computation LZ77 without Although our scheme is hea...

Indoor positioning systems (IPSs) suffer from a lack of standard evaluation procedures enabling credible comparisons: this is one the main challenges hindering their widespread market adoption. Traditionally, accuracy based on errors defined as Euclidean distance between true positions and estimated positions. While simple, it ignores obstacles floor transitions. In article, we describe that me...