8 Search Results for "R�tsch, Gunnar"

Document
DOI: 10.4230/DagRep.12.12.54
Inter-Vehicular Communication - From Edge Support to Vulnerable Road Users II (Dagstuhl Seminar 22512)

Authors: Ana Aguiar, Onur Altintas, Falko Dressler, Gunnar Karlsson, and Florian Klingler

Published in: Dagstuhl Reports, Volume 12, Issue 12 (2023)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21262 "Inter-Vehicular Communication – From Edge Support to Vulnerable Road Users II". Looking back at the last decade, one can observe enormous progress in the domain of vehicular networking. In this growing community, many ongoing activities focus on the design of communication protocols to support safety applications, intelligent navigation, and many others. We shifted the focus from basic networking principles to open challenges in edge computing support and, as a novel aspect, on how to integrate so called vulnerable road users (VRU) into the picture.
Cite as

Ana Aguiar, Onur Altintas, Falko Dressler, Gunnar Karlsson, and Florian Klingler. Inter-Vehicular Communication - From Edge Support to Vulnerable Road Users II (Dagstuhl Seminar 22512). In Dagstuhl Reports, Volume 12, Issue 12, pp. 54-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{aguiar_et_al:DagRep.12.12.54,
  author =	{Aguiar, Ana and Altintas, Onur and Dressler, Falko and Karlsson, Gunnar and Klingler, Florian},
  title =	{{Inter-Vehicular Communication - From Edge Support to Vulnerable Road Users II (Dagstuhl Seminar 22512)}},
  pages =	{54--73},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{12},
  editor =	{Aguiar, Ana and Altintas, Onur and Dressler, Falko and Karlsson, Gunnar and Klingler, Florian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.12.54},
  URN =		{urn:nbn:de:0030-drops-178466},
  doi =		{10.4230/DagRep.12.12.54},
  annote =	{Keywords: 5G/6G, bicyclists, cooperative driving, edge computing, intelligent transportation systems, pedestrians, tactile internet, V2X, vehicle-to-vehicle communication, vulnerable road users}
}
Document
DOI: 10.4230/DagRep.11.5.89
Inter-Vehicular Communication - From Edge Support to Vulnerable Road Users (Dagstuhl Seminar 21262)

Authors: Ana Aguiar, Onur Altintas, Falko Dressler, and Gunnar Karlsson

Published in: Dagstuhl Reports, Volume 11, Issue 5 (2021)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 21262 "Inter-Vehicular Communication - From Edge Support to Vulnerable Road Users". Looking back at the last decade, one can observe enormous progress in the domain of vehicular networking. In this growing community, many ongoing activities focus on the design of communication protocols to support safety applications, intelligent navigation, and many others. We shifted the focus from basic networking principles to open challenges in edge computing support and, as a novel aspect, on how to integrate so called vulnerable road users (VRU) into the picture.
Cite as

Ana Aguiar, Onur Altintas, Falko Dressler, and Gunnar Karlsson. Inter-Vehicular Communication - From Edge Support to Vulnerable Road Users (Dagstuhl Seminar 21262). In Dagstuhl Reports, Volume 11, Issue 5, pp. 89-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@Article{aguiar_et_al:DagRep.11.5.89,
  author =	{Aguiar, Ana and Altintas, Onur and Dressler, Falko and Karlsson, Gunnar},
  title =	{{Inter-Vehicular Communication - From Edge Support to Vulnerable Road Users (Dagstuhl Seminar 21262)}},
  pages =	{89--96},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{5},
  editor =	{Aguiar, Ana and Altintas, Onur and Dressler, Falko and Karlsson, Gunnar},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.5.89},
  URN =		{urn:nbn:de:0030-drops-155722},
  doi =		{10.4230/DagRep.11.5.89},
  annote =	{Keywords: vehicular networks, vulnerable road users, edge computing, intelligent transportation systems}
}
Document
DOI: 10.4230/LIPIcs.WABI.2020.6
The Longest Run Subsequence Problem

Authors: Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, and Gunnar W. Klau

Published in: LIPIcs, Volume 172, 20th International Workshop on Algorithms in Bioinformatics (WABI 2020)

