27 Search Results for "J�hne, Bernd"

Document
DOI: 10.4230/LIPIcs.COSIT.2019.24
Dyadic Route Planning and Navigation in Collaborative Wayfinding

Authors: Crystal J. Bae and Daniel R. Montello

Published in: LIPIcs, Volume 142, 14th International Conference on Spatial Information Theory (COSIT 2019)

Abstract
The great majority of work in spatial cognition has taken an individual approach to the study of wayfinding, isolating the planning and decision-making process of a single navigating entity. The study we present here expands our understanding of human navigation as it unfolds in a social context, common to real-world scenarios. We investigate pedestrian navigation by pairs of people (dyads) in an unfamiliar, real-world environment. Participants collaborated on a task to plan and enact a route between a given origin and destination. Each dyad had to devise and agree upon a route to take using a paper map of the environment, and was then taken to the environment and asked to navigate to the destination from memory alone. We video-recorded and tracked the dyad as they interacted during both planning and navigation. Our results examine explanations for successful route planning and sources of uncertainty in navigation. This includes differences between situated and prospective planning - participants often modify their route-following on the fly based on unexpected challenges. We also investigate strategies of social role-taking (leading and following) within dyads.
Cite as

Crystal J. Bae and Daniel R. Montello. Dyadic Route Planning and Navigation in Collaborative Wayfinding. In 14th International Conference on Spatial Information Theory (COSIT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 142, pp. 24:1-24:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{bae_et_al:LIPIcs.COSIT.2019.24,
  author =	{Bae, Crystal J. and Montello, Daniel R.},
  title =	{{Dyadic Route Planning and Navigation in Collaborative Wayfinding}},
  booktitle =	{14th International Conference on Spatial Information Theory (COSIT 2019)},
  pages =	{24:1--24:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-115-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{142},
  editor =	{Timpf, Sabine and Schlieder, Christoph and Kattenbeck, Markus and Ludwig, Bernd and Stewart, Kathleen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2019.24},
  URN =		{urn:nbn:de:0030-drops-111168},
  doi =		{10.4230/LIPIcs.COSIT.2019.24},
  annote =	{Keywords: Wayfinding, Navigation, Collaboration, Leadership, Conversation Analysis}
}
Document
DOI: 10.4230/DagRep.7.10.84
Performance Portability in Extreme Scale Computing (Dagstuhl Seminar 17431)

Authors: Anshu Dubey, Paul H. J. Kelly, Bernd Mohr, and Jeffrey S. Vetter

Published in: Dagstuhl Reports, Volume 7, Issue 10 (2018)

Abstract
This Dagstuhl Seminar represented a unique opportunity to bring together international experts from the three research communities essential to tackling the HPC performance portability challenge: developers of large-scale computational science software projects, researchers developing parallel programming technologies, and performance specialists. The major research questions for the seminar were to understand challenges, design metrics, and prioritize potential solutions for performance portability, management of data movement in complex applications, composability, and pathways to impact on the research community. The overall conclusion shared by all participants was that performance portability in extreme scale computing can be achieved, especially if parallel applications are designed with performance portability in mind from the beginning. Making legacy application performance portable still requires enormous efforts and expertise. In many instances it will likely require extensive refactoring.
Cite as

Anshu Dubey, Paul H. J. Kelly, Bernd Mohr, and Jeffrey S. Vetter. Performance Portability in Extreme Scale Computing (Dagstuhl Seminar 17431). In Dagstuhl Reports, Volume 7, Issue 10, pp. 84-110, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@Article{dubey_et_al:DagRep.7.10.84,
  author =	{Dubey, Anshu and Kelly, Paul H. J. and Mohr, Bernd and Vetter, Jeffrey S.},
  title =	{{Performance Portability in Extreme Scale Computing (Dagstuhl Seminar 17431)}},
  pages =	{84--110},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{7},
  number =	{10},
  editor =	{Dubey, Anshu and Kelly, Paul H. J. and Mohr, Bernd and Vetter, Jeffrey S.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.7.10.84},
  URN =		{urn:nbn:de:0030-drops-86642},
  doi =		{10.4230/DagRep.7.10.84},
  annote =	{Keywords: Parallel programming, performance portability, productivity, scientific computing}
}
Document
DOI: 10.4230/LIPIcs.SOCG.2015.315
Combinatorial Redundancy Detection

Authors: Komei Fukuda, Bernd Gärtner, and May Szedlák

Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)

Abstract
The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs) in dictionary form, given by n equality constraints in n+d variables, where the variables are constrained to be nonnegative. A variable x_r is called redundant, if after removing its nonnegativity constraint the LP still has the same feasible region. The time needed to solve such an LP is denoted by LP(n,d). It is easy to see that solving n+d LPs of the above size is sufficient to detect all redundancies. The currently fastest practical method is the one by Clarkson: it solves n+d linear programs, but each of them has at most s variables, where s is the number of nonredundant constraints. In the first part we show that knowing all of the finitely many dictionaries of the LP is sufficient for the purpose of redundancy detection. A dictionary is a matrix that can be thought of as an enriched encoding of a vertex in the LP. Moreover - and this is the combinatorial aspect - it is enough to know only the signs of the entries, the actual values do not matter. Concretely we show that for any variable x_r one can find a dictionary, such that its sign pattern is either a redundancy or nonredundancy certificate for x_r. In the second part we show that considering only the sign patterns of the dictionary, there is an output sensitive algorithm of running time of order d (n+d) s^{d-1} LP(s,d) + d s^{d} LP(n,d) to detect all redundancies. In the case where all constraints are in general position, the running time is of order s LP(n,d) + (n+d) LP(s,d), which is essentially the running time of the Clarkson method. Our algorithm extends naturally to a more general setting of arrangements of oriented topological hyperplane arrangements.
Cite as

