16 Search Results for "Frank, Michael"

Document
DOI: 10.4230/LIPIcs.SoCG.2021.5
Chasing Puppies: Mobile Beacon Routing on Closed Curves

Authors: Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi Vermeulen, and Giovanni Viglietta

Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)

Abstract
We solve an open problem posed by Michael Biro at CCCG 2013 that was inspired by his and others’ work on beacon-based routing. Consider a human and a puppy on a simple closed curve in the plane. The human can walk along the curve at bounded speed and change direction as desired. The puppy runs with unbounded speed along the curve as long as the Euclidean straight-line distance to the human is decreasing, so that it is always at a point on the curve where the distance is locally minimal. Assuming that the curve is smooth (with some mild genericity constraints) or a simple polygon, we prove that the human can always catch the puppy in finite time.
Cite as

Mikkel Abrahamsen, Jeff Erickson, Irina Kostitsyna, Maarten Löffler, Tillmann Miltzow, Jérôme Urhausen, Jordi Vermeulen, and Giovanni Viglietta. Chasing Puppies: Mobile Beacon Routing on Closed Curves. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2021.5,
  author =	{Abrahamsen, Mikkel and Erickson, Jeff and Kostitsyna, Irina and L\"{o}ffler, Maarten and Miltzow, Tillmann and Urhausen, J\'{e}r\^{o}me and Vermeulen, Jordi and Viglietta, Giovanni},
  title =	{{Chasing Puppies: Mobile Beacon Routing on Closed Curves}},
  booktitle =	{37th International Symposium on Computational Geometry (SoCG 2021)},
  pages =	{5:1--5:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-184-9},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{189},
  editor =	{Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.5},
  URN =		{urn:nbn:de:0030-drops-138046},
  doi =		{10.4230/LIPIcs.SoCG.2021.5},
  annote =	{Keywords: Beacon routing, navigation, generic smooth curves, puppies}
}
Document
DOI: 10.4230/LIPIcs.AofA.2020.20
Greedy Maximal Independent Sets via Local Limits

Authors: Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, and Clara Shikhelman

Published in: LIPIcs, Volume 159, 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)