Abstract
Genome assembly is one of the most important problems in computational genomics. Here, we suggest addressing the scaffolding phase, in which contigs need to be linked and ordered to obtain larger pseudo-chromosomes, by means of a second incomplete assembly of a related species. The idea is to use alignments of binned regions in one contig to find the most homologous contig in the other assembly. We show that ordering the contigs of the other assembly can be expressed by a new string problem, the longest run subsequence problem (LRS). We show that LRS is NP-hard and present reduction rules and two algorithmic approaches that, together, are able to solve large instances of LRS to provable optimality. In particular, they can solve realistic instances resulting from partial Arabidopsis thaliana assemblies in short computation time. Our source code and all data used in the experiments are freely available.
Cite as

Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, and Gunnar W. Klau. The Longest Run Subsequence Problem. In 20th International Workshop on Algorithms in Bioinformatics (WABI 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 172, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{schrinner_et_al:LIPIcs.WABI.2020.6,
  author =	{Schrinner, Sven and Goel, Manish and Wulfert, Michael and Spohr, Philipp and Schneeberger, Korbinian and Klau, Gunnar W.},
  title =	{{The Longest Run Subsequence Problem}},
  booktitle =	{20th International Workshop on Algorithms in Bioinformatics (WABI 2020)},
  pages =	{6:1--6:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-161-0},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{172},
  editor =	{Kingsford, Carl and Pisanti, Nadia},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2020.6},
  URN =		{urn:nbn:de:0030-drops-127951},
  doi =		{10.4230/LIPIcs.WABI.2020.6},
  annote =	{Keywords: alignments, assembly, string algorithm, longest subsequence}
}
Document
DOI: 10.4230/LIPIcs.WABI.2018.16
Multiple-Choice Knapsack for Assigning Partial Atomic Charges in Drug-Like Molecules

Authors: Martin S. Engler, Bertrand Caron, Lourens Veen, Daan P. Geerke, Alan E. Mark, and Gunnar W. Klau

Published in: LIPIcs, Volume 113, 18th International Workshop on Algorithms in Bioinformatics (WABI 2018)

Abstract
A key factor in computational drug design is the consistency and reliability with which intermolecular interactions between a wide variety of molecules can be described. Here we present a procedure to efficiently, reliably and automatically assign partial atomic charges to atoms based on known distributions. We formally introduce the molecular charge assignment problem, where the task is to select a charge from a set of candidate charges for every atom of a given query molecule. Charges are accompanied by a score that depends on their observed frequency in similar neighbourhoods (chemical environments) in a database of previously parameterised molecules. The aim is to assign the charges such that the total charge equals a known target charge within a margin of error while maximizing the sum of the charge scores. We show that the problem is a variant of the well-studied multiple-choice knapsack problem and thus weakly NP-complete. We propose solutions based on Integer Linear Programming and a pseudo-polynomial time Dynamic Programming algorithm. We show that the results obtained for novel molecules not included in the database are comparable to the ones obtained performing explicit charge calculations while decreasing the time to determine partial charges for a molecule by several orders of magnitude, that is, from hours or even days to below a second. Our software is openly available at https://github.com/enitram/charge_assign.
Cite as

Martin S. Engler, Bertrand Caron, Lourens Veen, Daan P. Geerke, Alan E. Mark, and Gunnar W. Klau. Multiple-Choice Knapsack for Assigning Partial Atomic Charges in Drug-Like Molecules. In 18th International Workshop on Algorithms in Bioinformatics (WABI 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 113, pp. 16:1-16:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{engler_et_al:LIPIcs.WABI.2018.16,
  author =	{Engler, Martin S. and Caron, Bertrand and Veen, Lourens and Geerke, Daan P. and Mark, Alan E. and Klau, Gunnar W.},
  title =	{{Multiple-Choice Knapsack for Assigning Partial Atomic Charges in Drug-Like Molecules}},
  booktitle =	{18th International Workshop on Algorithms in Bioinformatics (WABI 2018)},
  pages =	{16:1--16:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-082-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{113},
  editor =	{Parida, Laxmi and Ukkonen, Esko},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.16},
  URN =		{urn:nbn:de:0030-drops-93187},
  doi =		{10.4230/LIPIcs.WABI.2018.16},
  annote =	{Keywords: Multiple-choice knapsack, integer linear programming, pseudo-polynomial dynamic programming, partial charge assignment, molecular dynamics simulations}
}
Document
DOI: 10.4230/DagRep.5.4.18
Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152)

Authors: Trevor Darrell, Marius Kloft, Massimiliano Pontil, Gunnar Rätsch, and Erik Rodner

Published in: Dagstuhl Reports, Volume 5, Issue 4 (2015)

