Path Queries on Compressed XML

Central to any XML query language is a path language such as XPath which operates on the tree structure of the XML document. We demonstrate in this paper that the tree structure can be e#ectively compressed and manipulated using techniques derived from symbolic model checking . Specifically, we show first that succinct representations of document tree structures based on sharing subtrees are highly e#ective. Second, we show that compressed structures can be queried directly and e#ciently through a process of manipulating selections of nodes and partial decompression

XRound : A reversible template language and its application in model-based security analysis

Successful analysis of the models used in Model-Driven Development requires the ability to synthesise the results of analysis and automatically integrate these results with the models themselves. This paper presents a reversible template language called XRound which supports round-trip transformations between models and the logic used to encode system properties. A template processor that supports the language is described, and the use of the template language is illustrated by its application in an analysis workbench, designed to support analysis of security properties of UML and MOF-based models. As a result of using reversible templates, it is possible to seamlessly and automatically integrate the results of a security analysis with a model. (C) 2008 Elsevier B.V. All rights reserved

Fast Shortest Path Distance Estimation in Large Networks

We study the problem of preprocessing a large graph so that point-to-point shortest-path queries can be answered very fast. Computing shortest paths is a well studied problem, but exact algorithms do not scale to huge graphs encountered on the web, social networks, and other applications. In this paper we focus on approximate methods for distance estimation, in particular using landmark-based distance indexing. This approach involves selecting a subset of nodes as landmarks and computing (offline) the distances from each node in the graph to those landmarks. At runtime, when the distance between a pair of nodes is needed, we can estimate it quickly by combining the precomputed distances of the two nodes to the landmarks. We prove that selecting the optimal set of landmarks is an NP-hard problem, and thus heuristic solutions need to be employed. Given a budget of memory for the index, which translates directly into a budget of landmarks, different landmark selection strategies can yield dramatically different results in terms of accuracy. A number of simple methods that scale well to large graphs are therefore developed and experimentally compared. The simplest methods choose central nodes of the graph, while the more elaborate ones select central nodes that are also far away from one another. The efficiency of the suggested techniques is tested experimentally using five different real world graphs with millions of edges; for a given accuracy, they require as much as 250 times less space than the current approach in the literature which considers selecting landmarks at random. Finally, we study applications of our method in two problems arising naturally in large-scale networks, namely, social search and community detection.Yahoo! Research (internship

Dovetail: Stronger Anonymity in Next-Generation Internet Routing

Current low-latency anonymity systems use complex overlay networks to conceal a user's IP address, introducing significant latency and network efficiency penalties compared to normal Internet usage. Rather than obfuscating network identity through higher level protocols, we propose a more direct solution: a routing protocol that allows communication without exposing network identity, providing a strong foundation for Internet privacy, while allowing identity to be defined in those higher level protocols where it adds value. Given current research initiatives advocating "clean slate" Internet designs, an opportunity exists to design an internetwork layer routing protocol that decouples identity from network location and thereby simplifies the anonymity problem. Recently, Hsiao et al. proposed such a protocol (LAP), but it does not protect the user against a local eavesdropper or an untrusted ISP, which will not be acceptable for many users. Thus, we propose Dovetail, a next-generation Internet routing protocol that provides anonymity against an active attacker located at any single point within the network, including the user's ISP. A major design challenge is to provide this protection without including an application-layer proxy in data transmission. We address this challenge in path construction by using a matchmaker node (an end host) to overlap two path segments at a dovetail node (a router). The dovetail then trims away part of the path so that data transmission bypasses the matchmaker. Additional design features include the choice of many different paths through the network and the joining of path segments without requiring a trusted third party. We develop a systematic mechanism to measure the topological anonymity of our designs, and we demonstrate the privacy and efficiency of our proposal by simulation, using a model of the complete Internet at the AS-level

Functional Skills Support Programme: Developing functional skills in music

This booklet is part of "... a series of 11 booklets which helps schools to implement functional skills across the curriculum. The booklets illustrate how functional skills can be applied and developed in different subjects and contexts, supporting achievement at Key Stage 3 and Key Stage 4. Each booklet contains an introduction to functional skills for subject teachers, three practical planning examples with links to related websites and resources, a process for planning and a list of additional resources to support the teaching and learning of functional skills." - The National Strategies website

Low-Stress Bicycling and Network Connectivity

For a bicycling network to attract the widest possible segment of the population, its most fundamental attribute should be low-stress connectivity, that is, providing routes between people’s origins and destinations that do not require cyclists to use links that exceed their tolerance for traffic stress, and that do not involve an undue level of detour. The objective of this study is to develop measures of low-stress connectivity that can be used to evaluate and guide bicycle network planning. We propose a set of criteria by which road segments can be classified into four levels of traffic stress (LTS). LTS 1 is suitable for children; LTS 2, based on Dutch bikeway design criteria, represents the traffic stress that most adults will tolerate; LTS 3 and 4 represent greater levels of stress. As a case study, every street in San Jose, California, was classified by LTS. Maps in which only bicycle-friendly links are displayed reveal a city divided into islands within which low-stress bicycling is possible, but separated from one another by barriers that can be crossed only by using high-stress links. Two points in the network are said to be connected at a given level of traffic stress if the subnetwork of links that do not exceed the specified level of stress connects them with a path whose length does not exceed a detour criterion (25% longer than the most direct path). For the network as a whole, we demonstrate two measures of connectivity that can be applied for a given level of traffic stress. One is “percent trips connected,” defined as the fraction of trips in the regional trip table that can be made without exceeding a specified level of stress and without excessive detour. This study used the home-to-work trip table, though in principle any trip table, including all trips, could be used. The second is “percent nodes connected,” a cruder measure that does not require a regional trip table, but measures the fraction of nodes in the street network (mostly street intersections) that are connected to each other. Because traffic analysis zones (TAZs) are too coarse a geographic unit for evaluating connectivity by bicycle, we also demonstrate a method of disaggregating the trip table from the TAZ level to census blocks. For any given TAZ, origins in the home-to-work trip table are allocated in proportion to population, while destinations are allocated based on land-use data. In the base case, the fraction of work trips up to six miles long that are connected at LTS 2 is 4.7%, providing a plausible explanation for the city’s low bicycling share. We show that this figure would almost triple if a proposed slate of improvements, totaling 32 miles in length but with strategically placed segments that provide low-stress connectivity across barriers, were implemented