Komei Fukuda, Bernd Gärtner, and May Szedlák. Combinatorial Redundancy Detection. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 315-328, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@InProceedings{fukuda_et_al:LIPIcs.SOCG.2015.315,
  author =	{Fukuda, Komei and G\"{a}rtner, Bernd and Szedl\'{a}k, May},
  title =	{{Combinatorial Redundancy Detection}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{315--328},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.315},
  URN =		{urn:nbn:de:0030-drops-51434},
  doi =		{10.4230/LIPIcs.SOCG.2015.315},
  annote =	{Keywords: system of linear inequalities, redundancy removal, linear programming, output sensitive algorithm, Clarkson’s method}
}
Document
DOI: 10.4230/DagRep.2.10.79
Time-of-Flight Imaging: Algorithms, Sensors and Applications (Dagstuhl Seminar 12431)

Authors: James Davis, Bernd Jähne, Andreas Kolb, Ramesh Raskar, and Christian Theobalt

Published in: Dagstuhl Reports, Volume 2, Issue 10 (2013)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12431 "Time-of-Flight Imaging: Algorithms, Sensors and Applications". The seminar brought together researchers with diverse background from both academia and industry to discuss various aspects of Time-of-Flight imaging and general depth sensors. The executive summary and abstracts of the talks given during the seminar as well as the outcome of several working groups on specific research topics are presented in this report.
Cite as

James Davis, Bernd Jähne, Andreas Kolb, Ramesh Raskar, and Christian Theobalt. Time-of-Flight Imaging: Algorithms, Sensors and Applications (Dagstuhl Seminar 12431). In Dagstuhl Reports, Volume 2, Issue 10, pp. 79-104, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Article{davis_et_al:DagRep.2.10.79,
  author =	{Davis, James and J\"{a}hne, Bernd and Kolb, Andreas and Raskar, Ramesh and Theobalt, Christian},
  title =	{{Time-of-Flight Imaging: Algorithms, Sensors and Applications (Dagstuhl Seminar 12431)}},
  pages =	{79--104},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{2},
  number =	{10},
  editor =	{Davis, James and J\"{a}hne, Bernd and Kolb, Andreas and Raskar, Ramesh and Theobalt, Christian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.10.79},
  URN =		{urn:nbn:de:0030-drops-39044},
  doi =		{10.4230/DagRep.2.10.79},
  annote =	{Keywords: Time-of-Flight, Kinect^TM, depth sensor}
}
Document
DOI: 10.4230/OASIcs.VLUDS.2011.59
CFD Simulation of Liquid-Liquid Extraction Columns and Visualization of Eulerian Datasets

Authors: Mark W. Hlawitschka, Fang Chen, Hans-Jörg Bart, and Bernd Hamann

Published in: OASIcs, Volume 27, Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011

Abstract
In this joint work, a complete framework for modeling, simulating and visualizing multiphase fluid flow within an extraction column is presented. We first present a volume-of-fluid simulation, which is able to predict the surface of the droplets during coalescence. However, a fast and efficient model is needed for the simulation of a liquid-liquid extraction column due to the high number of occurring droplets. To simulate the velocity and droplet size in a DN32 extraction column, a coupled computational fluid dynamic-population balance model solver is used. The simulation is analyzed using path-line based visualization techniques. A novel semi-automatic re-seeding technique for droplet path-line integration is proposed. With our technique, path-lines of fluid droplets can be re-initialized after contact with the stirring devices. The droplet breakage is captured, allowing the engineer to improve the design of liquid-liquid columns layout.
Cite as

Mark W. Hlawitschka, Fang Chen, Hans-Jörg Bart, and Bernd Hamann. CFD Simulation of Liquid-Liquid Extraction Columns and Visualization of Eulerian Datasets. In Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011. Open Access Series in Informatics (OASIcs), Volume 27, pp. 59-70, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{hlawitschka_et_al:OASIcs.VLUDS.2011.59,
  author =	{Hlawitschka, Mark W. and Chen, Fang and Bart, Hans-J\"{o}rg and Hamann, Bernd},
  title =	{{CFD Simulation of Liquid-Liquid Extraction Columns and Visualization of Eulerian Datasets}},
  booktitle =	{Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011},
  pages =	{59--70},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-46-0},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{27},
  editor =	{Garth, Christoph and Middel, Ariane and Hagen, Hans},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.VLUDS.2011.59},
  URN =		{urn:nbn:de:0030-drops-37410},
  doi =		{10.4230/OASIcs.VLUDS.2011.59},
  annote =	{Keywords: computational fluid dynamics, multiphase fluid, droplet collision, Eule- rian, path-line}
}
Document
DOI: 10.4230/DagSemProc.10051.3
Spotlight Abstraction of Agents and Areas

Authors: Tobe Toben, Bernd Westphal, and Jan-Hendrik Rakow

Published in: Dagstuhl Seminar Proceedings, Volume 10051, Quantitative and Qualitative Analysis of Network Protocols (2010)

Abstract
We present "spotlight abstraction" as a generic abstraction technique for the analysis of systems comprising an unbounded number of communicating agents. The abstraction principle is heterogeneous in the sense that the behaviour of a finite number of agents is preserved while the others are only abstractly represented. The precision of the abstraction can be tuned by an iterative procedure based on the analysis of counterexamples. Going beyond existing work, we show how to use the spotlight principle for analysing systems where the physical position of agents is relevant. To this end, we put the spotlight on areas rather than on fixed sets of agents.
Cite as

Tobe Toben, Bernd Westphal, and Jan-Hendrik Rakow. Spotlight Abstraction of Agents and Areas. In Quantitative and Qualitative Analysis of Network Protocols. Dagstuhl Seminar Proceedings, Volume 10051, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{toben_et_al:DagSemProc.10051.3,
  author =	{Toben, Tobe and Westphal, Bernd and Rakow, Jan-Hendrik},
  title =	{{Spotlight Abstraction of Agents and Areas}},
  booktitle =	{Quantitative and Qualitative Analysis of Network Protocols},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10051},
  editor =	{Bengt Jonsson and J\"{o}rg Kreiker and Marta Kwiatkowska},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10051.3},
  URN =		{urn:nbn:de:0030-drops-25173},
  doi =		{10.4230/DagSemProc.10051.3},
  annote =	{Keywords: Spotlight Abstraction, Verification, Dynamic Communication Systems}
}
Document
DOI: 10.4230/DagSemProc.07212.1
07212 Abstracts Collection – Constraint Databases, Geometric Elimination ang Geographic Information Systems

Authors: Bernd Bank, Max J. Egenhofer, and Bart Kuijpers

Published in: Dagstuhl Seminar Proceedings, Volume 7212, Constraint Databases, Geometric Elimination and Geographic Information Systems (2007)

Abstract
From 20.05. to 25.05., the Dagstuhl Seminar 07212 ``Constraint Databases, Geometric Elimination and Geographic Information Systems'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Bernd Bank, Max J. Egenhofer, and Bart Kuijpers. 07212 Abstracts Collection – Constraint Databases, Geometric Elimination ang Geographic Information Systems. In Constraint Databases, Geometric Elimination and Geographic Information Systems. Dagstuhl Seminar Proceedings, Volume 7212, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{bank_et_al:DagSemProc.07212.1,
  author =	{Bank, Bernd and Egenhofer, Max J. and Kuijpers, Bart},
  title =	{{07212 Abstracts Collection – Constraint Databases, Geometric Elimination ang Geographic Information Systems}},
  booktitle =	{Constraint Databases, Geometric Elimination and Geographic Information Systems},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7212},
  editor =	{Bernd Bank and Max J. Egenhofer and Bart Kuijpers},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07212.1},
  URN =		{urn:nbn:de:0030-drops-12870},
  doi =		{10.4230/DagSemProc.07212.1},
  annote =	{Keywords: Constraint databases, geometric elimination, quantier elimination algorithms, geographic information systems}
}
Document
DOI: 10.4230/DagSemProc.07212.2
07212 Manifesto – Constraint Databases, Geometric Elimination ang Geographic Information Systems

