9 Search Results for "L�sch, Steffen"


Document
Short Paper
Non-Linear Charge Functions for Electric Vehicle Scheduling with Dynamic Recharge Rates (Short Paper)

Authors: Fabian Löbel, Ralf Borndörfer, and Steffen Weider

Published in: OASIcs, Volume 115, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)


Abstract
The ongoing electrification of logistics systems and vehicle fleets increases the complexity of associated vehicle routing or scheduling problems. Battery-powered vehicles have to be scheduled to recharge in-service, and the relationship between charging time and replenished driving range is non-linear. In order to access the powerful toolkit offered by mixed-integer and linear programming techniques, this battery behavior has to be linearized. Moreover, as electric fleets grow, power draw peaks have to be avoided to save on electricity costs or to adhere to hard grid capacity limits, such that it becomes desirable to keep recharge rates dynamic. We suggest a novel linearization approach of battery charging behavior for vehicle scheduling problems, in which the recharge rates are optimization variables and not model parameters.

Cite as

Fabian Löbel, Ralf Borndörfer, and Steffen Weider. Non-Linear Charge Functions for Electric Vehicle Scheduling with Dynamic Recharge Rates (Short Paper). In 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023). Open Access Series in Informatics (OASIcs), Volume 115, pp. 15:1-15:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


Copy BibTex To Clipboard

@InProceedings{lobel_et_al:OASIcs.ATMOS.2023.15,
  author =	{L\"{o}bel, Fabian and Bornd\"{o}rfer, Ralf and Weider, Steffen},
  title =	{{Non-Linear Charge Functions for Electric Vehicle Scheduling with Dynamic Recharge Rates}},
  booktitle =	{23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)},
  pages =	{15:1--15:6},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-302-7},
  ISSN =	{2190-6807},
  year =	{2023},
  volume =	{115},
  editor =	{Frigioni, Daniele and Schiewe, Philine},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2023.15},
  URN =		{urn:nbn:de:0030-drops-187765},
  doi =		{10.4230/OASIcs.ATMOS.2023.15},
  annote =	{Keywords: Electric Vehicle Scheduling, Battery Powered Vehicles, Charging Process, Non-linear Charging, Recharge Modeling, Dynamic Recharge Rate}
}
Document
Composing Model-Based Analysis Tools (Dagstuhl Seminar 19481)

Authors: Francisco Durán, Robert Heinrich, Diego Pérez-Palacín, Carolyn L. Talcott, and Steffen Zschaler

Published in: Dagstuhl Reports, Volume 9, Issue 11 (2020)


Abstract
This report documents the program and the outcomes of the Dagstuhl Seminar 19481 "Composing Model-Based Analysis Tools". The key objective of the seminar was to provide more flexibility in model-driven engineering by bringing together representatives from industry and researchers in the formal methods and software engineering communities to establishing the foundations for a common understanding on the modularity and composition of modeling languages and model-based analyses.

Cite as

Francisco Durán, Robert Heinrich, Diego Pérez-Palacín, Carolyn L. Talcott, and Steffen Zschaler. Composing Model-Based Analysis Tools (Dagstuhl Seminar 19481). In Dagstuhl Reports, Volume 9, Issue 11, pp. 97-116, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


Copy BibTex To Clipboard