Abstract
The random greedy algorithm for finding a maximal independent set in a graph has been studied extensively in various settings in combinatorics, probability, computer science - and even in chemistry. The algorithm builds a maximal independent set by inspecting the vertices of the graph one at a time according to a random order, adding the current vertex to the independent set if it is not connected to any previously added vertex by an edge. In this paper we present a natural and general framework for calculating the asymptotics of the proportion of the yielded independent set for sequences of (possibly random) graphs, involving a useful notion of local convergence. We use this framework both to give short and simple proofs for results on previously studied families of graphs, such as paths and binomial random graphs, and to study new ones, such as random trees. We conclude our work by analysing the random greedy algorithm more closely when the base graph is a tree. We show that in expectation, the cardinality of a random greedy independent set in the path is no larger than that in any other tree of the same order.
Cite as

Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, and Clara Shikhelman. Greedy Maximal Independent Sets via Local Limits. In 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 159, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{krivelevich_et_al:LIPIcs.AofA.2020.20,
  author =	{Krivelevich, Michael and M\'{e}sz\'{a}ros, Tam\'{a}s and Michaeli, Peleg and Shikhelman, Clara},
  title =	{{Greedy Maximal Independent Sets via Local Limits}},
  booktitle =	{31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
  pages =	{20:1--20:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-147-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{159},
  editor =	{Drmota, Michael and Heuberger, Clemens},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.20},
  URN =		{urn:nbn:de:0030-drops-120507},
  doi =		{10.4230/LIPIcs.AofA.2020.20},
  annote =	{Keywords: Greedy maximal independent set, random graph, local limit}
}
Document
DOI: 10.4230/LIPIcs.ICDT.2020.13
Distribution Constraints: The Chase for Distributed Data

Authors: Gaetano Geck, Frank Neven, and Thomas Schwentick

Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)

Abstract
This paper introduces a declarative framework to specify and reason about distributions of data over computing nodes in a distributed setting. More specifically, it proposes distribution constraints which are tuple and equality generating dependencies (tgds and egds) extended with node variables ranging over computing nodes. In particular, they can express co-partitioning constraints and constraints about range-based data distributions by using comparison atoms. The main technical contribution is the study of the implication problem of distribution constraints. While implication is undecidable in general, relevant fragments of so-called data-full constraints are exhibited for which the corresponding implication problems are complete for EXPTIME, PSPACE and NP. These results yield bounds on deciding parallel-correctness for conjunctive queries in the presence of distribution constraints.
Cite as

Gaetano Geck, Frank Neven, and Thomas Schwentick. Distribution Constraints: The Chase for Distributed Data. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 13:1-13:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{geck_et_al:LIPIcs.ICDT.2020.13,
  author =	{Geck, Gaetano and Neven, Frank and Schwentick, Thomas},
  title =	{{Distribution Constraints: The Chase for Distributed Data}},
  booktitle =	{23rd International Conference on Database Theory (ICDT 2020)},
  pages =	{13:1--13:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-139-9},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{155},
  editor =	{Lutz, Carsten and Jung, Jean Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.13},
  URN =		{urn:nbn:de:0030-drops-119378},
  doi =		{10.4230/LIPIcs.ICDT.2020.13},
  annote =	{Keywords: tuple-generating dependencies, chase, conjunctive queries, distributed evaluation}
}
Document
DOI: 10.4230/OASIcs.CERTS.2019.1
Combined Security and Schedulability Analysis for MILS Real-Time Critical Architectures

Authors: Ill-ham Atchadam, Frank Singhoff, Hai Nam Tran, Noura Bouzid, and Laurent Lemarchand

Published in: OASIcs, Volume 73, 4th International Workshop on Security and Dependability of Critical Embedded Real-Time Systems (CERTS 2019)

Abstract
Real-time critical systems have to comply with stringent timing constraints, otherwise, disastrous consequences can occur at runtime. A large effort has been made to propose models and tools to verify timing constraints by schedulability analysis at the early stages of system designs. Fewer efforts have been made on verifying the security properties in these systems despite the fact that sinister consequences can also happen if these properties are compromised. In this article, we investigate how to jointly verify security and timing constraints. We show how to model a security architecture (MILS) and how to verify both timing constraints and security properties. Schedulability is investigated by the mean of scheduling analysis methods implemented into the Cheddar scheduling analyzer. Experiments are conducted to show the impact that improving security has on the schedulability analysis.
Cite as

Ill-ham Atchadam, Frank Singhoff, Hai Nam Tran, Noura Bouzid, and Laurent Lemarchand. Combined Security and Schedulability Analysis for MILS Real-Time Critical Architectures. In 4th International Workshop on Security and Dependability of Critical Embedded Real-Time Systems (CERTS 2019). Open Access Series in Informatics (OASIcs), Volume 73, pp. 1:1-1:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{atchadam_et_al:OASIcs.CERTS.2019.1,
  author =	{Atchadam, Ill-ham and Singhoff, Frank and Tran, Hai Nam and Bouzid, Noura and Lemarchand, Laurent},
  title =	{{Combined Security and Schedulability Analysis for MILS Real-Time Critical Architectures}},
  booktitle =	{4th International Workshop on Security and Dependability of Critical Embedded Real-Time Systems (CERTS 2019)},
  pages =	{1:1--1:12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-119-1},
  ISSN =	{2190-6807},
  year =	{2019},
  volume =	{73},
  editor =	{Asplund, Mikael and Paulitsch, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CERTS.2019.1},
  URN =		{urn:nbn:de:0030-drops-108922},
  doi =		{10.4230/OASIcs.CERTS.2019.1},
  annote =	{Keywords: MILS (Multi Independent Levels of Security), RTCS (Real-Time Critical Systems), Security architecture and models, Scheduling analysis, Security analysis}
}
Document
Tool Description
DOI: 10.4230/OASIcs.ICLP.2017.5
Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description)

Authors: Michael Codish, Michael Frank, Amit Metodi, and Morad Muslimany

