TY - JOUR
AU - Salem, M. Alaraby
AU - Kühne, Thomas D.
ID - 19681
JF - Molecular Physics
SN - 0026-8976
TI - Insight from energy decomposition analysis on a hydrogen-bond-mediated mechanism for on-water catalysis
ER -
TY - CONF
AU - Vorbohle, Christian
AU - Szopinski, Daniel
AU - Kundisch, Dennis
ED - Shishkov, B.
ID - 17368
SN - 978-3-030-52305-3
TI - Business Model Dependencies: Towards conceptualizing dependencies for extending modeling languages for business models
VL - 391
ER -
TY - CONF
AB - Symposium gemeinsam organisiert mit Irene Moor, Gesine Bär, Susanne Hartung, Jens Hoebel, Thomas Lampert und Veronika Wöhrer (Konferenz aufgrund Covid 19 gecancelt)
Angegebener Monat: Februar 2020
AU - Büker, Petra
AU - Hüpping, Birgit
ID - 19768
TI - Kinder als Forscher – ein Weg zur Partizipation? Ein kinder-rechtebasierter didaktischer Ansatz und dessen Relevanz aus der Perspektive von Grundschulkindern. Angenommener Beitrag im Rahmen des Symposiums: Partizipativ forschen mit Kindern und Jugendlichen für gesundheitliche Chancengleichheit am Kongress Armut und Gesundheit, TU Berlin
ER -
TY - JOUR
AU - Steiger, Sören
AU - Pelster, Matthias
ID - 19895
JF - Journal of Economic Behavior & Organization
SN - 0167-2681
TI - Social interactions and asset pricing bubbles
VL - 179
ER -
TY - GEN
AB - In backward error analysis, an approximate solution to an equation is
compared to the exact solution to a nearby "modified" equation. In numerical
ordinary differential equations, the two agree up to any power of the step
size. If the differential equation has a geometric property then the modified
equation may share it. In this way, known properties of differential equations
can be applied to the approximation. But for partial differential equations,
the known modified equations are of higher order, limiting applicability of the
theory. Therefore, we study symmetric solutions of discretized partial
differential equations that arise from a discrete variational principle. These
symmetric solutions obey infinite-dimensional functional equations. We show
that these equations admit second-order modified equations which are
Hamiltonian and also possess first-order Lagrangians in modified coordinates.
The modified equation and its associated structures are computed explicitly for
the case of rotating travelling waves in the nonlinear wave equation.
AU - McLachlan, Robert I
AU - Offen, Christian
ID - 19941
T2 - arXiv:2006.14172
TI - Backward error analysis for variational discretisations of partial differential equations
ER -
TY - JOUR
AU - Kreusser, Lisa Maria
AU - McLachlan, Robert I
AU - Offen, Christian
ID - 19939
IS - 5
JF - Nonlinearity
SN - 0951-7715
TI - Detection of high codimensional bifurcations in variational PDEs
VL - 33
ER -
TY - CONF
AU - Grabo, Matti
AU - Acar, Emre
AU - Kenig, Eugeny
ID - 19965
TI - Modeling of a Latent Heat Storage System Consisting of Encapsulated PCM- Elements
ER -
TY - CONF
AU - Müller, Michelle
AU - Neumann, Jürgen
AU - Gutt, Dominik
AU - Kundisch, Dennis
ID - 19782
T2 - Proceedings of the 41th International Conference on Information Systems (ICIS)
TI - Toss a Coin to your Host - How Guests End up Paying for the Cost of Regulatory Policies
ER -
TY - GEN
AU - Kramer, Paul
ID - 18638
TI - Comparison of Zero-Knowledge Range Proofs
ER -
TY - THES
AU - Heinzel, Joachim
ID - 15824
TI - Essays on the Theory of Industrial Organization: Credence Goods, Vertical Relations and Product Bundling
ER -
TY - THES
AU - Setzer, Alexander
ID - 18520
TI - Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks
ER -
TY - GEN
ED - Troschitz, Juliane
ED - Vorderbrüggen, Julian
ED - Kupfer, Robert
ED - Gude, Maik
ED - Meschut, Gerson
ID - 20119
T2 - Applied Sciences
TI - Joining of Thermoplastic Composites with Metals Using Resistance ElementWelding
ER -
TY - JOUR
AB - 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.
AU - Lu, You
AU - Luo, Rong
AU - Schubert, Michael
AU - Steffen, Eckhard
AU - Zhang, Cun-Quan
ID - 13114
JF - SIAM J. Discrete Math
TI - Flows on signed graphs without long barbells
VL - 34 (4)
ER -
TY - JOUR
AU - Thiele, Frederik
AU - vom Bruch, Felix
AU - Quiring, Victor
AU - Ricken, Raimund
AU - Herrmann, Harald
AU - Eigner, Christof
AU - Silberhorn, Christine
AU - Bartley, Tim
ID - 20157
JF - Optics Express
SN - 1094-4087
TI - Cryogenic electro-optic polarisation conversion in titanium in-diffused lithium niobate waveguides
ER -
TY - CONF
AB - 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.
AU - Afifi, Haitham
AU - Karl, Holger
ID - 20164
T2 - 2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob'2020)
TI - Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks
ER -
TY - CHAP
AU - Rohlfing, Katharina
AU - Grimminger, Angela
AU - Wrede, Britta
ED - Rohlfing, Katharina
ED - Müller-Brauers, Claudia
ID - 20210
T2 - International perspectives on digital media and early literacy: The impact of digital devices on learning, language acquisition and social interaction.
TI - The role of caregivers in keeping a child-robot interaction going.
ER -
TY - JOUR
AU - Tolksdorf, Nils
AU - Siebert, Scarlet
AU - Zorn, Isabel
AU - Horwarth, Ilona
AU - Rohlfing, Katharina
ID - 20241
JF - International Journal of Social Robotics
TI - Ethical considerations of applying robots in kindergarten settings: Towards an approach from a macroperspective.
ER -
TY - JOUR
AU - Crawshaw, Camilla E.
AU - Kern, Friederike
AU - Mertens, Ulrich
AU - Rohlfing, Katharina
ID - 20260
JF - Frontiers in Psychology
TI - Children’s Narrative Elaboration After Reading a Storybook Versus Viewing a Video
VL - 11
ER -
TY - CONF
AB - 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.
AU - Damke, Clemens
AU - Melnikov, Vitaly
AU - Hüllermeier, Eyke
ED - Jialin Pan, Sinno
ED - Sugiyama, Masashi
ID - 19953
KW - graph neural networks
KW - Weisfeiler-Lehman test
KW - cycle detection
T2 - Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)
TI - A Novel Higher-order Weisfeiler-Lehman Graph Convolution
VL - 129
ER -
TY - GEN
ED - Wehrheim, Heike
ED - Cabot, Jordi
ID - 20277
SN - 978-3-030-45233-9
TI - Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings
VL - 12076
ER -