@Article{duran_et_al:DagRep.9.11.97,
  author =	{Dur\'{a}n, Francisco and Heinrich, Robert and P\'{e}rez-Palac{\'\i}n, Diego and Talcott, Carolyn L. and Zschaler, Steffen},
  title =	{{Composing Model-Based Analysis Tools (Dagstuhl Seminar 19481)}},
  pages =	{97--116},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2020},
  volume =	{9},
  number =	{11},
  editor =	{Dur\'{a}n, Francisco and Heinrich, Robert and P\'{e}rez-Palac{\'\i}n, Diego and Talcott, Carolyn L. and Zschaler, Steffen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.9.11.97},
  URN =		{urn:nbn:de:0030-drops-119853},
  doi =		{10.4230/DagRep.9.11.97},
  annote =	{Keywords: Modelling, Simulation, Semantics, Formal Methods, Software Engineering}
}
Document
Yanagi: Transcript Segment Library Construction for RNA-Seq Quantification

Authors: Mohamed K. Gunady, Steffen Cornwell, Stephen M. Mount, and Héctor Corrada Bravo

Published in: LIPIcs, Volume 88, 17th International Workshop on Algorithms in Bioinformatics (WABI 2017)


Abstract
Analysis of differential alternative splicing from RNA-seq data is complicated by the fact that many RNA-seq reads map to multiple transcripts, and that annotated transcripts from a given gene are often a small subset of many possible complete transcripts for that gene. Here we describe Yanagi, a tool which segments a transcriptome into disjoint regions to create a segments library from a complete transcriptome annotation that preserves all of its consecutive regions of a given length L while distinguishing annotated alternative splicing events in the transcriptome. In this paper, we formalize this concept of transcriptome segmentation and propose an efficient algorithm for generating segment libraries based on a length parameter dependent on specific RNA-Seq library construction. The resulting segment sequences can be used with pseudo-alignment tools to quantify expression at the segment level. We characterize the segment libraries for the reference transcriptomes of Drosophila melanogaster and Homo sapiens. Finally, we demonstrate the utility of quantification using a segment library based on an analysis of differential exon skipping in Drosophila melanogaster and Homo sapiens. The notion of transcript segmentation as introduced here and implemented in Yanagi will open the door for the application of lightweight, ultra-fast pseudo-alignment algorithms in a wide variety of analyses of transcription variation.

Cite as

Mohamed K. Gunady, Steffen Cornwell, Stephen M. Mount, and Héctor Corrada Bravo. Yanagi: Transcript Segment Library Construction for RNA-Seq Quantification. In 17th International Workshop on Algorithms in Bioinformatics (WABI 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 88, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


Copy BibTex To Clipboard

@InProceedings{gunady_et_al:LIPIcs.WABI.2017.10,
  author =	{Gunady, Mohamed K. and Cornwell, Steffen and Mount, Stephen M. and Bravo, H\'{e}ctor Corrada},
  title =	{{Yanagi: Transcript Segment Library Construction for RNA-Seq Quantification}},
  booktitle =	{17th International Workshop on Algorithms in Bioinformatics (WABI 2017)},
  pages =	{10:1--10:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-050-7},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{88},
  editor =	{Schwartz, Russell and Reinert, Knut},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2017.10},
  URN =		{urn:nbn:de:0030-drops-76487},
  doi =		{10.4230/LIPIcs.WABI.2017.10},
  annote =	{Keywords: RNA-Seq, Genome Sequencing, Kmer-based alignment, Transcriptome Quantification, Differential Alternative Splicing}
}
Document
Improving the Quality of Distributed Composite Service Applications

Authors: Dionysios Efstathiou, Peter McBurney, Noël Plouzeau, and Steffen Zschaler

Published in: OASIcs, Volume 28, 2012 Imperial College Computing Student Workshop


Abstract
Dynamic service composition promotes the on-the-fly creation of value-added applications by combining services. Large scale, dynamic distributed applications, like those in the pervasive computing domain, pose many obstacles to service composition such as mobility, and resource availability. In such environments, a huge number of possible composition configurations may provide the same functionality, but only some of those may exhibit the desirable non-functional qualities (e.g. low battery consumption and response time) or satisfy users' preferences and constraints. The goal of a service composition optimiser is to scan the possible composition plans to detect these that are optimal in some sense (e.g. maximise availability or minimise data latency) with acceptable performance (e.g. relatively fast for the application domain). However, the majority of the proposed optimisation approaches for finding optimal composition plans, examine only the Quality of Service of each participated service in isolation without studying how the services are composed together within the composition. We argue that the consideration of multiple factors when searching for the optimal composition plans, such as which services are selected to participate in the composition, how these services are coordinated, communicate and interact within a composition, may improve the end-to-end quality of composite applications.

Cite as

Dionysios Efstathiou, Peter McBurney, Noël Plouzeau, and Steffen Zschaler. Improving the Quality of Distributed Composite Service Applications. In 2012 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 28, pp. 49-55, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


Copy BibTex To Clipboard

@InProceedings{efstathiou_et_al:OASIcs.ICCSW.2012.49,
  author =	{Efstathiou, Dionysios and McBurney, Peter and Plouzeau, No\"{e}l and Zschaler, Steffen},
  title =	{{Improving the Quality of Distributed Composite Service Applications}},
  booktitle =	{2012 Imperial College Computing Student Workshop},
  pages =	{49--55},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-48-4},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{28},
  editor =	{Jones, Andrew V.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2012.49},
  URN =		{urn:nbn:de:0030-drops-37649},
  doi =		{10.4230/OASIcs.ICCSW.2012.49},
  annote =	{Keywords: Service Composition, Optimisation, Dynamism, Evolution}
}
Document
Relating Two Semantics of Locally Scoped Names

Authors: Steffen Lösch and Andrew M. Pitts

Published in: LIPIcs, Volume 12, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (2011)


Abstract
The operational semantics of programming constructs involving locally scoped names typically makes use of stateful "dynamic allocation": a set of currently-used names forms part of the state and upon entering a scope the set is augmented by a new name bound to the scoped identifier. More abstractly, one can see this as a transformation of local scopes by expanding them outward to an implicit top-level. By contrast, in a neglected paper from 1994, Odersky gave a stateless lambda calculus with locally scoped names whose dynamics contracts scopes inward. The properties of "Odersky-style" local names are quite different from dynamically allocated ones and it has not been clear, until now, what is the expressive power of Odersky's notion. We show that in fact it provides a direct semantics of locally scoped names from which the more familiar dynamic allocation semantics can be obtained by continuation-passing style (CPS) translation. More precisely, we show that there is a CPS translation of typed lambda calculus with dynamically allocated names (the Pitts-Stark nu-calculus) into Odersky's lambda-nu-calculus which is computationally adequate with respect to observational equivalence in the two calculi.

Cite as

Steffen Lösch and Andrew M. Pitts. Relating Two Semantics of Locally Scoped Names. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 396-411, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{losch_et_al:LIPIcs.CSL.2011.396,
  author =	{L\"{o}sch, Steffen and Pitts, Andrew M.},
  title =	{{Relating Two Semantics of Locally Scoped Names}},
  booktitle =	{Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
  pages =	{396--411},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-32-3},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{12},
  editor =	{Bezem, Marc},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.396},
  URN =		{urn:nbn:de:0030-drops-32454},
  doi =		{10.4230/LIPIcs.CSL.2011.396},
  annote =	{Keywords: local names, continuations, typed lambda-calculus, observational equivalence}
}
Document
Railway Track Allocation by Rapid Branching

Authors: Ralf Borndörfer, Thomas Schlechte, and Steffen Weider

Published in: OASIcs, Volume 14, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10) (2010)


Abstract
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway network. Although it can be modeled as a standard path packing problem, instances of sizes relevant for real-world railway applications could not be solved up to now. We propose a rapid branching column generation approach that integrates the solution of the LP relaxation of a path coupling formulation of the problem with a special rounding heuristic. The approach is based on and exploits special properties of the bundle method for the approximate solution of convex piecewise linear functions. Computational results for difficult instances of the benchmark library TTPLIB are reported.

Cite as

Ralf Borndörfer, Thomas Schlechte, and Steffen Weider. Railway Track Allocation by Rapid Branching. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 13-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


Copy BibTex To Clipboard

@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2010.13,
  author =	{Bornd\"{o}rfer, Ralf and Schlechte, Thomas and Weider, Steffen},
  title =	{{Railway Track Allocation by Rapid Branching}},
  booktitle =	{10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)},
  pages =	{13--23},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-20-0},
  ISSN =	{2190-6807},
  year =	{2010},
  volume =	{14},
  editor =	{Erlebach, Thomas and L\"{u}bbecke, Marco},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.13},
  URN =		{urn:nbn:de:0030-drops-27465},
  doi =		{10.4230/OASIcs.ATMOS.2010.13},
  annote =	{Keywords: track allocation problem, integer programming, rapid branching heuristic, proximal bundle method}
}
Document
09401 Abstracts Collection – Machine learning approaches to statistical dependences and causality

Authors: Dominik Janzing, Steffen Lauritzen, and Bernhard Schölkopf

Published in: Dagstuhl Seminar Proceedings, Volume 9401, Machine learning approaches to statistical dependences and causality (2010)


Abstract
From 27.09.2009 to 02.10.2009, the Dagstuhl Seminar 09401 ``Machine learning approaches to statistical dependences and causality'' 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

Dominik Janzing, Steffen Lauritzen, and Bernhard Schölkopf. 09401 Abstracts Collection – Machine learning approaches to statistical dependences and causality. In Machine learning approaches to statistical dependences and causality. Dagstuhl Seminar Proceedings, Volume 9401, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


Copy BibTex To Clipboard

@InProceedings{janzing_et_al:DagSemProc.09401.1,
  author =	{Janzing, Dominik and Lauritzen, Steffen and Sch\"{o}lkopf, Bernhard},
  title =	{{09401 Abstracts Collection – Machine learning approaches to statistical dependences and causality }},
  booktitle =	{Machine learning approaches to statistical dependences and causality},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9401},
  editor =	{Dominik Janzing and Steffen Lauritzen and Bernhard Sch\"{o}lkopf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09401.1},
  URN =		{urn:nbn:de:0030-drops-23636},
  doi =		{10.4230/DagSemProc.09401.1},
  annote =	{Keywords: Machine learning, statistical dependences, causality}
}
Document
08391 Group Summary – Mining for Social Serendipity

Authors: Alexandre Passant, Ian Mulvany, Peter Mika, Nicolas Maisonneuve, Alexander Löser, Ciro Cattuto, Christian Bizer, Christian Bauckhage, and Harith Alani

Published in: Dagstuhl Seminar Proceedings, Volume 8391, Social Web Communities (2008)


Abstract
A common social problem at an event in which people do not personally know all of the other participants is the natural tendency for cliques to form and for discussions to mainly happen between people who already know each other. This limits the possibility for people to make interesting new acquaintances and acts as a retarding force in the creation of new links in the social web. Encouraging users to socialize with people they don't know by revealing to them hidden surprising links could help to improve the diversity of interactions at an event. The goal of this paper is to propose a method for detecting extit{"surprising"} relationships between people attending an event. By extit{"surprising"} relationship we mean those relationships that are not known a-priori, and that imply shared information not directly related with the local context of the event (location, interests, contacts) at which the meeting takes place. To demonstrate and test our concept we used the Flickr community. We focused on a community of users associated with a social event (a computer science conference) and represented in Flickr by means of a photo pool devoted to the event. We use Flickr metadata (tags) to mine for user similarity not related to the context of the event, as represented in the corresponding Flickr group. For example, we look for two group members who have been in the same highly specific place (identified by means of geo-tagged photos), but are not friends of each other and share no other common interests or, social neighborhood.

Cite as

Alexandre Passant, Ian Mulvany, Peter Mika, Nicolas Maisonneuve, Alexander Löser, Ciro Cattuto, Christian Bizer, Christian Bauckhage, and Harith Alani. 08391 Group Summary – Mining for Social Serendipity. In Social Web Communities. Dagstuhl Seminar Proceedings, Volume 8391, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


Copy BibTex To Clipboard

@InProceedings{passant_et_al:DagSemProc.08391.3,
  author =	{Passant, Alexandre and Mulvany, Ian and Mika, Peter and Maisonneuve, Nicolas and L\"{o}ser, Alexander and Cattuto, Ciro and Bizer, Christian and Bauckhage, Christian and Alani, Harith},
  title =	{{08391 Group Summary – Mining for Social Serendipity}},
  booktitle =	{Social Web Communities},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8391},
  editor =	{Harith Alani and Steffen Staab and Gerd Stumme},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08391.3},
  URN =		{urn:nbn:de:0030-drops-17910},
  doi =		{10.4230/DagSemProc.08391.3},
  annote =	{Keywords: Serendipity, online activity, context, ubiquitous computing}
}
Document
Station Location - Complexity and Approximation

