@phdthesis{15824,
author = {Heinzel, Joachim},
publisher = {Universität Paderborn},
title = {{Essays on the Theory of Industrial Organization: Credence Goods, Vertical Relations and Product Bundling}},
year = {2020},
}
@phdthesis{18520,
author = {Setzer, Alexander},
publisher = {Universität Paderborn},
title = {{Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks}},
doi = {10.17619/UNIPB/1-1026},
year = {2020},
}
@misc{20119,
booktitle = {Applied Sciences},
editor = {Troschitz, Juliane and Vorderbrüggen, Julian and Kupfer, Robert and Gude, Maik and Meschut, Gerson},
publisher = {MDPI},
title = {{Joining of Thermoplastic Composites with Metals Using Resistance ElementWelding}},
doi = {10.3390/app10207251},
year = {2020},
}
@article{13114,
abstract = {Many basic properties in Tutte's flow theory for unsigned graphs do not have
their counterparts for signed graphs. However, signed graphs without long
barbells in many ways behave like unsigned graphs from the point view of flows.
In this paper, we study whether some basic properties in Tutte's flow theory
remain valid for this family of signed graphs. Specifically let $(G,\sigma)$ be
a flow-admissible signed graph without long barbells. We show that it admits a
nowhere-zero $6$-flow and that it admits a nowhere-zero modulo $k$-flow if and
only if it admits a nowhere-zero integer $k$-flow for each integer $k\geq 3$
and $k \not = 4$. We also show that each nowhere-zero positive integer $k$-flow
of $(G,\sigma)$ can be expressed as the sum of some $2$-flows. For general
graphs, we show that every nowhere-zero $\frac{p}{q}$-flow can be normalized in
such a way, that each flow value is a multiple of $\frac{1}{2q}$. As a
consequence we prove the equality of the integer flow number and the ceiling of
the circular flow number for flow-admissible signed graphs without long
barbells.},
author = {Lu, You and Luo, Rong and Schubert, Michael and Steffen, Eckhard and Zhang, Cun-Quan},
journal = {SIAM J. Discrete Math},
pages = {2166--2187},
title = {{Flows on signed graphs without long barbells}},
doi = {10.1137/18M1222818},
volume = {34 (4)},
year = {2020},
}
@article{20157,
author = {Thiele, Frederik and vom Bruch, Felix and Quiring, Victor and Ricken, Raimund and Herrmann, Harald and Eigner, Christof and Silberhorn, Christine and Bartley, Tim},
issn = {1094-4087},
journal = {Optics Express},
title = {{Cryogenic electro-optic polarisation conversion in titanium in-diffused lithium niobate waveguides}},
doi = {10.1364/oe.399818},
year = {2020},
}
@inproceedings{20164,
abstract = {Upcoming sensing applications (acoustic or video) will have high processing requirements not satisfiable by a single node or need input from multiple sources (e.g., speaker localization). Offloading these applications to cloud or mobile edge is an option, but when running in a wireless senor network (WSN), it might entail needlessly high data rate and latency. An alternative is to spread processing inside the WSN, which is particularly attractive if the application comprises individual components. This scenario is typical for applications like acoustic signal processing. Mapping components to nodes can be formulated as wireless version of the NP-hard Virtual Network Embedding (VNE) problem, for which various heuristics exist. We propose a Reinforcement Learning (RL) framework, which relies on Q-Learning and uses either Greedy Epsilon or Epsilon Decay for exploration. We compare both exploration methods to the result of an optimization approach and show empirically that the RL framework achieves good results in terms of network delay within few number of steps.},
author = {Afifi, Haitham and Karl, Holger},
booktitle = {2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob'2020)},
title = {{Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks}},
year = {2020},
}
@inbook{20210,
author = {Rohlfing, Katharina and Grimminger, Angela and Wrede, Britta},
booktitle = {International perspectives on digital media and early literacy: The impact of digital devices on learning, language acquisition and social interaction.},
editor = {Rohlfing, Katharina and Müller-Brauers, Claudia},
title = {{The role of caregivers in keeping a child-robot interaction going.}},
year = {2020},
}
@article{20241,
author = {Tolksdorf, Nils and Siebert, Scarlet and Zorn, Isabel and Horwarth, Ilona and Rohlfing, Katharina},
journal = {International Journal of Social Robotics},
title = {{Ethical considerations of applying robots in kindergarten settings: Towards an approach from a macroperspective.}},
doi = {10.1007/s12369-020-00622-3},
year = {2020},
}
@article{20260,
author = {Crawshaw, Camilla E. and Kern, Friederike and Mertens, Ulrich and Rohlfing, Katharina},
journal = {Frontiers in Psychology},
title = {{Children’s Narrative Elaboration After Reading a Storybook Versus Viewing a Video}},
doi = {10.3389/fpsyg.2020.569891},
volume = {11},
year = {2020},
}
@inproceedings{19953,
abstract = {Current GNN architectures use a vertex neighborhood aggregation scheme, which limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman (WL) graph isomorphism test. Here, we propose a novel graph convolution operator that is based on the 2-dimensional WL test. We formally show that the resulting 2-WL-GNN architecture is more discriminative than existing GNN approaches. This theoretical result is complemented by experimental studies using synthetic and real data. On multiple common graph classification benchmarks, we demonstrate that the proposed model is competitive with state-of-the-art graph kernels and GNNs.},
author = {Damke, Clemens and Melnikov, Vitaly and Hüllermeier, Eyke},
booktitle = {Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)},
editor = {Jialin Pan, Sinno and Sugiyama, Masashi},
keyword = {graph neural networks, Weisfeiler-Lehman test, cycle detection},
location = {Bangkok, Thailand},
pages = {49--64},
publisher = {PMLR},
title = {{A Novel Higher-order Weisfeiler-Lehman Graph Convolution}},
volume = {129},
year = {2020},
}