Infrastructure Engineering - Research Publications
Permanent URI for this collection
Search Results
1 - 10 of 11
-
ItemImprecise Navigation(SpringerLink, 2003)Conventional models of navigation commonly assume a navigation agent's location can be precisely determined. This paper examines the more general case, where an agent's actual location cannot be precisely determined. This paper develops a formal model of navigation under imprecision using a graph. Two key strategies for dealing with imprecision are identified and defined: contingency and refinement. A contingency strategy aims to find an instruction sequence that maximizes an agent's chances of reaching its destination. A refinement strategy aims to use knowledge gained as an agent moves through the network to disambiguate location. Examples of both strategies are empirically tested using a simulation with computerized navigation agents moving through a road network at different levels of locational imprecision. The results of the simulation indicate that both the strategies, contingency and refinement, applied individually can produce significant improvements in navigation performance under imprecision, at least at relatively fine granularities. Using both strategies in concert produced significant improvements in performance across all granularities.
-
ItemLocation privacy and location-aware computing(CRC Press, 2006)
-
Item"Simplest" paths: automated route selection for navigation(Springer, 2003)Numerous cognitive studies have indicated that the form andcomplexity of route instructions may be as important to human navigatorsas the overall length of route. Most automated navigation systemsrely on computing the solution to the shortest path problem, and not theproblem of finding the “simplest” path. This paper addresses the issueof finding the “simplest” paths through a network, in terms of the instructioncomplexity. We propose a “simplest” paths algorithm that hasquadratic computation time for a planar graph. An empirical study ofthe algorithm’s performance, based on an established cognitive model ofnavigation instruction complexity, revealed that the length of a simplestpath was on average only 16% longer than the length of the correspondingshortest path. In return for marginally longer routes, the simplest pathalgorithm seems to offer considerable advantages over shortest paths interms of their ease of description and execution. The conclusions indicateseveral areas for future research: in particular cognitive studies areneeded to verify these initial computational results. Potentially, the simplestpaths algorithm could be used to replace shortest paths algorithmsin any automated system for generating human navigation instructions,including in-car navigation systems, Internet driving direction servers,and other location-based services.
-
ItemInformation dissemination in mobile ad-hoc geosensor networks(SPRINGER-VERLAG BERLIN, 2004)
-
ItemA formal model of obfuscation and negotiation for location privacy(Springer, 2005)Obfuscation concerns the practice of deliberately degradingthe quality of information in some way, so as to protect the privacy ofthe individual to whom that information refers. In this paper, we arguethat obfuscation is an important technique for protecting an individual’slocation privacy within a pervasive computing environment. The papersets out a formal framework within which obfuscated location-based servicesare defined. This framework provides a computationally efficientmechanism for balancing an individual’s need for high-quality informationservices against that individual’s need for location privacy. Negotiationis used to ensure that a location-based service provider receivesonly the information it needs to know in order to provide a service ofsatisfactory quality. The results of this work have implications for numerousapplications of mobile and location-aware systems, as they providea new theoretical foundation for addressing the privacy concerns thatare acknowledged to be retarding the widespread acceptance and use oflocation-based services.
-
ItemSimulation of obfuscation and negotiation for location privacy(Springer, 2005)Current mobile computing systems can automatically sense and communicatedetailed data about a person’s location. Location privacy is an urgent researchissue because concerns about privacy are seen to be inhibiting the growthof mobile computing. This paper investigates a new technique for safeguardinglocation privacy, called obfuscation, which protects a person’s location privacy bydegrading the quality of information about that person’s location. Obfuscation isbased on spatial imperfection and offers an orthogonal approach to conventionaltechniques for safeguarding information about a person’s location. Imprecisionand inaccuracy are two types of imperfection that may be used to achieve obfuscation.A set of simulations are used to empirically evaluate different obfuscationstrategies based on imprecision and inaccuracy. The results show that obfuscationcan enable high quality of service in concert with high levels of privacy.
-
ItemA spatiotemporal model of obfuscation strategies and counter strategies for location privacy( 2006)Safeguarding location privacy is becoming a critical issue in location based services and location-aware computing generally. Two drawbacks of many previous models of location privacy are: 1) the models only consider a person’slocation privacy protection, but not the invasion of location privacy by external agents; and 2) the models are static and do not consider the spatiotemporal aspectsof movement. We argue that, to be complete, any model of location privacy needs to enable the analysis and identification of techniques both to protect and toinvade an individual’s location privacy over time. One way to protect an individual’s location privacy is to minimize the information revealed about a person’s location, termed obfuscation. This paper presents an explicitly spatiotemporalmodel of location privacy that models a third party’s limited knowledge of a mobileindividual’s location. We identify two core strategies that a third party canuse to refine its knowledge, so potentially invading that mobile individual’s locationprivacy. A global refinement strategy uses the entire history of knowledgeabout an agent’s location in a single step. A local refinement strategy iterativelyconstructs refined knowledge over time.We present a formal model of global andlocal refinement operators, and show how this formal model can be translatedinto a computational model in a simulation environment.
-
ItemCommonsense notions of proximity and direction(Springer Verlag, 2004)It is desirable that formal theories of qualitative reasoning should be informed by the ways in which humans conceptualize the spaces in which they live. The work described in this paper uses data provided in experiments with human subjects to derive some regularities in such conceptualizations. The data concerns human conceptualization of proximity and direction within a university campus. The results are analyzed using several approaches. In particular, the relationship between geometric and human conceptual models of the space is explored; the structure and regularities of combinations of proximity and direction relations are examined; and the issue of granularity in vague spatial relations is considered. Overall, the results show that while individual differences between humans are important, there are striking regularities in the population’s notions of distance and direction in the space. The paper concentrates primarily on the formal foundations of commonsense notions of proximity and direction, but also identifies links to more applied domains, such as mobile and location-aware navigation systems.
-
ItemOntology-driven map generalization(Elsevier, 2005)Different users of geospatial information have different requirements of that information. Matching information to users' requirements demands an understanding of the ontological aspects of geospatial data. In this paper, we present an ontology-driven map generalization algorithm, called DMin, that can be tailored to particular users and users' tasks. The level of detail in a generated map is automatically adapted by DMin according to the semantics of the features represented. The DMin algorithm is based on a weighting function that has two components: (1) a geometric component that differs from previous approaches to map generalization in that no fixed threshold values are needed to parameterize the generalization process and (2) a semantic component that considers the relevance of map features to the user. The flexibility of DMin is demonstrated using the example of a transportation network.
-
ItemA spatiotemporal model of strategies and counter strategies for location privacy protection(SPRINGER-VERLAG BERLIN, 2006)