Authors: Bernd Bank, Max J. Egenhofer, Joos Heintz, Bart Kuijpers, and Peter Revesz

Published in: Dagstuhl Seminar Proceedings, Volume 7212, Constraint Databases, Geometric Elimination and Geographic Information Systems (2007)

Abstract
During the last two decades the topic of constraint databases has evolved into a mature area of computer science with sound mathematical foundations and with a profound theoretical understanding of the expressive power of a variety of query languages. Constraint databases are especially suited for applications in which possibly infinite sets of continuous data, that have a geometric interpretation, need to be stored in a computer. Today, the most important application domains of constraint databases are geographic information systems (GIS), spatial databases and spatio-temporal databases. In these applications infinite geometrical sets of continuous data are finitely represented by means of finite combinations of polynomial equality and inequality constraints that describe these data sets (in mathematical terms these geometrical data sets are known as semi-algebraic sets and they have been extensively studied in real algebraic geometry). On the other hand, constraint databases provide us with a new view on classic (linear and nonlinear) optimization theory.
Cite as

Bernd Bank, Max J. Egenhofer, Joos Heintz, Bart Kuijpers, and Peter Revesz. 07212 Manifesto – Constraint Databases, Geometric Elimination ang Geographic Information Systems. In Constraint Databases, Geometric Elimination and Geographic Information Systems. Dagstuhl Seminar Proceedings, Volume 7212, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{bank_et_al:DagSemProc.07212.2,
  author =	{Bank, Bernd and Egenhofer, Max J. and Heintz, Joos and Kuijpers, Bart and Revesz, Peter},
  title =	{{07212 Manifesto – Constraint Databases, Geometric Elimination ang Geographic Information Systems}},
  booktitle =	{Constraint Databases, Geometric Elimination and Geographic Information Systems},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7212},
  editor =	{Bernd Bank and Max J. Egenhofer and Bart Kuijpers},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07212.2},
  URN =		{urn:nbn:de:0030-drops-12824},
  doi =		{10.4230/DagSemProc.07212.2},
  annote =	{Keywords: Constraint databases, elimination procedures, geographical information systems}
}
Document
DOI: 10.4230/DagSemProc.07212.3
A lower bound for the complexity of linear optimization from a quantifier-elimination point of view

