Search results
6,653 records were found.
From January 27 to January 30, 2009 the Dagstuhl
Seminar No. 09052 on "Management of the Future Internet"
was held in Schloß Dagstuhl, Leibniz Center for
Informatics. During the seminar, several participants presented
their current research and ongoing work, and open problems
were discussed. Abstracts of these presentations given during
the seminar as well as abstracts of seminar results and ideas are
put together in this report.
The first section describes the overall seminar goals and topics.
The second section lists available abstracts. And the third
section refers to a full paper in the appendix, which was
directly written based on one of the discussions taking place.
From 24.10.04 to 29.10.04, the
Dagstuhl Seminar 04441 ``Mobile Information Management'' 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.
This article summarizes the presentations and discussions during a
workshop on naming and addressing in a future Internet that was
held in March 2009 at "Schloß Dagstuhl" in Germany. The aim of
the workshop was to explore the different roles that names have in
an internetwork architecture, as well as attempt to come to some
agreements on what characteristics are important or desirable for
names in these various roles. The goal of this report is to attempt
a faithful reflection of the workshop itself, presenting the different
views, positions and issues discussed at the workshop in a structured
way.
The serum complexity makes the absolute quantitative analysis of medium to low-abundant proteins very challenging. Tens of thousands proteins are present in human serum and dispersed over an extremely wide dynamic range. The reliable identification and quantitation of proteins, which are potential biomarkers of disease, in serum or plasma as matrix still represents one of the most difficult analytical challenges. The difficulties arise from the presence of a few, but highly abundant proteins in serum and from the non-availability of isotope-labeled proteins, which serve to calibrate the method and to account for losses during sample preparation. For the absolute quantitation of serum proteins, we have developed an analytical scheme based on first-dimension separation of the intact proteins by anion-exchange high-performance liquid chro...
From 22.03. to 27.03.09, the Dagstuhl Seminar 09131 ``Service Level Agreements in Grids '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
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.
This chapter is dedicated to the memory of Ray Reiter. It is also an overview of cognitive robotics, as we understand it to have been envisaged by him.1 Of course, nobody can control the use of a term or the direction of research. We apologize in advance to those who feel that other approaches to cognitive robotics and related problems are inadequately
represented here.
While IT environments are moving towards personalized and context-aware adaptive content and services, digital preservation systems should go beyond the current mechanisms to preserve digital objects. Social and personal experiences need to be investigated as part of the context of digital resources, i.e., the way in which a resource was used and perceived, by retaining usage data for instance. Overall, users have to be further involved in the digital preservation processes, in the creation of context metadata, in the storage and migration of resources, in particular for personal archives.
The 2006 Dagstuhl Seminar ``Theory of Evolutionary Algorithms'' carried forward a series of Dagstuhl seminars that started in 2000 and has become an established event in the community. In the week from from 05.02.2006 to 10.02.2006, 56 researchers from 12 countries discussed their recent work and recent trends in evolutionary computation.
As programs evolve, newly added functionality sometimes does no
longer align with the original design, ending up scattered across the
software system. Aspect mining tries to identify such cross-cutting
concerns in a program to support maintenance, or as a first step
towards an aspect-oriented program. Previous approaches to aspect
mining applied static or dynamic program analysis techniques to a
single version of a system.We leverage all versions from a system's
CVS history to mine aspect candidates with our Eclipse plug-in
HAM: when a single CVS commit adds calls to the same (small)
set of methods in many unrelated locations, these method calls are
likely to be cross-cutting. HAM employs formal concept analysis to
identify aspect candidates. Analysing one commit at a time makes
the approach scale to industrial-sized programs. In an ev...
A tree-automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. The finite condensation rank (FC-rank) of a linear ordering measures how far it is away from being dense. We prove that the FC-rank of every tree-automatic linear ordering is below omega^omega. This generalises Delhommé's result that each tree-automatic ordinal is less than omega^omega^omega. Furthermore, we show an analogue for tree-automatic linear orderings where the branching complexity of the trees involved is bounded.
