TY - CONF
AB - We consider a dynamic bi-objective vehicle routing problem, where a subset of customers ask for service over time. Therein, the distance traveled by a single vehicle and the number of unserved dynamic requests is minimized by a dynamic evolutionary multi-objective algorithm (DEMOA), which operates on discrete time windows (eras). A decision is made at each era by a decision-maker, thus any decision depends on irreversible decisions made in foregoing eras. To understand effects of sequences of decision-making and interactions/dependencies between decisions made, we conduct a series of experiments. More precisely, we fix a set of decision-maker preferences D and the number of eras n t and analyze all |D| nt combinations of decision-maker options. We find that for random uniform instances (a) the final selected solutions mainly depend on the final decision and not on the decision history, (b) solutions are quite robust with respect to the number of unvisited dynamic customers, and (c) solutions of the dynamic approach can even dominate solutions obtained by a clairvoyant EMOA. In contrast, for instances with clustered customers, we observe a strong dependency on decision-making history as well as more variance in solution diversity.
AU - Bossek, Jakob
AU - Grimme, Christian
AU - Rudolph, Günter
AU - Trautmann, Heike
ID - 46322
T2 - Proceedings of the IEEE Congress on Evolutionary Computation (CEC)
TI - Towards Decision Support in Dynamic Bi-Objective Vehicle Routing
ER -
TY - CONF
AB - In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier.
AU - Bossek, Jakob
AU - Grimme, Christian
AU - Trautmann, Heike
ID - 46323
T2 - Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)
TI - Dynamic Bi-Objective Routing of Multiple Vehicles
ER -
TY - CONF
AB - In online media environments, nostalgia can be used as important ingredient of propaganda strategies, specifically, by creating societal pessimism. This work addresses the automated detection of nostalgic text as a first step towards automatically identifying nostalgia-based manipulation strategies. We compare the performance of standard machine learning approaches on this challenge and demonstrate the successful transfer of the best performing approach to real-world nostalgia detection in a case study.
AU - Lena, Clever
AU - Frischlich, Lena
AU - Trautmann, Heike
AU - Grimme, Christian
ED - Grimme, Christian
ED - Preuß, Mike
ED - Takes, Frank
ED - Waldherr, Annie
ID - 46327
T2 - Disinformation in open online media
TI - Automated detection of nostalgic text in the context of societal pessimism
ER -
TY - CONF
AB - In this work we focus on the well-known Euclidean Traveling Salesperson Problem (TSP) and two highly competitive inexact heuristic TSP solvers, EAX and LKH, in the context of per-instance algorithm selection (AS). We evolve instances with 1000 nodes where the solvers show strongly different performance profiles. These instances serve as a basis for an exploratory study on the identification of well-discriminating problem characteristics (features). Our results in a nutshell: we show that even though (1) promising features exist, (2) these are in line with previous results from the literature, and (3) models trained with these features are more accurate than models adopting sophisticated feature selection methods, the advantage is not close to the virtual best solver in terms of penalized average runtime and so is the performance gain over the single best solver. However, we show that a feature-free deep neural network based approach solely based on visual representation of the instances already matches classical AS model results and thus shows huge potential for future studies.
AU - Seiler, Moritz V
AU - Pohl, Janina
AU - Bossek, Jakob
AU - Kerschke, Pascal
AU - Trautmann, Heike
ED - Bäck, Thomas
ED - Preuss, Mike
ED - Deutz, André
ED - Wang, Hao
ED - Doerr, Carola
ED - Emmerich, Michael
ED - Trautmann, Heike
ID - 46330
T2 - Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI)
TI - Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem
ER -
TY - CONF
AB - The past decade has been characterized by a strong increase in the use of social media and a continuous growth of public online discussion. With the failure of purely manual moderation, platform operators started searching for semi-automated solutions, where the application of Natural Language Processing (NLP) and Machine Learning (ML) techniques is promising. However, this requires huge financial investments for algorithmic implementations, data collection, and model training, which only big players can afford. To support smaller or medium-sized media enterprises (SME), we developed an integrated comment moderation system as an IT platform. This platform acts as a service provider and offers Analytics as a Service (AaaS) to SMEs. Operating such a platform, however, requires a robust technology stack, integrated workflows and well-defined interfaces between all parties. In this paper, we develop and discuss a suitable IT architecture and present a prototypical implementation.
AU - Riehle, Dennis M.
AU - Niemann, Marco
AU - Brunk, Jens
AU - Assenmacher, Dennis
AU - Trautmann, Heike
AU - Becker, Jörg
ED - Meiselwitz, Gabriele
ID - 46329
SN - 978-3-030-49576-3
T2 - Social Computing and Social Media. Participation, User Experience, Consumer Experience, and Applications of Social Computing
TI - Building an Integrated Comment Moderation System – Towards a Semi-automatic Moderation Tool
ER -
TY - JOUR
AB - Recently, social bots, (semi-) automatized accounts in social media, gained global attention in the context of public opinion manipulation. Dystopian scenarios like the malicious amplification of topics, the spreading of disinformation, and the manipulation of elections through “opinion machines” created headlines around the globe. As a consequence, much research effort has been put into the classification and detection of social bots. Yet, it is still unclear how easy an average online media user can purchase social bots, which platforms they target, where they originate from, and how sophisticated these bots are. This work provides a much needed new perspective on these questions. By providing insights into the markets of social bots in the clearnet and darknet as well as an exhaustive analysis of freely available software tools for automation during the last decade, we shed light on the availability and capabilities of automated profiles in social media platforms. Our results confirm the increasing importance of social bot technology but also uncover an as yet unknown discrepancy of theoretical and practically achieved artificial intelligence in social bots: while literature reports on a high degree of intelligence for chat bots and assumes the same for social bots, the observed degree of intelligence in social bot implementations is limited. In fact, the overwhelming majority of available services and software are of supportive nature and merely provide modules of automation instead of fully fledged “intelligent” social bots.
AU - Assenmacher, Dennis
AU - Clever, Lena
AU - Frischlich, Lena
AU - Quandt, Thorsten
AU - Trautmann, Heike
AU - Grimme, Christian
ID - 46333
IS - 3
JF - Social Media + Society
TI - Demystifying Social Bots: On the Intelligence of Automated Social Media Actors
VL - 6
ER -
TY - JOUR
AB - We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs – both to be minimized – is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers.
AU - Bossek, Jakob
AU - Kerschke, Pascal
AU - Trautmann, Heike
ID - 46334
JF - Applied Soft Computing
KW - Algorithm selection
KW - Multi-objective optimization
KW - Performance measurement
KW - Combinatorial optimization
KW - Traveling Salesperson Problem
SN - 1568-4946
TI - A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms
VL - 88
ER -
TY - CONF
AB - Artificial neural networks in general and deep learning networks in particular established themselves as popular and powerful machine learning algorithms. While the often tremendous sizes of these networks are beneficial when solving complex tasks, the tremendous number of parameters also causes such networks to be vulnerable to malicious behavior such as adversarial perturbations. These perturbations can change a model's classification decision. Moreover, while single-step adversaries can easily be transferred from network to network, the transfer of more powerful multi-step adversaries has - usually - been rather difficult.In this work, we introduce a method for generating strong adversaries that can easily (and frequently) be transferred between different models. This method is then used to generate a large set of adversaries, based on which the effects of selected defense methods are experimentally assessed. At last, we introduce a novel, simple, yet effective approach to enhance the resilience of neural networks against adversaries and benchmark it against established defense methods. In contrast to the already existing methods, our proposed defense approach is much more efficient as it only requires a single additional forward-pass to achieve comparable performance results.
AU - Seiler, Moritz Vinzent
AU - Trautmann, Heike
AU - Kerschke, Pascal
ID - 46331
T2 - Proceedings of the International Joint Conference on Neural Networks (IJCNN)
TI - Enhancing Resilience of Deep Learning Networks By Means of Transferable Adversaries
ER -
TY - CONF
AB - Multimodality is one of the biggest difficulties for optimization as local optima are often preventing algorithms from making progress. This does not only challenge local strategies that can get stuck. It also hinders meta-heuristics like evolutionary algorithms in convergence to the global optimum. In this paper we present a new concept of gradient descent, which is able to escape local traps. It relies on multiobjectivization of the original problem and applies the recently proposed and here slightly modified multi-objective local search mechanism MOGSA. We use a sophisticated visualization technique for multi-objective problems to prove the working principle of our idea. As such, this work highlights the transfer of new insights from the multi-objective to the single-objective domain and provides first visual evidence that multiobjectivization can link single-objective local optima in multimodal landscapes.
AU - Steinhoff, Vera
AU - Kerschke, Pascal
AU - Aspar, Pelin
AU - Trautmann, Heike
AU - Grimme, Christian
ID - 46332
T2 - Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)
TI - Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent
ER -
TY - CONF
AU - Glockner, Max
AU - Habernal, Ivan
AU - Gurevych, Iryna
ID - 48301
T2 - Findings of the Association for Computational Linguistics: EMNLP 2020
TI - Why do you think that? Exploring Faithful Sentence-Level Rationales Without Supervision
ER -
TY - CONF
AB - A full-bridge modular multilevel converter (MMC) is compared to a half-bridge-based MMC for high-current low-voltage DC-applications such as electrolysis, arc welding or datacenters with DC-power distribution. Usually, modular multilevel converters are used in high-voltage DC-applications (HVDC) in the multiple kV-range, but to meet the needs of a high-current demand at low output voltage levels, the modular converter concept requires adaptations. In the proposed concept, the MMC is used to step-down the three-phase medium-voltage of 10 kV. Therefore, each module is extended by an LLC resonant converter to adapt to the specific electrolyzers DC-voltage range of 142-220V and to provide galvanic isolation. The proposed MMC converter with full-bridge modules uses half the number of modules compared to a half-bridge-based MMC while reducing the voltage ripple by 78% and capacitor losses by 64% by rearranging the same components to ensure identical costs and volume. For additional reliability, a new robust algorithm for balancing conduction losses during the bypass phase is presented.
AU - Unruh, Roland
AU - Schafmeister, Frank
AU - Fröhleke, Norbert
AU - Böcker, Joachim
ID - 29940
KW - Cascaded H-Bridge
KW - Solid-State Transformer
KW - Capacitor voltage ripple
KW - Zero sequence voltage
KW - Full-Bridge
SN - 978-3-8007-5245-4
T2 - PCIM Europe digital days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management
TI - 1-MW Full-Bridge MMC for High-Current Low-Voltage (100V-400V) DC-Applications
ER -
TY - JOUR
AB - The proportion of freshmen enrolled in dual study programmes has steadily increased in recent years. From the perspective of potential students, these programmes are highly attractive because they combine types of learning that used to be largely separate at an institutional level: vocational and academic learning. In training-integrated dual study programmes, different institutional contexts, governance regimes, teaching styles and learning environments make bridging these two worlds of learning a challenge for both educators and learners. However, these programmes also allow leeway for didactic innovation, through the cooperation of different types of educational institutions and through new ways of using available didactic methods, and for establishing a new relationship between higher education (HE) and vocational education and training (VET). This paper positions training-integrated dual study programmes as an object of design-based research (DBR). By developing and using an extended model for the pedagogic development of HEIs, “pädagogische Hochschulentwicklung” (Brahm, Jenert, & Euler, 2016a, p. 19; Euler, 2013, p. 360), the paper systematically identifies generic educational problems in these hybrids. Based on a literature review, this paper classifies and explains the design challenges at the level of the learning environment, the study programme and the organisation. The challenges revolve mainly around the cooperation and integration of HE and VET. The paper concludes with an outlook on future DBR projects designing dual studies.
AU - Mordhorst, Lisa
AU - Gössling, Bernd
ID - 48366
IS - 1
JF - EDeR. Educational Design Research
KW - Dual study programmes
KW - Design challenges
KW - Pedagogic development of HEIs
KW - Literature review
KW - Study programme development
KW - DBR cycle
SN - 2511-0667
TI - Dual Study Programmes as a Design Challenge: Identifying Areas for Improvement as a Starting Point for Interventions
VL - 4
ER -
TY - CONF
AB - Heat dissipation is a limiting factor in the performance of many power electronic components. Especially in the TO-263-7 package, which is used for several SiC-MOSFETs, the heat transfer must take place through the cross section of the printed circuit board (PCB) to the heatsink at the bottom side. Most commonly, thermal vias are used to form this path in a perpendicular direction through all PCB-layers. In a given soft- and hard switched example applications with the use of C3M0065090J SiC-MOSFETs, this conventional approach limited the component’s maximum heat dissipation to approx. 13 W. A recent alternative approach are massive copper blocks (”pedestals”) being integrated in PCBs and reaching from their top- to the bottom-side in relevant footprint areas under SMD-housed power semiconductors. Pedestals allowing to increase the heat dissipation in the given case to even 36 W. This step is achieved due to the clearly superior heat spreading capability of that massive thermal connection between SiC-MOSFET and heatsink. For the hard switched example application the number of switch-elements can be halved to one, by using the pedestal instead of thermal vias. Independently of optimizing the heat transfer path, the up-front avoidance of losses helps to stay within existing heat dissipation limits, of course. The dominant conduction losses of the mentioned soft-switched example application could be halved by changing to SiC-MOSFET types with significant lowered RDSon. By using pedestals and changing to SiC-MOSFETs with lowered RDSon, the number of switch-elements can also be halved for the soft switched application.
AU - Strothmann, Benjamin
AU - Piepenbrock, Till
AU - Schafmeister, Frank
AU - Böcker, Joachim
ID - 30001
T2 - PCIM Europe digital days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management
TI - Heat dissipation strategies for silicon carbide power SMDs and their use in different applications
ER -
TY - JOUR
AB - Successful design of human-in-the-loop control sys- tems requires appropriate models for human decision makers. Whilst most paradigms adopted in the control systems literature hide the (limited) decision capability of humans, in behavioral economics individual decision making and optimization processes are well-known to be affected by perceptual and behavioral biases. Our goal is to enrich control engineering with some insights from behavioral economics research through exposing such biases in control-relevant settings.
This paper addresses the following two key questions:
1) How do behavioral biases affect decision making?
2) What is the role played by feedback in human-in-the-loop control systems?
Our experimental framework shows how individuals behave when faced with the task of piloting an UAV under risk and uncertainty, paralleling a real-world decision-making scenario. Our findings support the notion of humans in Cyberphysical Systems underlying behavioral biases regardless of – or even because of – receiving immediate outcome feedback. We observe substantial shares of drone controllers to act inefficiently through either flying excessively (overconfident) or overly conservatively (underconfident). Furthermore, we observe human-controllers to self-servingly misinterpret random sequences through being subject to a “hot hand fallacy”. We advise control engineers to mind the human component in order not to compromise technological accomplishments through human issues.
AU - Protte, Marius
AU - Fahr, René
AU - Quevedo, Daniel E.
ID - 21369
IS - 6
JF - IEEE Control Systems Magazine
TI - Behavioral Economics for Human-in-the-loop Control Systems Design: Overconfidence and the hot hand fallacy
VL - 40
ER -
TY - CHAP
AU - Schneider, Julia Christina
ED - Schäfer-Althaus, Sarah
ED - Strauß, Sara
ID - 36286
T2 - Transient Bodies in Anglophone Literature and Culture
TI - Birth Without a Woman: Mary Shelley's Frankenstein in the Context of Eighteenth-Century Ideas on Birth, Motherhood and Midwifery
ER -
TY - CHAP
AU - Corall, Niklas
ID - 48496
T2 - Nietzsche und die Reformation
TI - Reformation und Regierungskunst: Wahrheit als Grundlage normalisierender Macht bei Nietzsche und Foucault
ER -
TY - CONF
AU - Dröse, Jennifer
ED - Siller, H.-S.
ED - Weigel, W.
ED - Wöler, J. F.
ID - 45384
T2 - Beiträge zum Mathematikunterricht 2020
TI - Verstehensgrundlagen diagnostizieren - Welche Wissenselemente fokussieren Lehrkräfte?
ER -
TY - CHAP
AU - Dröse, Jennifer
AU - Eisen, V.
AU - Prediger, Susanne
AU - Altieri, M.
AU - Schellenbach, M.
AU - Menning, R.
ID - 45386
T2 - Mathematik lehren 223
TI - Textaufgaben lesen lernen – eine digital gestützte Einheit mit App
ER -
TY - JOUR
AB - Zusammenfassung. Die vorliegende Studie befasst sich mit der Übersetzung und Validierung des englischsprachigen Sport Emotion Questionnaire (SEQ; Jones et al., 2005 ), der vorwettbewerblichen Emotionen von Sporttreibenden misst. In einer ersten Teilstudie wurde mittels einer Hin-Rück-Übersetzung und des Bilingual-Retest-Verfahrens ( n = 32) eine deutsche Version des SEQ (SEQ-d) erzeugt. In Studie 2 (Tennisspieler/innen, n = 116) zeigte sich jedoch eine vom Original abweichende Faktorstruktur, woraufhin der SEQ-d als dreidimensionale Kurzskala entwickelt wurde. Diese wurde in Studie 3 (Läufern/innen, n = 271) validiert. Die Kurzskala besitzt einen akzeptablen Fit (CFI = .950, RMSEA = .069, SRMR = .063) und eine interne Konsistenz von α = .84 (negative Emotionen), α = .86 (positive Emotionen), α = .87 (Anspannung). Durch Korrelationen mit anderen Emotionsmerkmalen konnte die konvergente Validität bestätigt werden. Die Kriteriumsvalidität wurde anhand wettkampf- und personenbezogener Zusatzparameter untersucht (bspw. Alter, Wettkampferfahrung…). Mit der deutschsprachigen Version des SEQ liegt ein ökonomisches und validiertes Messinstrument zur Erfassung vorwettbewerblicher Emotionen vor.
AU - Wetzel, Änne
AU - Weigelt, Matthias
AU - Klingsieck, Katrin Birte
ID - 37831
IS - 4
JF - Diagnostica
KW - Clinical Psychology
SN - 0012-1924
TI - Übersetzung und Validierung einer deutschsprachigen Version des Sport Emotion Questionnaire (SEQ)
VL - 66
ER -
TY - JOUR
AB - Zusammenfassung. Die vorliegende Studie befasst sich mit der Übersetzung und Validierung des englischsprachigen Sport Emotion Questionnaire (SEQ; Jones et al., 2005 ), der vorwettbewerblichen Emotionen von Sporttreibenden misst. In einer ersten Teilstudie wurde mittels einer Hin-Rück-Übersetzung und des Bilingual-Retest-Verfahrens ( n = 32) eine deutsche Version des SEQ (SEQ-d) erzeugt. In Studie 2 (Tennisspieler/innen, n = 116) zeigte sich jedoch eine vom Original abweichende Faktorstruktur, woraufhin der SEQ-d als dreidimensionale Kurzskala entwickelt wurde. Diese wurde in Studie 3 (Läufern/innen, n = 271) validiert. Die Kurzskala besitzt einen akzeptablen Fit (CFI = .950, RMSEA = .069, SRMR = .063) und eine interne Konsistenz von α = .84 (negative Emotionen), α = .86 (positive Emotionen), α = .87 (Anspannung). Durch Korrelationen mit anderen Emotionsmerkmalen konnte die konvergente Validität bestätigt werden. Die Kriteriumsvalidität wurde anhand wettkampf- und personenbezogener Zusatzparameter untersucht (bspw. Alter, Wettkampferfahrung…). Mit der deutschsprachigen Version des SEQ liegt ein ökonomisches und validiertes Messinstrument zur Erfassung vorwettbewerblicher Emotionen vor.
AU - Wetzel, Änne
AU - Weigelt, Matthias
AU - Klingsieck, Katrin B.
ID - 29112
JF - Diagnostica
SN - 0012-1924
TI - Übersetzung und Validierung einer deutschsprachigen Version des Sport Emotion Questionnaire (SEQ)
ER -
TY - JOUR
AB - Das Schreiben von wissenschaftlichen Texten ist mit einer Vielzahl von Herausforderungen verbunden, die die Bewältigung einer Schreibaufgabe häufig mühselig erscheinen lassen. Dieser Beitrag führt das wissenschaftliche Schreiben als eine Form des komplexen Problemlösens ein. Er betrachtet das wissenschaftliche Schreiben als ein rhetorisches Problem und zeigt auf, welche Ressourcen und Strategien im Rahmen des Schreibprozesses eingesetzt werden, um dieses Problem zu lösen. Der Fokus liegt dabei auf der Rolle der Selbstregulation beim wissenschaftlichen Schreiben. Aus prominenten Kompetenz- und Phasenmodellen des Schreibens abgeleitet, stellt der Beitrag grundlegende Strategien einer erfolgreichen Selbstregulation beim wissenschaftlichen Schreiben vor, die individuell eingesetzt werden können, um ins Schreiben zu kommen und im Schreiben zu bleiben.
AU - Klingsieck, Katrin B.
AU - Golombek, Christiane
ID - 29109
JF - HLZ – Herausforderung Lehrer*innenbildung
TI - Schreibherausforderungen: Ins Schreiben kommen und im Schreiben bleiben –die Selbstregulation beim Schreiben wissenschaftlicher Texte in den Qualifizierungsphasen.
VL - 3
ER -
TY - CHAP
AU - Buhl, Heike M.
AU - Scharlau, Ingrid
AU - Patrzek, Justine
AU - Hiller, Sara
AU - Klingsieck, Katrin B.
ED - Krämer, Michael
ID - 31660
KW - Unterrichtsfach Psychologie
T2 - Psychologiedidaktik und Evaluation XIII
TI - Psychologie als Unterrichtsfach: Konzeption des Curriculums an der Universität Paderborn
ER -
TY - JOUR
AU - Svartdal, Frode
AU - Klingsieck, Katrin B.
AU - Steel, Piers
AU - Gamst-Klaussen, Thor
ID - 29111
JF - Personality and Individual Differences
SN - 0191-8869
TI - Measuring implemental delay in procrastination: Separating onset and sustained goal striving
ER -
TY - JOUR
AU - Svartdal, Frode
AU - Dahl, Tove I.
AU - Gamst-Klaussen, Thor
AU - Koppenborg, Markus
AU - Klingsieck, Katrin B.
ID - 29110
JF - Frontiers in Psychology
SN - 1664-1078
TI - How Study Environments Foster Academic Procrastination: Overview and Recommendations
ER -
TY - CHAP
AU - Luft, Sebastian
AU - Janes, Jered
ED - Burch, M
ED - McMullin, I
ID - 48813
T2 - Transcending Reason. Heidegger on Rationality,
TI - Die angebliche Frage nach dem ‘Sein des Seienden’: An Unknown Husserlian Response to Heidegger’s ‘Question of Being’
ER -
TY - BOOK
AU - Daniel-Söltenfuß, Desiree
ID - 48912
SN - 978-3-948719-03-6
TI - Geschlecht als pädagogische Herausforderung?!
ER -
TY - CONF
AB - Recently, the source separation performance was greatly improved by time-domain audio source separation based on dual-path recurrent neural network (DPRNN). DPRNN is a simple but effective model for a long sequential data. While DPRNN is quite efficient in modeling a sequential data of the length of an utterance, i.e., about 5 to 10 second data, it is harder to apply it to longer sequences such as whole conversations consisting of multiple utterances. It is simply because, in such a case, the number of time steps consumed by its internal module called inter-chunk RNN becomes extremely large. To mitigate this problem, this paper proposes a multi-path RNN (MPRNN), a generalized version of DPRNN, that models the input data in a hierarchical manner. In the MPRNN framework, the input data is represented at several (>_ 3) time-resolutions, each of which is modeled by a specific RNN sub-module. For example, the RNN sub-module that deals with the finest resolution may model temporal relationship only within a phoneme, while the RNN sub-module handling the most coarse resolution may capture only the relationship between utterances such as speaker information. We perform experiments using simulated dialogue-like mixtures and show that MPRNN has greater model capacity, and it outperforms the current state-of-the-art DPRNN framework especially in online processing scenarios.
AU - Kinoshita, Keisuke
AU - von Neumann, Thilo
AU - Delcroix, Marc
AU - Nakatani, Tomohiro
AU - Haeb-Umbach, Reinhold
ID - 20766
T2 - Proc. Interspeech 2020
TI - Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation
ER -
TY - CONF
AU - Gräßler, Iris
AU - Roesmann, Daniel
AU - Pottebaum, Jens
ID - 23518
T2 - Procedia Manufacturing - Proceedings of the 10th Conference on Learning Factories, CLF2020, Band 45; 16. - 17. Apr. 2020
TI - Traceable learning effects by use of digital adaptive assistance in production
VL - 45
ER -
TY - CONF
AU - Gräßler, Iris
AU - Pottebaum, Jens
AU - Scholle, Philipp
AU - Thiele, Henrik
ID - 23513
T2 - ISPIM Conference Proceedings; 7. - 10. Jun. 2020
TI - Innovation management and strategic planning of innovative self-preparednes and self-Protection services
ER -
TY - GEN
AU - Treder, Alexandra
ID - 48940
TI - Diskriminierung begegnen – Vielfalt gestalten : Veranstaltungsreihe von und für Studierende und Interessierte
ER -
TY - CONF
AB - Faults in the realization and usage of cyber-physical systems can cause significant security issues. Attackers might exploit vulnerabilities in the physical configurations, control systems, or accessibility through internet connections. For CPS, two challenges are combined: Firstly, discipline-specific security measures should be applied. Secondly, new measures have to be created to cover interdisciplinary impacts. For instance, faulty software configurations in cyber-physical production systems (CPPS) might allow attackers to manipulate the correct control of production processes impacting the quality of end products. From liability and publicity perspective, a worst-case scenario is that such a corrupted product is delivered to a customer. In this context, security-oriented fault-tolerance in Systems Engineering (SE) requires measures to evaluate interdisciplinary system designs with regard to potential scenarios of attacks. The paper at hand contributes a conceptual threat modelling approach to cover potential attack scenarios. The approach can be used to derive both system-level and discipline-specific security solutions. As an application case, issues are focused on which attackers intend to exploit vulnerabilities in a CPPS. The goal is to support systems engineers in verification and validation tasks regarding security-oriented fault-tolerance.
AU - Gräßler, Iris
AU - Bodden, Eric
AU - Pottebaum, Jens
AU - Geismann, Johannes
AU - Roesmann, Daniel
ID - 23521
T2 - Advanced, Contemporary Control, Advances in Intelligent Systems and Computing
TI - Security-Oriented Fault-Tolerance in Systems Engineering: A Conceptual Threat Modelling Approach for Cyber-Physical Production Systems
VL - 1196
ER -
TY - JOUR
AB - AbstractThe value of models is well recognised in product and systems engineering. Modelling languages and diagrams are used to capture mental models and to handle model complexity. Literature research indicates that there are only very few approaches to utilise the potential of virtual and augmented reality for supporting tasks in model based (systems) engineering. The paper at hand contributes a new morphology of intuitive interaction for Immersive Abstraction as a holistic approach to extend that coverage. It presents a holistic framework to categorise solutions and future research directions.
AU - Gräßler, Iris
AU - Pottebaum, Jens
ID - 23468
JF - Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020
SN - 2633-7762
TI - Immersive Abstraction: A new Morphology of Intuitive Interaction with System Models
VL - Band 1
ER -
TY - CONF
AU - Gräßler, Iris
AU - Roesmann, Daniel
AU - Pottebaum, Jens
ID - 23520
SN - 978-3-936804-27-0
T2 - Frühjahrskongress 2020 - Digitaler Wandel, digitale Arbeit, digitaler Mensch?; 16. - 18. Mrz. 2020
TI - Entwicklung eines Prüfstands für die Bewertung von kompetenzbildenden Assistenzsystemen in Cyber-physischen Produktionssystemen
ER -
TY - CONF
AU - Gräßler, Iris
AU - Pottebaum, Jens
AU - Taplick, Patrick
AU - Roesmann, Daniel
AU - Kamann, Markus
ID - 23519
SN - 978-3-936804-27-0
T2 - Frühjahrskongress 2020 - Digitaler Wandel, digitale Arbeit, digitaler Mensch?; 16. - 18. Mrz. 2020
TI - Produktdatenbasiertes, arbeitsgebundenes Lernen für und mit Augmented Reality in der Instandhaltung
ER -
TY - JOUR
AU - Pottebaum, Jens
AU - Gräßler, Iris
ID - 23530
IS - (11-12)
JF - Konstruktion
TI - Informationsqualität in der Produktentwicklung: Modellbasiertes Systems Engineering mit expliziter Berücksichtigung von Unsicherheit
VL - 72 (11-12)
ER -
TY - GEN
AU - Meyberg, Sora
AU - Treder, Alexandra
ID - 48941
TI - Mit Methoden der Drama- und Erzählpädagogik Fremdsprachen lernen
ER -
TY - CHAP
AU - Schulze, Max
ED - Gliem, Vera
ED - Strsembski, Stephan
ID - 48963
KW - Editionen
KW - Kunst
KW - Fotografie
KW - Siebdruck
KW - Farbattentat
T2 - Provinz Editionen 2011-2020
TI - Hunger (Eduardo Chillida) und Swingcolor
ER -
TY - CHAP
AU - Schulze, Max
ED - Theewen, Gerhard
ID - 48957
SN - 978-3-89770-523-4
T2 - Salon #15
TI - Der Wunsch zu verschwinden
ER -
TY - BOOK
AU - Hartung, Olaf
ID - 29817
SN - 978-3-17-022637-1
TI - Museen und Geschichtsunterricht
ER -
TY - CHAP
AU - Moritz, Tilman
ED - Stiegemann, Christoph
ID - 49006
SN - 978-3-7319-0956-9
T2 - Peter Paul Rubens und der Barock im Norden. Katalog zur Ausstellung im Erzbischöflichen Diözesanmuseum Paderborn
TI - Mehr Barock wagen. Neuordnungen des Fürstbistums Paderborn aus dem Dreißigjährigen Krieg
ER -
TY - GEN
AU - Moritz, Tilman
ID - 49018
T2 - Rottenburger Jahrbuch für Kirchengeschichte
TI - P. O. Adiele: The Popes, the Catholic Church and the Transatlantic Enslavement of Black Africans 1418–1839. Hildesheim u. a. 2017
VL - 38
ER -
TY - CHAP
AB - In this work we review the novel framework for the computation of finite dimensional invariant sets of infinite dimensional dynamical systems developed in [6] and [36]. By utilizing results on embedding techniques for infinite dimensional systems we extend a classical subdivision scheme [8] as well as a continuation algorithm [7] for the computation of attractors and invariant manifolds of finite dimensional systems to the infinite dimensional case. We show how to implement this approach for the analysis of delay differential equations and partial differential equations and illustrate the feasibility of our implementation by computing the attractor of the Mackey-Glass equation and the unstable manifold of the one-dimensional Kuramoto-Sivashinsky equation.
AU - Gerlach, Raphael
AU - Ziessler, Adrian
ED - Junge, Oliver
ED - Schütze, Oliver
ED - Ober-Blöbaum, Sina
ED - Padberg-Gehle, Kathrin
ID - 17994
SN - 2198-4182
T2 - Advances in Dynamics, Optimization and Computation
TI - The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems
VL - 304
ER -
TY - JOUR
AB - We investigate self-adjoint matrices A∈Rn,n with respect to their equivariance properties. We show in particular that a matrix is self-adjoint if and only if it is equivariant with respect to the action of a group Γ2(A)⊂O(n) which is isomorphic to ⊗nk=1Z2. If the self-adjoint matrix possesses multiple eigenvalues – this may, for instance, be induced by symmetry properties of an underlying dynamical system – then A is even equivariant with respect to the action of a group Γ(A)≃∏ki=1O(mi) where m1,…,mk are the multiplicities of the eigenvalues λ1,…,λk of A. We discuss implications of this result for equivariant bifurcation problems, and we briefly address further applications for the Procrustes problem, graph symmetries and Taylor expansions.
AU - Dellnitz, Michael
AU - Gebken, Bennet
AU - Gerlach, Raphael
AU - Klus, Stefan
ID - 16712
IS - 2
JF - Dynamical Systems
SN - 1468-9367
TI - On the equivariance properties of self-adjoint matrices
VL - 35
ER -
TY - BOOK
AU - Schulze, Max
ID - 49070
TI - Vandalene
ER -
TY - CONF
AB - In this paper we present our system for the detection and classification of acoustic scenes and events (DCASE) 2020 Challenge Task 4: Sound event detection and separation in domestic environments. We introduce two new models: the forward-backward convolutional recurrent neural network (FBCRNN) and the tag-conditioned convolutional neural network (CNN). The FBCRNN employs two recurrent neural network (RNN) classifiers sharing the same CNN for preprocessing. With one RNN processing a recording in forward direction and the other in backward direction, the two networks are trained to jointly predict audio tags, i.e., weak labels, at each time step within a recording, given that at each time step they have jointly processed the whole recording. The proposed training encourages the classifiers to tag events as soon as possible. Therefore, after training, the networks can be applied to shorter audio segments of, e.g., 200ms, allowing sound event detection (SED). Further, we propose a tag-conditioned CNN to complement SED. It is trained to predict strong labels while using (predicted) tags, i.e., weak labels, as additional input. For training pseudo strong labels from a FBCRNN ensemble are used. The presented system scored the fourth and third place in the systems and teams rankings, respectively. Subsequent improvements allow our system to even outperform the challenge baseline and winner systems in average by, respectively, 18.0% and 2.2% event-based F1-score on the validation set. Source code is publicly available at https://github.com/fgnt/pb_sed.
AU - Ebbers, Janek
AU - Haeb-Umbach, Reinhold
ID - 20753
T2 - Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020)
TI - Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection
ER -
TY - BOOK
AU - Schneider, Martin
AU - Sadowski, Dieter
AU - Frick, Bernd
AU - Warning, Susanne
ID - 21566
TI - Personalökonomie und Personalpolitik: Grundlagen einer evidenzbasierten Praxis
ER -
TY - JOUR
AU - Schneider, Martin
ID - 18426
JF - Erzähltes Geld: Finanzmärkte und Krisen in Literatur, Film und Medien
SN - 978-3-8260-6930-7
TI - Gier und andere Tugenden: Widersprüchliche Bewertungen der Marktwirtschaft ain Oliver Stones "Wall Street"
ER -
TY - JOUR
AU - Meier, Heiko
AU - Auer, Thorsten Fabian
AU - Sennefelder, Lisa
ID - 34861
IS - 1
JF - Journal Gesundheitsförderung für Akteurinnen und Akteure aus Politik, Wissenschaft und Praxis
SN - 2195-9552
TI - Der Einfluss von gesundheitsförderlichen Maßnahmen auf die Kommunikationsstrukturen: Nutzen für die Arbeitsproduktivität?
ER -
TY - JOUR
AU - Gretz, Daniela
ID - 49185
JF - JbRG
TI - Zwischen romantischem Fragment und Skizze/n der Moderne. Zum medialen Realismus von Wilhelm Raabes Wer kann es wenden?
VL - 61
ER -
TY - JOUR
AB - Beziehungen zwischen Erwachsenen und ihren Eltern sind durch Interdependenzen und Dependenzen gekennzeichnet. Während das Zusammenleben von Familien mit Kindern im mittleren Erwachsenenalter dabei ganz überwiegend durch Interdependenz geprägt ist, nehmen im Alter Dependenzen durch gesundheitliche Beeinträchtigungen der Eltern zu. Mit Blick darauf werden im Artikel behaviorale, kognitive und emotionale Merkmale von Eltern-Kind-Beziehungen erläutert und theoretisch in zentrale Konzepte eingebettet. Das Verhalten ist durch Solidarität zwischen den Generationen, aber auch durch Aspekte des Einflusses innerhalb der Beziehung und aufeinander, gekennzeichnet. Um Familienkognitionen zu beschreiben, werden die verwandten Konzepte der Individuation und der filialen Reife herangezogen. Verhalten, wie auch Kognitionen, sind eng mit dem dritten Beziehungsmerkmal, der Affektivität verknüpft, das neben positiven auch negative Gefühle sowie Ambivalenzen umfasst.
AU - Buhl, Heike M.
AU - Sommer, Sabrina
ID - 49278
IS - 2
JF - Psychotherapie im Alter
KW - General Earth and Planetary Sciences
KW - General Environmental Science
SN - 1613-2637
TI - Intergenerationelle Beziehungen in der Familie
VL - 16
ER -
TY - BOOK
ED - Breuer, Saskia
ED - Hillebrand, Sonja
ID - 49329
TI - Das Leichte Lexikon des Glaubens
ER -
TY - CONF
AU - Moritzer, Elmar
AU - Hillemeyer, Johannes
ID - 24247
T2 - 73rd Annual Assembly of International Institute of Welding (IIW) and International Conference
TI - Material Specific Predicting of the Optimal Joining Parameters for the Screw Blind Rivet Joining Process
ER -
TY - CHAP
AU - Kammeyer, Katharina
ED - Knauth, Thorsten
ED - Möller, Rainer
ED - Pithan, Annabelle
ID - 49378
T2 - Inklusive Religionspädagogik der Vielfalt. Konzeptionelle Grundlagen und didaktische Konkretionen
TI - Differenz
VL - 42
ER -
TY - JOUR
AU - Mandrella, M.
AU - Trang, S.
AU - Kolbe, L. M.
ID - 49470
IS - 2
JF - Journal of the Association for Information Systems
TI - Synthesizing and Integrating Research on IT-Based Value Co-Creation: A Meta-Analysis
VL - 21
ER -
TY - JOUR
AU - Masuch, K.
AU - Hengstler, S.
AU - Trang, S.
AU - Brendel, A.
ID - 49466
IS - 1
JF - AIS Transactions on Replication Research
TI - Replication of the Unified Model of Information Security Policy Compliance
VL - 6
ER -
TY - JOUR
AU - Brendel, B.
AU - Greulich, S.
AU - Trang, S.
AU - Niederman, F.
ID - 49465
IS - 1
JF - AIS Transactions on Replication Research
TI - Towards a Greater Diversity of Replication Studies
VL - 6
ER -
TY - JOUR
AU - Trang, S.
AU - Trenz, M.
AU - Weiger, W.
AU - Tarafdar, M.
AU - Cheung, C.
ID - 49467
JF - European Journal of Information Systems
TI - One app to trace them all? Examining app specifications for mass acceptance of contact-tracing apps
VL - 29
ER -
TY - CHAP
AU - Schumacher, Jan
AU - Rezat, Sebastian
ED - Kadunz, Gert
ID - 44685
SN - 9783662611937
T2 - Zeichen und Sprache im Mathematikunterricht: Semiotik in Theorie und Praxis
TI - Rekonstruktion diagrammatischen Schließens beim Erlernen der Subtraktion negativer Zahlen
ER -
TY - BOOK
AU - Halding, Ole
AU - Hartung, Olaf
ID - 29823
SN - 979-8-6046-6598-5
TI - Die Eigenen täuschen: Szenen eines Kriegsausbruchs nach wahrer Geschichte
ER -
TY - CONF
AU - Krings, Sarah Claudia
AU - Yigitbas, Enes
AU - Jovanovikj, Ivan
AU - Sauer, Stefan
AU - Engels, Gregor
ID - 16790
SN - 978-1-4503-7984-7/20/06
T2 - Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)
TI - Development Framework for Context-Aware Augmented Reality Applications
ER -
TY - JOUR
AU - Hagemann, Philipp
AU - Kreißl, Steffen
AU - Reinke, Paul
AU - Wagner, Alexander
ID - 47828
JF - Tierstudien
TI - "[...] eine Sammelstelle für Tierseelenkunde". Wie eine Wissenschaftszeitschrift um 1900 die Mensch/Tier-Grenze neu zu ordnen versucht
VL - 18
ER -
TY - CHAP
AU - Sloane, Hannah
AU - Kremer, H.-Hugo
ED - Fuge, Juliane
ED - Kremer, H.-Hugo
ID - 26021
T2 - Mentoring in Hochschuldidaktik und -praxis - Eine Reflexion wissenschaftlicher Erkenntnisse und praktischer Erfahrungen
TI - Peer Mentoring an der Fakultät für Wirtschaftswissenschaften - Einblicke in ein Schulungskonzept für Peer Mentor*innen
VL - 2
ER -
TY - CHAP
AU - Meyer zu Hörste-Bührer, Raphaela
ED - Focken, F.-E.
ED - van Oorschot, F.
ED - Breu, C.
ID - 49533
T2 - Schriftbindung evangelischer Theologie, Forum Theologische Literaturzeitung 37
TI - Gotteswort und Menschenwort.
ER -
TY - CHAP
AU - Meyer zu Hörste-Bührer, Raphaela
ED - Focken, F.-E.
ED - van Oorschot , F.
ED - Breu, C.
ID - 49535
T2 - Schriftbindung evangelischer Theologie, Forum Theologische Literaturzeitung 37
TI - Autorität der Schrift im Verhältnis zu Rezeptionsprozessen.
ER -
TY - CHAP
AU - Meyer zu Hörste-Bührer, Raphaela
ED - Focken, F.-E.
ED - van Oorschot, F.
ED - Breu, C.
ID - 49532
T2 - Schriftbindung evangelischer Theologie, Forum Theologische Literaturzeitung 37
TI - Schrift und Schriftauslegung in relationaler Perspektive.
ER -
TY - CHAP
AU - Meyer zu Hörste-Bührer, Raphaela
ED - Focken, F.-E.
ED - van Oorschot, F.
ED - Breu, C.
ID - 49534
T2 - Schriftbindung evangelischer Theologie, Forum Theologische Literaturzeitung 37
TI - Pluralität und Einheit der Schrift.
ER -
TY - BOOK
ED - Focken, F.-E.
ED - van Oorschot, F.
ED - Breu, C.
ED - Bührer, W.
ED - Stamer, T.
ED - Zeller, K.
ED - Ziethe, C.
ID - 49522
TI - Schriftbindung evangelischer Theologie. Theorieelemente aus interdisziplinären Gesprächen.
ER -
TY - JOUR
AU - Meyer zu Hörste-Bührer, Raphaela
ID - 49531
JF - ides quaerens intellectum. Festschrift für Walter Dietz.
TI - Die Gewalt der Ethik? Überlegungen zu Ausübung und Legitimation struktureller Gewalt durch die theologische Ethik.
ER -
TY - JOUR
AU - Meyer zu Hörste-Bührer, Raphaela
ID - 49544
JF - Zeitschrift für Evangelische Ethik 64/1
TI - Digitale antike Ethik – Gründung des „Journals of Ethics in Antiquity and Christianity (JEAC)“
ER -
TY - CONF
AB - Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring problem for bipartite graphs more efficiently by using dynamic optimization. In our approach the graph instance is given incrementally such that the EA can reoptimize its coloring when a new edge introduces a conflict. We show that, when edges are inserted in a way that preserves graph connectivity, Randomized Local Search (RLS) efficiently finds a proper 2-coloring for all bipartite graphs. This includes graphs for which RLS and other EAs need exponential expected time in a static optimization scenario. We investigate different ways of building up the graph by popular graph traversals such as breadth-first-search and depth-first-search and analyse the resulting runtime behavior. We further show that offspring populations (e. g. a (1 + {$\lambda$}) RLS) lead to an exponential speedup in {$\lambda$}. Finally, an island model using 3 islands succeeds in an optimal time of {$\Theta$}(m) on every m-edge bipartite graph, outperforming offspring populations. This is the first example where an island model guarantees a speedup that is not bounded in the number of islands.
AU - Bossek, Jakob
AU - Neumann, Frank
AU - Peng, Pan
AU - Sudholt, Dirk
ID - 48847
KW - dynamic optimization
KW - evolutionary algorithms
KW - running time analysis
KW - theory
SN - 978-1-4503-7128-5
T2 - Proceedings of the Genetic and Evolutionary Computation Conference
TI - More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization
ER -
TY - CONF
AB - One-shot optimization tasks require to determine the set of solution candidates prior to their evaluation, i.e., without possibility for adaptive sampling. We consider two variants, classic one-shot optimization (where our aim is to find at least one solution of high quality) and one-shot regression (where the goal is to fit a model that resembles the true problem as well as possible). For both tasks it seems intuitive that well-distributed samples should perform better than uniform or grid-based samples, since they show a better coverage of the decision space. In practice, quasi-random designs such as Latin Hypercube Samples and low-discrepancy point sets are indeed very commonly used designs for one-shot optimization tasks. We study in this work how well low star discrepancy correlates with performance in one-shot optimization. Our results confirm an advantage of low-discrepancy designs, but also indicate the correlation between discrepancy values and overall performance is rather weak. We then demonstrate that commonly used designs may be far from optimal. More precisely, we evolve 24 very specific designs that each achieve good performance on one of our benchmark problems. Interestingly, we find that these specifically designed samples yield surprisingly good performance across the whole benchmark set. Our results therefore give strong indication that significant performance gains over state-of-the-art one-shot sampling techniques are possible, and that evolutionary algorithms can be an efficient means to evolve these.
AU - Bossek, Jakob
AU - Doerr, Carola
AU - Kerschke, Pascal
AU - Neumann, Aneta
AU - Neumann, Frank
ID - 48849
KW - Continuous optimization
KW - Fully parallel search
KW - One-shot optimization
KW - Regression
KW - Surrogate-assisted optimization
SN - 978-3-030-58111-4
T2 - Parallel Problem Solving from Nature (PPSN XVI)
TI - Evolving Sampling Strategies for One-Shot Optimization Tasks
ER -
TY - CONF
AB - Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows to study precisely the increase in difficulty caused by weight dependence. We provide a 3.59-approximation for this weight dependent version of TSP with metric distances and bounded positive weights. Furthermore, we conduct experimental investigations for simple randomized local search with classical mutation operators and two variants of the state-of-the-art evolutionary algorithm EAX adapted to the weighted TSP. Our results show the impact of the node weights on the position of the nodes in the resulting tour.
AU - Bossek, Jakob
AU - Casel, Katrin
AU - Kerschke, Pascal
AU - Neumann, Frank
ID - 48851
KW - dynamic optimization
KW - evolutionary algorithms
KW - running time analysis
KW - theory
SN - 978-1-4503-7128-5
T2 - Proceedings of the Genetic and Evolutionary Computation Conference
TI - The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics
ER -
TY - CONF
AB - In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier.
AU - Bossek, Jakob
AU - Grimme, Christian
AU - Trautmann, Heike
ID - 48845
KW - decision making
KW - dynamic optimization
KW - evolutionary algorithms
KW - multi-objective optimization
KW - vehicle routing
SN - 978-1-4503-7128-5
T2 - Proceedings of the Genetic and Evolutionary Computation Conference
TI - Dynamic Bi-Objective Routing of Multiple Vehicles
ER -
TY - CONF
AB - The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respective (restart) variants manage to calculate close-to optimal or even optimal solutions, also for large instances with several thousand nodes in reasonable time. In this work we extend existing benchmarking studies by addressing anytime behaviour of inexact TSP solvers based on empirical runtime distributions leading to an increased understanding of solver behaviour and the respective relation to problem hardness. It turns out that performance ranking of solvers is highly dependent on the focused approximation quality. Insights on intersection points of performances offer huge potential for the construction of hybridized solvers depending on instance features. Moreover, instance features tailored to anytime performance and corresponding performance indicators will highly improve automated algorithm selection models by including comprehensive information on solver quality.
AU - Bossek, Jakob
AU - Kerschke, Pascal
AU - Trautmann, Heike
ID - 48844
T2 - 2020 IEEE Congress on Evolutionary Computation (CEC)
TI - Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection
ER -
TY - CONF
AB - Sequential model-based optimization (SMBO) approaches are algorithms for solving problems that require computationally or otherwise expensive function evaluations. The key design principle of SMBO is a substitution of the true objective function by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO algorithms are intrinsically modular, leaving the user with many important design choices. Significant research efforts go into understanding which settings perform best for which type of problems. Most works, however, focus on the choice of the model, the acquisition function, and the strategy used to optimize the latter. The choice of the initial sampling strategy, however, receives much less attention. Not surprisingly, quite diverging recommendations can be found in the literature. We analyze in this work how the size and the distribution of the initial sample influences the overall quality of the efficient global optimization (EGO) algorithm, a well-known SMBO approach. While, overall, small initial budgets using Halton sampling seem preferable, we also observe that the performance landscape is rather unstructured. We furthermore identify several situations in which EGO performs unfavorably against random sampling. Both observations indicate that an adaptive SMBO design could be beneficial, making SMBO an interesting test-bed for automated algorithm design.
AU - Bossek, Jakob
AU - Doerr, Carola
AU - Kerschke, Pascal
ID - 48850
KW - continuous black-box optimization
KW - design of experiments
KW - initial design
KW - sequential model-based optimization
SN - 978-1-4503-7128-5
T2 - Proceedings of the Genetic and Evolutionary Computation Conference
TI - Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB
ER -
TY - CONF
AB - The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting components. The Traveling Thief Problem (TTP) addresses such interactions by combining two combinatorial optimisation problems, namely the TSP and the Knapsack Problem (KP). Recently, a new problem called the node weight dependent Traveling Salesperson Problem (W-TSP) has been introduced where nodes have weights that influence the cost of the tour. In this paper, we compare W-TSP and TTP. We investigate the structure of the optimised tours for W-TSP and TTP and the impact of using each others fitness function. Our experimental results suggest (1) that the W-TSP often can be solved better using the TTP fitness function and (2) final W-TSP and TTP solutions show different distributions when compared with optimal TSP or weighted greedy solutions.
AU - Bossek, Jakob
AU - Neumann, Aneta
AU - Neumann, Frank
ID - 48852
KW - Evolutionary algorithms
KW - Node weight dependent TSP
KW - Traveling Thief Problem
SN - 978-3-030-58111-4
T2 - Parallel Problem Solving from Nature (PPSN XVI)
TI - Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions
ER -
TY - CONF
AB - We consider a dynamic bi-objective vehicle routing problem, where a subset of customers ask for service over time. Therein, the distance traveled by a single vehicle and the number of unserved dynamic requests is minimized by a dynamic evolutionary multi-objective algorithm (DEMOA), which operates on discrete time windows (eras). A decision is made at each era by a decision-maker, thus any decision depends on irreversible decisions made in foregoing eras. To understand effects of sequences of decision-making and interactions/dependencies between decisions made, we conduct a series of experiments. More precisely, we fix a set of decision-maker preferences D and the number of eras n{$<$}inf{$>$}t{$<$}/inf{$>$} and analyze all $|D|\^{n_t}$ combinations of decision-maker options. We find that for random uniform instances (a) the final selected solutions mainly depend on the final decision and not on the decision history, (b) solutions are quite robust with respect to the number of unvisited dynamic customers, and (c) solutions of the dynamic approach can even dominate solutions obtained by a clairvoyant EMOA. In contrast, for instances with clustered customers, we observe a strong dependency on decision-making history as well as more variance in solution diversity.
AU - Bossek, Jakob
AU - Grimme, Christian
AU - Rudolph, Günter
AU - Trautmann, Heike
ID - 48846
T2 - 2020 IEEE Congress on Evolutionary Computation (CEC)
TI - Towards Decision Support in Dynamic Bi-Objective Vehicle Routing
ER -
TY - CONF
AB - Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this area of research by examining evolutionary diversity optimisation approaches for the classical Traveling Salesperson Problem (TSP). We study the impact of using different diversity measures for a given set of tours and the ability of evolutionary algorithms to obtain a diverse set of high quality solutions when adopting these measures. Our studies show that a large variety of diverse high quality tours can be achieved by using our approaches. Furthermore, we compare our approaches in terms of theoretical properties and the final set of tours obtained by the evolutionary diversity optimisation algorithm.
AU - Do, Anh Viet
AU - Bossek, Jakob
AU - Neumann, Aneta
AU - Neumann, Frank
ID - 48879
KW - diversity maximisation
KW - evolutionary algorithms
KW - travelling salesperson problem
SN - 978-1-4503-7128-5
T2 - Proceedings of the Genetic and Evolutionary Computation Conference
TI - Evolving Diverse Sets of Tours for the Travelling Salesperson Problem
ER -
TY - CONF
AB - Evolutionary algorithms (EAs) are general-purpose problem solvers that usually perform an unbiased search. This is reasonable and desirable in a black-box scenario. For combinatorial optimization problems, often more knowledge about the structure of optimal solutions is given, which can be leveraged by means of biased search operators. We consider the Minimum Spanning Tree (MST) problem in a single- and multi-objective version, and introduce a biased mutation, which puts more emphasis on the selection of edges of low rank in terms of low domination number. We present example graphs where the biased mutation can significantly speed up the expected runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate that bias can lead to exponential runtime if "heavy" edges are necessarily part of an optimal solution. However, on general graphs in the single-objective setting, we show that a combined mutation operator which decides for unbiased or biased edge selection in each step with equal probability exhibits a polynomial upper bound - as unbiased mutation - in the worst case and benefits from bias if the circumstances are favorable.
AU - Roostapour, Vahid
AU - Bossek, Jakob
AU - Neumann, Frank
ID - 48895
KW - biased mutation
KW - evolutionary algorithms
KW - minimum spanning tree problem
KW - runtime analysis
SN - 978-1-4503-7128-5
T2 - Proceedings of the 2020 Genetic and Evolutionary Computation Conference
TI - Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem
ER -
TY - CONF
AB - In this work we focus on the well-known Euclidean Traveling Salesperson Problem (TSP) and two highly competitive inexact heuristic TSP solvers, EAX and LKH, in the context of per-instance algorithm selection (AS). We evolve instances with nodes where the solvers show strongly different performance profiles. These instances serve as a basis for an exploratory study on the identification of well-discriminating problem characteristics (features). Our results in a nutshell: we show that even though (1) promising features exist, (2) these are in line with previous results from the literature, and (3) models trained with these features are more accurate than models adopting sophisticated feature selection methods, the advantage is not close to the virtual best solver in terms of penalized average runtime and so is the performance gain over the single best solver. However, we show that a feature-free deep neural network based approach solely based on visual representation of the instances already matches classical AS model results and thus shows huge potential for future studies.
AU - Seiler, Moritz
AU - Pohl, Janina
AU - Bossek, Jakob
AU - Kerschke, Pascal
AU - Trautmann, Heike
ID - 48897
KW - Automated algorithm selection
KW - Deep learning
KW - Feature-based approaches
KW - Traveling Salesperson Problem
SN - 978-3-030-58111-4
T2 - Parallel Problem Solving from {Nature} (PPSN XVI)
TI - Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem
ER -
TY - JOUR
AB - We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs \textendash both to be minimized \textendash is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers. \textbullet The multi-objective perspective is naturally generalizable to multiple objectives. \textbullet Proof of relationship between HV and the PAR in the considered bi-objective space. \textbullet New insights into complementary behavior of stochastic optimization algorithms.
AU - Bossek, Jakob
AU - Kerschke, Pascal
AU - Trautmann, Heike
ID - 48848
IS - C
JF - Applied Soft Computing
KW - Algorithm selection
KW - Combinatorial optimization
KW - Multi-objective optimization
KW - Performance measurement
KW - Traveling Salesperson Problem
SN - 1568-4946
TI - A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms
VL - 88
ER -
TY - JOUR
AU - Bartz-Beielstein, Thomas
AU - Doerr, Carola
AU - van den Berg, Daan
AU - Bossek, Jakob
AU - Chandrasekaran, Sowmya
AU - Eftimov, Tome
AU - Fischbach, Andreas
AU - Kerschke, Pascal
AU - Cava, William La
AU - Lopez-Ibanez, Manuel
AU - Malan, Katherine M.
AU - Moore, Jason H.
AU - Naujoks, Boris
AU - Orzechowski, Patryk
AU - Volz, Vanessa
AU - Wagner, Markus
AU - Weise, Thomas
ID - 48836
JF - Corr
TI - Benchmarking in Optimization: Best Practice and Open Issues
ER -
TY - GEN
AU - Fastlabend-Vargas, Daniel
ID - 49599
TI - Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info
ER -
TY - BOOK
AU - Lammer, Christina
ID - 30869
TI - Erinnerung und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa
ER -
TY - GEN
AU - Huybrechts, Yves
ID - 49767
TI - "Die Bombardierung von Brüssel - teil 1" (PODCAST)
ER -
TY - JOUR
AU - Huybrechts, Yves
ID - 49736
JF - Historisches Jahrbuch
SN - 00182621
TI - Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und Reichskammergericht, 1737-1739
VL - 140
ER -
TY - GEN
AU - Huybrechts, Yves
ID - 49756
TI - "Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen." (VIDEO)
ER -
TY - GEN
AU - Huybrechts, Yves
ID - 49750
TI - Interview zur Ausstellung "Rubens und der Barock im Norden" - 2 Teile (VIDEO)
ER -
TY - CHAP
AU - Diedrich, Alena
ED - Bremer, Kai
ED - Elit, Stefan
ED - Kroucheva, Katerina
ID - 49831
T2 - Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext
TI - Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic
ER -
TY - CHAP
AU - Diedrich, Alena
ED - Eke, Norbert Otto
ID - 49832
T2 - Handbuch Vormärz
TI - Lyrik im Vormärz
ER -
TY - CHAP
AU - Diedrich, Alena
ED - Eke, Norbert Otto
ID - 49833
T2 - Handbuch Vormärz
TI - Nikolaus Lenau
ER -
TY - CHAP
AU - Neiske, Iris
AU - Bücker, Diana
ID - 49869
SN - 1424-3636
T2 - Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37
TI - Medienpädagogik und Hochschuldidaktik
ER -
TY - BOOK
ED - Autsch, Sabiene
ED - Pickartz, Tim
ID - 49915
TI - Impulse 5. Texte und Bilder zur Kunstvermittlung: Go West! Kunst- und Ausstellungsszene New York 2019.
ER -
TY - BOOK
ED - Autsch, Sabiene
ID - 49917
TI - "Was machst du gerade?" Essays aus dem Atelier in Zeiten von Corona
ER -
TY - GEN
AU - Autsch, Sabiene
ID - 49947
IS - 155
T2 - PUR [= Paderborner Universitätsreden. Hg. von. Prof. em. Dr. Dr. hc. malt. Peter Freese]
TI - Festrede auf Maria v. Welser anlässlich der Verleihung der Ehrendoktorwürde am 14.11.2019 durch die kulturwissenschaftliche Fakultät der Universität Paderborn
ER -
TY - JOUR
AU - Karsten, Andrea
AU - Weisberg, Jan
ID - 32154
JF - JoSch - Journal der Schreibwissenschaft
TI - Profession und Disziplin. Ein Schreibgespräch über den Weg durch die Fächer, Schreibdidaktik als Feldforschung (und - nebenbei - die Rettung der Schriftkultur).
VL - 2
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 28698
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete Zbl 1445.01036
TI - Wittgenstein, Ludwig, Wiener Ausgabe, Bd. 8.2: Synopse der Manuskriptbände V bis X, hg. v. Michael Nedo, Vittorio Klostermann: Frankfurt a.M. 2019
ER -
TY - JOUR
AU - Pauls, Karina
ID - 50105
JF - Kunst+Unterricht 441/442
TI - Alice im Wunderland. Ein Klassiker der Kinderliteratur als Künstlerbuch
ER -
TY - CHAP
AU - Dahmen, Stephan
AU - Bonvin, Jean-Michel
ED - Knöpfel, Carlo
ED - Maeder, Pascal
ED - Tecklenburg, Ueli
ID - 50137
T2 - Wörterbuch der Schweizer Sozialpolitik
TI - Soziale Investition
ER -
TY - JOUR
AU - Stricker, Ina
AU - Müller, Lenka
AU - Hohmann, Sascha
ID - 50192
IS - 2020
JF - Astronomie + Raumfahrt im Unterricht
SN - 1437-8639
TI - Die Entstehung von Sternen und Planeten
VL - 6
ER -