Authors: Rafael Grimson

Published in: Dagstuhl Seminar Proceedings, Volume 7212, Constraint Databases, Geometric Elimination and Geographic Information Systems (2007)

Abstract
We discuss the impact of data structures in quantifier elimination. We analyze the arithmetic complexity of the feasibility problem in linear optimization theory as a quantifier-elimination problem. For the case of polyhedra defined by $2n$ halfspaces in $mathbb{R}^n$ we prove that, if dense representation is used to code polynomials, any quantifier-free formula expressing the set of parameters describing nonempty polyhedra has size $Omega(4^{n})$.
Cite as

Rafael Grimson. A lower bound for the complexity of linear optimization from a quantifier-elimination point of view. In Constraint Databases, Geometric Elimination and Geographic Information Systems. Dagstuhl Seminar Proceedings, Volume 7212, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{grimson:DagSemProc.07212.3,
  author =	{Grimson, Rafael},
  title =	{{A lower bound for the complexity of linear optimization from a quantifier-elimination point of view}},
  booktitle =	{Constraint Databases, Geometric Elimination and Geographic Information Systems},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7212},
  editor =	{Bernd Bank and Max J. Egenhofer and Bart Kuijpers},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07212.3},
  URN =		{urn:nbn:de:0030-drops-12837},
  doi =		{10.4230/DagSemProc.07212.3},
  annote =	{Keywords: Quantifier elimination, dense representation, instrinsic, lower bound}
}
Document
DOI: 10.4230/DagSemProc.07212.4
An analytic solution to the alibi query in the bead model for moving object data