Published in: OASIcs, Volume 58, Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)

Abstract
This paper presents pl-cliquer, a Prolog interface to the cliquer tool for the maximum clique problem. Using pl-cliquer facilitates a programming style that allows logic programs to integrate with other tools such as: Boolean satisfiability solvers, finite domain constraint solvers, and graph isomorphism tools. We illustrate this programming style to solve the Graph Coloring problem, applying a symmetry break that derives from finding a maximum clique in the input graph. We present an experimentation of the resulting Graph Coloring solver on two benchmarks, one from the graph coloring community and the other from the examination timetabling community. The implementation of pl-cliquer consists of two components: A lightweight C interface, connecting cliquer's C library and Prolog, and a Prolog module which loads the library. The complete tool is available as a SWI-Prolog module.
Cite as

Michael Codish, Michael Frank, Amit Metodi, and Morad Muslimany. Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 5:1-5:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{codish_et_al:OASIcs.ICLP.2017.5,
  author =	{Codish, Michael and Frank, Michael and Metodi, Amit and Muslimany, Morad},
  title =	{{Logic Programming with Max-Clique and its Application to Graph Coloring}},
  booktitle =	{Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
  pages =	{5:1--5:18},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-058-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{58},
  editor =	{Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.5},
  URN =		{urn:nbn:de:0030-drops-84559},
  doi =		{10.4230/OASIcs.ICLP.2017.5},
  annote =	{Keywords: Logic Programming, Constraints, Maximum Clique}
}
Document
Invited Talk
DOI: 10.4230/LIPIcs.TIME.2017.1
Ontology-Mediated Query Answering over Temporal Data: A Survey (Invited Talk)

Authors: Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, and Michael Zakharyaschev

Published in: LIPIcs, Volume 90, 24th International Symposium on Temporal Representation and Reasoning (TIME 2017)

Abstract
We discuss the use of various temporal knowledge representation formalisms for ontology-mediated query answering over temporal data. In particular, we analyse ontology and query languages based on the linear temporal logic LTL, the multi-dimensional Halpern-Shoham interval temporal logic HS_n, as well as the metric temporal logic MTL. Our main focus is on the data complexity of answering temporal ontology-mediated queries and their rewritability into standard first-order and datalog queries.
Cite as

Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, and Michael Zakharyaschev. Ontology-Mediated Query Answering over Temporal Data: A Survey (Invited Talk). In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 1:1-1:37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{artale_et_al:LIPIcs.TIME.2017.1,
  author =	{Artale, Alessandro and Kontchakov, Roman and Kovtunova, Alisa and Ryzhikov, Vladislav and Wolter, Frank and Zakharyaschev, Michael},
  title =	{{Ontology-Mediated Query Answering over Temporal Data: A Survey}},
  booktitle =	{24th International Symposium on Temporal Representation and Reasoning (TIME 2017)},
  pages =	{1:1--1:37},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-052-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{90},
  editor =	{Schewe, Sven and Schneider, Thomas and Wijsen, Jef},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2017.1},
  URN =		{urn:nbn:de:0030-drops-79338},
  doi =		{10.4230/LIPIcs.TIME.2017.1},
  annote =	{Keywords: Description Logic, Temporal Logic, Ontology Mediated Query Answering, Data Complexity}
}
Document
DOI: 10.4230/OASIcs.ICLP.2016.21
Methods for Solving Extremal Problems in Practice

Authors: Michael Frank

Published in: OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)

