Functional Granularity
نویسنده
چکیده
The method presented in this paper aims to reduce the computational costs of some kinds of navigation in a world with obstacles. We give algorithms to capture the logical structure of an object given a polygonal representation of it. Then these algorithms are used in conjunction with the notion of functional granularity to handle navigation of a moving object. 1 Framework The class of problems we are interested in deals with physical interactions among a set of objects. Several works (often labelled \Qualitative Spatial Rea-soning") choose a local approach of the problem: an object is not located with regard to an origin (with a coordinate system for instance). The position of an object is rather determined with its spatial relations to other objects. A set of objects is then described by a list of qualitative relations among them. Providing objects have only limited spatial innuence, local relations are often suucient to a complete description, a good choice of relations thus providing a quite short description. 2 Precision of the representation Depending on the studied relations, the precision of the representation of the objects has to be adapted. For instance, the representation of an object can be as simple as a point (a town in a country located with respect to other cities), or very complex (the same town with regard to a car navigating in the town). Two opposite technics can then be envisaged: The maximal needed precision is predictable. Each object can then be represented at the given precision. It is very eecient if the targeted application only use relations that need little diierent precision level. At the opposite, if two of the used relations need very diierent precisions, the one that needs only simple representation could be limited in its eeciency, handling to complex representations. The previous condition is not possible (or not wanted). The grain of the representation must be adapted for each relation. Such a system could then handle relations with quite diierent level of precision in the representation of objects. We choose to take an interest in the last option, and present in this framework the notion of functional granularity. 3 Matching granularity and functionality of a relation By studying a set of objects and a type of relation on this set, the characteristics of the objects needed to apply the relation can be determined. If we focused on qualitative spatial relations, the following classiication …
منابع مشابه
The Performance Impact of Granularity Control and Functional Parallelism
Task granularity and functional parallelism are fundamental issues in the optimization of parallel programs. Appropriate granularity for exploitation of parallelism is affected by characteristics of both the program and the execution environment. In this paper we demonstrate the efficacy of dynamic granularity control. The scheme we propose uses dynamic runtime information to select the task si...
متن کاملA Systematic Method for Software Architecture Design
This paper presents the Systematic Method for Architecture Design (SyMAD) which extends the Attribute Driven Design (ADD) method by (i) enforcing, at any level of granularity, a separation between application design addressing functional requirements and architecture design addressing non-functional requirements, (ii) making it explicit that non-functional requirements at any particular level o...
متن کاملBiomedical Informatics and Granularity
An explicit formal-ontological representation of entities existing at multiple levels of granularity is an urgent requirement for biomedical information processing. We discuss some fundamental principles which can form a basis for such a representation. We also comment on some of the implicit treatments of granularity in currently available ontologies and terminologies (GO, FMA, SNOMED CT).
متن کاملA Quantitative Measurement and Validation of Granularity in Service Oriented Architecture
The prominent principle of designing service in Service Oriented Architecture is service granularity. The granularity is a crucial design decision. The service should be neither too coarse nor too fine grained. Therefore it should be evaluated at the design phase itself to measure its level of appropriateness. This paper proposes a suite of metrics for measuring service granularity quantitative...
متن کاملOn the Granularity of Divide-and-Conquer Parallelism
This paper studies the runtime behaviour of various parallel divide-and-conquer algorithms written in a non-strict functional language, when three common granularity control mechanisms are used: a simple cut-off, a priority thread creation and a priority scheduling mechanism. These mechanisms use granularity information that is currently provided via annotations to improve the performance of th...
متن کاملSegmentation Granularity in Dependency Representations for Korean
Previous work on Korean language processing has proposed different basic segmentation units. This paper explores different possible dependency representations for Korean using different levels of segmentation granularity — that is, different schemes for morphological segmentation of tokens into syntactic words. We provide a new Universal Dependencies (UD)-like corpus based on different levels o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000