Authors: Bart Kuijpers and Walied Othman

Published in: Dagstuhl Seminar Proceedings, Volume 7212, Constraint Databases, Geometric Elimination and Geographic Information Systems (2007)

Abstract
Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample points are known, beads can be used to model the uncertainty about the object's location in between sample points. In this setting, a query of particular interest, that has been studied in the literature of geographic information systems (GIS), is the alibi query. This boolean query asks whether two moving objects can have physically met. This adds up to deciding whether the necklaces of beads of these objects intersect. This problem can be reduced to deciding whether two beads intersect. Since, existing software to solve this problem fails to answer this question within a reasonable time, we propose an analytical solution to the alibi query, which can be used to answer the alibi query in constant time, a matter of milliseconds or less, for two single beads and in time proportional to the product of their lengths for necklaces of beads.
Cite as

Bart Kuijpers and Walied Othman. An analytic solution to the alibi query in the bead model for moving object data. In Constraint Databases, Geometric Elimination and Geographic Information Systems. Dagstuhl Seminar Proceedings, Volume 7212, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{kuijpers_et_al:DagSemProc.07212.4,
  author =	{Kuijpers, Bart and Othman, Walied},
  title =	{{An analytic solution to the alibi query in the bead model for moving object data}},
  booktitle =	{Constraint Databases, Geometric Elimination and Geographic Information Systems},
  pages =	{1--22},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7212},
  editor =	{Bernd Bank and Max J. Egenhofer and Bart Kuijpers},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07212.4},
  URN =		{urn:nbn:de:0030-drops-12864},
  doi =		{10.4230/DagSemProc.07212.4},
  annote =	{Keywords: Beads, uncertainty, alibi, query, solution, quantifier elimination, constraint database}
}
Document
DOI: 10.4230/DagSemProc.07212.5
Checking the Integrity of Spatial Integrity Constraints

Authors: Stephan Mäs

Published in: Dagstuhl Seminar Proceedings, Volume 7212, Constraint Databases, Geometric Elimination and Geographic Information Systems (2007)

Abstract
Integrity constraints play a major role when the quality of spatial data is checked by automatic procedures. Nevertheless the possibilities of checking the internal consistency of the integrity constraints themselves are hardly researched jet. This work analyses the applicability of reasoning techniques like the composition of spatial relations and constraint satisfaction in networks of constraints to find conflicts and redundancies in sets of spatial semantic integrity constraints. These integrity rules specify relations among entity classes. Such relations must hold to assure that the data is fitting to the semantics intended by the data model. For spatial data many semantic integrity constraints are based on spatial properties described for example through qualitative topological or metric relations. Since integrity constraints are defined at the class level, the reasoning properties of these spatial relations can not directly be applied. Therefore a set of class relations has been defined which, combined with the instance relations, enables for the specification of integrity constraints and to reason about them.
Cite as

Stephan Mäs. Checking the Integrity of Spatial Integrity Constraints. In Constraint Databases, Geometric Elimination and Geographic Information Systems. Dagstuhl Seminar Proceedings, Volume 7212, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{mas:DagSemProc.07212.5,
  author =	{M\"{a}s, Stephan},
  title =	{{Checking the Integrity of Spatial Integrity Constraints}},
  booktitle =	{Constraint Databases, Geometric Elimination and Geographic Information Systems},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7212},
  editor =	{Bernd Bank and Max J. Egenhofer and Bart Kuijpers},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07212.5},
  URN =		{urn:nbn:de:0030-drops-12859},
  doi =		{10.4230/DagSemProc.07212.5},
  annote =	{Keywords: Semantic Integrity Constraints, Spatial Relations, Class Level Relations, Reasoning, Consistency of Constraints, Constraint Networks}
}
Document
DOI: 10.4230/DagSemProc.07212.6
Constraint Databases and Geographic Information Systems

Authors: Peter Revesz

Published in: Dagstuhl Seminar Proceedings, Volume 7212, Constraint Databases, Geometric Elimination and Geographic Information Systems (2007)