Authors: Steffen Mecke, Anita Schöbel, and Dorothea Wagner

Published in: OASIcs, Volume 2, 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05) (2006)


Abstract
We consider a geometric set covering problem. In its original form it consists of adding stations to an existing geometric transportation network so that each of a given set of settlements is not too far from a station. The problem is known to be NP-hard in general. However, special cases with certain properties have been shown to be efficiently solvable in theory and in practice, especially if the covering matrix has (almost) consecutive ones property. In this paper we are narrowing the gap between intractable and efficiently solvable cases of the problem. We also present an approximation algorithm for cases with almost consecutive ones property.

Cite as

Steffen Mecke, Anita Schöbel, and Dorothea Wagner. Station Location - Complexity and Approximation. In 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05). Open Access Series in Informatics (OASIcs), Volume 2, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{mecke_et_al:OASIcs.ATMOS.2005.661,
  author =	{Mecke, Steffen and Sch\"{o}bel, Anita and Wagner, Dorothea},
  title =	{{Station Location - Complexity and Approximation}},
  booktitle =	{5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)},
  pages =	{1--11},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-00-2},
  ISSN =	{2190-6807},
  year =	{2006},
  volume =	{2},
  editor =	{Kroon, Leo G. and M\"{o}hring, Rolf H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2005.661},
  URN =		{urn:nbn:de:0030-drops-6612},
  doi =		{10.4230/OASIcs.ATMOS.2005.661},
  annote =	{Keywords: Station Location, facility location, complexity, approximation}
}
  • Refine by Author
  • 2 Borndörfer, Ralf
  • 2 Weider, Steffen
  • 2 Zschaler, Steffen
  • 1 Alani, Harith
  • 1 Bauckhage, Christian
  • Show More...

  • Refine by Classification
  • 1 Applied computing → Transportation
  • 1 General and reference → General literature
  • 1 Mathematics of computing → Integer programming
  • 1 Mathematics of computing → Linear programming

  • Refine by Keyword
  • 1 Battery Powered Vehicles
  • 1 Charging Process
  • 1 Differential Alternative Splicing
  • 1 Dynamic Recharge Rate
  • 1 Dynamism
  • Show More...

  • Refine by Type
  • 9 document

  • Refine by Publication Year
  • 2 2010
  • 1 2006
  • 1 2008
  • 1 2011
  • 1 2012
  • 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