@inproceedings{20139, author = {{Spliethöver, Maximilian and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}}, pages = {{76--87}}, title = {{{Argument from Old Man's View: Assessing Social Bias in Argumentation}}}, year = {{2020}}, } @inproceedings{20140, author = {{Dorsch, Jonas and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}}, pages = {{19--29}}, title = {{{Semi-Supervised Cleansing of Web Argument Corpora}}}, year = {{2020}}, } @inproceedings{20159, abstract = {{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.}}, author = {{Baswana, Surender and Gupta, Shiv and Knollmann, Till}}, booktitle = {{28th Annual European Symposium on Algorithms (ESA 2020)}}, editor = {{Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}}, isbn = {{978-3-95977-162-7}}, issn = {{1868-8969}}, keywords = {{Mincut, Sensitivity, Data Structure}}, pages = {{12:1--12:14}}, publisher = {{Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}}, title = {{{Mincut Sensitivity Data Structures for the Insertion of an Edge}}}, doi = {{10.4230/LIPIcs.ESA.2020.12}}, volume = {{173}}, year = {{2020}}, } @inproceedings{20166, author = {{Bondarenko, Alexander and Fröbe, Maik and Beloucif, Meriem and Gienapp, Lukas and Ajjour, Yamen and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast, Martin and Hagen, Matthias}}, booktitle = {{CEUR Workshop Proceedings}}, pages = {{384--395}}, title = {{{Overview of Touché 2020: Argument Retrieval}}}, volume = {{2696}}, year = {{2020}}, } @inproceedings{20185, author = {{Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}}, booktitle = {{Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings }}, editor = {{Devismes, Stéphane and Mittal, Neeraj}}, isbn = {{978-3-030-64347-8}}, pages = {{60--64}}, publisher = {{Springer}}, title = {{{Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility }}}, doi = {{10.1007/978-3-030-64348-5_5}}, volume = {{12514}}, year = {{2020}}, } @article{20189, abstract = {{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.}}, author = {{Hammer, Manfred and Ebers, Lena and Förstner, Jens}}, issn = {{0306-8919}}, journal = {{Optical and Quantum Electronics}}, keywords = {{tet_topic_waveguides}}, title = {{{Hybrid coupled mode modelling of the evanescent excitation of a dielectric tube by semi-guided waves at oblique angles}}}, doi = {{10.1007/s11082-020-02595-z}}, volume = {{52}}, year = {{2020}}, } @misc{20221, author = {{Yeole, Paresh Kishor}}, title = {{{Plurality Consensus in Hybrid Networks}}}, year = {{2020}}, } @article{20233, abstract = {{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.}}, author = {{Myroshnychenko, Viktor and Smirnov, Stanislav and Jose, Pious Mathews Mulavarickal and Brosseau, Christian and Förstner, Jens}}, issn = {{1359-6454}}, journal = {{Acta Materialia}}, pages = {{116432}}, title = {{{Nonlinear dielectric properties of random paraelectric-dielectric composites}}}, doi = {{10.1016/j.actamat.2020.10.051}}, volume = {{203}}, year = {{2020}}, } @inproceedings{20274, author = {{Bila, Eleni and Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, booktitle = {{Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings}}, editor = {{Gotsman, Alexey and Sokolova, Ana}}, pages = {{39--58}}, publisher = {{Springer}}, title = {{{Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory}}}, doi = {{10.1007/978-3-030-50086-3\_3}}, volume = {{12136}}, year = {{2020}}, } @inproceedings{20275, author = {{Beringer, Steffen and Wehrheim, Heike}}, booktitle = {{Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020}}, editor = {{van Sinderen, Marten and Fill, Hans{-}Georg and A. Maciaszek, Leszek}}, pages = {{15--26}}, publisher = {{ScitePress}}, title = {{{Consistency Analysis of AUTOSAR Timing Requirements}}}, doi = {{10.5220/0009766600150026}}, year = {{2020}}, } @inproceedings{20276, author = {{Beyer, Dirk and Wehrheim, Heike}}, booktitle = {{Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}}}, editor = {{Margaria, Tiziana and Steffen, Bernhard}}, pages = {{143--167}}, publisher = {{Springer}}, title = {{{Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework}}}, doi = {{10.1007/978-3-030-61362-4\_8}}, volume = {{12476}}, year = {{2020}}, } @proceedings{20277, editor = {{Wehrheim, Heike and Cabot, Jordi}}, isbn = {{978-3-030-45233-9}}, publisher = {{Springer}}, title = {{{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}}}, doi = {{10.1007/978-3-030-45234-6}}, volume = {{12076}}, year = {{2020}}, } @proceedings{20278, editor = {{Ahrendt, Wolfgang and Wehrheim, Heike}}, isbn = {{978-3-030-50994-1}}, publisher = {{Springer}}, title = {{{Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]}}}, doi = {{10.1007/978-3-030-50995-8}}, volume = {{12165}}, year = {{2020}}, } @article{20279, author = {{Sharma, Arnab and Wehrheim, Heike}}, journal = {{CoRR}}, title = {{{Testing Monotonicity of Machine Learning Models}}}, volume = {{abs/2002.12278}}, year = {{2020}}, } @inproceedings{24022, abstract = {{In this paper we propose a novel low-power receiver architecture which uses a direct-detection receiver in combination with a 2.44 GHz 13 bit Barker Code SAW correlator for improvement of co-channel interference. Furthermore, to improve receiver sensitivity, a narrowband baseband correlator which uses pulse position modulation (PPM) is proposed. The receiver can be used as a Wake-up Receiver (WuRx) in Wireless Sensor Networks (WSN) to minimize the power dissipation and provide asynchronous and on-demand data communication. We present a rigorous analysis of the receiver. It shows that the RF front-end (SAW correlator and envelope detector) alone suffers from poor sensitivity due to the high baseband bandwidth and the absence of an RF low noise amplifier. However, by adding the narrowband correlator with an innovative Pulse Position Modulation (PPM) scheme, the overall sensitivity of the receiver reaches -63.1 dB with an improvement of 17.7 dB due to the use of the narrowband correlator that reduces the baseband bandwidth from 50 to 0.84 MHz. By scaling the narrowband correlator bandwidth further down, the receiver sensitivity can be further improved.}}, author = {{Abughannam, Saed and Scheytt, Christoph}}, booktitle = {{IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2020) }}, publisher = {{IEEE}}, title = {{{Sensitivity Analysis of a Low-Power Wake-Up Receiver Using an RF Barker Code SAW Correlator and a Baseband Narrowband Correlator}}}, doi = {{10.1109/PIMRC48278.2020.9217198}}, year = {{2020}}, } @inproceedings{24027, abstract = {{Fault effect simulation is a well-established technique for the qualification of robust embedded software and hardware as required by different safety standards. Our article introduces a Virtual Prototype based approach for the fault analysis and fast simulation of a set of automatically generated and target compiled software programs. The approach scales to different RISC-V ISA standard subset configurations and is based on an instruction and hardware register coverage for automatic fault injections of permanent and transient bitflips. The analysis of each software binary evaluates its opcode type and register access coverage including the addressed memory space. Based on this information dedicated sets of fault injected hardware models, i.e., mutants, are generated. The simulation of all mutants conducted with the different binaries finally identifies the cases with a normal termination though executed on a faulty hardware model. They are identified as a subject for further investigations and improvements by the implementation of additional hardware or software safety countermeasures. Our final evaluation results with automatic C code generation, compilation, analysis, and simulation show that QEMU provides an adequate efficient platform, which also scales to more complex scenarios.}}, author = {{Adelt, Peer and Koppelmann, Bastian and Müller, Wolfgang and Scheytt, Christoph}}, booktitle = {{MBMV 2020 - Methods and Description Languages for Modelling and Verification of Circuits and Systems; GMM/ITG/GI-Workshop}}, title = {{{A Scalable Platform for QEMU Based Fault Effect Analysis for RISC-V Hardware Architectures}}}, year = {{2020}}, } @inproceedings{24030, abstract = {{Low-power receivers use direct-detection receiver architecture for its design simplicity and its low power dissipation. However, the direct-detection based receivers suffer from co-channel interference which significantly degrades the communication reliability. Co-channel interference robustness can be improved by using a BPSK Barker code modulated Surface Acoustic Wave (SAW) correlator as a prior stage to the RF direct detection circuit. This paper reports in details the design, fabrication and measurements of a 2.45 GHz SAW correlator with 13 bits length Barker code. The device is fabricated on Lithium Niobate LiNbO3 substrate and it is composed of an input non-coded Inter Digital Transducers (IDT), a Piezoelectric substrate and an output coded IDT. The device wavelength λ is set to 1.6 μm, considering a phase velocity of the wave equal to 3970 m.s-1. Several configurations of the device were designed and fabricated, particularly varying the aperture and the non-coded IDT length to find out the optimal device configuration. All devices were found to operate with Insertion Loss (IL) ranging from 12 to 15 dB at 2.45 GHz with a tip probing measurement setup, while a packaged sample has an IL of 12.45 dB at 2.44 GHz mounted on a PCB with external 50 Ω LC matching network. Additionally, time-domain measurement for the packaged device shows that the output has a correlation peak with a peak-to-side-lobe (PSL) ratio of 4:1 for a -0.5 dBm input BPSK Barker code signal.}}, author = {{Ballandras, Sylvain and Abughannam, Saed and Courjon, Emilie and Scheytt, Christoph}}, booktitle = {{GeMiC 2020 - German Microwave Conference}}, title = {{{Design and Fabrication of Barker Coded Surface Acoustic Wave (SAW) Correlator at 2.45 GHz for Low-Power Wake-up Receivers}}}, year = {{2020}}, } @inproceedings{3583, author = {{ Guetttatfi, Zakarya and Kaufmann, Paul and Platzner, Marco}}, booktitle = {{Proceedings of the International Workshop on Applied Reconfigurable Computing (ARC)}}, title = {{{Optimal and Greedy Heuristic Approaches for Scheduling and Mapping of Hardware Tasks to Reconfigurable Computing Devices}}}, year = {{2020}}, } @inproceedings{3800, author = {{Wachsmuth, Henning and Werner, Till}}, booktitle = {{Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics}}, pages = {{6739--6745}}, title = {{{Intrinsic Quality Assessment of Arguments}}}, year = {{2020}}, } @inproceedings{3878, author = {{El Baff, Roxanne and Wachsmuth, Henning and Al-Khatib, Khalid and Stein, Benno}}, booktitle = {{Proceedings of 58th Annual Meeting of the Association for Computational Linguistics}}, editor = {{Tsujii, Junichi and Hajic, Jan}}, pages = {{553--564}}, title = {{{Analyzing the Persuasive Effect of Style in News Editorial Argumentation}}}, year = {{2020}}, }