Abstract
Constraint databases and geographic information systems share many applications. However, constraint databases can go beyond geographic information systems in efficient spatial and spatiotemporal data handling methods and in advanced applications. This survey mainly describes ways that constraint databases go beyond geographic information systems. However, the survey points out that in some areas constraint databases can learn also from geographic information systems.
Cite as

Peter Revesz. Constraint Databases and Geographic Information Systems. In Constraint Databases, Geometric Elimination and Geographic Information Systems. Dagstuhl Seminar Proceedings, Volume 7212, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{revesz:DagSemProc.07212.6,
  author =	{Revesz, Peter},
  title =	{{Constraint Databases and Geographic Information Systems}},
  booktitle =	{Constraint Databases, Geometric Elimination and Geographic Information Systems},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7212},
  editor =	{Bernd Bank and Max J. Egenhofer and Bart Kuijpers},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07212.6},
  URN =		{urn:nbn:de:0030-drops-12810},
  doi =		{10.4230/DagSemProc.07212.6},
  annote =	{Keywords: Constraint databases, geographic information systems, moving objects, spatiotemporal data, visualization}
}
Document
DOI: 10.4230/DagSemProc.05402.1
Dagstuhl-Manifest zur Strategischen Bedeutung des Software Engineering in Deutschland

Authors: Manfred Broy, Matthias Jarke, Manfred Nagl, Hans Dieter Rombach, Armin B. Cremers, Jürgen Ebert, Sabine Glesner, Martin Glinz, Michael Goedicke, Gerhard Goos, Volker Gruhn, Wilhelm Hasselbring, Stefan Jähnichen, Stefan Kowalewski, Bernd J. Krämer, Stefan Leue, Claus Lewerentz, Peter Liggesmeyer, Christoph Lüth, Barbara Paech, Helmut A. Partsch, Ilka Philippow, Lutz Prechelt, Andreas Rausch, Willem-Paul de Roever, Bernhard Rumpe, Gudula Rünger, Wilhelm Schäfer, Kurt Schneider, Andy Schürr, Walter F. Tichy, Bernhard Westfechtel, Wolf Zimmermann, and Albert Zündorf

Published in: Dagstuhl Seminar Proceedings, Volume 5402, Perspectives Workshop (2006)

Abstract
Im Rahmen des Dagstuhl Perspektiven Workshop 05402 "Challenges for Software Engineering Research" haben führende Software Engineering Professoren den derzeitigen Stand der Softwaretechnik in Deutschland charakterisiert und Handlungsempfehlungen für Wirtschaft, Forschung und Politik abgeleitet. Das Manifest fasst die diese Empfehlungen und die Bedeutung und Entwicklung des Fachgebiets prägnant zusammen.
Cite as

Manfred Broy, Matthias Jarke, Manfred Nagl, Hans Dieter Rombach, Armin B. Cremers, Jürgen Ebert, Sabine Glesner, Martin Glinz, Michael Goedicke, Gerhard Goos, Volker Gruhn, Wilhelm Hasselbring, Stefan Jähnichen, Stefan Kowalewski, Bernd J. Krämer, Stefan Leue, Claus Lewerentz, Peter Liggesmeyer, Christoph Lüth, Barbara Paech, Helmut A. Partsch, Ilka Philippow, Lutz Prechelt, Andreas Rausch, Willem-Paul de Roever, Bernhard Rumpe, Gudula Rünger, Wilhelm Schäfer, Kurt Schneider, Andy Schürr, Walter F. Tichy, Bernhard Westfechtel, Wolf Zimmermann, and Albert Zündorf. Dagstuhl-Manifest zur Strategischen Bedeutung des Software Engineering in Deutschland. In Perspectives Workshop. Dagstuhl Seminar Proceedings, Volume 5402, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{broy_et_al:DagSemProc.05402.1,
  author =	{Broy, Manfred and Jarke, Matthias and Nagl, Manfred and Rombach, Hans Dieter and Cremers, Armin B. and Ebert, J\"{u}rgen and Glesner, Sabine and Glinz, Martin and Goedicke, Michael and Goos, Gerhard and Gruhn, Volker and Hasselbring, Wilhelm and J\"{a}hnichen, Stefan and Kowalewski, Stefan and Kr\"{a}mer, Bernd J. and Leue, Stefan and Lewerentz, Claus and Liggesmeyer, Peter and L\"{u}th, Christoph and Paech, Barbara and Partsch, Helmut A. and Philippow, Ilka and Prechelt, Lutz and Rausch, Andreas and de Roever, Willem-Paul and Rumpe, Bernhard and R\"{u}nger, Gudula and Sch\"{a}fer, Wilhelm and Schneider, Kurt and Sch\"{u}rr, Andy and Tichy, Walter F. and Westfechtel, Bernhard and Zimmermann, Wolf and Z\"{u}ndorf, Albert},
  title =	{{Dagstuhl-Manifest zur Strategischen Bedeutung des Software Engineering in Deutschland}},
  booktitle =	{Perspectives Workshop},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5402},
  editor =	{Manfred Broy and Manfred Nagl and Hans Dieter Rombach and Matthias Jarke},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05402.1},
  URN =		{urn:nbn:de:0030-drops-5853},
  doi =		{10.4230/DagSemProc.05402.1},
  annote =	{Keywords: Software Engineering, Software Technik, Strategie}
}
Document
DOI: 10.4230/DagSemProc.05462.1
05462 Abstracts Collection – Service Oriented Computing (SOC)

