@inproceedings{46591, author = {{Mapura Ramirez, Luz Alejandra and Kenig, Eugeny Y.}}, location = {{Frankfurt am Main}}, title = {{{Zur Berechnug von flüssigkeitsseitigen Stoffübergagnskoeffizienten für Strukturpackungen}}}, year = {{2023}}, } @article{23428, abstract = {{The Koopman operator has become an essential tool for data-driven approximation of dynamical (control) systems in recent years, e.g., via extended dynamic mode decomposition. Despite its popularity, convergence results and, in particular, error bounds are still quite scarce. In this paper, we derive probabilistic bounds for the approximation error and the prediction error depending on the number of training data points; for both ordinary and stochastic differential equations. Moreover, we extend our analysis to nonlinear control-affine systems using either ergodic trajectories or i.i.d. samples. Here, we exploit the linearity of the Koopman generator to obtain a bilinear system and, thus, circumvent the curse of dimensionality since we do not autonomize the system by augmenting the state by the control inputs. To the best of our knowledge, this is the first finite-data error analysis in the stochastic and/or control setting. Finally, we demonstrate the effectiveness of the proposed approach by comparing it with state-of-the-art techniques showing its superiority whenever state and control are coupled.}}, author = {{Nüske, Feliks and Peitz, Sebastian and Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl}}, journal = {{Journal of Nonlinear Science}}, title = {{{Finite-data error bounds for Koopman-based prediction and control}}}, doi = {{10.1007/s00332-022-09862-1}}, volume = {{33}}, year = {{2023}}, } @unpublished{46649, abstract = {{Different conflicting optimization criteria arise naturally in various Deep Learning scenarios. These can address different main tasks (i.e., in the setting of Multi-Task Learning), but also main and secondary tasks such as loss minimization versus sparsity. The usual approach is a simple weighting of the criteria, which formally only works in the convex setting. In this paper, we present a Multi-Objective Optimization algorithm using a modified Weighted Chebyshev scalarization for training Deep Neural Networks (DNNs) with respect to several tasks. By employing this scalarization technique, the algorithm can identify all optimal solutions of the original problem while reducing its complexity to a sequence of single-objective problems. The simplified problems are then solved using an Augmented Lagrangian method, enabling the use of popular optimization techniques such as Adam and Stochastic Gradient Descent, while efficaciously handling constraints. Our work aims to address the (economical and also ecological) sustainability issue of DNN models, with a particular focus on Deep Multi-Task models, which are typically designed with a very large number of weights to perform equally well on multiple tasks. Through experiments conducted on two Machine Learning datasets, we demonstrate the possibility of adaptively sparsifying the model during training without significantly impacting its performance, if we are willing to apply task-specific adaptations to the network weights. Code is available at https://github.com/salomonhotegni/MDMTN.}}, author = {{Hotegni, Sedjro Salomon and Peitz, Sebastian and Berkemeier, Manuel Bastian}}, booktitle = {{arXiv:2308.12243}}, pages = {{13}}, title = {{{Multi-Objective Optimization for Sparse Deep Neural Network Training}}}, year = {{2023}}, } @article{46637, author = {{Gonchikzhapov, Munko and Kasper, Tina}}, issn = {{2666-352X}}, journal = {{Applications in Energy and Combustion Science}}, keywords = {{Nanoparticle synthesis, Flame spray pyrolysis, SpraySyn burner, Flame structure, Species distribution, Temperature distribution}}, publisher = {{Elsevier BV}}, title = {{{Thermal and chemical structure of ethanol and 2-ethylhexanoic acid/ethanol SpraySyn flames}}}, doi = {{10.1016/j.jaecs.2023.100174}}, volume = {{15}}, year = {{2023}}, } @article{21600, abstract = {{Many problems in science and engineering require an efficient numerical approximation of integrals or solutions to differential equations. For systems with rapidly changing dynamics, an equidistant discretization is often inadvisable as it results in prohibitively large errors or computational effort. To this end, adaptive schemes, such as solvers based on Runge–Kutta pairs, have been developed which adapt the step size based on local error estimations at each step. While the classical schemes apply very generally and are highly efficient on regular systems, they can behave suboptimally when an inefficient step rejection mechanism is triggered by structurally complex systems such as chaotic systems. To overcome these issues, we propose a method to tailor numerical schemes to the problem class at hand. This is achieved by combining simple, classical quadrature rules or ODE solvers with data-driven time-stepping controllers. Compared with learning solution operators to ODEs directly, it generalizes better to unseen initial data as our approach employs classical numerical schemes as base methods. At the same time it can make use of identified structures of a problem class and, therefore, outperforms state-of-the-art adaptive schemes. Several examples demonstrate superior efficiency. Source code is available at https://github.com/lueckem/quadrature-ML.}}, author = {{Dellnitz, Michael and Hüllermeier, Eyke and Lücke, Marvin and Ober-Blöbaum, Sina and Offen, Christian and Peitz, Sebastian and Pfannschmidt, Karlson}}, journal = {{SIAM Journal on Scientific Computing}}, number = {{2}}, pages = {{A579--A595}}, title = {{{Efficient time stepping for numerical integration using reinforcement learning}}}, doi = {{10.1137/21M1412682}}, volume = {{45}}, year = {{2023}}, } @inbook{46691, author = {{Dahms, Frederik and Homberg, Werner}}, booktitle = {{Lecture Notes in Mechanical Engineering}}, isbn = {{9783031410222}}, issn = {{2195-4356}}, location = {{Cannes, France}}, publisher = {{Springer Nature Switzerland}}, title = {{{Analysis and Modelling of the Deformation in the Manufacture of Flange-Contours by the Combined Friction-Spinning and Flow-Forming Process}}}, doi = {{10.1007/978-3-031-41023-9_72}}, year = {{2023}}, } @inproceedings{46665, author = {{Garnefeld, I. and Böhm, Eva and Hanf, L. and Helm, S.}}, booktitle = {{2023 AMA Summer Academic Conference, San Francisco, CA}}, location = {{San Francisco, CA}}, title = {{{Unboxing video effectiveness – Does speech matter?}}}, year = {{2023}}, } @inproceedings{46666, author = {{Kessing, K. and Garnefeld, I. and Böhm, Eva}}, booktitle = {{EMAC Annual Conference, Odense, Denmark}}, location = {{Odense, Denmark.}}, title = {{{The dark and bright side of online reviews in manufacturer online shops}}}, year = {{2023}}, } @inproceedings{46667, author = {{Hanf, L. and Garnefeld, I. and Böhm, Eva and Helm, S.}}, booktitle = {{EMAC Annual Conference, Odense, Denmark}}, location = {{Odense, Denmark}}, title = {{{Stimulating engagement with unboxing videos – Does speech matter?}}}, year = {{2023}}, } @inproceedings{46739, author = {{Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, booktitle = {{2023 53rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W)}}, publisher = {{IEEE}}, title = {{{Low Power Streaming of Sensor Data Using Gray Code-Based Approximate Communication}}}, doi = {{10.1109/dsn-w58399.2023.00056}}, year = {{2023}}, } @inproceedings{46740, author = {{Janzen, Thomas and Wotschel, Philipp and Meier, Jana and Vogelsang, Christoph}}, booktitle = {{EARLI 2023}}, location = {{Thessaloniki, Greece}}, title = {{{Assessing pre-service EFL teachers’ feedback performance in role-play-based simulations}}}, year = {{2023}}, } @article{46741, author = {{Zscherp, Mario Fabian and Jentsch, Silas Aurel and Müller, Marius Johannes and Lider, Vitalii and Becker, Celina and Chen, Limei and Littmann, Mario and Meier, Falco and Beyer, Andreas and Hofmann, Detlev Michael and As, Donat Josef and Klar, Peter Jens and Volz, Kerstin and Chatterjee, Sangam and Schörmann, Jörg}}, issn = {{1944-8244}}, journal = {{ACS Applied Materials & Interfaces}}, keywords = {{General Materials Science}}, number = {{33}}, pages = {{39513--39522}}, publisher = {{American Chemical Society (ACS)}}, title = {{{Overcoming the Miscibility Gap of GaN/InN in MBE Growth of Cubic InxGa1–xN}}}, doi = {{10.1021/acsami.3c06319}}, volume = {{15}}, year = {{2023}}, } @inproceedings{33722, author = {{Müller, Michelle and Neumann, Jürgen}}, booktitle = {{Proceedings of the 55th Hawaii International Conference on System Sciences (HICSS)}}, location = {{Maui, Hawaii, USA}}, title = {{{Bring me my Meal on your Wheel - An Empirical Analysis of the Impact of Food Delivery Platforms on Local Restaurant Employment}}}, year = {{2023}}, } @article{44143, abstract = {{AbstractWorking conditions of knowledge workers have been subject to rapid change recently. Digital nomadism is no longer a phenomenon that relates only to entrepreneurs, freelancers, and gig workers. Corporate employees, too, have begun to uncouple their work from stationary (home) offices and 9-to-5 schedules. However, pursuing a permanent job in a corporate environment is still subject to fundamentally different values than postulated by the original notion of digital nomadism. Therefore, this paper explores the work identity of what is referred to as ‘corporate nomads’. By drawing on identity theory and the results of semi-structured interviews, the paper proposes a conceptualization of the corporate nomad archetype and presents nine salient identity issues of corporate nomads (e.g., holding multiple contradictory identities, the flexibility paradox, or collaboration constraints). By introducing the ‘corporate nomad’ archetype to the Information Systems literature, this article helps to rethink established conceptions of “home office” and socio-spatial configurations of knowledge work.}}, author = {{Marx, Julian and Stieglitz, Stefan and Brünker, Felix and Mirbabaie, Milad}}, issn = {{2363-7005}}, journal = {{Business & Information Systems Engineering}}, keywords = {{Information Systems}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Home (Office) is where your Heart is}}}, doi = {{10.1007/s12599-023-00807-w}}, year = {{2023}}, } @article{46487, author = {{Zander, K.K. and Nguyen, D. and Mirbabaie, Milad and Garnett, S.T.}}, issn = {{2212-4209}}, journal = {{International Journal of Disaster Risk Reduction}}, keywords = {{Geology, Safety Research, Geotechnical Engineering and Engineering Geology, Building and Construction}}, publisher = {{Elsevier BV}}, title = {{{Aware but not prepared: understanding situational awareness during the century flood in Germany in 2021}}}, doi = {{10.1016/j.ijdrr.2023.103936}}, volume = {{96}}, year = {{2023}}, } @book{45863, abstract = {{In the proposal for our CRC in 2011, we formulated a vision of markets for IT services that describes an approach to the provision of such services that was novel at that time and, to a large extent, remains so today: „Our vision of on-the-fly computing is that of IT services individually and automatically configured and brought to execution from flexibly combinable services traded on markets. At the same time, we aim at organizing markets whose participants maintain a lively market of services through appropriate entrepreneurial actions.“ Over the last 12 years, we have developed methods and techniques to address problems critical to the convenient, efficient, and secure use of on-the-fly computing. Among other things, we have made the description of services more convenient by allowing natural language input, increased the quality of configured services through (natural language) interaction and more efficient configuration processes and analysis procedures, made the quality of (the products of) providers in the marketplace transparent through reputation systems, and increased the resource efficiency of execution through reconfigurable heterogeneous computing nodes and an integrated treatment of service description and configuration. We have also developed network infrastructures that have a high degree of adaptivity, scalability, efficiency, and reliability, and provide cryptographic guarantees of anonymity and security for market participants and their products and services. To demonstrate the pervasiveness of the OTF computing approach, we have implemented a proof-of-concept for OTF computing that can run typical scenarios of an OTF market. We illustrated the approach using a cutting-edge application scenario – automated machine learning (AutoML). Finally, we have been pushing our work for the perpetuation of On-The-Fly Computing beyond the SFB and sharing the expertise gained in the SFB in events with industry partners as well as transfer projects. This work required a broad spectrum of expertise. Computer scientists and economists with research interests such as computer networks and distributed algorithms, security and cryptography, software engineering and verification, configuration and machine learning, computer engineering and HPC, microeconomics and game theory, business informatics and management have successfully collaborated here.}}, author = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}}, pages = {{247}}, publisher = {{Heinz Nixdorf Institut, Universität Paderborn}}, title = {{{On-The-Fly Computing -- Individualized IT-services in dynamic markets}}}, doi = {{10.17619/UNIPB/1-1797}}, volume = {{412}}, year = {{2023}}, } @article{45458, author = {{Stieglitz, Stefan and Mirbabaie, Milad and Deubel, Annika and Braun, Lea-Marie and Kissmer, Tobias}}, issn = {{0268-4012}}, journal = {{International Journal of Information Management}}, keywords = {{Library and Information Sciences, Computer Networks and Communications, Information Systems}}, publisher = {{Elsevier BV}}, title = {{{The potential of digital nudging to bridge the gap between environmental attitude and behavior in the usage of smart home applications}}}, doi = {{10.1016/j.ijinfomgt.2023.102665}}, volume = {{72}}, year = {{2023}}, } @article{46746, author = {{Mirbabaie, Milad and Marx, Julian and Erle, Lukas}}, issn = {{1943-7544}}, journal = {{Pacific Asia Journal of the Association for Information Systems}}, title = {{{Digital Nudge Stacking and Backfiring: Understanding Sustainable E-Commerce Purchase Decisions}}}, year = {{2023}}, } @misc{46753, abstract = {{Die Energieaufnahme von Haushaltskältegeräten ist seit den 1990er Jahren erheblich gesunken. Dieser Wert wird von den Herstellern im Neuzustand der Geräte unter Normbedingungen bestimmt. Wie jedes technische System unterliegen jedoch auch Haushaltskältegeräte einem Alterungsprozess, der zu einem Anstieg der Energieaufnahme über die Zeit führt. Im Rahmen dieser Dissertation wurde auf der Grundlage von 100 Messungen der Energieaufnahme, die an 32 Geräten über einen Zeitraum von 21 Jahren durchgeführt wurden, ein Alterungsmodell entwickelt. Dieses Modell ist das erste, das mit Hilfe von Daten der Energieaufnahme real gealterter Geräte entwickelt wurde. Es beschreibt einen Anstieg der Energieaufnahme von 27 % über die durchschnittliche Einsatzzeit eines Haushaltskältegeräts von 16 Jahren. Der stärkste Anstieg erfolgt in den ersten fünf Betriebsjahren. Durch Diffusionsvorgänge in dem im Gehäuse verbauten Polyurethan-Schaum wird das im Zellgas vorhandene Kohlenstoffdioxid durch Luft ersetzt. Hierdurch steigt die Wärmeleitfähigkeit des Schaums um ca. 33 % an, wodurch sich die Energieaufnahme der Geräte erhöht. Des Weiteren wurde der Einsatz von Paraffinen als Phasenwechselmaterial in Haushaltskältegeräten untersucht. Durch deren Einsatz konnte die Energieaufnahme gesenkt und die Funktionalität der Geräte gesteigert werden. Hierfür sind detaillierte Kenntnisse der Materialkenndaten der Paraffine notwendig. Die Wärmeleitfähigkeit der verschiedenen Paraffin-Stoffgruppen in der festen Phase ist jedoch bisher nur unzureichend untersucht worden. Daher wurde ein Messaufbau entwickelt, mit dem die Wärmeleitfähigkeit von festem Paraffin bestimmt werden kann, und es wurden entsprechende Messungen durchgeführt.}}, author = {{Paul, Andreas}}, publisher = {{LibreCat University}}, title = {{{Analyse von Alterungsmechanismen im Hinblick auf die Effizienz von Haushaltskältegeräten}}}, doi = {{10.17619/UNIPB/1-1784}}, year = {{2023}}, } @article{34114, abstract = {{Qualitative comparative analysis (QCA) enables researchers in international management to better understand how the impact of a single explanatory factor depends on the context of other factors. But the analytical toolbox of QCA does not include a parameter for the explanatory power of a single explanatory factor or “condition”. In this paper, we therefore reinterpret the Banzhaf power index, originally developed in cooperative game theory, to establish a goodness-of-fit parameter in QCA. The relative Banzhaf index we suggest measures the explanatory power of one condition averaged across all sufficient combinations of conditions. The paper argues that the index is especially informative in three situations that are all salient in international management and call for a context-sensitive analysis of single conditions, namely substantial limited diversity in the data, the emergence of strong INUS conditions in the analysis, and theorizing with contingency factors. The paper derives the properties of the relative Banzhaf index in QCA, demonstrates how the index can be computed easily from a rudimentary truth table, and explores its insights by revisiting selected papers in international management that apply fuzzy-set QCA. It finally suggests a three-step procedure for utilizing the relative Banzhaf index when the causal structure involves both contingency effects and configurational causation. }}, author = {{Haake, Claus-Jochen and Schneider, Martin}}, journal = {{Journal of International Management}}, keywords = {{Qualitative comparative analysis, Banzhaf power index, causality, explanatory power}}, publisher = {{Elsevier}}, title = {{{Playing games with QCA: Measuring the explanatory power of single conditions with the Banzhaf index}}}, year = {{2023}}, }