@inproceedings{19776,
abstract = {Angegebener Monat: September 2018},
author = {Büker, Petra},
title = {{Grundschule im Wandel. Bildung heute für die Welt von morgen. Keynote anlässlich des 1. Delbrücker Grundschultages: „50 Jahre Schulform Grundschule“. Initiiert vom Arbeitskreis Delbrücker Grundschulen}},
year = {2018},
}
@article{13209,
author = {Sahoo, Sudhir and Kormath Madam Raghupathy, Ramya and Kühne, Thomas D. and Mirhosseini, Hossein},
journal = {J. Phys. Chem. C},
number = {37},
pages = {21202--21209},
title = {{Theoretical Investigation of Interaction of CuInSe2 Absorber Material with Oxygen, Hydrogen, and Water}},
doi = {10.1021/acs.jpcc.8b06709},
volume = {122},
year = {2018},
}
@article{19935,
abstract = {A bifurcation is a qualitative change in a family of solutions to an equation produced by varying parameters. In contrast to the local bifurcations of dynamical systems that are often related to a change in the number or stability of equilibria, bifurcations of boundary value problems are global in nature and may not be related to any obvious change in dynamical behaviour. Catastrophe theory is a well-developed framework which studies the bifurcations of critical points of functions. In this paper we study the bifurcations of solutions of boundary-value problems for symplectic maps, using the language of (finite-dimensional) singularity theory. We associate certain such problems with a geometric picture involving the intersection of Lagrangian submanifolds, and hence with the critical points of a suitable generating function. Within this framework, we then study the effect of three special cases: (i) some common boundary conditions, such as Dirichlet boundary conditions for second-order systems, restrict the possible types of bifurcations (for example, in generic planar systems only the A-series beginning with folds and cusps can occur); (ii) integrable systems, such as planar Hamiltonian systems, can exhibit a novel periodic pitchfork bifurcation; and (iii) systems with Hamiltonian symmetries or reversing symmetries can exhibit restricted bifurcations associated with the symmetry. This approach offers an alternative to the analysis of critical points in function spaces, typically used in the study of bifurcation of variational problems, and opens the way to the detection of more exotic bifurcations than the simple folds and cusps that are often found in examples. },
author = {McLachlan, Robert I and Offen, Christian},
issn = {0951-7715},
journal = {Nonlinearity},
pages = {2895--2927},
title = {{Bifurcation of solutions to Hamiltonian boundary value problems}},
doi = {10.1088/1361-6544/aab630},
year = {2018},
}
@inproceedings{2850,
author = {Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
booktitle = {Ninth International Conference on Fun with Algorithms (FUN)},
title = {{Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}},
doi = {10.4230/LIPIcs.FUN.2018.22},
year = {2018},
}
@unpublished{19978,
abstract = {We introduce the \emph{Online Connected Dominating Set Leasing} problem
(OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set
$\mathcal{L}$ of lease types each characterized by a duration and cost, and a
sequence of subsets of $V$ arriving over time. A node can be leased using lease
type $l$ for cost $c_l$ and remains active for time $d_l$. The adversary gives
in each step $t$ a subset of nodes that need to be dominated by a connected
subgraph consisting of nodes active at time $t$. The goal is to minimize the
total leasing costs. OCDSL contains the \emph{Parking Permit
Problem}~\cite{PPP} as a special subcase and generalizes the classical offline
\emph{Connected Dominating Set} problem~\cite{Guha1998}. It has an $\Omega(\log
^2 n + \log |\mathcal{L}|)$ randomized lower bound resulting from lower bounds
for the \emph{Parking Permit Problem} and the \emph{Online Set Cover}
problem~\cite{Alon:2003:OSC:780542.780558,Korman}, where $|\mathcal{L}|$ is the
number of available lease types and $n$ is the number of nodes in the input
graph. We give a randomized $\mathcal{O}(\log ^2 n + \log |\mathcal{L}| \log
n)$-competitive algorithm for OCDSL. We also give a deterministic algorithm for
a variant of OCDSL in which the dominating subgraph need not be connected, the
\emph{Online Dominating Set Leasing} problem. The latter is based on a simple
primal-dual approach and has an $\mathcal{O}(|\mathcal{L}| \cdot
\Delta)$-competitive ratio, where $\Delta$ is the maximum degree of the input
graph.},
author = {Markarian, Christine},
booktitle = {arXiv:1805.02994},
title = {{Online Connected Dominating Set Leasing}},
year = {2018},
}
@misc{3365,
author = {Schnuer, Jan-Philip},
publisher = {Universität Paderborn},
title = {{Static Scheduling Algorithms for Heterogeneous Compute Nodes}},
year = {2018},
}
@misc{5417,
abstract = {Molecular Dynamic (MD) simulations are computationally intensive and accelerating them using specialized hardware is a topic of investigation in many studies. One of the routines in the critical path of MD simulations is the three-dimensional Fast Fourier Transformation (FFT3d). The potential in accelerating FFT3d using hardware is usually bound by bandwidth and memory. Therefore, designing a high throughput solution for an FPGA that overcomes this problem is challenging.
In this thesis, the feasibility of offloading FFT3d computations to FPGA implemented using OpenCL is investigated. In order to mask the latency in memory access, an FFT3d that overlaps computation with communication is designed. The implementa- tion of this design is synthesized for the Arria 10 GX 1150 FPGA and evaluated with the FFTW benchmark. Analysis shows a better performance using FPGA over CPU for larger FFT sizes, with the 643 FFT showing a 70% improvement in runtime using FPGAs.
This FFT3d design is integrated with CP2K to explore the potential in accelerating molecular dynamic simulations. Evaluation of CP2K simulations using FPGA shows a 41% improvement in runtime in FFT3d computations over CPU for larger FFT3d designs.},
author = {Ramaswami, Arjun},
keyword = {FFT: FPGA, CP2K, OpenCL},
publisher = {Universität Paderborn},
title = {{Accelerating Molecular Dynamic Simulations by Offloading Fast Fourier Transformations to FPGA}},
year = {2018},
}
@misc{9926,
author = {Mikroökonomie, Lehrstuhl},
publisher = {Universität Paderborn},
title = {{Agenda setting in jury decision by sequential majority voting}},
year = {2018},
}
@misc{4806,
author = {Gräper, Gerrit},
publisher = {Universität Paderborn},
title = {{The Suitability of Equilibrium Concepts to evaluate competitive behaviour}},
year = {2018},
}
@misc{8074,
author = {Aykanat, Cengiz},
publisher = {Universität Paderborn},
title = {{Sharing Economy - Chancen und Risiken aus ökonomischer Sicht}},
year = {2018},
}
@misc{5936,
author = {Scheibl, Manuel},
publisher = {Universität Paderborn},
title = {{Learning about learning curves from dataset properties}},
year = {2018},
}
@misc{18033,
author = {Wulfes, Robin},
publisher = {Universität Paderborn},
title = {{Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}},
year = {2018},
}
@phdthesis{6597,
author = {Juhnke, Jakob},
publisher = {Universität Paderborn},
title = {{Models and Constructions for Secure Reputation Systems}},
doi = {10.17619/UNIPB/1-570},
year = {2018},
}
@inproceedings{4565,
author = {Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik},
booktitle = {Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)},
isbn = {9781450357999},
location = {Wien},
publisher = {ACM Press},
title = {{Brief Announcement: Competitive Routing in Hybrid Communication Networks}},
doi = {10.1145/3210377.3210663},
year = {2018},
}
@inproceedings{16380,
author = {Pannu, Gurjashan Singh and Klingler, Florian and Sommer, Christoph and Dressler, Falko},
booktitle = {2017 IEEE Vehicular Networking Conference (VNC)},
isbn = {9781538609866},
title = {{QQDCA: Adapting IEEE 802.11 EDCA for unicast transmissions at high topology dynamics}},
doi = {10.1109/vnc.2017.8275619},
year = {2018},
}
@article{16366,
author = {Dressler, Falko and Klingler, Florian and Segata, Michele and Cigno, Renato Lo},
issn = {0018-9219},
journal = {Proceedings of the IEEE},
pages = {436--446},
title = {{Cooperative Driving and the Tactile Internet}},
doi = {10.1109/jproc.2018.2863026},
year = {2018},
}
@article{9680,
author = {Allgaier, Markus and Ansari, Vahid and Eigner, Christof and Quiring, Viktor and Ricken, Raimund and Donohue, John Matthew and Czerniuk, Thomas and Aßmann, Marc and Bayer, Manfred and Brecht, Benjamin and Silberhorn, Christine},
issn = {0003-6951},
journal = {Applied Physics Letters},
title = {{Streak camera imaging of single photons at telecom wavelength}},
doi = {10.1063/1.5004110},
year = {2018},
}
@article{21029,
author = {Allgaier, Markus and Ansari, Vahid and Eigner, Christof and Quiring, Viktor and Ricken, Raimund and Donohue, John Matthew and Czerniuk, Thomas and Aßmann, Marc and Bayer, Manfred and Brecht, Benjamin and Silberhorn, Christine},
issn = {0003-6951},
journal = {Applied Physics Letters},
title = {{Streak camera imaging of single photons at telecom wavelength}},
doi = {10.1063/1.5004110},
volume = {112},
year = {2018},
}
@article{21310,
author = {Kapidzic, Sanja and Neuberger, Christoph and Stieglitz, Stefan and Mirbabaie, Milad},
issn = {2167-0811},
journal = {Digital Journalism},
pages = {251--272},
title = {{Interaction and Influence on Twitter: Comparing the discourse relationships between user types on five topics}},
doi = {10.1080/21670811.2018.1522962},
year = {2018},
}
@article{21308,
author = {Stieglitz, S. and Meske, C. and Ross, B. and Mirbabaie, Milad},
journal = {Information Systems Frontiers},
title = {{Going Back in Time to Predict the Future - The Complex Role of the Data Collection Period in Social Media Analytics}},
year = {2018},
}