Authors: Bernd J. Krämer, Michael P. Papazoglou, and Francisco Cubera

Published in: Dagstuhl Seminar Proceedings, Volume 5462, Service Oriented Computing (SOC) (2006)

Abstract
From 15.11.05 to 18.11.05, the Dagstuhl Seminar 05462 ``Service Oriented Computing (SOC)'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Bernd J. Krämer, Michael P. Papazoglou, and Francisco Cubera. 05462 Abstracts Collection – Service Oriented Computing (SOC). In Service Oriented Computing (SOC). Dagstuhl Seminar Proceedings, Volume 5462, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{kramer_et_al:DagSemProc.05462.1,
  author =	{Kr\"{a}mer, Bernd J. and Papazoglou, Michael P. and Cubera, Francisco},
  title =	{{05462 Abstracts Collection – Service Oriented Computing (SOC)}},
  booktitle =	{Service Oriented Computing (SOC)},
  pages =	{1--18},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5462},
  editor =	{Francisco Cubera and Bernd J. Kr\"{a}mer and Michael P. Papazoglou},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05462.1},
  URN =		{urn:nbn:de:0030-drops-5795},
  doi =		{10.4230/DagSemProc.05462.1},
  annote =	{Keywords: Service-oriented computing, service development life cycle, service composition, service quality, service management, service-oriented architecture, SOA}
}
Document
DOI: 10.4230/DagSemProc.05462.2
05462 Report from the Composition Group

Authors: Vincenzo D'Andrea and Bouallem Benatallah

Published in: Dagstuhl Seminar Proceedings, Volume 5462, Service Oriented Computing (SOC) (2006)

Abstract
This report summarizes the activities of the working group in charge of discussing issues related to Service Composition. The group worked for two consecutive afternoons.
Cite as

Vincenzo D'Andrea and Bouallem Benatallah. 05462 Report from the Composition Group. In Service Oriented Computing (SOC). Dagstuhl Seminar Proceedings, Volume 5462, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{dandrea_et_al:DagSemProc.05462.2,
  author =	{D'Andrea, Vincenzo and Benatallah, Bouallem},
  title =	{{05462 Report from the Composition Group}},
  booktitle =	{Service Oriented Computing (SOC)},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5462},
  editor =	{Francisco Cubera and Bernd J. Kr\"{a}mer and Michael P. Papazoglou},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05462.2},
  URN =		{urn:nbn:de:0030-drops-5202},
  doi =		{10.4230/DagSemProc.05462.2},
  annote =	{Keywords: Service Composition}
}
  • Refine by Author
  • 4 Krämer, Bernd J.
  • 3 Kuijpers, Bart
  • 2 Bank, Bernd
  • 2 Dustdar, Schahram
  • 2 Egenhofer, Max J.
  • Show More...

  • Refine by Classification
  • 1 Applied computing → Psychology
  • 1 Applied computing → Sociology
  • 1 General and reference → Empirical studies

  • Refine by Keyword
  • 3 Constraint databases
  • 2 Service-oriented computing
  • 2 geographic information systems
  • 2 service composition
  • 2 service management
  • Show More...

  • Refine by Type
  • 27 document

  • Refine by Publication Year
  • 12 2006
  • 6 2007
  • 1 1995
  • 1 1998
  • 1 2005
  • Show More...

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact