2024-03-28T08:27:54Z
https://drops.dagstuhl.de/oai
oai:drops-oai.dagstuhl.de:3205
2011-08-30T00:00:00Z
ddc:004
open_access
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061)
Fischer-Hübner, Simone
Hoofnagle, Chris
Krontiris, Ioannis
Rannenberg, Kai
Waidner, Michael
Online Social Networks
Informational Self-Determination
Privacy Enhancing Technologies
Data Protection Directive
While the collection and monetization of user data has become a main source for funding ``free'' services like search engines, online social networks, news sites and blogs, neither privacy-enhancing technologies nor its regulations have kept up with user needs and privacy preferences.
The aim of this Manifesto is to raise awareness for the actual state of the art of online privacy, especially in the international research community and in ongoing efforts to improve the respective legal frameworks, and to provide concrete recommendations to industry, regulators, and research agencies for improving online privacy. In particular we examine how the basic principle of informational self-determination, as promoted by European legal doctrines, could be applied to infrastructures like the internet, Web 2.0 and mobile telecommunication networks.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Simone Fischer-Hübner and Chris Hoofnagle and Ioannis Krontiris and Kai Rannenberg and Michael Waidner
2011
Is Part Of Dagstuhl Manifestos, Volume 1, Issue 1 (2011)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.1.1.1
urn:nbn:de:0030-drops-32055
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.1.1.1
eng
https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:3212
2011-09-30T00:00:00Z
ddc:004
open_access
Modeling, Analysis, and Verification - The Formal Methods Manifesto 2010 (Dagstuhl Perspectives Workshop 10482)
Kreiker, Jörg
Tarlecki, Andrzej
Vardi, Moshe Y.
Wilhelm, Reinhard
Formal methods
Verification
Analysis
Modeling
Design for Verifiability
This manifesto represents the results of the Dagstuhl Perspectives Workshop 10482 "Formal Methods – Just a Euro-Science?" held from November 30 to December 3, 2010 at Schloss Dagstuhl, Germany. We strive to clarify the terminology and categorize the abundance of concepts and methods in order to reduce misunderstandings among the involved research community and in communication with industry. We discuss the industrial acceptance of formal methods and how to increase it by targeted research and improved education. Finally, we state a few challenges and provide perspectives of the field. This document is opinionated in nature and biased towards the experiences and views of the participants listed in the appendix, further distilled by the authors.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jörg Kreiker and Andrzej Tarlecki and Moshe Y. Vardi and Reinhard Wilhelm
2011
Is Part Of Dagstuhl Manifestos, Volume 1, Issue 1 (2011)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.1.1.21
urn:nbn:de:0030-drops-32121
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.1.1.21
eng
https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:3445
2012-03-06T00:00:00Z
ddc:004
open_access
Improving The Future of Research Communications and e-Scholarship (Dagstuhl Perspectives Workshop 11331)
Bourne, Philip E.
Clark, Timothy W.
Dale, Robert
de Waard, Anita
Herman, Ivan
Hovy, Eduard H.
Shotton, David
Elektronisches Publizieren
Dokumentenserver
Bibliometrie Science publishing
online communities
science policy
digital repositories
semantic publishing
citation analysis
The dissemination of knowledge derived from research and scholarship has a fundamental impact on the ways in which society develops and progresses, and at the same time it feeds back to improve subsequent research and scholarship. Here, as in so many other areas of human activity, the internet is changing the way things work; two decades of emergent and increasingly pervasive information technology have demonstrated the potential for far more effective scholarly communication. But the use of this technology remains limited.
Force11 is a community of scholars, librarians, archivists, publishers and research funders that has arisen organically to help facilitate the change toward improved knowledge creation and sharing. This document highlights the findings of the Force11 workshop on the Future of Research Communication held at Schloss Dagstuhl, Germany, in August 2011: it summarizes a number of key problems facing scholarly publishing today, and presents a vision that addresses these problems, proposing concrete steps that key stakeholders can take to improve the state of scholarly publishing.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Philip E. Bourne and Timothy W. Clark and Robert Dale and Anita de Waard and Ivan Herman and Eduard H. Hovy and David Shotton
2012
Is Part Of Dagstuhl Manifestos, Volume 1, Issue 1 (2011)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.1.1.41
urn:nbn:de:0030-drops-34458
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.1.1.41
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:3654
2012-09-06T00:00:00Z
ddc:004
open_access
Social, Supply-Chain, Administrative, Business, Commerce, Political networks: a multi-discipline perspective (Dagstuhl Perspectives Workshop 12182)
Häsel, Matthias
Quandt, Thorsten
Vossen, Gottfried
Networks
network infrastructure
network types
network effects
data in networks
social networks
social media
crowdsourcing
This is the manifesto of Dagstuhl Perspectives Workshop 12182 on a multi-discipline perspective on networks. The information society is shaped by an increasing presence of networks in various manifestations, most notably computer networks, supply-chain networks, and social networks, but also business networks, administrative networks, or political networks. Online networks nowadays connect people all around the world at day and night, and
allow to communicate and to work collaboratively and efficiently. What has been a commodity in the private as well as in the enterprise sectors independently for quite some time now is currently growing together at an increasing pace. As a consequence, the time has come for the relevant sciences, including computer
science, information systems, social sciences, economics, communication sciences, and others, to give up their traditional "silo-style" thinking and enter into borderless dialogue and interaction. The purpose of this Manifesto is to review where we stand today, and to outline directions in which we urgently need to move, in terms of both research and teaching, but also in terms of funding.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Matthias Häsel and Thorsten Quandt and Gottfried Vossen
2012
Is Part Of Dagstuhl Manifestos, Volume 2, Issue 1 (2012)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.2.1.1
urn:nbn:de:0030-drops-36542
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.2.1.1
eng
https://creativecommons.org/licenses/by-nd/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:4167
2013-07-30T00:00:00Z
ddc:004
open_access
Computation and Palaeography: Potentials and Limits (Dagstuhl Perspectives Workshop 12382)
Hassner, Tal
Rehbein, Malte
Stokes, Peter A.
Wolf, Lior
Digital Humanities
Digital Palaeography
Cultural Heritage
This manifesto documents the program and outcomes of Dagstuhl Seminar 12382 `Perspectives Workshop: Computation and Palaeography: Potentials and Limits'. The workshop focused on the interaction of palaeography, the study of ancient and medieval documents, with computerized tools, particularly those developed for analysis of digital images and text mining. The goal of this marriage of disciplines is to provide efficient solutions to time and labor consuming palaeographic tasks. It furthermore attempts to provide scholars with quantitative evidence to palaeographical arguments, consequently facilitating a better understanding of our cultural heritage through the unique perspective of ancient and medieval documents. The workshop provided a vital opportunity for palaeographers to interact and discuss the potential of digital methods with
computer scientists specializing in machine vision and statistical data analysis. This was essential not only in suggesting new directions and ideas for improving palaeographic research, but also in identifying questions which scholars working individually, in their respective fields, would not have
asked without directly communicating with colleagues from outside their research community.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Tal Hassner and Malte Rehbein and Peter A. Stokes and Lior Wolf
2013
Is Part Of Dagstuhl Manifestos, Volume 2, Issue 1 (2012)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.2.1.14
urn:nbn:de:0030-drops-41679
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.2.1.14
eng
https://creativecommons.org/licenses/by-nd/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:4356
2013-11-29T00:00:00Z
ddc:004
open_access
Machine Learning Methods for Computer Security (Dagstuhl Perspectives Workshop 12371)
Joseph, Anthony D.
Laskov, Pavel
Roli, Fabio
Tygar, J. Doug
Nelson, Blaine
Adversarial Learning
Computer Security
Robust Statistical Learning
Online Learning with Experts
Game Theory
Learning Theory
The study of learning in adversarial environments is an emerging discipline at the juncture between machine learning and computer security. The interest in learning-based methods for security- and system-design applications comes from the high degree of complexity of phenomena underlying the security and reliability of computer systems. As it becomes increasingly difficult to reach the desired properties solely using statically designed mechanisms, learning methods are being used more and more to obtain a better understanding of various data collected from these complex systems. However, learning approaches can be evaded by adversaries, who change their behavior in response to the learning methods. To-date, there has been limited research into learning techniques that are resilient to attacks with provable robustness guarantees
The Perspectives Workshop, "Machine Learning Methods for Computer Security" was convened to bring together interested researchers from both the computer security and machine learning communities to discuss techniques, challenges, and future research directions for secure learning and learning-based security applications. As a result of the twenty-two invited presentations, workgroup sessions and informal discussion, several priority areas of research were
identified. The open problems identified in the field ranged from traditional applications of machine learning in security, such as attack detection and analysis of malicious software, to methodological issues related to secure learning, especially the development of new formal approaches with provable security guarantees. Finally a number of other potential applications were
pinpointed outside of the traditional scope of computer security in which
security issues may also arise in connection with data-driven methods. Examples of such applications are social media spam, plagiarism detection, authorship identification, copyright enforcement, computer vision (particularly in the context of biometrics), and sentiment analysis.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Anthony D. Joseph and Pavel Laskov and Fabio Roli and J. Doug Tygar and Blaine Nelson
2013
Is Part Of Dagstuhl Manifestos, Volume 3, Issue 1 (2013)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.3.1.1
urn:nbn:de:0030-drops-43569
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.3.1.1
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:4429
2014-01-13T00:00:00Z
ddc:004
open_access
ICT for Bridging Biology and Medicine (Dagstuhl Perspectives Workshop 13342)
Almeida, Jonas S.
Dress, Andreas
Kühne, Titus
Parida, Laxmi
Systems medicine
health-care related information systems
biomedical workflow engines
medical cloud
patient participation
ICT literacy
The systems paradigm of modern medicine presents both, an opportunity and a challenge, for current Information and Communication Technology (ICT). The opportunity is to understand the spatio-temporal organisation and dynamics of the human body as an integrated whole, incorporating the biochemical, physiological, and environmental interactions that sustain life. Yet, to accomplish this, one has to meet the challenge of integrating, visualising, interpreting, and utilising an unprecedented amount of in-silico, in-vitro and in-vivo data related to health care in a systematic, transparent, comprehensible, and reproducible fashion. This challenge is substantially compounded by the critical need to align technical solutions with the increasingly social dimension of modern ICT and the wide range of stakeholders in modern health-care systems.
Unquestionably, advancing health-care related ICT has the potential of fundamentally revolutionising care-delivery systems, affecting all our lives both, personally and -- in view of the enormous costs of health--care systems in modern societies -- also financially.
Accordingly, to ponder the options of ICT for delivering the promise of systems approaches to medical care, medical researchers and physicians, biologists and mathematicians, computer scientists and information--systems experts
from three continents and from both, industry and academia, met in Dagstuhl for a Dagstuhl Perspectives Workshop on ICT Strategies for Bridging Biology and Medicine from August 18 to 23, 2013, to thoroughly discuss this multidisciplinary topic and to derive and compile a comprehensive list of pertinent recommendations -- rather than just to deliver a set package of sanitised powerpoint presentations on medical ICT. The recommendations in this manifesto reflect points of convergence that emerged during the intense discussions and analyses taking place the workshop. They also reflect a particular attention given to the identification of challenges for improving the effectiveness of ICT approaches to Systems Biomedicine.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jonas S. Almeida and Andreas Dress and Titus Kühne and Laxmi Parida
2014
Is Part Of Dagstuhl Manifestos, Volume 3, Issue 1 (2013)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.3.1.31
urn:nbn:de:0030-drops-44292
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.3.1.31
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:4786
2014-10-16T00:00:00Z
ddc:004
open_access
Massive Open Online Courses: Current State and Perspectives (Dagstuhl Perspectives Workshop 14112)
Dillenbourg, Pierre
Fox, Armando
Kirchner, Claude
Mitchell, John
Wirsing, Martin
Massive open online course
MOOC
SPOC
e-learning
education
The rapid emergence and adoption of Massive Open Online Courses (MOOCs) has raised new questions and rekindled old debates in higher education. Academic leaders are concerned about educational quality, access to content, privacy protection for learner data, production costs and the proper relationship between MOOCs and residential instruction, among other matters. At the same time, these same leaders see opportunities for the scale of MOOCs to support learning: faculty interest in teaching innovation, better learner engagement through personalization, increased understanding of learner behavior through large-scale data analytics, wider access for continuing education learners and other nonresidential learners, and the possibility to enhance revenue or lower educational costs. Two years after "the year of the MOOC", this report summarizes the state of the art and the future directions of greatest interest as seen by an international group of academic leaders. Eight provocative positions are put forward, in hopes of aiding policy-makers, academics, administrators, and learners regarding the potential future of MOOCs in higher education. The recommendations span a variety of topics including financial considerations, pedagogical quality, and the social fabric.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Pierre Dillenbourg and Armando Fox and Claude Kirchner and John Mitchell and Martin Wirsing
2014
Is Part Of Dagstuhl Manifestos, Volume 4, Issue 1 (2014)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.4.1.1
urn:nbn:de:0030-drops-47861
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.4.1.1
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:4966
2015-03-16T00:00:00Z
ddc:004
open_access
Co-Design of Systems and Applications for Exascale (Dagstuhl Perspectives Workshop 12212)
Bode, Arndt
Hoisie, Adolfy
Kranzlmüller, Dieter
Nagel, Wolfgang E.
Straube, Christian
Exascale
Co-Deisgn
Scalability
Power Efficiency
Reliability
The Dagstuhl Perspectives Workshop 12212 on "Co-Design of Systems and Applications for Exascale" is reaching into the future, where exascale systems with their capabilities provide new possibilities and challenges. The goal of the workshop has been to identify concrete barriers and obstacles, and to discuss ideas on how to overcome them. It is a common agreement that co-design across all layers, algorithms, applications, programming models, run-time systems, architectures, and infrastructures, will be required. The discussion between the experts identified a series of requirements on exascale co-design efforts, as well as concrete recommendations and open questions for future research.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Arndt Bode and Adolfy Hoisie and Dieter Kranzlmüller and Wolfgang E. Nagel and Christian Straube
2015
Is Part Of Dagstuhl Manifestos, Volume 4, Issue 1 (2014)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.4.1.28
urn:nbn:de:0030-drops-49663
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.4.1.28
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:5509
2015-10-23T00:00:00Z
ddc:004
open_access
Connecting Performance Analysis and Visualization (Dagstuhl Perspectives Workshop 14022)
Bremer, Peer-Timo
Mohr, Bernd
Pascucci, Valerio
Schulz, Martin
Gamblin, Todd
Brunst, Holger
Performance Analysis
Performance Tools
Information Visualization
Visual Analytics
In the first week of January 2014 Schloss Dagstuhl hosted a Perspectives Workshop on “Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing”. The workshop brought together two previously separate communities – from Visualization and Performance Analysis for High Performance Computing – to discuss a long term joint research agenda. The goal was to identify and address the challenges in using visual representations to understand and optimize the performance of extreme-scale applications running on today's most powerful
computing systems like climate modeling, combustion, material science or astro-physics simulations.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Peer-Timo Bremer and Bernd Mohr and Valerio Pascucci and Martin Schulz and Todd Gamblin and Holger Brunst
2015
Is Part Of Dagstuhl Manifestos, Volume 5, Issue 1 (2015)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.5.1.1
urn:nbn:de:0030-drops-55099
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.5.1.1
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:5565
2015-11-13T00:00:00Z
ddc:004
open_access
Privacy and Security in an Age of Surveillance (Dagstuhl Perspectives Workshop 14401)
Preneel, Bart
Rogaway, Philipp
Ryan, Mark D.
Ryan, Peter Y. A.
Big data
encryption
mass surveillance
privacy
Before the Snowden revelations about the scope of surveillance by the NSA and its partner agencies, most people assumed that surveillance was limited to what is necessary and proportionate for these agencies to fulfil their prescribed role. People assumed that oversight mechanisms were in place to ensure that
surveillance was appropriately constrained. But the Snowden revelations undermine these beliefs. We now know that nations are amassing personal data about people's lives at an unprecedented scale, far beyond most people's wildest expectations.
The scope of state surveillance must be limited by an understanding of its costs as well as benefits. The costs are not limited to financial ones but also include eroding personal rights and the degradation to the integrity, vibrancy, or fundamental character of civil society.
This manifesto stems from a Dagstuhl Perspectives Workshop held in late 2014.
The meeting was a four-day gathering of experts from multiple disciplines connected with privacy and security. The aim was to explore how society as a whole, and the computing science community in particular, should respond to the Snowden revelations. More precisely, the meeting discussed the scope and nature of the practice of mass-surveillance, basic principles that should underlie reforms, and the potential for technical, legal, and other means to help stem or restore human rights threatened by ubiquitous electronic surveillance.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Bart Preneel and Philipp Rogaway and Mark D. Ryan and Peter Y. A. Ryan
2015
Is Part Of Dagstuhl Manifestos, Volume 5, Issue 1 (2015)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.5.1.25
urn:nbn:de:0030-drops-55653
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.5.1.25
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:7146
2017-05-23T00:00:00Z
ddc:004
open_access
Engineering Academic Software (Dagstuhl Perspectives Workshop 16252)
Allen, Alice
Aragon, Cecilia
Becker, Christoph
Carver, Jeffrey
Chis, Andrei
Combemale, Benoit
Croucher, Mike
Crowston, Kevin
Garijo, Daniel
Gehani, Ashish
Goble, Carole
Haines, Robert
Hirschfeld, Robert
Howison, James
Huff, Kathryn
Jay, Caroline
Katz, Daniel S.
Kirchner, Claude
Kuksenok, Katie
Lämmel, Ralf
Nierstrasz, Oscar
Turk, Matt
van Nieuwpoort, Rob
Vaughn, Matthew
Vinju, Jurgen J.
Academic software
Research software
Software citation
Software sustainability
Software is often a critical component of scientific research. It can be a component of the academic research methods used to produce research results, or it may itself be an academic research result. Software, however, has rarely been considered to be a citable artifact in its own right. With the advent of open-source software, artifact evaluation committees of conferences, and journals that include source code and running systems as part of the published artifacts, we foresee that software will increasingly be recognized as part of the academic process. The quality and sustainability of this software must be accounted for, both a prioro and a posteriori.
The Dagstuhl Perspectives Workshop on "Engineering Academic Software" has examined the strengths, weaknesses, risks, and opportunities of academic software engineering. A key outcome of the workshop is this Dagstuhl Manifesto, serving as a roadmap towards future professional software engineering for software-based research instruments and other software produced and used in an academic context. The manifesto is expressed in terms of a series of actionable "pledges" that users and developers of academic research software can take as concrete steps towards improving the environment in which that software is produced.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Alice Allen and Cecilia Aragon and Christoph Becker and Jeffrey Carver and Andrei Chis and Benoit Combemale and Mike Croucher and Kevin Crowston and Daniel Garijo and Ashish Gehani and Carole Goble and Robert Haines and Robert Hirschfeld and James Howison and Kathryn Huff and Caroline Jay and Daniel S. Katz and Claude Kirchner and Katie Kuksenok and Ralf Lämmel and Oscar Nierstrasz and Matt Turk and Rob van Nieuwpoort and Matthew Vaughn and Jurgen J. Vinju
2017
Is Part Of Dagstuhl Manifestos, Volume 6, Issue 1 (2017)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.6.1.1
urn:nbn:de:0030-drops-71468
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.6.1.1
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:8677
2018-04-09T00:00:00Z
ddc:004
open_access
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)
Abiteboul, Serge
Arenas, Marcelo
Barceló, Pablo
Bienvenu, Meghyn
Calvanese, Diego
David, Claire
Hull, Richard
Hüllermeier, Eyke
Kimelfeld, Benny
Libkin, Leonid
Martens, Wim
Milo, Tova
Murlak, Filip
Neven, Frank
Ortiz, Magdalena
Schwentick, Thomas
Stoyanovich, Julia
Su, Jianwen
Suciu, Dan
Vianu, Victor
Yi, Ke
database theory
principles of data management
query languages
efficient query processing
query optimization
heterogeneous data
uncertainty
knowledge-enriched data management
machine learning
workflows
human-related data
ethics
The area of Principles of Data Management (PDM) has made crucial contributions to the development of formal frameworks for understanding and managing
data and knowledge. This work has involved a rich cross-fertilization between
PDM and other disciplines in mathematics and computer science, including logic, complexity theory, and knowledge representation. We anticipate on-going expansion of PDM research as the technology and applications involving data management continue to grow and evolve. In particular, the lifecycle of Big Data Analytics raises a wealth of challenge areas that PDM can help with.
In this report we identify some of the most important research directions where the PDM community has the potential to make significant contributions. This is done from three perspectives: potential practical relevance, results already obtained, and research questions that appear surmountable in the short and medium term.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Serge Abiteboul and Marcelo Arenas and Pablo Barceló and Meghyn Bienvenu and Diego Calvanese and Claire David and Richard Hull and Eyke Hüllermeier and Benny Kimelfeld and Leonid Libkin and Wim Martens and Tova Milo and Filip Murlak and Frank Neven and Magdalena Ortiz and Thomas Schwentick and Julia Stoyanovich and Jianwen Su and Dan Suciu and Victor Vianu and Ke Yi
2018
Is Part Of Dagstuhl Manifestos, Volume 7, Issue 1 (2018)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.7.1.1
urn:nbn:de:0030-drops-86772
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.7.1.1
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:8683
2018-04-16T00:00:00Z
ddc:004
open_access
QoE Vadis? (Dagstuhl Perspectives Workshop 16472)
Fiedler, Markus
Möller, Sebastian
Reichl, Peter
Xie, Min
multimedia
network and application management
network quality monitoring and measurement
quality of experience
socio-economic and business aspects
The goal of the Dagstuhl Perspectives Workshop 16472 has been to discuss and outline the strategic evolution of Quality of Experience as a key topic for future Internet research. The resulting manifesto, which is presented here, reviews the state of the art in the Quality of Experience (QoE) domain, along with a SWOT analysis. Based on those, it discusses how the QoE research area might develop in the future, and how QoE research will lead to innovative and improved products and services. It closes by providing a set of recommendations for the scientific community and industry, as well as for future funding of QoE-related activities.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Markus Fiedler and Sebastian Möller and Peter Reichl and Min Xie
2018
Is Part Of Dagstuhl Manifestos, Volume 7, Issue 1 (2018)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.7.1.30
urn:nbn:de:0030-drops-86830
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.7.1.30
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:8824
2018-05-29T00:00:00Z
ddc:004
open_access
Tensor Computing for Internet of Things (Dagstuhl Perspectives Workshop 16152)
Acar, Evrim
Anandkumar, Animashree
Mullin, Lenore
Rusitschka, Sebnem
Tresp, Volker
Distributed Systems
Real-time and embedded systems
Signal processing systems
Learning
Multiagent systems
"The fundamental laws necessary for the mathematical treatment of large part of physics and the whole of chemistry are thus completely known, and the difficulty lies only in the fact that application of these laws leads to equations that are too complex to be solved." - Dirac 1929
The digital world of Internet of Things (IoT) will provide a high-resolution depiction of our physical world through measurements and other data - even high-definition "video," if you consider streaming data frames coming from a myriad of sensors embedded in everything we use. This depiction will have captured our interactions with the physical world and the interactions of digitally enhanced machines and devices. Tensors, as generalizations of vectors and matrices, provide a natural and scalable framework for handling data with such inherent structures and complex dependencies. Scalable tensor methods have attracted considerable amount of attention, with successes in a series of learning tasks, such as learning latent variable models, relational learning, spatio-temporal forecasting as well as training [19] and compression [20] of deep neural networks.
In a Dagstuhl Perspectives Workshop on Tensor Computing for IoT, we validated the fundamental suitability of tensor methods for handling the massive amounts of data coming from connected cyber-physical systems (CPS). The multidisciplinary discourse among academics, industrial researchers and practitioners in the IoT/CPS domain and in the field of machine learning and tensor methods, exposed open issues that need to be addressed to reap value from the technological opportunity. This Manifesto summarizes the immediate action fields for advancement: IoT Tensor Data Benchmarks, Tensor Tools for IoT, and the evolution of a Knowledge Hub. The activities will also be channeled to create best practices and a common tensor language across the disciplines.
In a not so distant future, basic infrastructures for living will be mainly data-driven, automated by digitally enhanced devices and machines. The tools and frameworks used to engineer such systems will ensure production-ready machine learning code which utilizes tensor-based, hence better interpretable, models and runs on distributed, decentralized, and embedded computing resources in a robust and reliable way. We conclude the manifesto with a strategy how to move towards this vision with concrete steps in the identified action fields.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Evrim Acar and Animashree Anandkumar and Lenore Mullin and Sebnem Rusitschka and Volker Tresp
2018
Is Part Of Dagstuhl Manifestos, Volume 7, Issue 1 (2018)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.7.1.52
urn:nbn:de:0030-drops-88244
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.7.1.52
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:9895
2018-11-16T00:00:00Z
ddc:004
open_access
Present and Future of Formal Argumentation (Dagstuhl Perspectives Workshop 15362)
Gabbay, Dov M.
Giacomin, Massimiliano
Liao, Beishui
van der Torre, Leendert
Artificial Intelligence
Knowledge Representation and Reasoning
Multi-Agent Systems
Argumentation
Non-monotonic Logic
Formal Argumentation is emerging as a key reasoning paradigm building bridges among knowledge representation and reasoning in artificial intelligence, informal argumentation in philosophy and linguistics, legal and ethical argumentation, mathematical and logical reasoning, and graph-theoretic reasoning. It aims to capture diverse kinds of reasoning and dialogue activities in the presence of uncertainty and conflicting information in a formal and intuitive way, with potential applications ranging from argumentation mining, via LegalTech and machine ethics, to therapy
in clinical psychology. The turning point for the modern stage of formal argumentation theory, much similar to the introduction of possible worlds semantics for the theory of modality, is the framework and language of Dung's abstract argumentation theory introduced in 1995. This means that nothing could remain the same as before 1995 - it should be a focal point of reference for any study of argumentation, even if it is critical about it. Now, in modal logic, the introduction of the possible worlds semantics has led to a complete paradigm shift, both in tools and new subjects of studies. This is still not fully true for what is going on in argumentation theory. The Dagstuhl workshop led to the first volume of a handbook series in formal argumentation, reflecting the new stage of the development of argumentation theory.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dov M. Gabbay and Massimiliano Giacomin and Beishui Liao and Leendert van der Torre
2018
Is Part Of Dagstuhl Manifestos, Volume 7, Issue 1 (2018)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.7.1.69
urn:nbn:de:0030-drops-98957
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.7.1.69
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:9898
2018-11-21T00:00:00Z
ddc:004
open_access
From Evaluating to Forecasting Performance: How to Turn Information Retrieval, Natural Language Processing and Recommender Systems into Predictive Sciences (Dagstuhl Perspectives Workshop 17442)
Ferro, Nicola
Fuhr, Norbert
Grefenstette, Gregory
Konstan, Joseph A.
Castells, Pablo
Daly, Elizabeth M.
Declerck, Thierry
Ekstrand, Michael D.
Geyer, Werner
Gonzalo, Julio
Kuflik, Tsvi
Lindén, Krister
Magnini, Bernardo
Nie, Jian-Yun
Perego, Raffaele
Shapira, Bracha
Soboroff, Ian
Tintarev, Nava
Verspoor, Karin
Willemsen, Martijn C.
Zobel, Justin
Information Systems
Formal models
Evaluation
Simulation
User Interaction
We describe the state-of-the-art in performance modeling and prediction for Information Retrieval (IR), Natural Language Processing (NLP) and Recommender Systems (RecSys) along with its shortcomings and strengths. We present a framework for further research, identifying five major problem areas: understanding measures, performance analysis, making underlying assumptions explicit, identifying application features determining performance, and the development of prediction models describing the relationship between assumptions, features and resulting performance.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Nicola Ferro and Norbert Fuhr and Gregory Grefenstette and Joseph A. Konstan and Pablo Castells and Elizabeth M. Daly and Thierry Declerck and Michael D. Ekstrand and Werner Geyer and Julio Gonzalo and Tsvi Kuflik and Krister Lindén and Bernardo Magnini and Jian-Yun Nie and Raffaele Perego and Bracha Shapira and Ian Soboroff and Nava Tintarev and Karin Verspoor and Martijn C. Willemsen and Justin Zobel
2018
Is Part Of Dagstuhl Manifestos, Volume 7, Issue 1 (2018)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.7.1.96
urn:nbn:de:0030-drops-98987
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.7.1.96
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:13237
2020-11-24T00:00:00Z
ddc:004
open_access
Implementing FAIR Data Infrastructures (Dagstuhl Perspectives Workshop 18472)
Manola, Natalia
Mutschke, Peter
Scherp, Guido
Tochtermann, Klaus
Wittenburg, Peter
Gregory, Kathleen
Hasselbring, Wilhelm
den Heijer, Kees
Manghi, Paolo
Van Uytvanck, Dieter
fair principles
open data
open science
research data infrastructures
The open science movement is gaining strength and momentum worldwide, signalling a fundamental shift in how scientific research is made accessible and reusable. In order to fulfill the promises of open science, reliable and sustainable research data infrastructures must be developed. While the FAIR data principles provide a promising conceptual basis for developing such data infrastructures, they do not provide technological guidance on how to do so.
Computer science is uniquely situated to fill this gap by researching and developing tools and technical specifications which can help to realize the creation of FAIR data infrastructures. To this end, this Dagstuhl Perspectives Workshop brought together computer scientists and digital infrastructure experts from across disciplinary domains to discuss key challenges and technical solutions to implementing and promoting the establishment of FAIR-compliant infrastructures for research data. This manifesto reports the findings from the workshop and provides recommendations along two lines: (1) how computer science can contribute to implementing FAIR data infrastructures and (2) how to make computer science research itself more FAIR.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Natalia Manola and Peter Mutschke and Guido Scherp and Klaus Tochtermann and Peter Wittenburg and Kathleen Gregory and Wilhelm Hasselbring and Kees den Heijer and Paolo Manghi and Dieter Van Uytvanck
2020
Is Part Of Dagstuhl Manifestos, Volume 8, Issue 1 (2020)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.8.1.1
urn:nbn:de:0030-drops-132376
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.8.1.1
eng
https://creativecommons.org/licenses/by/3.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:13744
2021-03-31T00:00:00Z
ddc:004
open_access
Web Futures: Inclusive, Intelligent, Sustainable The 2020 Manifesto for Web Science (Dagstuhl Perspectives Workshop 18262)
Berendt, Bettina
Gandon, Fabien
Halford, Susan
Hall, Wendy
Hendler, Jim
Kinder-Kurlanda, Katharina E.
Ntoutsi, Eirini
Staab, Steffen
Web Science
Artificial Intelligence
Web Governance
Capacity Building
This Manifesto was produced from the Perspectives Workshop 18262 entitled "10 Years of Web Science" that took place at Schloss Dagstuhl from June 24 – 29, 2018. At the Workshop, we revisited the origins of Web Science, explored the challenges and opportunities of the Web, and looked ahead to potential futures for both the Web and Web Science.
We explain issues that society faces in the Web by the ambivalences that are inherent in the Web. All the enormous benefits that the Web offers - for information sharing, collective organization and distributed activity, social inclusion and economic growth - will always carry along negative consequences, too, and 30 years after its creation negative consequences of the Web are only too apparent.
The Web continues to evolve and its next major step will involve Artificial Intelligence (AI) at large. AI has the potential to amplify positive and negative outcomes, and we explore these possibilities, situating them within the wider debate about the future of regulation and governance for the Web. Finally, we outline the need to extend Web Science as the science that is devoted to the analysis and engineering of the Web, to strengthen our role in shaping the future of the Web and present five key directions for capacity building that are necessary to achieve this: (i), supporting interdisciplinarity, (ii), supporting collaboration, (iii), supporting the sustainable Web, (iv), supporting the Intelligent Web, and (v), supporting the Inclusive Web.
Our writing reflects our background in several disciplines of the social and technical sciences and that these disciplines emphasize topics to various extents. We are acutely aware that our observations occupy a particular point in time and are skewed towards our experience as Western scholars - a limitation that Web Science will need to overcome.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Bettina Berendt and Fabien Gandon and Susan Halford and Wendy Hall and Jim Hendler and Katharina E. Kinder-Kurlanda and Eirini Ntoutsi and Steffen Staab
2021
Is Part Of Dagstuhl Manifestos, Volume 9, Issue 1 (2021)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.9.1.1
urn:nbn:de:0030-drops-137443
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.9.1.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:13745
2021-03-31T00:00:00Z
ddc:004
open_access
Diversity in News Recommendation (Dagstuhl Perspectives Workshop 19482)
Bernstein, Abraham
de Vreese, Claes
Helberger, Natali
Schulz, Wolfgang
Zweig, Katharina
Baden, Christian
Beam, Michael A.
Hauer, Marc P.
Heitz, Lucien
Jürgens, Pascal
Katzenbach, Christian
Kille, Benjamin
Klimkiewicz, Beate
Loosen, Wiebke
Moeller, Judith
Radanovic, Goran
Shani, Guy
Tintarev, Nava
Tolmeijer, Suzanne
van Atteveldt, Wouter
Vrijenhoek, Sanne
Zueger, Theresa
News
recommender systems
diversity
News diversity in the media has for a long time been a foundational and uncontested basis for ensuring that the communicative needs of individuals and society at large are met. Today, people increasingly rely on online content and recommender systems to consume information challenging the traditional concept of news diversity. In addition, the very concept of diversity, which differs between disciplines, will need to be re-evaluated requiring an interdisciplinary investigation, which requires a new level of mutual cooperation between computer scientists, social scientists, and legal scholars. Based on the outcome of a interdisciplinary workshop, we have the following recommendations, directed at researchers, funders, legislators, regulators, and the media industry:
- Conduct interdisciplinary research on news recommenders and diversity.
- Create a safe harbor for academic research with industry data.
- Strengthen the role of public values in news recommenders.
- Create a meaningful governance framework for news recommenders.
- Fund a joint lab to spearhead the needed interdisciplinary research, boost practical innovation, develop reference solutions, and transfer insights into practice.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Abraham Bernstein and Claes de Vreese and Natali Helberger and Wolfgang Schulz and Katharina Zweig and Christian Baden and Michael A. Beam and Marc P. Hauer and Lucien Heitz and Pascal Jürgens and Christian Katzenbach and Benjamin Kille and Beate Klimkiewicz and Wiebke Loosen and Judith Moeller and Goran Radanovic and Guy Shani and Nava Tintarev and Suzanne Tolmeijer and Wouter van Atteveldt and Sanne Vrijenhoek and Theresa Zueger
2021
Is Part Of Dagstuhl Manifestos, Volume 9, Issue 1 (2021)
Article
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagMan.9.1.43
urn:nbn:de:0030-drops-137456
https://drops.dagstuhl.de/entities/document/10.4230/DagMan.9.1.43
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:172
2005-04-19T00:00:00Z
ddc:004
open_access
03411 Final Report – Language Based Security
Banerjee, Anindya
Mantel, Heiko
Naumann, David
Sabelfeld, Andrei
Access control
information flow
noninterference
downgrading protocol analysis
This paper summarizes the objectives and structure of a seminar with the same title, held from October 5th to 10th 2003 at Schloss Dagstuhl, Germany.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Anindya Banerjee and Heiko Mantel and David Naumann and Andrei Sabelfeld
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 3411, Language-Based Security (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.03411.1
urn:nbn:de:0030-drops-1724
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.03411.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:173
2005-04-19T00:00:00Z
ddc:004
open_access
03411 Abstracts Collection – Language Based Security
Banerjee, Anindya
Mantel, Heiko
Naumann, David
Sabelfeld, Andrei
Access control
information flow
noninterference
downgrading protocol analysis
From October 5th to 10th 2003,the Dagstuhl Seminar 03411
``Language Based security'' 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 are put together in this paper.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Anindya Banerjee and Heiko Mantel and David Naumann and Andrei Sabelfeld
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 3411, Language-Based Security (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.03411.2
urn:nbn:de:0030-drops-1731
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.03411.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:7
2004-10-08T00:00:00Z
ddc:004
open_access
03471 Abstracts Collection – Design of Systems with Predictable Behaviour
Thiele, Lothar
Wilhelm, Reinhard
real-time systems
guarantees
predictability
embedded systems
performance
On 16.11.-19.11.2003, the Perspectives Workshop 03471 "Design of Systems with Predictable Behaviour" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the workshop, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well a digest 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Lothar Thiele and Reinhard Wilhelm
2004
Is Part Of Dagstuhl Seminar Proceedings, Volume 3471, Perspectives Workshop: Design of Systems with Predictable Behaviour (2004)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.03471.1
urn:nbn:de:0030-drops-73
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.03471.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:2
2004-08-04T00:00:00Z
ddc:004
open_access
Design for Time-Predictability
Thiele, Lothar
Wilhelm, Reinhard
real-time systems
guarantees
predictability
embedded systems
performance
A large part of safety-critical embedded systems has to satisfy hard real-time
constraints. These need sound methods and tools to derive reliable run-time guarantees.
The guaranteed run times should not only be reliable, but also precise.
The achievable precision highly depends on characteristics of the target architecture
and the implementation methods and system layers of the software. Trends in
hardware and software design run contrary to predictability. This article describes
threats to time-predictability of systems and proposes design principles that support
time predictability. The ultimate goal is to design performant systems with
sharp upper and lower bounds on execution times.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Lothar Thiele and Reinhard Wilhelm
2004
Is Part Of Dagstuhl Seminar Proceedings, Volume 3471, Perspectives Workshop: Design of Systems with Predictable Behaviour (2004)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.03471.2
urn:nbn:de:0030-drops-23
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.03471.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:6
2004-09-10T00:00:00Z
ddc:004
open_access
Fast, predictable and low energy memory references through architecture-aware compilation
Marwedel, Peter
Wehmeyer, Lars
Verma, Manish
Steinke, Stefan
Helmig, Urs
Embedded system
compiler
energy efficiency
low power
WCET
scratchpad
memory access
The design of future high-performance embedded systems is hampered
by two problems: First, the required hardware needs more energy than is
available from batteries. Second, current cache-based approaches for bridging the
increasing speed gap between processors and memories cannot guarantee predictable
real-time behavior. A contribution to solving both problems is made in
this paper which describes a comprehensive set of algorithms that can be applied
at design time in order to maximally exploit scratch pad memories (SPMs). We
show that both the energy consumption as well as the computed worst case execution
time (WCET) can be reduced by up to to 80% and 48%, respectively, by
establishing a strong link between the memory architecture and the compiler.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Peter Marwedel and Lars Wehmeyer and Manish Verma and Stefan Steinke and Urs Helmig
2004
Is Part Of Dagstuhl Seminar Proceedings, Volume 3471, Perspectives Workshop: Design of Systems with Predictable Behaviour (2004)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.03471.3
urn:nbn:de:0030-drops-66
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.03471.3
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:5
2004-09-10T00:00:00Z
ddc:004
open_access
Requirements for and Design of a Processor with Predictable Timing
Berg, Christoph
Engblom, Jakob
Wilhelm, Reinhard
WCET
hard real-time
embedded systems
computer architecture
This paper introduces a set of design principles that aim to make processor
architectures amenable to static timing analysis. Based on these principles,
we give a design of a hard real-time processor with predictable timing, which is
simultaneously capable of reaching respectable performance levels.
The design principles we identify are recoverability from information loss in
the analysis, minimal variation of the instruction timing, non-interference between
processor components, deterministic processor behavior, and comprehensive
documentation. The principles are based on our experience and that of other
researchers in building timing analysis tools for existing processors.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Christoph Berg and Jakob Engblom and Reinhard Wilhelm
2004
Is Part Of Dagstuhl Seminar Proceedings, Volume 3471, Perspectives Workshop: Design of Systems with Predictable Behaviour (2004)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.03471.4
urn:nbn:de:0030-drops-57
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.03471.4
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:4
2004-09-10T00:00:00Z
ddc:004
open_access
Simplicity Considered Fundamental to Design for Predictability
Halang, Wolfgang
Design for predictability
simplicity
dependability
safety
real-time
Complexity is the core problem of contemporary information technology, as the artificial complicatedness of its artefacts is exploding Intellectually easy and economically feasible predictability can be achieved by selecting simplicity as fundamental design principle. Predictability of system behaviour is identified as the central concept for the design of real-time and embedded systems, since it essentially implies the other requirements timeliness and dependability holding for them. Practically all dynamic and virtual features aiming to enhance the average performance of computing systems as well as the traditional categories and optimality criteria are found inadequate and are, thus, considered harmful. In mainstream research on scheduling the gap between academic research and reality has grown so wide that research results are doomed to irrelevance. Instead, useful scheduling research ought to employ utmost simplicity as optimality criterion, and strive to minimise software size and complexity. Computing should embrace other disciplines’ notions and technologies of time. Programming and verification methods for safety-related applications are identified on the basis of their simplicity and ergonomic aptitude. It is advocated to utilise the permanent advances in microelectronics to solve long untackled problems and to foster simplicity and predictability by hardware support.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Wolfgang Halang
2004
Is Part Of Dagstuhl Seminar Proceedings, Volume 3471, Perspectives Workshop: Design of Systems with Predictable Behaviour (2004)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.03471.5
urn:nbn:de:0030-drops-46
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.03471.5
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:456
2006-03-29T00:00:00Z
ddc:004
open_access
04021 Abstracts Collection – Content-Based Retrieval
Malik, Jitendra
Samet, Hanan
Veltkamp, Remco
Zisserman, Andrew
Object recognition
semantic-based retrieval
indexing schemes
matching algorithms
shape
texture
color
and lay-out matching
relevance feedback
From 04.01.04 to 09.01.04, the Dagstuhl Seminar 04021 ``Content-Based Retrieval''
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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jitendra Malik and Hanan Samet and Remco Veltkamp and Andrew Zisserman
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4021, Content-Based Retrieval (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04021.1
urn:nbn:de:0030-drops-4563
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04021.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:457
2006-03-13T00:00:00Z
ddc:004
open_access
04041 Abstracts Collection – Component-Based Modeling and Simulation
Barros, Fernando J.
Lehmann, Axel
Liggesmeyer, Peter
Verbraeck, Alexander
Zeigler, Bernhard P.
System-theoretic definitions and foundations for model- components
specification of model components
hierarchical
model-based model development cost-benefit
quality
performance
relibility
and reusability aspects
From 18.01.04 to 23.01.04, the Dagstuhl Seminar 04041 ``Component-Based Modeling and Simulation'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Fernando J. Barros and Axel Lehmann and Peter Liggesmeyer and Alexander Verbraeck and Bernhard P. Zeigler
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4041, Component-Base Modeling and Simulation (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04041.1
urn:nbn:de:0030-drops-4572
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04041.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:532
2006-04-13T00:00:00Z
ddc:004
open_access
04051 Abstracts Collection – Perspectives Workshop: Empirical Theory and the Science of Software Engineering
Herbsleb, James D.
Tichy, Walter F.
From 25.01.04 to 29.01.04, the Dagstuhl Seminar 04051 ``Perspectives Workshop: Empirical Theory and the Science of Software Engineering'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
James D. Herbsleb and Walter F. Tichy
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4051, Perspectives Workshop: Empirical Theory and the Science of Software Engineering (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04051.1
urn:nbn:de:0030-drops-5323
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04051.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:458
2006-03-13T00:00:00Z
ddc:004
open_access
04061 Abstracts Collection – Real Computation and Complexity
Lickteig, Thomas
Meer, Klaus
Pardo, Luis Miguel
Real algebraic complexity and lower bounds
numerical methods
homotopy methods
condition as complexity ingredient
symbolic methods
bit complexity
From 01.02.04 to 06.02.04, the Dagstuhl Seminar 04061 ``Real Computation and Complexity'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Thomas Lickteig and Klaus Meer and Luis Miguel Pardo
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4061, Real Computation and Complexity (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04061.1
urn:nbn:de:0030-drops-4584
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04061.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:499
2006-03-13T00:00:00Z
ddc:004
open_access
04061 Summary – Real Computation and Complexity
Lickteig, Thomas
Meer, Klaus
Pardo, Luis Miguel
The seminar "Real Computation and Complexity" was intended as a meeting
place of several tendencies in the complexity analysis of algorithms in real computation.
One main idea therefore was to bring together scientists with rather
different backgrounds such as numerical analysis, symbolic computing, real and
complex algebraic geometry, logic, differential algebra and computational complexity.
This broadness guaranteed to get a thorough overview of current results,
methods and trends in the area. It allowed as well to discuss main problems
related to all aspects of real computation and complexity from different perspectives.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Thomas Lickteig and Klaus Meer and Luis Miguel Pardo
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4061, Real Computation and Complexity (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04061.2
urn:nbn:de:0030-drops-4994
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04061.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:498
2006-03-10T00:00:00Z
ddc:004
open_access
04081 Abstracts Collection – Theory of Evolutionary Algorithms
Beyer, Hans-Georg
Jansen, Thomas
Reeves, Colin
Vose, Michael D.
Evolutionary algorithms
genetic programming
co-evolution
run time analysis
landscape analysis
Markov chains
From 15.02.04 to 20.02.04, the Dagstuhl Seminar 04081 ``Theory of Evolutionary Algorithms'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Hans-Georg Beyer and Thomas Jansen and Colin Reeves and Michael D. Vose
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4081, Theory of Evolutionary Algorithms (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04081.1
urn:nbn:de:0030-drops-4981
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04081.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:175
2005-05-04T00:00:00Z
ddc:004
open_access
04091 Abstracts Collection – Data Structures
Albers, Susanne
Sedgewick, Robert
Wagner, Dorothea
Cache oblivious algorithms
cell probe model
computational geometry
data compression
dictionaries
finger search
hashing
heaps I/O efficiency
lower bounds
From 22.02. to 27.02.2004, Dagstuhl Seminar "Data Structures"
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
are put together in this paper. The first section
describes the seminar topics and goals in general.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Susanne Albers and Robert Sedgewick and Dorothea Wagner
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4091, Data Structures (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04091.1
urn:nbn:de:0030-drops-1758
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04091.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:25
2005-02-07T00:00:00Z
ddc:004
open_access
04101 Abstracts Collection – Language Engineering for Model-Driven Software Development
Bézivin, Jean
Heckel, Reiko
Dagstuhl Seminar 04101
From
29.02. to 05.03.04,
the Dagstuhl Seminar
04101
``Language Engineering for Model-Driven Software Development''
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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jean Bézivin and Reiko Heckel
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.1
urn:nbn:de:0030-drops-258
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:11
2005-02-02T00:00:00Z
ddc:004
open_access
04101 Discussion – A Taxonomy of Model Transformations
Mens, Tom
Czarnecki, Krzysztof
Gorp, Pieter Van
taxonomy
model transformations
This report summarises the results of the discussions of a working group on model transformation of the Dagstuhl Seminar on Language Engineering for Model-Driven Software Development. The main contribution is a taxonomy of model transformation. This taxonomy can be used to help developers in deciding which model transformation approach is best suited to deal with a particular problem.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Tom Mens and Krzysztof Czarnecki and Pieter Van Gorp
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.2
urn:nbn:de:0030-drops-111
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:10
2005-02-01T00:00:00Z
ddc:004
open_access
04101 Summary – Language Engineering for Model-driven Software Development
Bézivin, Jean
Heckel, Reiko
Dagstuhl Seminar 04101
This paper summarizes the objectives and structure of a seminar with the same title, held from February 29th to April 5th 2004 at Schloss Dagstuhl, Germany.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jean Bézivin and Reiko Heckel
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.3
urn:nbn:de:0030-drops-101
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.3
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:20
2005-02-07T00:00:00Z
ddc:004
open_access
A MDA Approach to Model & Implement Transformations
Jezequel, Jean-Marc
no keywords
Only in software and in linguistics a model has the same
nature as the thing it models. In software at least, this opens the possibility
to automatically derive software from its model. This property is
well known from any compiler writer (and others), but it was recently be
made quite popular with an OMG initiative called the Model Driven Architecture
(MDA). The model transformations allowing the engineers to
more or less automatically go from platform-independent models (PIM)
to platform-specific models (PSM) are increasingly seen as vital assets
that must be managed with sound software engineering principles. We
believe that transformations should be first-class models in the MDA
world; we propose to adopt the object-oriented approach and to leverage
the expressive power of UML as a metamodel defining the transformation
language.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jean-Marc Jezequel
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.4
urn:nbn:de:0030-drops-202
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.4
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:14
2005-02-07T00:00:00Z
ddc:004
open_access
An Example for Metamodeling Syntax and Semantics of Two Languages, their Transformation, and a Correctness Criterion
Gogolla, Martin
no keywords
We study a metamodel for the Entity Relationship (ER) and
the Relational data model. We do this by describing the syntax of the
ER data model by introducing classes for ER schemata, entities, and
relationships. We also describe the semantics of the ER data model by
introducing classes for ER states, instances, and links. The connection
between syntax and semantics is established by associations explaining that syntactical objects are interpreted by corresponding semantical objects.
Analogously we do this for the Relational data model. Finally, we give a metamodel for the transformation of ER schemata into Relational database schemata. By characterizing the syntax and semantics of the languages to be transformed and also the transformation itself within the same (meta-)modeling language we are able to include equivalence criteria on the syntactical and on the semantical level for the transformation. In particular, we show that the semantical equivalence criterion requires that the ER states and the corresponding Relational states bear the same information.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Martin Gogolla
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.5
urn:nbn:de:0030-drops-143
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.5
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:12
2005-02-02T00:00:00Z
ddc:004
open_access
Application of Graph Transformation for Automating Web Service Discovery
Heckel, Reiko
Cherchago, Alexey
SOA
graph transformation
contracts
The paper represents current achievements of an ongoing research that aims to develop a formal approach supporting an automatic selection of a Web service sought by a requestor. The approach is based on the matching the requestor’s requirements for a "useful" service against the service description offered by the provider. We focus on the checking behavioral compatibility between operation contracts specifying pre-conditions and effects of required and provided operations. Graph transformation rules with positive application conditions are proposed as a visual formal notation for contracts. The desired dependence between requestor and provider contracts is determined by the semantic compatibility relation and syntactic matching procedure that is sound
w.r.t. this relation.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Reiko Heckel and Alexey Cherchago
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.6
urn:nbn:de:0030-drops-121
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.6
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:21
2005-02-04T00:00:00Z
ddc:004
open_access
Foundations of Meta-Pyramids: Languages vs. Metamodels – Episode II: Story of Thotus the Baboon
Favre, Jean-Marie
models
reverse engineering
transformations
Despite the recent interest for Model Driven Engineering approaches,
the so-called four-layers metamodelling architecture is subject to a
lot of debate. The relationship that exists between a model and a metamodel
is often called instanceOf, but this terminology, which comes directly from
the object oriented technology, is not appropriate for the modelling of similar
meta-pyramids in other domains. The goal of this paper is to study which are
the foundations of the meta-pyramids independently from a particular technology.
This paper is actually the second episode of the series "From Ancient
Egypt to Model Driven Engineering". In the pilot episode, the notion of megamodel
was introduced to model essential Model Driven Engineering concepts.
The notion of models was thoroughly discussed and only one association,
namely RepresentationOf was introduced. In this paper the megamodel
is extended with one fundamental relation in order to model the notion of languages
and of metamodels. It is shown how Thotus the Baboon helped
Nivizeb the priest in designing strong foundations for meta-pyramids. The
secrets of some ancient pyramids are revealed.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jean-Marie Favre
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.7
urn:nbn:de:0030-drops-212
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.7
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:13
2005-02-02T00:00:00Z
ddc:004
open_access
Foundations of Model (Driven) (Reverse) Engineering : Models – Episode I: Stories of The Fidus Papyrus and of The Solarus
Favre, Jean-Marie
models
reverse engineering
transformations
Model Driven Engineering (MDE) received a lot of attention in the last years, both from academia and industry. However, there is still a debate on which basic concepts form the foundation of MDE. The Model Driven Architecture (MDA) from the OMG does not provided clear answers to this question. This standard instead provides a complex set of interdependent technologies. This paper is the first of a series aiming at defining the foundations of MDE independently from a particular technology. A megamodel is introduced in this paper and incrementally refined in further papers from the series. This paper is devoted to a single concept, the concept of model, and to a single relation, the RepresentationOf relation. The lack of strong foundations for the MDA 4-layers meta-pyramid leads to a common mockery: ``So, MDA is just about Egyptology?!''. This paper is the pilot of the series called ``From Ancient Egypt to Model Driven Engineering''. The various episodes of this series show that Egyptology is actually a good model to study MDE.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jean-Marie Favre
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.8
urn:nbn:de:0030-drops-136
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.8
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:17
2005-02-07T00:00:00Z
ddc:004
open_access
Graph Transformation Based Models of Dynamic Software Architectures and Architectural Styles
Thöne, Sebastian
no keywords
no abstract
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Sebastian Thöne
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.9
urn:nbn:de:0030-drops-174
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.9
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:16
2005-02-07T00:00:00Z
ddc:004
open_access
Graph Transformation in a Nutshell
Heckel, Reiko
graph transformation
Even sophisticated techniques start out from simple ideas. Later, in reply to application needs or theoretical problems new concepts are introduced and new formalizations proposed, often to a point where the original simple core is hardly recognizable. In this paper we provide a non-technical introduction to the basic concepts of typed graph transformation systems, completed with a survey of more advanced concepts, and explain some of its history and motivations.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Reiko Heckel
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.10
urn:nbn:de:0030-drops-169
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.10
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:15
2005-02-07T00:00:00Z
ddc:004
open_access
Language Engineering in Practice
Große-Rhode, Martin
no keywords
no abstract
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Martin Große-Rhode
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.11
urn:nbn:de:0030-drops-151
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.11
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:22
2005-02-07T00:00:00Z
ddc:004
open_access
Multi-Domain Integration with MOF and extended Triple Graph Grammars
Königs, Alexander
Schürr, Andy
no keywords
One aim of tool integration is designing an
integrated development environment that accesses
the data/models of different tools and keeps them
consistent throughout a project being considered.
Present approaches that aim for data integration
by specifying (graphically denoted) consistency
checking constraints or consistency preserving
transformations are restricted to pairs of
documents. We present an example that motivates
the need for a more general data/model
integration approach which is able to integrate an
arbitrary number of MOF-compliant models.
From a formal point of view this approach is a
generalization of the triple graph grammar
document integration approach. From a practical
point of view it is a proposal how to specify multidirectional
declarative model transformations in
the context of OMG’s model-driven architecture
(MDA) development efforts and its request for
proposals for a MOF-compliant "query, view, and
transformation" (QVT) approach.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Alexander Königs and Andy Schürr
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.12
urn:nbn:de:0030-drops-225
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.12
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:19
2005-02-07T00:00:00Z
ddc:004
open_access
Refinement and Consistency in Multiview Models
Wehrheim, Heike
no keywords
Model transformations are an integral part of OMG's standard for Model Driven Architecture (MDA). Model transformations should at the best allow for a seamless transition from high-level models to actual implementations. They are therefore required to be behaviour preserving: models (or the final implementation) at lower levels should adhere to the descriptions given in higher level models. Moreover, for complex systems models usually consists of descriptions of different views on the system. Consequently, different kinds of model transformations take place on different views, and together they should guarantee behaviourpreservation. In this paper we discuss the applicability of formal methods to model transformations. Formal methods come with build-in notions of transformations between models, or more precisely, with refinement and subtyping concepts which provide means for comparing models on different
levels with respect to their behaviour. Such notions can be applied as
correctness criteria for evaluating model transformations. Moreover, refinement and subtyping concepts for different views can be shown to neatly fit together. This is achieved by giving a common semantics to all views which furthermore opens the possibility of checking consistency between them.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Heike Wehrheim
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.13
urn:nbn:de:0030-drops-190
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.13
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:24
2005-02-07T00:00:00Z
ddc:004
open_access
Subjects, Models, Languages, Transformations
Rensink, Arend
no keywords
Discussions about model-driven approaches tend to be hampered
by terminological confusion. This is at least partially caused by
a lack of formal precision in defining the basic concepts, including that
of \model" and \thing being modelled" | which we call subject in this
paper. We propose a minimal criterion that a model should fulfill: essentially,
it should come equipped with a clear and unambiguous membership
test; in other words, a notion of which subjects it models. We then go
on to discuss a certain class of models of models that we call languages,
which apart from defining their own membership test also determine
membership of their members. Finally, we introduce transformations on
each of these layers: a subject transformation is essentially a pair of subjects,
a model transformation is both a pair of models and a model of
pairs (namely, subject transformations), and a language transformation
is both a pair of languages and a language of model transformations.
We argue that our framework has the benefits of formal precision (there
can be no doubt about whether something satifies our criteria for being
a model, a language or a transformation) and minimality (it is hard to
imagine a case of modelling or transformation not having the characterstics
that we propose).
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Arend Rensink
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.14
urn:nbn:de:0030-drops-242
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.14
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:23
2005-02-07T00:00:00Z
ddc:004
open_access
What is a Model?
Kühne, Thomas
no keywords
With the recent trend to model driven development a commonly
agreed notion of \model" becomes a pivotal issue. However, currently
there is little consensus about what exactly a model is and what it is
not. Furthermore, basic terms such as \metamodel" are far from being
understood in the same way by all members of the modeling community.
This article attempts to start establishing a consensus about generally
acceptable terminology. Its main contribution is the distinction between
two fundamentally different kinds of models, i.e. \type model" versus
\token model". The recognition of the fundamental difference in these
two kinds of models is crucial to avoid misunderstandings and unnecessary
disputes among members of the modeling community.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Thomas Kühne
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.15
urn:nbn:de:0030-drops-237
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.15
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:18
2005-02-07T00:00:00Z
ddc:004
open_access
Write Once, Deploy N: a Performance Oriented MDA Case Study
Gorp, Pieter Van
model transformation
consistency management
qvt
mda
ocl
To focus the comparison of languages for model checking and transformation on criteria that matter in practical development, there is an urgent need for more, realistic case studies. In this paper, we first present the problem of developing distributed database applications that are optimized for concurrent data access, without locking in on vendor extensions of a particular J2EE application server, with proper separation of concerns, and with tool support for domain evolution. Then, we propose and discuss a conceptual language for model refinement and code generation as a possible solution to the presented problem. After applying this particular language on our case study, we derive general conclusions on composition, sequencing, inheritance, and design by contract for such languages.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Pieter Van Gorp
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4101, Language Engineering for Model-Driven Software Development (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04101.16
urn:nbn:de:0030-drops-181
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04101.16
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:501
2006-06-27T00:00:00Z
ddc:004
open_access
04121 Abstracts Collection – Evaluating Embodied Conversational Agents
Ruttkay, Zsofia
André, Elisabeth
Johnson, W. Lewis
Pelachaud, Catherine
Critical evaluation of some implemented EcAs
issues and framework for evaluation and design
From 14.03.04 to 19.03.04, the Dagstuhl Seminar 04121 ``Evaluating Embodied Conversational Agents'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Zsofia Ruttkay and Elisabeth André and W. Lewis Johnson and Catherine Pelachaud
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4121, Evaluating Embodied Conversational Agents (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04121.1
urn:nbn:de:0030-drops-5015
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04121.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:462
2006-06-27T00:00:00Z
ddc:004
open_access
04121 Working Group 2 – Design criteria, techniques and case studies for creating and evaluating interactive experiences for virtual humans
Gratch, Jonathan
Egges, Arjan
Eliens, Anton
Isbister, Katherine
Marsella, Stacy
Paiva, Ana
Rist, Thomas
ten Hagen, Paul
How does one go about designing a human? With the rise in recent years of virtual humans this is no longer purely a philosophical question. Virtual humans are intelligent agents with a body, often a human-like graphical body, that interact verbally and non-verbally with human users on a variety of tasks and applications. Our working group approached this question from the perspective of interactivity. Specifically, how can one design effective interactive experiences involving a virtual human, and what constraints does this goal place on the form and function of an embodied conversational agent.
Our group grappled with several related questions: What ideals should designers aspire to, what sources of theory and data will best lead to this goal and what methodologies can inform and validate the design process? A longer article (.pdf) summarizes the output of this WG and suggests a specific framework, borrowed from interactive media design, as a vehicle for advancing the state of interactive experiences with virtual humans.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jonathan Gratch and Arjan Egges and Anton Eliens and Katherine Isbister and Stacy Marsella and Ana Paiva and Thomas Rist and Paul ten Hagen
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4121, Evaluating Embodied Conversational Agents (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04121.2
urn:nbn:de:0030-drops-4621
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04121.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:461
2006-03-14T00:00:00Z
ddc:004
open_access
ECA Perspectives - Requirements, Applications, Technology
Eliens, Anton
Huang, Zhisheng
Hoorn, Johan F.
Visser, Cees T.
Embodied agents
virtual environments
rich media
In the last years we have developed a platform for
the realization of embodied (conversational)
agents, in a distributed logic programming
framework. In this paper we will present an
overview of our work, by discussing the
requirements that acted as our guidelines for
design decisions during development, some of the
applications that have served as target
demonstrators for developing and testing new
functionality, and the (distributed logic
programming) technology which we used for the
realization of the platform and the implementation
of our STEP scripting language.
Although the focus of our paper will primarily be
our own DLP+X3D platform, we believe that our
discussion along the perspectives of requirements,
applications and technology might be more generally
worthwhile in establishing the relative merits of
the operational use of ECA-technology. At the end
of this paper, we will moreover provide some hints
of how to approach the experimental validation of
the (possible) benefits of embodied conversational
agents in user applications.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Anton Eliens and Zhisheng Huang and Johan F. Hoorn and Cees T. Visser
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4121, Evaluating Embodied Conversational Agents (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04121.3
urn:nbn:de:0030-drops-4611
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04121.3
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:586
2006-06-27T00:00:00Z
ddc:004
open_access
Evaluating ECAs - What,how and why?
Ruttkay, Zsofia
Dormann, Claire
Noot, Han
Embodied conversational agents
design
evaluation framework
methodology
One would like to rely on design guidelines for embodied conversational
agents (ECAs), grounded on evaluation studies. How to define the physical and
mental characteristics of an ECA, optimal for an envisioned application? What will be the added value of using an ECA? Although there have been studies addressing such issues, we are still far from getting a complete picture. This is not only due to the still relatively little experience with applications of ECAs, but also to the diversity in terms and experimental settings used. The lack of a common, established framework makes it difficult to compare ECAs, interpret evaluation results and judge their scope and relevance. In this paper we propose a common taxonomy of the relevant design and evaluation aspects of ECAs. We refer to recent works to elicit evaluation concepts
and discuss measurement issues.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Zsofia Ruttkay and Claire Dormann and Han Noot
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4121, Evaluating Embodied Conversational Agents (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04121.4
urn:nbn:de:0030-drops-5867
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04121.4
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:460
2006-03-14T00:00:00Z
ddc:004
open_access
Evaluating Embodied Conversational Agents in Collaborative Virtual Environments
Gerhard, Michael
Embodied Conversational Agents,Collaborative Virtual Environments
Presence
There are currently no evaluation methods
specific to ECAs in CVEs and traditional
evaluation methods are limited in their
applicability and consequently unlikely to
address the full range of aspects now inherent in
such systems. We argue that a combination of
controlled experimentation, quasi-experiments,
review-based evaluation and heuristic expert
reviews is needed. To operationalise these
traditional evaluation methods the concept of
presence was deployed, and it was argued that
presence as a cognitive variable can be measured
and that such a measure can be a key indicator of
the usability of ECAs in CVEs. Presence measures
can be administered within controlled experiments
and quasi-experiments to test certain aspects of
the system. Such experiments might turn out
particularly useful as a means of selecting
between two or more design options and it is
argued that issues concerning ECAs in CVEs can be
meaningfully evaluated by comparing subjects’
experience of presence. Further, although
implementation issues were not the primary
concern of this study, the strength and
shortcomings of the prototype agent were
evaluated as secondary variables within that
experiment. A set of criteria developed for the
evaluation of the strengths and shortcomings of
the current prototype agent are partly based on
Nielsen’s general usability guidelines and partly
on a set of heuristics proposed for non-embodied conversational systems.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Michael Gerhard
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4121, Evaluating Embodied Conversational Agents (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04121.5
urn:nbn:de:0030-drops-4609
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04121.5
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:464
2006-04-13T00:00:00Z
ddc:004
open_access
04122 Abstracts Collection – Wireless Sensor Networks and Applications
Ferscha, Alois
Olariu, Stephan
Pfeifer, Tom
Energy-efficient training and self-organisation
failure recovery and recalibration
resource management and Connection Admission Control (CAC)
Media Access (MAC) protocols for wireless sensor network
network management scenarios and solutions
From 14.03.04 to 19.03.04, the Dagstuhl Seminar 04122 ``Wireless Sensor Networks and Applications'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Alois Ferscha and Stephan Olariu and Tom Pfeifer
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4122, Wireless Sensor Networks and Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04122.1
urn:nbn:de:0030-drops-4648
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04122.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:465
2006-03-20T00:00:00Z
ddc:004
open_access
04131 Abstracts Collection – Geometric Properties from Incomplete Data
Klette, Reinhard
Kozera, Ryszard
Noakes, Lyle
Weickert, Joachim
From 21.03.04 to 26.03.04, the Dagstuhl Seminar 04131 ``Geometric Properties from Incomplete Data'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Reinhard Klette and Ryszard Kozera and Lyle Noakes and Joachim Weickert
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4131, Geometric Properties from Incomplete Data (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04131.1
urn:nbn:de:0030-drops-4652
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04131.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:467
2006-03-16T00:00:00Z
ddc:004
open_access
04161 Abstracts Collection – Detecting Local Patterns
Boulicaut, Jean-François
Morik, Katharina
Siebes, Arno
From 12.04.04 to 16.04.04, the Dagstuhl Seminar 04161 ``Detecting Local Patterns'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jean-François Boulicaut and Katharina Morik and Arno Siebes
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4161, Detecting Local Patterns (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04161.1
urn:nbn:de:0030-drops-4677
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04161.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:468
2006-03-10T00:00:00Z
ddc:004
open_access
04171 Abstracts Collection – Logic Based Information Agents
Dix, Jürgen
Eiter, Thomas
Franconi, Enrico
From 18.04.04 to 23.04.04, the Dagstuhl Seminar 04171 ``Logic Based Information Agents'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jürgen Dix and Thomas Eiter and Enrico Franconi
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4171, Logic Based Information Agents (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04171.1
urn:nbn:de:0030-drops-4689
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04171.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:469
2006-03-10T00:00:00Z
ddc:004
open_access
04172 Abstracts Collection – Perspectives Workshop: Visualization and Image Processing of Tensor Fields
Weickert, Joachim
Hagen, Hans
From 18.04.04 to 23.04.04, the Dagstuhl Seminar 04172 ``Perspectives Workshop: Visualization and Image Processing of Tensor Fields'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Joachim Weickert and Hans Hagen
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4172, Perspectives Workshop: Visualization and Image Processing of Tensor Fields (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04172.1
urn:nbn:de:0030-drops-4692
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04172.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:9
2004-11-30T00:00:00Z
ddc:004
open_access
The Atomic Manifesto: a Story in Four Quarks
Jones, Cliff
Lomet, David
Romanovsky, Alexander
Weikum, Gerhard
Fekete, Alan
Gaudel, Marie-Claude
Korth, Henry F.
de Lemos, Rogerio
Moss, Eliot
Rajwar, Ravi
Ramamritham, Krithi
Randell, Brian
Rodrigues, Luis
Atomic Actions
Transaction Processing
Database Systems
Dependability
Fault Tolerance
Formal Methods
Correctness Reasoning
This report summarizes the viewpoints and insights gathered in the Dagstuhl Seminar on Atomicity in System Design and Execution, which was attended by 32 people from four different scientific communities: database and transaction processing systems, fault tolerance and dependable systems, formal methods for system design and correctness reasoning, and hardware architecture and programming languages. Each community presents its position in interpreting the notion of atomicity and the existing state of the art, and each community identifies scientific challenges that should be addressed in future work. In addition, the report discusses common themes across communities and strategic research problems that require multiple communities to team up for a viable solution.
The general theme of how to specify, implement, compose, and reason about extended
and relaxed notions of atomicity is viewed as a key piece in coping with
the pressing issue of building and maintaining highly dependable systems that
comprise many components with complex interaction patterns.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Cliff Jones and David Lomet and Alexander Romanovsky and Gerhard Weikum and Alan Fekete and Marie-Claude Gaudel and Henry F. Korth and Rogerio de Lemos and Eliot Moss and Ravi Rajwar and Krithi Ramamritham and Brian Randell and Luis Rodrigues
2004
Is Part Of Dagstuhl Seminar Proceedings, Volume 4181, Atomicity in System Design and Execution (2004)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04181.1
urn:nbn:de:0030-drops-93
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04181.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:503
2006-03-14T00:00:00Z
ddc:004
open_access
04201 Abstracts Collection – Content Distribution Infrastructures
Griwodz, Carsten
Plagemann, Thomas Peter
Steinmetz, Ralf
Content distribution networks
peer-to-peer
overlay networks
From 11.05.04 to 14.05.04, the Dagstuhl Seminar 04201 ``Content Distribution Infrastructures'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Carsten Griwodz and Thomas Peter Plagemann and Ralf Steinmetz
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4201, Content Distribution Infrastructures (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04201.1
urn:nbn:de:0030-drops-5039
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04201.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:502
2006-03-14T00:00:00Z
ddc:004
open_access
04201 Summary – Content Distribution Infrastructures
Griwodz, Carsten
Plagemann, Thomas Peter
Steinmetz, Ralf
Content distribution networks
peer-to-peer
overlay networks
We provide a summary of the Dagstuhl workshop on content distribution infrastructures. The presentations and group discussions of the workshop are summarized in context, and visionary and outrageous opinions of the workshop participants are described.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Carsten Griwodz and Thomas Peter Plagemann and Ralf Steinmetz
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4201, Content Distribution Infrastructures (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04201.2
urn:nbn:de:0030-drops-5021
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04201.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:470
2006-03-29T00:00:00Z
ddc:004
open_access
04211 Abstracts Collection – Algorithms and Number Theory
Cremona, John
Pohst, Michael E.
Algorithmic number theory seminar at Dagstuhl
From 16.05.04 to 21.05.04, the Dagstuhl Seminar 04211 ``Algorithms and Number Theory'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
John Cremona and Michael E. Pohst
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4211, Algorithms and Number Theory (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04211.1
urn:nbn:de:0030-drops-4701
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04211.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:273
2005-09-19T00:00:00Z
ddc:004
open_access
04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes
Brandstädt, Andreas
Corneil, Derek G.
Jansen, Klaus
Spinrad, Jeremy P.
Graph algorithms
graph classes
graph algorithms
robust algorithms
approximation
From 23.05.04 to 28.05.04, the Dagstuhl Seminar
04221 ``Robust and Approximative Algorithms on Particular Graph Classes'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Andreas Brandstädt and Derek G. Corneil and Klaus Jansen and Jeremy P. Spinrad
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4221, Robust and Approximative Algorithms an Particular Graph Classes (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04221.1
urn:nbn:de:0030-drops-2732
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04221.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:8
2004-11-19T00:00:00Z
ddc:004
open_access
04231 Abstracts Collection – Scheduling in Computer and Manufacturing Systems
Blazewicz, Jacek
Ecker, Klaus
Pesch, Erwin
Trystram, Denis
Scheduling
During 31.05.-04.06.04, the Dagstuhl Seminar 04231 "Scheduling in Computer and Manufacturing 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jacek Blazewicz and Klaus Ecker and Erwin Pesch and Denis Trystram
2004
Is Part Of Dagstuhl Seminar Proceedings, Volume 4231, Scheduling in Computer and Manufacturing Systems (2004)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04231.1
urn:nbn:de:0030-drops-81
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04231.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:27
2005-02-18T00:00:00Z
ddc:004
open_access
04241 Abstracts Collection – Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems
König, Barbara
Montanari, Ugo
Gardner, Philippa
graph transformation
process calculi
Recently there has been a lot of research, combining concepts of process algebra with those of the theory of graph grammars and graph transformation systems. Both can be viewed as general frameworks in which one can specify and reason about concurrent and distributed systems. There are many areas where both theories overlap and this reaches much further than just using graphs to give a graphic representation to processes.
Processes in a communication network can be seen in two different ways: as terms in an algebraic theory, emphasizing their behaviour and their interaction with the environment, and as nodes (or edges) in a graph, emphasizing their topology and their connectedness. Especially topology, mobility and dynamic reconfigurations at
runtime can be modelled in a very intuitive way using graph transformation. On the other hand the definition and proof of behavioural equivalences is often easier in the process algebra setting.
Also standard techniques of algebraic semantics for universal constructions, refinement and compositionality can take better advantage of the process algebra representation. An important example where the combined theory is more convenient than both alternatives is for defining the concurrent (noninterleaving), abstract semantics of distributed systems. Here graph transformations lack abstraction and process algebras lack expressiveness.
Another important example is the work on bigraphical reactive systems with the aim of deriving a labelled transitions system from an unlabelled reactive system such that the resulting bisimilarity is a congruence. Here, graphs seem to be a convenient framework, in which this theory can be stated and developed.
So, although it is the central aim of both frameworks to model and reason about concurrent systems, the semantics of processes can have a very different flavour in these theories. Research in this area aims at combining the advantages of both frameworks and translating concepts of one theory into the other. The Dagsuthl Seminar, which took place from 06.06. to 11.06.2004, was aimed at bringing together researchers of the two communities in order to share their ideas and develop new concepts. These proceedings4 of the do not only contain abstracts of the talks given at the seminar, but also summaries of topics of central interest. We would like to thank all participants of the seminar for coming and sharing their ideas and everybody who has contributed to the proceedings.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Barbara König and Ugo Montanari and Philippa Gardner
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4241, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04241.1
urn:nbn:de:0030-drops-279
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04241.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:28
2005-02-18T00:00:00Z
ddc:004
open_access
Summary 1: Adhesivity, Bigraphs and Bisimulation Congruences
Sobocinski, Pawel
graph transformation
category theory
bisimulation
This paper is intended as a short informal summary of some
of the topics which arose at the Dagstuhl meeting held 6/06/04-11/06/04.
In particular, we shall summarise some of the content of talks by H. Ehrig, F. Gadducci, O. H. Jensen, R. Milner, B. K�¶nig,
V. Sassone and the author. The general areas include adhesive
categories and generalisations, contextual labelled transition semantics
for graph transformation systems via borrowed-contexts and GIPOs, and
bigraphs. We shall conclude with a summary of some of the discussions
which followed the aforementioned presentations.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Pawel Sobocinski
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4241, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04241.2
urn:nbn:de:0030-drops-286
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04241.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:29
2005-02-18T00:00:00Z
ddc:004
open_access
Summary 2: Graph Grammar Verification through Abstraction
Baldan, Paolo
König, Barbara
Rensink, Arend
graph transformation
verification
Until now there have been few contributions concerning the
verification of graph grammars, specifically of infinite-state graph
grammars. This paper compares two existing approaches, based on
abstractions of graph transformation systems. While in the unfolding
approach graph grammars are approximated by Petri nets, in the
partitioning approach graphs are abstracted according to their local
structure. We describe differences and similarities of the two
approaches and explain the underlying ideas.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Paolo Baldan and Barbara König and Arend Rensink
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4241, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04241.3
urn:nbn:de:0030-drops-291
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04241.3
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:30
2005-02-18T00:00:00Z
ddc:004
open_access
Summary 3: On Graph(ic) Encodings
Bruni, Roberto
Lanese, Ivan
graph transformation
process calculi
encodings
This paper is an informal summary of different encoding techniques
from process calculi and distributed formalisms to graphic frameworks. The survey
includes the use of solo diagrams, term graphs, synchronized hyperedge replacement
systems, bigraphs, tile models and interactive systems, all presented at
the Dagstuhl Seminar 04241. The common theme of all techniques recalled here
is having a graphic presentation that, at the same time, gives both an intuitive visual
rendering (of processes, states, etc.) and a rigorous mathematical framework.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Roberto Bruni and Ivan Lanese
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4241, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04241.4
urn:nbn:de:0030-drops-303
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04241.4
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:322
2005-11-02T00:00:00Z
ddc:004
open_access
04251 – Imaging Beyond the Pinhole Camera
Daniilidis, Kostas
Klette, Reinhard
Leonardis, Ales
Panoramic imaging
omnidirectional cameras
laser range finder
data fusion
sensor geometry
calibration
motion analysis
tracking
From 13.06.04 to 18.06.04, the
Dagstuhl Seminar 04251 ``Imaging Beyond the Pin-hole Camera. 12th Seminar on Theoretical Foundations of Computer Vision'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Kostas Daniilidis and Reinhard Klette and Ales Leonardis
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4251, Imaging Beyond the Pin-hole Camera. 12th Seminar on Theoretical Foundations of Computer Vision (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04251.1
urn:nbn:de:0030-drops-3222
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04251.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:294
2005-11-02T00:00:00Z
ddc:004
open_access
Mobile Panoramic Mapping using CCD-Line Camera and Laser Scanner
Reulke, Ralf
Wehr, Aloysius
Griesbach, Denis
Digital panoramic camera
laser scanner
data fusion
mobile mapping
The fusion of panoramic camera data with laser scanner data is a new approach and allows the combination of high-resolution image and depth data. Application areas are city modelling, virtual reality and documentation of the cultural heritage. Panoramic recording of image data is realized by a CCD-line, which is precisely rotated around the projection centre. In the case of other possible movements, the actual position of the projection centre and the view direction has to be measured. Linear moving panoramas e.g. along a wall are an interesting extension of such rotational panoramas. Here, the instantaneous position and orientation determination can be realized with an integrated navigation system comprising differential GPS and an inertial measurement unit.
This paper investigates the combination of a panoramic camera and a laser scanner with a navigation system for indoor and outdoor applications. First it will be reported about laboratory experiments, which were carried out to obtain valid parameters about the surveying accuracy achievable with both sensors panoramic camera and laser scanner respectively. Then out door surveying results using a position and orientation system as navigation sensor will be presented and discussed.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ralf Reulke and Aloysius Wehr and Denis Griesbach
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4251, Imaging Beyond the Pin-hole Camera. 12th Seminar on Theoretical Foundations of Computer Vision (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04251.2
urn:nbn:de:0030-drops-2946
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04251.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:471
2006-03-29T00:00:00Z
ddc:004
open_access
04261 Abstracts Collection – Algorithmic Methods for Railway Optimization
Kroon, Leo G.
Wagner, Dorothea
Geraets, Frank
Zaroliagis, Christos
From 20.06.04 to 25.06.04, the Dagstuhl Seminar 04261 ``Algorithmic Methods for Railway Optimization'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leo G. Kroon and Dorothea Wagner and Frank Geraets and Christos Zaroliagis
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4261, Algorithmic Methods for Railway Optimization (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04261.1
urn:nbn:de:0030-drops-4712
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04261.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:451
2006-01-24T00:00:00Z
ddc:004
open_access
04271 Abstracts Collection – Preferences: Specification, Inference, Applications
Bosi, Gianni
Brafman, Ronen I.
Chomicki, Jan
Kießling, Werner
Preference specification and representation
preference composition and merging
preference aggregation
xiomatic properties of preferences
logics of preference
topological/algebraic preference structures and their utility representation
inear and non-linear utility representations
preferences with intransitive indifference
From 27.06.04 to 02.07.04, the Dagstuhl Seminar 04271 ``Preferences: Specification, Inference, Applications'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Gianni Bosi and Ronen I. Brafman and Jan Chomicki and Werner Kießling
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.1
urn:nbn:de:0030-drops-4510
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:405
2006-01-19T00:00:00Z
ddc:004
open_access
Adaptive Rich Media Presentations via Preference-Based Constrained Optimization
Brafman, Ronen I.
Friedman, Doron
Preferences
cp-nets
multi-media presentations
Personalization and adaptation of multi-media messages are well
known and well studied problems. Ideally, each message should reflect
its recipient's interests, device capabilities, and network
conditions. Such personalization is more difficult to carry out
given a compound multi-media presentation containing multiple
spatially and temporally related elements. This paper describes a novel
formal, yet practical approach, and
an implemented system prototype for authoring and adapting compound multi-media presentations. Our approach builds on recent advances in preference specification and preferences-based constrained optimization techniques.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ronen I. Brafman and Doron Friedman
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.2
urn:nbn:de:0030-drops-4050
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:400
2006-01-19T00:00:00Z
ddc:004
open_access
Efficient Evaluation of Numerical Preferences: Top k Queries, Skylines and Multi-objective Retrieval
Balke, Wolf-Tilo
Top k retrieval
skyline queries
multi-objective optimization
numerical preferences
utility functions
Query processing in databases and information systems has developed beyond mere SQL-style exact matching of attribute values. Scoring database objects according to numerical user preferences and retrieving only the top k matches or Pareto-optimal result sets (skyline queries) are already common for a variety of applications.
Recently a lot of database literature has focussed on how to efficiently evaluate queries based on numerical preferences. Specialized algorithms using either top k retrieval (assuming a single compensation function defined over all query predicates, i.e. a global utility function) or computing skylines (assuming all query predicates as pairwise incomparable) have been shown to be capable of avoiding naïve linear database scans by pruning large numbers of database objects and thus vastly improve scalability. However, both paradigms are only two extreme cases of exploring viable compromises for each user’s objectives, which may or may not be comparable. To find the correct result set for arbitrary cases of multi-objective query processing in databases a novel algorithm for computing sets of objects that are non-dominated with respect to a set of monotonic objective functions representing a user's notion of utility, has recently been presented. Naturally containing top k and skyline retrieval paradigms as special cases, this algorithm maintains scalability also for all cases in between. To be more precise, in both special cases the multi-objective retrieval algorithm will behave exactly like the most efficient known evaluation algorithms for top k and skyline queries respectively. This algorithm has also been proved to be correct and instance-optimal in terms of necessary object accesses. Moreover, it improves the psychological response behavior by progressively producing result objects as quickly as possible, while the algorithm is still running, so user can deal with result objects at the earliest point in time.
Our tutorial will discuss all state of the art algorithms for top k retrieval, skyline queries and multi-objective retrieval and point to open problems, future extensions of the paradigm and research in numerical preferences.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Wolf-Tilo Balke
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.3
urn:nbn:de:0030-drops-4007
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.3
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:402
2006-01-19T00:00:00Z
ddc:004
open_access
Non-Transitive Consumer Behavior
Fuchs-Seliger, Susanne
Rational choice
consumer behavior
competitive equilibrium
Rational choice when preferences are not required to be transitive and complete has been discussed in the literature for years. In this article transitivity and completeness of the preference relation is also not assumed. It will be shown that nevertheless the existence of a competitive equilibrium can be proven when those properties are replaced by a domination property which allows that there could be cicles among those alternatives which are of less importance for the individual and which he or she would never choose if better ones are available.
Moreover, one can show that the compensated demand function is continuous under very weak conditions, and because of this, Shephard’s lemma follows without assuming transitivity and completeness of the underlying preferences.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Susanne Fuchs-Seliger
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.4
urn:nbn:de:0030-drops-4027
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.4
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:403
2006-01-19T00:00:00Z
ddc:004
open_access
Personalization of Queries based on User Preferences
Koutrika, Georgia
Ioannidis, Yannis
Query personalization
user profiles
preferences
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The underlying idea is that different users may find different things relevant to a search due to different preferences. Essential ingredients of query personalization are: (a) a model for representing and storing preferences in user profiles, and (b) algorithms for the generation of personalized answers using stored preferences. Modeling the plethora of preference types is a challenge. In this paper, we present a preference model that combines expressivity and concision. In addition, we provide algorithms for the selection of preferences related to a query and the progressive generation of personalized results, which are ranked based on user interest.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Georgia Koutrika and Yannis Ioannidis
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.5
urn:nbn:de:0030-drops-4039
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.5
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:450
2006-01-24T00:00:00Z
ddc:004
open_access
Preference Modelling
Öztürk, Meltem
Tsoukias, Alexis
Vincke, Philippe
Preferences
Interval Orders
Hesitation
Logical formulation
This paper provides the reader with a presentation of preference modelling fundamental notions as well as some recent results in this field. Preference modelling is an inevitable step in a variety of fields: economy, sociology, psychology, mathematical programming, even medicine, archaeology, and obviously decision analysis. Our notation and some basic definitions, such as those of binary relation, properties and ordered sets, are presented at the beginning of the paper. We start by discussing different reasons for constructing a model or preference. We then go through a number of issues that influence the construction of preference models. Different formalisations besides classical
logic such as fuzzy sets and non-classical logics become necessary. We then present different types of preference structures reflecting the behavior of a decision-maker: classical, extended and valued ones. It is relevant to have a numerical representation of preferences: functional representations,
value functions. The concepts of thresholds and minimal representation are also introduced in this section. In section 7, we briefly explore the concept of deontic logic (logic of preference) and other formalisms associated with "compact representation of preferences" introduced for special purpoes. We end the paper with some concluding remarks.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Meltem Öztürk and Alexis Tsoukias and Philippe Vincke
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.6
urn:nbn:de:0030-drops-4507
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.6
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:399
2006-01-19T00:00:00Z
ddc:004
open_access
Preference-based Problem Solving for Constraint Programming
Junker, Ulrich
Multi-criteria optimization
preferences
explanations
Combinatorial problems such as scheduling, resource allocation, and configuration have many
attributes that can be subject of user preferences. Traditional optimization approaches compile
those preferences into a single utility function and use it as the optimization objective when
solving the problem, but neither explain why the resulting solution satisfies the original
preferences, nor indicate the trade-offs made during problem solving. We argue that the
whole problem solving process becomes more transparent and controllable for the user
if it is based on the original preferences. We show how the original preferences can be used
to control the problem solving process and how they can be used to explain the choice
and the optimality of the detected solution. Based on this explanation, the user can refine
the preference model, thus gaining full control over the problem solver.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ulrich Junker
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.7
urn:nbn:de:0030-drops-3993
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.7
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:401
2006-01-24T00:00:00Z
ddc:004
open_access
Preferences on Intervals: a general framework
Tsoukias, Alexis
Öztürk, Meltem
Preferences
Interval Orders
Hesitation
Logical formulation
I present a general framework for the comparison of alternatives to which (possibly) an interval of values is associated. Some representation theorems for the existence of the intervals are discussed as well the possibility ot explicitly take into account situations of hesitation.
Some appropriate logical formalisms are discussed for such a purpose.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Alexis Tsoukias and Meltem Öztürk
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.8
urn:nbn:de:0030-drops-4015
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.8
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:406
2006-01-19T00:00:00Z
ddc:004
open_access
Representing preferences in the possibilistic setting
Souhila Kaci
Dubois, Didier
Prade, Henri
Possibility
preference
possibilistic logic
The accurate and easy representation of users' preferences in information
engineering systems becomes an important issue. Possibility theory provides a
generic framework for the qualitative representation of preferences, where
several equivalent information formats co- exist (distribution, logical bases,
conditionals, graphical networks). Moreover, a bipolar representation
distinguishing between positive and negative preferences has been developed in
this setting. The paper offers a comprehensive survey of these representation
issues.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Souhila Kaci and Didier Dubois and Henri Prade
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4271, Preferences: Specification, Inference, Applications (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04271.9
urn:nbn:de:0030-drops-4063
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04271.9
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:472
2006-03-10T00:00:00Z
ddc:004
open_access
04281 Abstracts Collection – Integrative Bioinformatics - Aspects of the Virtual Cell
Collado-Vides, Julio
Hofestädt, Ralf
Sensen, Christoph W.
From 04.07.04 to 09.07.04, the Dagstuhl Seminar 04281 ``Integrative Bioinformatics - Aspects of the Virtual Cell'' 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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Julio Collado-Vides and Ralf Hofestädt and Christoph W. Sensen
2006
Is Part Of Dagstuhl Seminar Proceedings, Volume 4281, Integrative Bioinformatics - Aspects of the Virtual Cell (2006)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04281.1
urn:nbn:de:0030-drops-4725
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04281.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:270
2005-09-09T00:00:00Z
ddc:004
open_access
Data Mining: The Next Generation
Ramakrishnan, Raghu
Agrawal, Rakesh
Freytag, Johann-Christoph
Bollinger, Toni
Clifton, Christopher W.
Dzeroski, Saso
Hipp, Jochen
Keim, Daniel
Kramer, Stefan
Kriegel, Hans-Peter
Leser, Ulf
Liu, Bing
Mannila, Heikki
Meo, Rosa
Morishita, Shinichi
Ng, Raymond
Pei, Jian
Raghavan, Prabhakar
Spiliopoulou, Myra
Srivastava, Jaideep
Torra, Vicenc
Data mining
databases
artificial intelligence
machine learning
statistics
semantics
Data Mining (DM) has enjoyed great popularity in recent years, with advances in both research and commercialization. The first generation of DM research and development has yielded several commercially available systems, both stand-alone and integrated with database systems; produced scalable versions of algorithms for many classical DM problems; and introduced novel pattern discovery problems.
In recent years, research has tended to be fragmented into several distinct pockets without a comprehensive framework. Researchers have continued to work largely within the parameters of their parent disciplines, building upon existing and distinct research methodologies. Even when they address a common problem (for example, how to cluster a dataset) they apply different techniques, different perspectives on what the important issues are, and different evaluation criteria. While different approaches can be complementary, and such a diversity is ultimately a strength of the field, better communication across disciplines is required if DM is to forge a distinct identity with a core set of principles, perspectives, and challenges that differentiate it from each of the parent disciplines.
Further, while the amount and complexity of data continues to grow rapidly, and the task of distilling useful insight continues to be central, serious concerns have emerged about social implications of DM. Addressing these concerns will require advances in our theoretical understanding of the principles that underlie DM algorithms, as well as an integrated approach to security and privacy in all phases of data management and analysis.
Researchers from a variety of backgrounds assembled at Dagstuhl to re-assess the current directions of the field, to identify critical problems that require attention, and to discuss ways to increase the flow of ideas across the different disciplines that DM has brought together. The workshop did not seek to draw up an agenda for the field of DM. Rather, it offers the participants’ perspective on two technical directions – compositionality and privacy – and describes some important application challenges that drove the discussion. Both of these directions illustrate the opportunities for crossdisciplinary research, and there was broad agreement that they represent important and timely areas for further work; of course, the choice of these directions as topics for discussion also reflects the personal interests and biases of the workshop participants.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Raghu Ramakrishnan and Rakesh Agrawal and Johann-Christoph Freytag and Toni Bollinger and Christopher W. Clifton and Saso Dzeroski and Jochen Hipp and Daniel Keim and Stefan Kramer and Hans-Peter Kriegel and Ulf Leser and Bing Liu and Heikki Mannila and Rosa Meo and Shinichi Morishita and Raymond Ng and Jian Pei and Prabhakar Raghavan and Myra Spiliopoulou and Jaideep Srivastava and Vicenc Torra
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4292, Perspectives Workshop: Data Mining: The Next Generation (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04292.1
urn:nbn:de:0030-drops-2709
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04292.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:157
2005-07-15T00:00:00Z
ddc:004
open_access
04301 Abstracts Collection – Cache-Oblivious and Cache-Aware Algorithms
Arge, Lars
Bender, Michael A.
Demaine, Erik
Leiserson, Charles
Mehlhorn, Kurt
Cache oblivious
cache aware
external memory
I/O-efficient algorithms
data structures
The Dagstuhl Seminar 04301 ``Cache-Oblivious and Cache-Aware Algorithms'' was held
in the International Conference and Research Center (IBFI), Schloss Dagstuhl, from 18.07.2004 to 23.07.2004.
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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Lars Arge and Michael A. Bender and Erik Demaine and Charles Leiserson and Kurt Mehlhorn
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4301, Cache-Oblivious and Cache-Aware Algorithms (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04301.1
urn:nbn:de:0030-drops-1576
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04301.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:156
2005-07-01T00:00:00Z
ddc:004
open_access
A Simple Algorithm for I/O-efficiently Pruning Dense Spanners
Gudmundsson, Joachim
Vahrenhold, Jan
No keywords
Given a geometric graph $G=(S,E)$ in $R^d$ with
constant dilation $t$, and a positive constant
$\epsilon$, we show how to construct a
$(1+\epsilon)$-spanner of $G$ with $O(|S|)$ edges
using $O(sort(|E|))$ I/O operations.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Joachim Gudmundsson and Jan Vahrenhold
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4301, Cache-Oblivious and Cache-Aware Algorithms (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04301.2
urn:nbn:de:0030-drops-1566
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04301.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:155
2005-07-01T00:00:00Z
ddc:004
open_access
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
Arge, Lars
de Berg, Mark
Haverkort, Herman J.
Yi, Ke
R-Trees
The query efficiency of a data structure that stores a set of objects, can normally be assessed by analysing the number of objects, pointers etc. looked at when answering a query. However, if the data structure is too big to fit in main memory, data may need to be fetched from disk. In that case, the query efficiency is easily dominated by moving the disk head to the correct locations, rather than by reading the data itself.
To reduce the number of disk accesses, once can group the data into blocks, and strive to bound the number of different blocks accessed rather than the number of individual data objects read. An R-tree is a general-purpose data structur that stores a hierarchical grouping of geometric objects into blocks. Many heuristics have been designed to determine which objects should be grouped together, but none of these heuristics could give a guarantee on the resulting worst-case query time.
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query by accessing $O((N/B)^{1-1/d} + T/B)$ blocks, where $N$ is the number of $d$-dimensional objects stored, $B$ is the number of objects per block, and $T$ is the number of objects whose bounding boxes intersect the query window. This is provably asymptotically optimal. Experiments show that the PR-tree performs similar to the best known heuristics on real-life and relatively nicely distributed data, but outperforms them significantly on more extreme data.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Lars Arge and Mark de Berg and Herman J. Haverkort and Ke Yi
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4301, Cache-Oblivious and Cache-Aware Algorithms (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04301.3
urn:nbn:de:0030-drops-1554
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04301.3
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:174
2005-04-22T00:00:00Z
ddc:004
open_access
04351 Abstracts Collection – Spatial Representation: Discrete vs. Continuous Computational Models
Kopperman, Ralph
Panangaden, Prakash
Smyth, Michael B.
Spreen, Dieter
Webster, Julian
Domain theory
formal topology
constructive topology
domain representation
space-time
quantum gravity
inverse limit construction
matroid geometry
descriptive set theory
Borel hierarchy
Hausdorff difference hierarchy
Wadge degree partial metric
fractafold
region geometry
oriented projective geometry
From 22.08.04 to 27.08.04, the Dagstuhl Seminar 04351
``Spatial Representation: Discrete vs. Continuous Computational Models''
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.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ralph Kopperman and Prakash Panangaden and Michael B. Smyth and Dieter Spreen and Julian Webster
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.1
urn:nbn:de:0030-drops-1742
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.1
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:171
2005-04-19T00:00:00Z
ddc:004
open_access
04351 Summary – Spatial Representation: Discrete vs. Continuous Computational Models
Kopperman, Ralph
Panangaden, Prakash
Smyth, Michael B.
Spreen, Dieter
Webster, Julian
Domain theory
formal topology
constructive topology
domain representation
space-time
quantum gravity
inverse limit construction
matroid geometry
descriptive set theory
Borel hierarchy
Hausdorff difference hierarchy
Wadge degree
partial metric
fractafold
region geometry
Topological notions and methods are used in various areas of the physical sciences and engineering, and therefore computer processing of topological data is important. Separate from this, but closely related, are computer science uses of topology: applications to programming language semantics and computing with exact real numbers are important examples. The seminar concentrated on an important approach, which is basic to all these applications, i.e. spatial representation.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ralph Kopperman and Prakash Panangaden and Michael B. Smyth and Dieter Spreen and Julian Webster
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.2
urn:nbn:de:0030-drops-1710
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.2
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:133
2005-04-22T00:00:00Z
ddc:004
open_access
A Cartesian Closed Extension of the Category of Locales
Heckmann, Reinhold
Locale
Cartesian closed category
We present a Cartesian closed category ELOC of equilocales,
which contains the category LOC of locales as a reflective full subcategory.
The embedding of LOC into ELOC preserves products and all exponentials of exponentiable locales.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Reinhold Heckmann
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.3
urn:nbn:de:0030-drops-1339
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.3
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:125
2005-04-22T00:00:00Z
ddc:004
open_access
A Category of Discrete Closure Spaces
Pfaltz, John L.
Category
closure
antimatroid
function
Discrete systems such as sets, monoids, groups are familiar categories.
The internal strucutre of the latter two is defined by an algebraic operator.
In this paper we describe the internal structure of the base set by a closure operator. We illustrate the role of such closure in convex geometries and partially ordered sets and thus suggestthe wide applicability of closure systems.
Next we develop the ideas of closed and complete functions over closure spaces. These can be used to establish criteria for asserting
that "the closure of a functional image under $f$ is equal to the functional image of the closure". Functions with these properties can be treated as categorical morphisms. Finally, the category "CSystem" of closure systems is shown to be cartesian closed.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
John L. Pfaltz
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.4
urn:nbn:de:0030-drops-1253
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.4
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:135
2005-04-22T00:00:00Z
ddc:004
open_access
A domain of spacetime intervals in general relativity
Martin, Keye
Panangaden, Prakash
Causality
spacetime
global hyperbolicity
interval domains
bicontinuous posets
spacetime topology
We prove that a globally hyperbolic spacetime with its causality relation is a bicontinuous poset whose interval topology is the manifold topology. This implies that from only a countable
dense set of events and the causality relation, it
is possible to reconstruct a globally hyperbolic
spacetime in a purely order theoretic manner. The
ultimate reason for this is that globally hyperbolic spacetimes belong to a category that is equivalent to a special category of domains called interval domains.
We obtain a mathematical setting in which one
can study causality independently of geometry
and differentiable structure, and which also
suggests that spacetime emanates from
something discrete.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Keye Martin and Prakash Panangaden
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.5
urn:nbn:de:0030-drops-1350
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.5
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:126
2005-04-22T00:00:00Z
ddc:004
open_access
A geometry of information, I: Nerves, posets and differential forms
Gratus, Jonathan
Porter, Timothy
Chu spaces
nerves
differential forms
The main theme of this workshop is 'Spatial Representation: Continuous vs. Discrete'. Spatial representation has two contrasting but interacting aspects (i) representation \emph{of} spaces' and (ii) representation \emph{by} spaces. In this paper we will examine two aspects that are common to both interpretations of the theme, namely nerve constructions and refinement. Representations change, data changes, spaces change. We will examine the possibility of a 'differential geometry' of spatial representations of both types, and in the sequel give an algebra of differential forms that has the potential to handle the dynamical aspect of such a geometry. We will discuss briefly a conjectured class of spaces, generalising the Cantor set which would seem ideal as a test-bed for the set of tools we are developing.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jonathan Gratus and Timothy Porter
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.6
urn:nbn:de:0030-drops-1268
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.6
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:127
2005-04-22T00:00:00Z
ddc:004
open_access
A geometry of information, II: Sorkin models, and biextensional collapses
Gratus, Jonathan
Porter, Timothy
Chu space
Sorkin model
Nerve
In this second part of our contribution to the workshop, we look in more detail at the Sorkin model, its relationship to constructions in Chu space theory, and then compare it with the Nerve constructions given in the first part.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jonathan Gratus and Timothy Porter
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.7
urn:nbn:de:0030-drops-1271
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.7
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:134
2005-04-22T00:00:00Z
ddc:004
open_access
Auxiliary relations and sandwich theorems
God, Chris
Jung, Achim
Knight, Robin
Kopperman, Ralph
Adjoint
auxiliary relation
continuous poset
pairwise completely regular (and pairwise normal) bitopological space
upper (lower) semicontinuous Urysohn relation
A well-known topological theorem due to Kat\v etov states:
Suppose $(X,\tau)$ is a normal topological space, and let $f:X\to[0,1]$ be upper semicontinuous, $g:X\to[0,1]$ be lower semicontinuous, and $f\leq g$. Then there is a continuous $h:X\to[0,1]$ such that $f\leq h\leq g$.
We show a version of this theorem for many posets with auxiliary relations. In particular, if $P$ is a Scott domain and $f,g:P\to[0,1]$ are such that $f\leq g$, and $f$ is lower continuous and $g$ Scott continuous, then for some $h$, $f\leq h\leq g$ and $h$ is both Scott and lower continuous.
As a result, each Scott continuous function from $P$ to $[0,1]$, is the sup of the functions below it which are both Scott and lower continuous.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Chris God and Achim Jung and Robin Knight and Ralph Kopperman
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.8
urn:nbn:de:0030-drops-1348
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.8
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:117
2005-04-19T00:00:00Z
ddc:004
open_access
Compactness in apartness spaces?
Bridges, Douglas
Ishihara, Hajime
Schuster, Peter
Vita, Luminita S.
Apartness
constructive
compact uniform space
A major problem in the constructive theory of apartness spaces is that of finding a good notion of compactness. Such a notion should (i) reduce to ``complete plus totally bounded'' for uniform spaces and (ii) classically be equivalent to the usual Heine-Borel-Lebesgue property for the apartness topology. The constructive counterpart of the smallest uniform structure compatible with a given apartness, while not constructively a uniform structure, offers a possible solution to the compactness-definition problem. That counterpart turns out to be interesting in its own right, and reveals some additional properties of an apartness that may have uses elsewhere in the theory.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Douglas Bridges and Hajime Ishihara and Peter Schuster and Luminita S. Vita
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.9
urn:nbn:de:0030-drops-1175
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.9
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:128
2005-04-22T00:00:00Z
ddc:004
open_access
Continued Radicals
Johnson, Jamie
Richmond, Tom
Continued radical
A nested radical with terms $a_1, a_2, \ldots , a_N$ is an expression of form $\sqrt{a_N + \cdots + \sqrt{a_2 + \sqrt{a_1}}}$. The limit
as $N$ approaches infinity of such an expression, if it exists,
is called a continued radical. We consider the set of real
numbers $S(M)$ representable as a continued radical whose terms $a_1, a_2, \ldots$ are all from a finite set $M$ of nonnegative real numbers. We give conditions on the set $M$ for $S(M)$ to be (a) an interval, and (b) homeomorphic to the Cantor set.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Jamie Johnson and Tom Richmond
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.10
urn:nbn:de:0030-drops-1286
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.10
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:130
2005-04-22T00:00:00Z
ddc:004
open_access
Continuous Semantics for Termination Proofs
Berger, Ulrich
Higher-order term rewriting
termination
domain theory
We prove a general strong normalization theorem for higher type
rewrite systems based on Tait's strong computability predicates and a
strictly continuous domain-theoretic semantics. The theorem applies to
extensions of Goedel's system $T$, but also to various forms of bar
recursion for which termination was hitherto unknown.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Ulrich Berger
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.11
urn:nbn:de:0030-drops-1300
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.11
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:136
2005-04-22T00:00:00Z
ddc:004
open_access
Deadlocks and Dihomotopy in Mutual Exclusion Models
Raussen, Martin
Mutual exclusion
deadlock detection
dihomotopy
Parallel processes in concurrency theory can be modelled in a geometric framework. A convenient model are the Higher Dimensional Automata of V. Pratt and E. Goubault with cubical complexes as their mathematical description. More abstract models are given by (locally) partially ordered topological spaces, the directed ($d$-spaces) of
M.Grandis and the flows of P. Gaucher. All models invite to use or modify ideas from algebraic topology, notably homotopy.
In specific semaphore models for mutual exclusion, we have developed methods and algorithms that can detect deadlocks and unsafe regions and give information about essentially different schedules using higher dimensional ``geometric'' representations of the state space and executions (directed paths) along it.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Martin Raussen
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.12
urn:nbn:de:0030-drops-1364
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.12
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
oai:drops-oai.dagstuhl.de:132
2005-04-22T00:00:00Z
ddc:004
open_access
Dihomotopy Classes of Dipaths in the Geometric Realization of a Cubical Set: from Discrete to Continuous and back again
Fajstrup, Lisbeth
Cubical Complex
Higher Dimensional Automaton
Ditopology
The geometric models of concurrency - Dijkstra's PV-models and V. Pratt's Higher Dimensional Automata -
rely on a translation of discrete or algebraic information to geometry.
In both these cases, the translation is the geometric realisation of a semi cubical complex,
which is then a locally partially ordered space, an lpo space.
The aim is to use the algebraic topology machinery, suitably adapted to the fact
that there is a preferred time direction.
Then the results - for instance dihomotopy classes of dipaths, which model
the number of inequivalent computations should be used on the discrete model and give the corresponding discrete objects.
We prove that this is in fact the case for the models considered:
Each dipath is dihomottopic to a combinatorial dipath
and if two combinatorial dipaths are dihomotopic, then they are combinatorially equivalent.
Moreover, the notions of dihomotopy (LF., E. Goubault, M. Raussen)
and d-homotopy (M. Grandis) are proven to be equivalent for these models
- hence the Van Kampen theorem is available for dihomotopy.
Finally we give an idea of how many spaces have a local po-structure given by cubes.
The answer is, that any cubicalized space has such a structure
after at most one subdivision.
In particular, all triangulable spaces have a cubical local po-structure.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Lisbeth Fajstrup
2005
Is Part Of Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)
InProceedings
Text
doc-type:ResearchArticle
publishedVersion
application/pdf
doi:10.4230/DagSemProc.04351.13
urn:nbn:de:0030-drops-1328
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.13
eng
https://creativecommons.org/licenses/by/4.0/legalcode
Computer Science
LZI
Report / Research paper / Working paper
eyJvZmZzZXQiOjEwMCwibWV0YWRhdGFQcmVmaXgiOiJvYWlfd2dsIiwic2V0IjoiZGRjOjAwNCIsImZyb20iOm51bGwsInVudGlsIjpudWxsfQ==