Abstract
One of the most common assumptions in many machine learning and data analysis tasks is that the given data points are realizations of independent and identically distributed (IID) random variables. However, this assumption is often violated, e.g., when training and test data come from different distributions (dataset bias or domain shift) or the data points are highly interdependent (e.g., when the data exhibits temporal or spatial correlations). Both scenarios are typical situations in visual recognition and computational biology. For instance, computer vision and image analysis models can be learned from object-centric internet resources, but are often rather applied to real-world scenes. In computational biology and personalized medicine, training data may be recorded at a particular hospital, but the model is applied to make predictions on data from different hospitals, where patients exhibit a different population structure. In the seminar report, we discuss, present, and explore new machine learning methods that can deal with non-i.i.d. data as well as new application scenarios.
Cite as

Trevor Darrell, Marius Kloft, Massimiliano Pontil, Gunnar Rätsch, and Erik Rodner. Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152). In Dagstuhl Reports, Volume 5, Issue 4, pp. 18-55, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@Article{darrell_et_al:DagRep.5.4.18,
  author =	{Darrell, Trevor and Kloft, Marius and Pontil, Massimiliano and R\"{a}tsch, Gunnar and Rodner, Erik},
  title =	{{Machine Learning with Interdependent and Non-identically Distributed Data (Dagstuhl Seminar 15152)}},
  pages =	{18--55},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2015},
  volume =	{5},
  number =	{4},
  editor =	{Darrell, Trevor and Kloft, Marius and Pontil, Massimiliano and R\"{a}tsch, Gunnar and Rodner, Erik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.4.18},
  URN =		{urn:nbn:de:0030-drops-53497},
  doi =		{10.4230/DagRep.5.4.18},
  annote =	{Keywords: machine learning, computer vision, computational biology, transfer learning, domain adaptation}
}
Document
DOI: 10.4230/OASIcs.GCB.2013.46
Reconstructing Consensus Bayesian Network Structures with Application to Learning Molecular Interaction Networks

Authors: Holger Fröhlich and Gunnar W. Klau

Published in: OASIcs, Volume 34, German Conference on Bioinformatics 2013

Abstract
Bayesian Networks are an established computational approach for data driven network inference. However, experimental data is limited in its availability and corrupted by noise. This leads to an unavoidable uncertainty about the correct network structure. Thus sampling or bootstrap based strategies are applied to obtain edge frequencies. In a more general sense edge frequencies can also result from integrating networks learned on different datasets or via different inference algorithms. Subsequently one typically wants to derive a biological interpretation from the results in terms of a consensus network. We here propose a log odds based edge score on the basis of the expected false positive rate and thus avoid the selection of a subjective edge frequency cutoff. Computing a score optimal consensus network in our new model amounts to solving the maximum weight acyclic subdigraph problem. We use a branch-and-cut algorithm based on integer linear programming for this task. Our empirical studies on simulated and real data demonstrate a consistently improved network reconstruction accuracy compared to two threshold based strategies.
Cite as

Holger Fröhlich and Gunnar W. Klau. Reconstructing Consensus Bayesian Network Structures with Application to Learning Molecular Interaction Networks. In German Conference on Bioinformatics 2013. Open Access Series in Informatics (OASIcs), Volume 34, pp. 46-55, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{frohlich_et_al:OASIcs.GCB.2013.46,
  author =	{Fr\"{o}hlich, Holger and Klau, Gunnar W.},
  title =	{{Reconstructing Consensus Bayesian Network Structures with Application to Learning Molecular Interaction Networks}},
  booktitle =	{German Conference on Bioinformatics 2013},
  pages =	{46--55},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-59-0},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{34},
  editor =	{Bei{\ss}barth, Tim and Kollmar, Martin and Leha, Andreas and Morgenstern, Burkhard and Schultz, Anne-Kathrin and Waack, Stephan and Wingender, Edgar},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.GCB.2013.46},
  URN =		{urn:nbn:de:0030-drops-42273},
  doi =		{10.4230/OASIcs.GCB.2013.46},
  annote =	{Keywords: Bayesian Networks, Network Reverse Engineering, Minimum Feedback Arc Set, Maximum Acyclic Subgraph, Molecular Interaction Networks}
}
Document
DOI: 10.4230/DagSemProc.10403.1
10403 Abstracts Collection – Impact of Human Mobility on Communications : Measurement, Analysis, Modeling, and Simulation

Authors: Kevin C. Almeroth, Gunnar Karlsson, Cecilia Mascolo, and Jörg Ott

Published in: Dagstuhl Seminar Proceedings, Volume 10403, Impact of Human Mobility on Communications : Measurement, Analysis, Modeling, and Simulation (2011)

