A novel method for extracting linear streets from a street network is proposed where a linear street is defined as a sequence of connected street segments having a shape similar to a straight line segment. Specifically a given street network is modeled as a Conditional Random Field (CRF) where the task of extracting linear streets corresponds to performing learning and inference with respect to...

To interconnect a wireless sensor network (WSN) to the Internet, we propose to use TCP/IP as the standard protocol for all network entities. We present a cross layer designed communication architecture, which contains a MAC protocol, IP, a new protocol called Hopto-Hop Reliability (H2HR) protocol, and the TCP Support for Sensor Nodes (TSS) protocol. The MAC protocol implements the MAC layer of ...

Astronaut photography acquired from the International Space Station presently is only available option for free global high-resolution nighttime light (NTL) imagery. Unfortunately, these data are not georeferenced, meaning they cannot easily be used many remote sensing applications such as change detection or fusion. Georeferencing NTL manually, example, by finding tie points, difficult due to ...

BACKGROUND Globally, female street-based sex workers are vulnerable to gender-based violence. Previous research has shown having a peer social network can reduce sex workers' risks of victimization. However, mechanisms of how social network impacts violence among female street-based sex workers are still far from clear. METHODS Our study was based on data abstracted from a paper-and-pencil su...

Previous studies of the influence of topological qualities of urban street network on the image of the city are based mainly on centrality and connectivity measures taken from graph theory. The paper suggests instead a multi-perspective approach combining graph theory and Q-analysis. Although Q-analysis shares some similarity with graph theory, it enables us to deal with a multidimensional chai...

We prove the following graph coloring result Let G be a connected bipartite planar graph Then one can triangulate G in such a way that the resulting graph is colorable This result implies several new upper bounds for guarding problems including the rst non trivial upper bound for the rectilinear Prison Yard Problem n vertex guards are su cient to watch the interior of a rectilinear polygon with...