Abstract
During the 20 th century there has been an incredible progress in solving theoretically hard problems in practice. One of the most prominent examples is the DPLL algorithm and its derivatives to solve the Boolean satisfiability problem, which can handle instances with millions of variables and clauses in reasonable time, notwithstanding the theoretical difficulty of solving the problem. Despite this progress, there are classes of problems that contain especially hard instances, which have remained open for decades despite their relative small size. One such class is the class of extremal problems, which typically involve finding a combinatorial object under some constraints (e.g, the search for Ramsey numbers). In recent years, a number of specialized methods have emerged to tackle extremal problems. Most of these methods are applied to a specific problem, despite the fact there is a great deal in common between different problems. Following a meticulous examination of these methods, we would like to extend them to handle general extremal problems. Further more, we would like to offer ways to exploit the general structure of extremal problems in order to develop constraints and symmetry breaking techniques which will, hopefully, improve existing tools. The latter point is of immense importance in the context of extremal problems, which often hamper existing tools when there is a great deal of symmetry in the search space, or when not enough is known of the problem structure. For example, if a graph is a solution to a problem instance, in many cases any isomorphic graph will also be a solution. In such cases, existing methods can usually be applied only if the model excludes symmetries.
Cite as

Michael Frank. Methods for Solving Extremal Problems in Practice. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 21:1-21:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{frank:OASIcs.ICLP.2016.21,
  author =	{Frank, Michael},
  title =	{{Methods for Solving Extremal Problems in Practice}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{21:1--21:6},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.21},
  URN =		{urn:nbn:de:0030-drops-67513},
  doi =		{10.4230/OASIcs.ICLP.2016.21},
  annote =	{Keywords: Extremal Problems, Constraints, SAT Solving, Logic Programming, Parallelism}
}
Document
DOI: 10.4230/DFU.Vol4.12111.191
The Uses of Norms

Authors: Munindar P. Singh, Matthew Arrott, Tina Balke, Amit K. Chopra, Rob Christiaanse, Stephen Cranefield, Frank Dignum, Davide Eynard, Emilia Farcas, Nicoletta Fornara, Fabien Gandon, Guido Governatori, Hoa Khanh Dam, Joris Hulstijn, Ingolf Krueger, Ho-Pun Lam, Michael Meisinger, Pablo Noriega, Bastin Tony Roy Savarimuthu, Kartik Tadanki, Harko Verhagen, and Serena Villata

Published in: Dagstuhl Follow-Ups, Volume 4, Normative Multi-Agent Systems (2013)

Abstract
This chapter presents a variety of applications of norms. These applications include governance in sociotechnical systems, data licensing and data collection, understanding software development teams, requirements engineering, assurance, natural resource allocation, wireless grids, autonomous vehicles, serious games, and virtual worlds.
Cite as

Munindar P. Singh, Matthew Arrott, Tina Balke, Amit K. Chopra, Rob Christiaanse, Stephen Cranefield, Frank Dignum, Davide Eynard, Emilia Farcas, Nicoletta Fornara, Fabien Gandon, Guido Governatori, Hoa Khanh Dam, Joris Hulstijn, Ingolf Krueger, Ho-Pun Lam, Michael Meisinger, Pablo Noriega, Bastin Tony Roy Savarimuthu, Kartik Tadanki, Harko Verhagen, and Serena Villata. The Uses of Norms. In Normative Multi-Agent Systems. Dagstuhl Follow-Ups, Volume 4, pp. 191-229, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InCollection{singh_et_al:DFU.Vol4.12111.191,
  author =	{Singh, Munindar P. and Arrott, Matthew and Balke, Tina and Chopra, Amit K. and Christiaanse, Rob and Cranefield, Stephen and Dignum, Frank and Eynard, Davide and Farcas, Emilia and Fornara, Nicoletta and Gandon, Fabien and Governatori, Guido and Khanh Dam, Hoa and Hulstijn, Joris and Krueger, Ingolf and Lam, Ho-Pun and Meisinger, Michael and Noriega, Pablo and Savarimuthu, Bastin Tony Roy and Tadanki, Kartik and Verhagen, Harko and Villata, Serena},
  title =	{{The Uses of Norms}},
  booktitle =	{Normative Multi-Agent Systems},
  pages =	{191--229},
  series =	{Dagstuhl Follow-Ups},
  ISBN =	{978-3-939897-51-4},
  ISSN =	{1868-8977},
  year =	{2013},
  volume =	{4},
  editor =	{Andrighetto, Giulia and Governatori, Guido and Noriega, Pablo and van der Torre, Leendert W. N.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol4.12111.191},
  URN =		{urn:nbn:de:0030-drops-40047},
  doi =		{10.4230/DFU.Vol4.12111.191},
  annote =	{Keywords: Norms, MAS, Governance, Requirements engineering}
}
Document
DOI: 10.4230/DagRep.1.6.54
Outdoor and Large-Scale Real-World Scene Analysis. 15th Workshop Theoretic Foundations of Computer Vision (Dagstuhl Seminar 11261)