Abstract
From 06.10.2010 to 09.10.2010, the Dagstuhl Seminar 10403 ``Impact of Human Mobility on Communications : Measurement, Analysis, Modeling, and Simulation'' 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.
Cite as

Kevin C. Almeroth, Gunnar Karlsson, Cecilia Mascolo, and Jörg Ott. 10403 Abstracts Collection – Impact of Human Mobility on Communications : Measurement, Analysis, Modeling, and Simulation. In Impact of Human Mobility on Communications : Measurement, Analysis, Modeling, and Simulation. Dagstuhl Seminar Proceedings, Volume 10403, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{almeroth_et_al:DagSemProc.10403.1,
  author =	{Almeroth, Kevin C. and Karlsson, Gunnar and Mascolo, Cecilia and Ott, J\"{o}rg},
  title =	{{10403 Abstracts Collection – Impact of Human Mobility on Communications : Measurement, Analysis, Modeling, and Simulation}},
  booktitle =	{Impact of Human Mobility on Communications : Measurement, Analysis, Modeling, and Simulation},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2011},
  volume =	{10403},
  editor =	{Kevin C. Almeroth and Gunnar Karlsson and Cecilia Mascolo and J\"{o}rg Otto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10403.1},
  URN =		{urn:nbn:de:0030-drops-29222},
  doi =		{10.4230/DagSemProc.10403.1},
  annote =	{Keywords: Human Mobility, Vehicular Mobility, Social Interactions, Mobile Networking}
}
Document
DOI: 10.4230/DagSemProc.09071.3
On the Performance of Pedestrian Content Distribution

Authors: Gunnar Karlsson, Olafur Ragnar Helgason, and Vladimir Vukadinovic

Published in: Dagstuhl Seminar Proceedings, Volume 9071, Delay and Disruption-Tolerant Networking (DTN) II (2009)

Abstract
Mobile communication devices may be used for spreading multimedia data without support of an infrastructure. Such a scheme, where the data is carried by people walking around and relayed from device to device by means of short range radio, could potentially form a public content distribution system that spans vast urban areas. There are basically only three system parameters that can be determined in the design: the transmission range of the nodes, the setup time when nodes make a contact, and their storage capacity. The transport mechanism is the flow of people and it can be studied but not engineered. The question addressed in this paper is how well pedestrian content distribution may work. We answer this question by modeling the mobility of people moving around in a city, constrained by a given topology. The model is supplemented by simulation of similar or related scenarios for validation and extension. Our conclusion is that contents spread well with pedestrian speeds already at low arrival rates into a studied region. Our contributions are both the results on the feasibility of pedestrian content distribution and the queuing analytic model that captures the flow of people.
Cite as

Gunnar Karlsson, Olafur Ragnar Helgason, and Vladimir Vukadinovic. On the Performance of Pedestrian Content Distribution. In Delay and Disruption-Tolerant Networking (DTN) II. Dagstuhl Seminar Proceedings, Volume 9071, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{karlsson_et_al:DagSemProc.09071.3,
  author =	{Karlsson, Gunnar and Helgason, Olafur Ragnar and Vukadinovic, Vladimir},
  title =	{{On the Performance of Pedestrian Content Distribution}},
  booktitle =	{Delay and Disruption-Tolerant Networking (DTN) II},
  pages =	{1--23},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9071},
  editor =	{Kevin Fall and Cecilia Mascolo and J\"{o}rg Ott and Lars Wolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09071.3},
  URN =		{urn:nbn:de:0030-drops-23597},
  doi =		{10.4230/DagSemProc.09071.3},
  annote =	{Keywords: Content distribution, mobile peer-to-peer, ad hoc network, wireless network, mobile communication}
}
  • Refine by Author
  • 4 Karlsson, Gunnar
  • 3 Klau, Gunnar W.
  • 2 Aguiar, Ana
  • 2 Altintas, Onur
  • 2 Dressler, Falko
  • Show More...

  • Refine by Classification
  • 2 Networks → Cyber-physical networks
  • 1 Applied computing → Chemistry
  • 1 Applied computing → Computational genomics
  • 1 Computing methodologies → Machine learning
  • 1 Human-centered computing
  • Show More...

  • Refine by Keyword
  • 2 edge computing
  • 2 intelligent transportation systems
  • 2 vulnerable road users
  • 1 5G/6G
  • 1 Bayesian Networks
  • Show More...

  • Refine by Type
  • 8 document

  • Refine by Publication Year
  • 1 2009
  • 1 2011
  • 1 2013
  • 1 2015
  • 1 2018
  • Show More...

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

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