@inproceedings{6665,
author = {{Krauter, Stefan and Bendfeld, Jörg}},
booktitle = {{2015 IEEE 42nd Photovoltaic Specialist Conference (PVSC)}},
isbn = {{9781479979448}},
publisher = {{IEEE}},
title = {{{Cost, performance, and yield comparison of eight different micro-inverters}}},
doi = {{10.1109/pvsc.2015.7355821}},
year = {{2015}},
}
@inproceedings{6666,
author = {{Krauter, Stefan}},
booktitle = {{2015 IEEE 42nd Photovoltaic Specialist Conference (PVSC)}},
isbn = {{9781479979448}},
publisher = {{IEEE}},
title = {{{BOS cost reduction via direct PV charging of electrical vehicles}}},
doi = {{10.1109/pvsc.2015.7356264}},
year = {{2015}},
}
@inproceedings{6667,
author = {{Bendfeld, Jörg and Bouyraaman, Yassin and Balluff, Stefan and Krauter, Stefan}},
booktitle = {{Proceedings of the Karlsruhe Institute of Technology (KIT) - Energy Science Technology 2015}},
location = {{Karlsruhe}},
title = {{{Stabilizing oﬀshore wind farm power feed-in via power to gas storage systems}}},
year = {{2015}},
}
@inproceedings{6668,
author = {{Bendfeld, Jörg and Balluff, Stefan and Krauter, Stefan}},
booktitle = {{Proceedings of the Karlsruhe Institute of Technology (KIT) - Energy Science Technology 2015}},
title = {{{Discovering the potential for oﬀshore windfarms trough measurements}}},
year = {{2015}},
}
@inproceedings{6669,
author = {{Bendfeld, Jörg and Balluff, Stefan and Krauter, Stefan}},
booktitle = {{Proceedings of the 10th Conference on Sustainable Development of Energy, Water and Enviroment Systems - SDEWES}},
title = {{{Wind power forecasting for oﬀshore wind farms}}},
year = {{2015}},
}
@inproceedings{6670,
author = {{Bendfeld, Jörg and Balluff, Stefan and Krauter, Stefan}},
booktitle = {{Proceedings of the 10th Conference on Sustainable Development of Energy, Water and Enviroment Systems - SDEWES}},
title = {{{Oﬀshore wind energy development based on Merra data}}},
year = {{2015}},
}
@inproceedings{6671,
author = {{Bendfeld, Jörg and Balluff, Stefan and Krauter, Stefan}},
booktitle = {{Proceedings of the 10th Conference on Sustainable Development of Energy, Water and Enviroment Systems - SDEWES}},
title = {{{Oﬀshore metocean station for energy purposes}}},
year = {{2015}},
}
@inproceedings{6672,
author = {{Bendfeld, Jörg and Balluff, Stefan and Krauter, Stefan}},
booktitle = {{EWEA Forecasting 2015 Technology Workshop}},
location = {{Leuven, Belgium}},
title = {{{Short term wind and energy prediction for oﬀshore wind farms using neural networks}}},
year = {{2015}},
}
@inproceedings{6719,
author = {{Heindorf, Stefan and Potthast, Martin and Stein, Benno and Engels, Gregor}},
booktitle = {{SIGIR}},
isbn = {{9781450336215}},
pages = {{831--834}},
publisher = {{ACM}},
title = {{{Towards Vandalism Detection in Knowledge Bases}}},
doi = {{10.1145/2766462.2767804}},
year = {{2015}},
}
@inproceedings{6726,
author = {{Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc}},
booktitle = {{Fundamentals of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings}},
pages = {{173--185}},
title = {{{A Note on Decidable Separability by Piecewise Testable Languages}}},
doi = {{10.1007/978-3-319-22177-9\_14}},
year = {{2015}},
}
@article{6769,
author = {{Tönnies, Merle}},
journal = {{Dramatic Minds. Performance, Cognition, and the Representation of Interiority}},
pages = {{243--260}},
publisher = {{Peter Lang}},
title = {{{Between Authenticity and Objectification: Narrating the Self in Contemporary British Drama}}},
year = {{2015}},
}
@misc{694,
author = {{Stilow, Georg}},
publisher = {{Universität Paderborn}},
title = {{{Mobile Agenten in Netzwerken: Analyse von Hotspots}}},
year = {{2015}},
}
@inbook{6952,
author = {{Bouyraaman, Yassin and Bendfeld, Jörg and Breymann, Philipp and Krauter, Stefan}},
booktitle = {{Renewable Energy in the Service of Mankind Vol I}},
isbn = {{9783319177762}},
pages = {{845--854}},
publisher = {{Springer International Publishing}},
title = {{{Integration of Wind Energy in Power System—Modelling of a Market Oriented Energy Concept}}},
doi = {{10.1007/978-3-319-17777-9_76}},
year = {{2015}},
}
@book{6978,
editor = {{Kremer, H.-Hugo and Beutner, Marc}},
title = {{{Individuelle Kompetenzentwicklungswege: Bildungsarbeit in einer dualisierten Ausbildungsvorbereitung. Ergebnisse und Reflexionen aus dem Forschungs- und Entwicklungsprojekt InBig}}},
year = {{2015}},
}
@unpublished{16449,
abstract = {{We consider the following variant of the two dimensional gathering problem
for swarms of robots: Given a swarm of $n$ indistinguishable, point shaped
robots on a two dimensional grid. Initially, the robots form a closed chain on
the grid and must keep this connectivity during the whole process of their
gathering. Connectivity means, that neighboring robots of the chain need to be
positioned at the same or neighboring points of the grid. In our model,
gathering means to keep shortening the chain until the robots are located
inside a $2\times 2$ subgrid. Our model is completely local (no global control,
no global coordinates, no compass, no global communication or vision, \ldots).
Each robot can only see its next constant number of left and right neighbors on
the chain. This fixed constant is called the \emph{viewing path length}. All
its operations and detections are restricted to this constant number of robots.
Other robots, even if located at neighboring or the same grid point cannot be
detected. Only based on the relative positions of its detectable chain
neighbors, a robot can decide to obtain a certain state. Based on this state
and their local knowledge, the robots do local modifications to the chain by
moving to neighboring grid points without breaking the chain. These
modifications are performed without the knowledge whether they lead to a global
progress or not. We assume the fully synchronous $\mathcal{FSYNC}$ model. For
this problem, we present a gathering algorithm which needs linear time. This
result generalizes the result from \cite{hopper}, where an open chain with
specified distinguishable (and fixed) endpoints is considered.}},
author = {{Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}},
booktitle = {{arXiv:1510.05454}},
title = {{{Gathering a Closed Chain of Robots on a Grid}}},
year = {{2015}},
}
@unpublished{16452,
abstract = {{We consider the problem of dominating set-based virtual backbone used for
routing in asymmetric wireless ad-hoc networks. These networks have non-uniform
transmission ranges and are modeled using the well-established disk graphs. The
corresponding graph theoretic problem seeks a strongly connected
dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes
in a digraph is a strongly connected dominating-absorbent set if the subgraph
induced by these nodes is strongly connected and each node in the graph is
either in the set or has both an in-neighbor and an out-neighbor in it.
Distributed algorithms for this problem are of practical significance due to
the dynamic nature of ad-hoc networks. We present a first distributed
approximation algorithm, with a constant approximation factor and O(Diam)
running time, where Diam is the diameter of the graph. Moreover we present a
simple heuristic algorithm and conduct an extensive simulation study showing
that our heuristic outperforms previously known approaches for the problem.}},
author = {{Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}},
booktitle = {{arXiv:1510.01866}},
title = {{{Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks}}},
year = {{2015}},
}
@inproceedings{16460,
abstract = {{Consider n nodes connected to a single coordinator. Each node receives an
individual online data stream of numbers and, at any point in time, the
coordinator has to know the k nodes currently observing the largest values, for
a given k between 1 and n. We design and analyze an algorithm that solves this
problem while bounding the amount of messages exchanged between the nodes and
the coordinator. Our algorithm employs the idea of using filters which,
intuitively speaking, leads to few messages to be sent, if the new input is
"similar" to the previous ones. The algorithm uses a number of messages that is
on expectation by a factor of O((log {\Delta} + k) log n) larger than that of
an offline algorithm that sets filters in an optimal way, where {\Delta} is
upper bounded by the largest value observed by any node.}},
author = {{Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}},
booktitle = {{Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)}},
pages = {{357--364}},
publisher = {{IEEE}},
title = {{{Online Top-k-Position Monitoring of Distributed Data Streams}}},
doi = {{10.1109/IPDPS.2015.40}},
year = {{2015}},
}
@article{16582,
author = {{Demoures, F. and Gay-Balmaz, F. and Leyendecker, S. and Ober-Blöbaum, S. and Ratiu, T. S. and Weinand, Y.}},
issn = {{0029-599X}},
journal = {{Numerische Mathematik}},
pages = {{73--123}},
title = {{{Discrete variational Lie group formulation of geometrically exact beam dynamics}}},
doi = {{10.1007/s00211-014-0659-4}},
year = {{2015}},
}
@inproceedings{16622,
author = {{Keuck, L. and Frohleke, N. and Bocker, J. and Ziessler, A.}},
booktitle = {{2015 17th European Conference on Power Electronics and Applications (EPE'15 ECCE-Europe)}},
isbn = {{9789075815221}},
title = {{{PFC-control for improved inductor utilization}}},
doi = {{10.1109/epe.2015.7309373}},
year = {{2015}},
}
@article{16642,
author = {{Ober-Blöbaum, Sina and Padberg-Gehle, Kathrin}},
issn = {{1617-7061}},
journal = {{PAMM}},
pages = {{639--640}},
title = {{{Multiobjective optimal control of fluid mixing}}},
doi = {{10.1002/pamm.201510309}},
year = {{2015}},
}