@inbook{34077, author = {{Bondarenko, Alexander and Fröbe, Maik and Kiesel, Johannes and Syed, Shahbaz and Gurcke, Timon and Beloucif, Meriem and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast, Martin and Hagen, Matthias}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030997380}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Overview of Touché 2022: Argument Retrieval}}}, doi = {{10.1007/978-3-030-99739-7_43}}, year = {{2022}}, } @inbook{33985, abstract = {{Der Beitrag widmet sich dem Einsatz von Augmented Reality (AR) in betrieblichen Aus- und Weiterbildungskontexten. Hierbei stehen insbesondere Fragen zu Berufsfeldern und Ausbildungsinhalten, zu verwendeten AR-Spezifikationen, zu Zusammenhängen zwischen AR-Anwendung und leistungs-, wahrnehmungs- und motivationsbezogenen Variablen sowie zur didaktischen Einbettung entsprechender Technologien im Fokus. Auf Basis einer integrierenden Sichtung bestehender Literatur konnten insgesamt 16 Studien sowie zwei bereits vorliegende Literaturreviews in die Analyse eingeschlossen werden. Die Ergebnisse verweisen u. a. auf eine heterogene Lage hinsichtlich forschungsmethodischer Zugänge und didaktischer Referenzkonzepte. Weitgehend förderliche Effekte auf leistungs-, wahrnehmungs- und motivationsbezogene Variablen stimmen insgesamt bezüglich des AR-Einsatzes positiv, machen aber auch die Notwendigkeit einer integrierten Betrachtung technologischer und pädagogisch-instruktionaler Gestaltungsparameter deutlich.}}, author = {{Kärner, Tobias and Goller, Michael and Maier, Andreas}}, booktitle = {{Digitalisierung und digitale Medien in der Berufsbildung: Konzepte, Befunde und Herausforderungen}}, editor = {{Schumann, Stephan and Seeber, Susan and Abele, Stephan}}, keywords = {{Augmented Reality, Ausbildung, Weiterbildung, Lernen mit digitalen Medien, integratives Literaturreview}}, pages = {{213--230}}, publisher = {{wbv}}, title = {{{Augmented Reality Anwendungen in der betrieblichen Aus‐ und Weiterbildung}}}, volume = {{41}}, year = {{2022}}, } @article{34080, abstract = {{Startpunkt jeglicher Professionalisierungsbemühungen ist ein Verständnis der für das professionelle Handeln notwendigen Kompetenzen. Dieser Beitrag widmet sich der literaturbasierten Identifikation von Kompetenzen des betrieblichen Ausbildungspersonals und ordnet diese den vier Kompetenzbereichen Fach-, Methoden-, Sozial- und Selbstkompetenz zu. Die Ergebnisse können sowohl als Grundlage für weitere Forschung dienen als auch in der Praxis als Orientierung für die Gestaltung von Qualifizierungsmaßnahmen verwendet werden. }}, author = {{Bonnes, Caroline and Binkert, Julia and Goller, Michael}}, journal = {{Berufsbildung in Wissenschaft und Praxis – BWP}}, number = {{4}}, title = {{{Kompetenzen des betrieblichen Ausbildungspersonals: Eine literaturbasierte Systematisierung}}}, year = {{2022}}, } @inproceedings{34051, abstract = {{An argument is a constellation of premises reasoning towards a certain conclusion. The automatic generation of conclusions is becoming a very prominent task, raising the need for automatic measures to assess the quality of these generated conclusions. The SharedTask at the 9th Workshop on Argument Mining proposes a new task to assess the novelty and validity of a conclusion given a set of premises. In this paper, we present a multitask learning approach that transfers the knowledge learned from the natural language inference task to the tasks at hand. Evaluation results indicate the importance of both knowledge transfer and joint learning, placing our approach in the fifth place with strong results compared to baselines.}}, author = {{Alshomary, Milad and Stahl, Maja}}, booktitle = {{Proceedings of the 9th Workshop on Argument Mining}}, pages = {{111–114}}, publisher = {{International Conference on Computational Linguistics}}, title = {{{Argument Novelty and Validity Assessment via Multitask and Transfer Learning}}}, year = {{2022}}, } @article{34099, abstract = {{Using a unique combination of advanced characterization techniques, we identify specific degradation mechanisms and quantify degradative species formed during fast charge cycling of lithium-ion battery pouch cells.}}, author = {{McShane, Eric J. and Paul, Partha P. and Tanim, Tanvir R. and Cao, Chuntian and Steinrück, Hans-Georg and Thampy, Vivek and Trask, Stephen E. and Dunlop, Alison R. and Jansen, Andrew N. and Dufek, Eric J. and Toney, Michael F. and Weker, Johanna Nelson and McCloskey, Bryan D.}}, issn = {{2050-7488}}, journal = {{Journal of Materials Chemistry A}}, keywords = {{General Materials Science, Renewable Energy, Sustainability and the Environment, General Chemistry}}, number = {{44}}, pages = {{23927--23939}}, publisher = {{Royal Society of Chemistry (RSC)}}, title = {{{Multimodal quantification of degradation pathways during extreme fast charging of lithium-ion batteries}}}, doi = {{10.1039/d2ta05887a}}, volume = {{10}}, year = {{2022}}, } @article{34098, author = {{Yusuf, Maha and LaManna, Jacob M. and Paul, Partha P. and Agyeman-Budu, David N. and Cao, Chuntian and Dunlop, Alison R. and Jansen, Andrew N. and Polzin, Bryant J. and Trask, Stephen E. and Tanim, Tanvir R. and Dufek, Eric J. and Thampy, Vivek and Steinrück, Hans-Georg and Toney, Michael F. and Nelson Weker, Johanna}}, issn = {{2666-3864}}, journal = {{Cell Reports Physical Science}}, keywords = {{General Physics and Astronomy, General Energy, General Engineering, General Materials Science, General Chemistry}}, number = {{11}}, pages = {{101145}}, publisher = {{Elsevier BV}}, title = {{{Simultaneous neutron and X-ray tomography for visualization of graphite electrode degradation in fast-charged lithium-ion batteries}}}, doi = {{10.1016/j.xcrp.2022.101145}}, volume = {{3}}, year = {{2022}}, } @inproceedings{34103, abstract = {{It is well known that different algorithms perform differently well on an instance of an algorithmic problem, motivating algorithm selection (AS): Given an instance of an algorithmic problem, which is the most suitable algorithm to solve it? As such, the AS problem has received considerable attention resulting in various approaches - many of which either solve a regression or ranking problem under the hood. Although both of these formulations yield very natural ways to tackle AS, they have considerable weaknesses. On the one hand, correctly predicting the performance of an algorithm on an instance is a sufficient, but not a necessary condition to produce a correct ranking over algorithms and in particular ranking the best algorithm first. On the other hand, classical ranking approaches often do not account for concrete performance values available in the training data, but only leverage rankings composed from such data. We propose HARRIS- Hybrid rAnking and RegRessIon foreSts - a new algorithm selector leveraging special forests, combining the strengths of both approaches while alleviating their weaknesses. HARRIS' decisions are based on a forest model, whose trees are created based on splits optimized on a hybrid ranking and regression loss function. As our preliminary experimental study on ASLib shows, HARRIS improves over standard algorithm selection approaches on some scenarios showing that combining ranking and regression in trees is indeed promising for AS.}}, author = {{Fehring, Lukass and Hanselle, Jonas Manuel and Tornede, Alexander}}, booktitle = {{Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022}}, location = {{Baltimore}}, title = {{{HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection}}}, year = {{2022}}, } @article{33251, author = {{Robra-Bissantz, Susanne and Lattemann, Christoph and Laue, Ralf and Leonhard-Pfleger, Raphaela and Wagner, Luisa and Gerundt, Oliver and Schlimbach, Ricarda and Baumann, Sabine and Vorbohle, Christian and Gottschalk, Sebastian and Kundisch, Dennis and Engels, Gregor and Wünderlich, Nancy and Nissen, Volker and Lohrenz, Lisa and Michalke, Simon}}, journal = {{HMD Praxis der Wirtschaftsinformatik}}, number = {{5}}, pages = {{1227 -- 1257}}, title = {{{Methoden zum Design digitaler Plattformen, Geschäftsmodelle und Service-Ökosysteme}}}, volume = {{59}}, year = {{2022}}, } @inproceedings{33502, author = {{Althaus, Maike and Poniatowski, Martin and Kundisch, Dennis}}, booktitle = {{Proceedings of the 43rd International Conference on Information Systems (ICIS)}}, location = {{Copenhagen, Denmark}}, title = {{{Tackling Crises Together? – An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic}}}, year = {{2022}}, } @inproceedings{33882, author = {{Laux, Florian and Poniatowski, Martin and Kundisch, Dennis}}, location = {{Copenhagen, Denmark}}, title = {{{May I have your attention, please? Analyzing the effects of attention screening mechanisms on crowdworking platforms}}}, year = {{2022}}, } @inproceedings{33885, author = {{Seutter, Janina}}, location = {{Copenhagen, Denmark}}, title = {{{Online Reviews in B2B Markets: A Qualitative Study on the Underlying Motives }}}, year = {{2022}}, } @inproceedings{32602, author = {{Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}}, booktitle = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}}, editor = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}}, isbn = {{978-3-95977-253-2}}, issn = {{1868-8969}}, pages = {{8:1–8:22}}, publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}}, title = {{{The Structural Power of Reconfigurable Circuits in the Amoebot Model}}}, doi = {{10.4230/LIPIcs.DNA.28.8}}, volume = {{238}}, year = {{2022}}, } @inproceedings{32603, author = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}}, booktitle = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}}, editor = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}}, isbn = {{978-3-95977-253-2}}, issn = {{1868-8969}}, pages = {{9:1–9:22}}, publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}}, title = {{{Fault-Tolerant Shape Formation in the Amoebot Model}}}, doi = {{10.4230/LIPIcs.DNA.28.9}}, volume = {{238}}, year = {{2022}}, } @inproceedings{30916, author = {{Seutter, Janina}}, booktitle = {{Proceedings of the 30th European Conference on Information Systems (ECIS)}}, location = {{Timișoara, Romania}}, title = {{{Online Reviews in B2B Markets: A Qualitative Study of Underlying Motivations}}}, year = {{2022}}, } @inproceedings{31062, author = {{Poniatowski, Martin}}, booktitle = {{Proceedings of the 28th Americas Conference on Information Systems (AMCIS)}}, location = {{Minneapolis, USA}}, title = {{{How the Display of the Transaction Count Affects the Purchase Intention}}}, year = {{2022}}, } @inproceedings{30939, author = {{Vorbohle, Christian and Kundisch, Dennis}}, booktitle = {{Proceedings of the 30th European Conference on Information Systems (ECIS)}}, location = {{Timișoara, Romania}}, title = {{{Overcoming Silos: A Review of Business Model Modeling Languages for Business Ecosystems}}}, year = {{2022}}, } @inproceedings{30734, author = {{Althaus, Maike and Poniatowski, Martin and Kundisch, Dennis}}, location = {{Madrid, Spain}}, title = {{{Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic}}}, year = {{2022}}, } @inproceedings{30212, author = {{Vorbohle, Christian and Kundisch, Dennis}}, title = {{{Key Properties of Sustainable Business Ecosystem Relationships}}}, year = {{2022}}, } @inproceedings{32811, abstract = {{The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\Delta(n)$ is reset to one; otherwise, $\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\Delta(n)$ is itself $\alpha$-mixing from which we conclude a strong law of large numbers for $\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times.}}, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}}, booktitle = {{Proceedings of the 58th Allerton Conference on Communication, Control, and Computing}}, title = {{{Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law}}}, year = {{2022}}, } @inproceedings{30793, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}}, booktitle = {{Proceedings of the 14th International Conference on Agents and Artificial Intelligence}}, publisher = {{SCITEPRESS - Science and Technology Publications}}, title = {{{Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication}}}, doi = {{10.5220/0010845400003116}}, year = {{2022}}, }