Authors: Frank Dellaert, Jan-Michael Frahm, Marc Pollefeys, and Bodo Rosenhahn

Published in: Dagstuhl Reports, Volume 1, Issue 6 (2011)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11261 ``Outdoor and Large-Scale Real-World Scene Analysis, 15th Workshop Theoretic Foundations of Computer Vision''. 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, followed by the scheduled programme. Overall, the seminar was a great success, which is also reflected in the very positive feedback we received from the evaluation.
Cite as

Frank Dellaert, Jan-Michael Frahm, Marc Pollefeys, and Bodo Rosenhahn. Outdoor and Large-Scale Real-World Scene Analysis. 15th Workshop Theoretic Foundations of Computer Vision (Dagstuhl Seminar 11261). In Dagstuhl Reports, Volume 1, Issue 6, pp. 54-80, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@Article{dellaert_et_al:DagRep.1.6.54,
  author =	{Dellaert, Frank and Frahm, Jan-Michael and Pollefeys, Marc and Rosenhahn, Bodo},
  title =	{{Outdoor and Large-Scale Real-World Scene Analysis. 15th Workshop Theoretic Foundations of Computer Vision (Dagstuhl Seminar 11261)}},
  pages =	{54--80},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{6},
  editor =	{Dellaert, Frank and Frahm, Jan-Michael and Pollefeys, Marc and Rosenhahn, Bodo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.1.6.54},
  URN =		{urn:nbn:de:0030-drops-32755},
  doi =		{10.4230/DagRep.1.6.54},
  annote =	{Keywords: Computer Vision, Scene Analysis}
}
Document
DOI: 10.4230/DagSemProc.10021.5
Programming Service Oriented Agents

Authors: Benjamin Hirsch, Thomas Konnerth, Michael Burkhardt, and Sahin Albayrak

Published in: Dagstuhl Seminar Proceedings, Volume 10021, Service-Oriented Architecture and (Multi-)Agent Systems Technology (2010)

Abstract
This paper introduces a programming language for service-oriented agents. JADL++ combines the ease of use of scripting-languages with a state-of-the-art service oriented approach which allows the seamless integration of web-services. Furthermore, the language includes OWL-based ontologies for semantic descriptions of data and services, thus allowing agents to make intelligent decisions about service calls.
Cite as

Benjamin Hirsch, Thomas Konnerth, Michael Burkhardt, and Sahin Albayrak. Programming Service Oriented Agents. In Service-Oriented Architecture and (Multi-)Agent Systems Technology. Dagstuhl Seminar Proceedings, Volume 10021, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{hirsch_et_al:DagSemProc.10021.5,
  author =	{Hirsch, Benjamin and Konnerth, Thomas and Burkhardt, Michael and Albayrak, Sahin},
  title =	{{Programming Service Oriented Agents}},
  booktitle =	{Service-Oriented Architecture and (Multi-)Agent Systems Technology},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10021},
  editor =	{Monique Calisti and Frank P. Dignum and Ryszard Kowalczyk and Frank Leymann and Rainer Unland},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10021.5},
  URN =		{urn:nbn:de:0030-drops-28158},
  doi =		{10.4230/DagSemProc.10021.5},
  annote =	{Keywords: Service oriented architectures, agents, agent programming language, semantic services}
}
Document
DOI: 10.4230/DagSemProc.10021.6
Reliability of Service-Based and Agent-Based Systems

Authors: Michael N. Huhns

Published in: Dagstuhl Seminar Proceedings, Volume 10021, Service-Oriented Architecture and (Multi-)Agent Systems Technology (2010)

