TY - JOUR
AU - Schapeler, Timon
AU - Philipp Höpker, Jan
AU - Bartley, Tim
ID - 20156
JF - Optics Express
SN - 1094-4087
TI - Quantum detector tomography of a 2×2 multi-pixel array of superconducting nanowire single photon detectors
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 - Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of vertices that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can efficiently report the set of all pairs from S× S whose mincut value increases upon insertion of the edge (x,y) to G. The only result that exists for this problem is for a single pair of vertices (Picard and Queyranne, Mathematical Programming Study, 13 (1980), 8-16). We present the following results for the single source and the all-pairs versions of this problem.
1) Single source: Given any designated source vertex s, there exists a data structure of size 𝒪(|S|) that can output all those vertices from S whose mincut value to s increases upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(|S|).
2) All-pairs: There exists an 𝒪(|S|²) size data structure that can output all those pairs of vertices from S× S whose mincut value gets increased upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(k), where k is the number of pairs of vertices whose mincut increases.
For both these versions, we also address the problem of reporting the values of the mincuts upon insertion of any given edge. To derive our results, we use interesting insights into the nearest and the farthest mincuts for a pair of vertices. In addition, a crucial result, that we establish and use in our data structures, is that there exists a directed acyclic graph of 𝒪(n) size that compactly stores the farthest mincuts from all vertices of V to a designated vertex s in the graph. We believe that this result is of independent interest, especially, because it also complements a previously existing result by Hariharan et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar family, and hence, can be stored compactly in a tree of 𝒪(n) size.
AU - Baswana, Surender
AU - Gupta, Shiv
AU - Knollmann, Till
ED - Grandoni, Fabrizio
ED - Herman, Grzegorz
ED - Sanders, Peter
ID - 20159
KW - Mincut
KW - Sensitivity
KW - Data Structure
SN - 1868-8969
T2 - 28th Annual European Symposium on Algorithms (ESA 2020)
TI - Mincut Sensitivity Data Structures for the Insertion of an Edge
VL - 173
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 - CONF
AU - Bondarenko, Alexander
AU - Fröbe, Maik
AU - Beloucif, Meriem
AU - Gienapp, Lukas
AU - Ajjour, Yamen
AU - Panchenko, Alexander
AU - Biemann, Chris
AU - Stein, Benno
AU - Wachsmuth, Henning
AU - Potthast, Martin
AU - Hagen, Matthias
ID - 20166
T2 - CEUR Workshop Proceedings
TI - Overview of Touché 2020: Argument Retrieval
VL - 2696
ER -
TY - JOUR
AU - Otroshi, Mortaza
AU - Meschut, Gerson
ID - 20170
IS - 7/20
JF - Umformtechnik Blech Rohre Profile
SN - 0300-3167
TI - Spannungszustandsabhängige Schädigungsmodellierung zum Halbhohlstanznieten
ER -
TY - CONF
AU - Castenow, Jannik
AU - Harbig, Jonas
AU - Jung, Daniel
AU - Knollmann, Till
AU - Meyer auf der Heide, Friedhelm
ED - Devismes, Stéphane
ED - Mittal, Neeraj
ID - 20185
SN - 978-3-030-64347-8
T2 - Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings
TI - Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility
VL - 12514
ER -
TY - JOUR
AB - A dielectric step-index optical fiber with tube-like profile is considered, being positioned with a small gap on top of a dielectric slab waveguide. We propose a 2.5-D hybrid analytical/numerical coupled mode model for the evanescent excitation of the tube through semi-guided waves propagating in the slab at oblique angles. The model combines the directional polarized modes supported by the slab with analytic solutions for the TE-, TM-, and orbital-angular-momentum (OAM) modes of the tube-shaped fiber. Implementational details of the scheme are discussed, complemented by finite-element simulations for verification purposes. Our results include configurations with resonant in-fiber excitation of OAM modes with large orbital angular momentum and strong field enhancement.
AU - Hammer, Manfred
AU - Ebers, Lena
AU - Förstner, Jens
ID - 20189
JF - Optical and Quantum Electronics
KW - tet_topic_waveguides
SN - 0306-8919
TI - Hybrid coupled mode modelling of the evanescent excitation of a dielectric tube by semi-guided waves at oblique angles
VL - 52
ER -
TY - GEN
AU - Hemsen, Paul
AU - Hesse, Marc
AU - Löken, Nils
AU - Nouri, Zahra
ID - 20191
T2 - 2nd Crowdworking Symposium
TI - Platform-independent Reputation and Qualification System for Crowdwork
ER -
TY - JOUR
AU - Lüke, Carina
AU - Ritterfeld, Ute
AU - Grimminger, Angela
AU - Rohlfing, Katharina
AU - Liszkowski, Ulf
ID - 20198
JF - Frontiers in Psychology 11
TI - Integrated Communication System: Gesture and language acquisition in typically developing children and children with LD and DLD
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 - GEN
AB - In many real-world applications, the relative depth of objects in an image is
crucial for scene understanding, e.g., to calculate occlusions in augmented
reality scenes. Predicting depth in monocular images has recently been tackled
using machine learning methods, mainly by treating the problem as a regression
task. Yet, being interested in an order relation in the first place,
ranking methods suggest themselves as a natural alternative to regression, and
indeed, ranking approaches leveraging pairwise comparisons as training
information ("object A is closer to the camera than B") have shown promising
performance on this problem. In this paper, we elaborate on the use of
so-called \emph{listwise} ranking as a generalization of the pairwise approach.
Listwise ranking goes beyond pairwise comparisons between objects and considers
rankings of arbitrary length as training information. Our approach is based on
the Plackett-Luce model, a probability distribution on rankings, which we
combine with a state-of-the-art neural network architecture and a sampling
strategy to reduce training complexity. An empirical evaluation on benchmark
data in a "zero-shot" setting demonstrates the effectiveness of our proposal
compared to existing ranking and regression methods.
AU - Lienen, Julian
AU - Hüllermeier, Eyke
ID - 20211
T2 - arXiv:2010.13118
TI - Monocular Depth Estimation via Listwise Ranking using the Plackett-Luce model
ER -
TY - GEN
AU - Yeole, Paresh Kishor
ID - 20221
TI - Plurality Consensus in Hybrid Networks
ER -
TY - JOUR
AB - The challenge of designing new tunable nonlinear dielectric materials with tailored properties has attracted an increasing amount of interest recently. Herein, we study the effective nonlinear dielectric response of a stochastic paraelectric-dielectric composite consisting of equilibrium distributions of circular and partially penetrable disks (or parallel, infinitely long, identical, partially penetrable, circular cylinders) of a dielectric phase randomly dispersed in a continuous matrix of a paraelectric phase. The random microstructures were generated using the Metropolis Monte Carlo algorithm. The evaluation of the effective permittivity and tunability were carried out by employing either a Landau thermodynamic model or its Johnson’s approximation to describe the field-dependent permittivity of the paraelectric phase and solving continuum-electrostatics equations using finite element calculations. We reveal that the percolation threshold in this composite governs the critical behavior of the effective permittivity and tunability. For microstructures below the percolation threshold, our simulations demonstrate a strong nonlinear behaviour of the field-dependent effective permittivity and very high tunability that increases as a function of dielectric phase concentration. Above the percolation threshold, the effective permittivity shows the tendency to linearization and the tunability dramatically drops down. The highly reduced permittivity and extraordinarily high tunability are obtained for the composites with dielectric impenetrable disks at high concentrations, in which the triggering of the percolation transition is avoided. The reported results cast light on distinct nonlinear behaviour of 2D and 3D stochastic composites and can guide the design of novel composites with the controlled morphology and tailored permittivity and tunability.
AU - Myroshnychenko, Viktor
AU - Smirnov, Stanislav
AU - Jose, Pious Mathews Mulavarickal
AU - Brosseau, Christian
AU - Förstner, Jens
ID - 20233
JF - Acta Materialia
SN - 1359-6454
TI - Nonlinear dielectric properties of random paraelectric-dielectric composites
VL - 203
ER -
TY - JOUR
AU - Heyser, Per
AU - Sartisson, Vadim
AU - Meschut, Gerson
AU - Droß, Marcel
AU - Dröder, Klaus
ID - 20235
JF - Materials Testing
SN - 0025-5300
TI - Increased load bearing capacity of mechanically joined FRP/metal joints using a pin structured auxiliary joining element
ER -
TY - THES
AU - Hoof, Simon
ID - 20240
TI - Essays on Cooperation in Differential Games
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 - BOOK
ED - Rohlfing, Katharina J.
ED - Müller-Brauers, Claudia
ID - 20256
SN - 9780429321399
TI - International Perspectives on Digital Media and Early Literacy
ER -
TY - JOUR
AU - Kohlmeyer, Theresa
AU - Reis, Oliver
AU - Viertel, Franziska
AU - Rohlfing, Katharina
ID - 20257
JF - Theo Web
TI - Wie meinst du das? - Begriffserwerb im Religionsunterricht
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 -