Abstract
A description of the current problems of service-oriented architectures and service-oriented computing and how the solutions will come from using agent technology. That is, services will have to become more agent-like in order to succeed fully in the marketplace.
Cite as

Michael N. Huhns. Reliability of Service-Based and Agent-Based Systems. In Service-Oriented Architecture and (Multi-)Agent Systems Technology. Dagstuhl Seminar Proceedings, Volume 10021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{huhns:DagSemProc.10021.6,
  author =	{Huhns, Michael N.},
  title =	{{Reliability of Service-Based and Agent-Based Systems}},
  booktitle =	{Service-Oriented Architecture and (Multi-)Agent Systems Technology},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10021},
  editor =	{Monique Calisti and Frank P. Dignum and Ryszard Kowalczyk and Frank Leymann and Rainer Unland},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10021.6},
  URN =		{urn:nbn:de:0030-drops-25546},
  doi =		{10.4230/DagSemProc.10021.6},
  annote =	{Keywords: Service-oriented computing, multiagent systems}
}
Document
DOI: 10.4230/DagSemProc.07181.9
Reliably Capture Local Clusters in Noisy Domains From Parallel Universes

Authors: Frank Höppner and Mirko Böttcher

Published in: Dagstuhl Seminar Proceedings, Volume 7181, Parallel Universes and Local Patterns (2007)

Abstract
When seeking for small local patterns it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We propose a new approach that addresses this problem by exploiting temporal information which is contained in most business data sets. The algorithm enables the detection of local patterns in noisy data sets more reliable compared to the case when the temporal information is ignored. This is achieved by making use of the fact that noise does not reproduce its incidental structure but even small patterns do. In particular, we developed a method to track clusters over time based on an optimal match of data partitions between time periods.
Cite as

Frank Höppner and Mirko Böttcher. Reliably Capture Local Clusters in Noisy Domains From Parallel Universes. In Parallel Universes and Local Patterns. Dagstuhl Seminar Proceedings, Volume 7181, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{hoppner_et_al:DagSemProc.07181.9,
  author =	{H\"{o}ppner, Frank and B\"{o}ttcher, Mirko},
  title =	{{Reliably Capture Local Clusters in Noisy Domains From Parallel Universes}},
  booktitle =	{Parallel Universes and Local Patterns},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7181},
  editor =	{Michael R. Berthold and Katharina Morik and Arno Siebes},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07181.9},
  URN =		{urn:nbn:de:0030-drops-12617},
  doi =		{10.4230/DagSemProc.07181.9},
  annote =	{Keywords: Local pattern, time, parallel universe}
}
Document
DOI: 10.4230/DagSemProc.07131.3
Advances in pre-processing and model generation for mass spectrometric data analysis

Authors: Frank Michael Schleif

Published in: Dagstuhl Seminar Proceedings, Volume 7131, Similarity-based Clustering and its Application to Medicine and Biology (2007)

Abstract
The analysis of complex signals as obtained by mass spectrometric measurements is complicated and needs an appropriate representation of the data. Thereby the kind of preprocessing, feature extraction as well as the used similarity measure are of particular importance. Focusing on biomarker analysis and taking the functional nature of the data into account this task is even more complicated. A new mass spectrometry tailored data preprocessing is shown, discussed and analyzed in a clinical proteom study compared to a standard setting.
Cite as

Frank Michael Schleif. Advances in pre-processing and model generation for mass spectrometric data analysis. In Similarity-based Clustering and its Application to Medicine and Biology. Dagstuhl Seminar Proceedings, Volume 7131, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{schleif:DagSemProc.07131.3,
  author =	{Schleif, Frank Michael},
  title =	{{Advances in pre-processing and model generation for mass spectrometric data analysis}},
  booktitle =	{Similarity-based Clustering and its Application to Medicine and Biology},
  pages =	{1--24},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7131},
  editor =	{Michael Biehl and Barbara Hammer and Michel Verleysen and Thomas Villmann},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07131.3},
  URN =		{urn:nbn:de:0030-drops-11329},
  doi =		{10.4230/DagSemProc.07131.3},
  annote =	{Keywords: Similarity measures, functional data, proteomics, mass spectrometry, pre-processing,wavelet analysis, generalized peak list}
}
Document
DOI: 10.4230/DagSemProc.06291.4
A SOA-Based Architecture Framework

Authors: Wil van der Aalst, Michael Beisiegel, Kees van Hee, Dieter König, and Christian Stahl

Published in: Dagstuhl Seminar Proceedings, Volume 6291, The Role of Business Processes in Service Oriented Architectures (2006)

Abstract
In this paper we present first results of a SOA-based architecture framework. The architecture framework is required to be close to industry standards, especially to service component architecture (SCA), language independent (i.e. it is adoptable) and the building blocks of a system, activities and data, are first class citizens. We present a meta model of the architecture framework and discuss its concepts in detail.
Cite as

Wil van der Aalst, Michael Beisiegel, Kees van Hee, Dieter König, and Christian Stahl. A SOA-Based Architecture Framework. In The Role of Business Processes in Service Oriented Architectures. Dagstuhl Seminar Proceedings, Volume 6291, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{vanderaalst_et_al:DagSemProc.06291.4,
  author =	{van der Aalst, Wil and Beisiegel, Michael and van Hee, Kees and K\"{o}nig, Dieter and Stahl, Christian},
  title =	{{A SOA-Based Architecture Framework}},
  booktitle =	{The Role of Business Processes in Service Oriented Architectures},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6291},
  editor =	{Frank Leymann and Wolfgang Reisig and Satish R. Thatte and Wil van der Aalst},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06291.4},
  URN =		{urn:nbn:de:0030-drops-8277},
  doi =		{10.4230/DagSemProc.06291.4},
  annote =	{Keywords: SOA, architecture framework}
}
Document
DOI: 10.4230/DagSemProc.06061.8
Runtime Analysis of a Simple Ant Colony Optimization Algorithm

Authors: Frank Neumann and Carsten Witt

Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)

Abstract
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic is rather weak. Building up such a theory is demanded to understand how these heuristics work as well as to come up with better algorithms for certain problems. Up to now, only convergence results have been achieved showing that optimal solutions can be obtained in a finite amount of time. We present the first runtime analysis of a simple ACO algorithm that transfers many rigorous results with respect to the expected runtime of a simple evolutionary algorithm to our algorithm. In addition, we examine the choice of the evaporation factor, which is a crucial parameter in such an algorithm, in greater detail and analyze its effect with respect to the runtime.
Cite as

Frank Neumann and Carsten Witt. Runtime Analysis of a Simple Ant Colony Optimization Algorithm. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{neumann_et_al:DagSemProc.06061.8,
  author =	{Neumann, Frank and Witt, Carsten},
  title =	{{Runtime Analysis of  a Simple Ant Colony Optimization Algorithm}},
  booktitle =	{Theory of Evolutionary Algorithms},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6061},
  editor =	{Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.8},
  URN =		{urn:nbn:de:0030-drops-5928},
  doi =		{10.4230/DagSemProc.06061.8},
  annote =	{Keywords: Randomized Search Heuristics, Ant Colony Optimization, Runtime Analysis}
}
  • Refine by Author
  • 2 Frank, Michael
  • 1 Abrahamsen, Mikkel
  • 1 Albayrak, Sahin
  • 1 Arrott, Matthew
  • 1 Artale, Alessandro
  • Show More...

  • Refine by Classification
  • 1 Computer systems organization → Real-time system architecture
  • 1 Information systems → Parallel and distributed DBMSs
  • 1 Mathematics of computing → Graph algorithms
  • 1 Mathematics of computing → Probabilistic algorithms
  • 1 Mathematics of computing → Random graphs
  • Show More...

  • Refine by Keyword
  • 2 Constraints
  • 2 Logic Programming
  • 2 Service-oriented computing
  • 1 Ant Colony Optimization
  • 1 Beacon routing
  • Show More...

  • Refine by Type
  • 16 document

  • Refine by Publication Year
  • 3 2006
  • 2 2007
  • 2 2010
  • 2 2020
  • 1 2011
  • 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