@article{41496, author = {{Hein, Maxwell and Lopes Dias, Nelson Filipe and Kokalj, David and Stangier, Dominic and Hoyer, Kay-Peter and Tillmann, Wolfgang and Schaper, Mirko}}, issn = {{0142-1123}}, journal = {{International Journal of Fatigue}}, keywords = {{Industrial and Manufacturing Engineering, Mechanical Engineering, Mechanics of Materials, General Materials Science, Modeling and Simulation}}, publisher = {{Elsevier BV}}, title = {{{On the influence of physical vapor deposited thin coatings on the low-cycle fatigue behavior of additively processed Ti-6Al-7Nb alloy}}}, doi = {{10.1016/j.ijfatigue.2022.107235}}, volume = {{166}}, year = {{2022}}, } @article{41490, author = {{Hein, Maxwell and Lopes Dias, Nelson Filipe and Kokalj, David and Stangier, Dominic and Hoyer, Kay-Peter and Tillmann, Wolfgang and Schaper, Mirko}}, issn = {{0142-1123}}, journal = {{International Journal of Fatigue}}, keywords = {{Industrial and Manufacturing Engineering, Mechanical Engineering, Mechanics of Materials, General Materials Science, Modeling and Simulation}}, publisher = {{Elsevier BV}}, title = {{{On the influence of physical vapor deposited thin coatings on the low-cycle fatigue behavior of additively processed Ti-6Al-7Nb alloy}}}, doi = {{10.1016/j.ijfatigue.2022.107235}}, volume = {{166}}, year = {{2022}}, } @inproceedings{21727, abstract = {{Platform-based business models underlie the success of many of today’s largest, fastest-growing, and most disruptive companies. Despite the success of prominent examples, such as Uber and Airbnb, creating a profitable platform ecosystem presents a key challenge for many companies across all industries. Although research provides knowledge about platforms’ different value drivers (e.g., network effects), companies that seek to transform their current business model into a platform-based one lack an artifact to reduce knowledge boundaries, collaborate effectively, and cope with the complexities and dynamics of platform ecosystems. We address this challenge by developing two artifacts and combining research from variability modeling, business model dependencies, and system dynamics. This paper presents a design science research approach to develop the platform ecosystem modeling language and the platform ecosystem development tool that support researcher and practitioner by visualizing and simulating platform ecosystems. }}, author = {{Vorbohle, Christian and Gottschalk, Sebastian}}, booktitle = {{Proceedings of the 29th European Conference on Information Systems (ECIS)}}, keywords = {{Platform Ecosystems, Platform Ecosystem Modeling Language, Platform Ecosystem Development Tool, Business Models, Design Science}}, location = {{Virtual Conference/Workshop}}, publisher = {{AIS}}, title = {{{Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems }}}, year = {{2021}}, } @article{33649, author = {{Kessler, Jan and Calcavecchia, Francesco and Kühne, Thomas}}, issn = {{2513-0390}}, journal = {{Advanced Theory and Simulations}}, keywords = {{Multidisciplinary, Modeling and Simulation, Numerical Analysis, Statistics and Probability}}, number = {{4}}, publisher = {{Wiley}}, title = {{{Artificial Neural Networks as Trial Wave Functions for Quantum Monte Carlo}}}, doi = {{10.1002/adts.202000269}}, volume = {{4}}, year = {{2021}}, } @article{35575, author = {{Schulze Darup, Moritz and Alexandru, Andreea B. and Quevedo, Daniel E. and Pappas, George J.}}, issn = {{1066-033X}}, journal = {{IEEE Control Systems}}, keywords = {{Electrical and Electronic Engineering, Modeling and Simulation, Control and Systems Engineering, Electrical and Electronic Engineering, Modeling and Simulation, Control and Systems Engineering}}, number = {{3}}, pages = {{58--78}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Encrypted Control for Networked Systems: An Illustrative Introduction and Current Challenges}}}, doi = {{10.1109/mcs.2021.3062956}}, volume = {{41}}, year = {{2021}}, } @article{37822, author = {{Han, Daxin and Yang, Keke and Meschut, Gerson}}, issn = {{0924-0136}}, journal = {{Journal of Materials Processing Technology}}, keywords = {{Industrial and Manufacturing Engineering, Metals and Alloys, Computer Science Applications, Modeling and Simulation, Ceramics and Composites}}, publisher = {{Elsevier BV}}, title = {{{Mechanical joining of glass fibre reinforced polymer (GFRP) through an innovative solid self-piercing rivet}}}, doi = {{10.1016/j.jmatprotec.2021.117182}}, volume = {{296}}, year = {{2021}}, } @article{41510, author = {{Pramanik, Sudipta and Andreiev, Anatolii and Hoyer, Kay-Peter and Schaper, Mirko}}, issn = {{0142-1123}}, journal = {{International Journal of Fatigue}}, keywords = {{Industrial and Manufacturing Engineering, Mechanical Engineering, Mechanics of Materials, General Materials Science, Modeling and Simulation}}, publisher = {{Elsevier BV}}, title = {{{Quasi in-situ analysis of fracture path during cyclic loading of double-edged U notched additively manufactured FeCo alloy}}}, doi = {{10.1016/j.ijfatigue.2021.106498}}, volume = {{153}}, year = {{2021}}, } @article{20143, author = {{Otroshi, Mortaza and Rossel, Moritz and Meschut, Gerson}}, journal = {{Journal of Advanced Joining Processes}}, keywords = {{Self-pierce riveting, Ductile fracture, Damage modeling, GISSMO damage model}}, publisher = {{Elsevier}}, title = {{{Stress state dependent damage modeling of self-pierce riveting process simulation using GISSMO damage model}}}, doi = {{10.1016/j.jajp.2020.100015}}, volume = {{1}}, year = {{2020}}, } @article{33263, abstract = {{Dynamical systems often admit geometric properties that must be taken into account when studying their behavior. We show that many such properties can be encoded by means of quiver representations. These properties include classical symmetry, hidden symmetry, and feedforward structure, as well as subnetwork and quotient relations in network dynamical systems. A quiver equivariant dynamical system consists of a collection of dynamical systems with maps between them that send solutions to solutions. We prove that such quiver structures are preserved under Lyapunov--Schmidt reduction, center manifold reduction, and normal form reduction.}}, author = {{Nijholt, Eddie and Rink, Bob W. and Schwenker, Sören}}, issn = {{1536-0040}}, journal = {{SIAM Journal on Applied Dynamical Systems}}, keywords = {{Modeling and Simulation, Analysis}}, number = {{4}}, pages = {{2428--2468}}, publisher = {{Society for Industrial & Applied Mathematics (SIAM)}}, title = {{{Quiver Representations and Dimension Reduction in Dynamical Systems}}}, doi = {{10.1137/20m1345670}}, volume = {{19}}, year = {{2020}}, } @article{34670, author = {{Black, Tobias}}, issn = {{0218-2025}}, journal = {{Mathematical Models and Methods in Applied Sciences}}, keywords = {{Applied Mathematics, Modeling and Simulation}}, number = {{06}}, pages = {{1075--1117}}, publisher = {{World Scientific Pub Co Pte Lt}}, title = {{{Global generalized solutions to a forager–exploiter model with superlinear degradation and their eventual regularity properties}}}, doi = {{10.1142/s0218202520400072}}, volume = {{30}}, year = {{2020}}, } @article{4682, author = {{Schmiedel, T. and Müller, Oliver and vom Brocke, J.}}, journal = {{Organizational Research Methods}}, keywords = {{online reviews, organizational culture, structural topic model, topic modeling, tutorial}}, pages = {{941----968 }}, title = {{{Topic Modeling as a Strategy of Inquiry in Organizational Research: A Tutorial With an Application Example on Organizational Culture}}}, doi = {{https://doi.org/10.1177/1094428118773858}}, year = {{2019}}, } @article{48884, abstract = {{The Travelling Salesperson Problem (TSP) is one of the best-studied NP-hard problems. Over the years, many different solution approaches and solvers have been developed. For the first time, we directly compare five state-of-the-art inexact solvers\textemdash namely, LKH, EAX, restart variants of those, and MAOS\textemdash on a large set of well-known benchmark instances and demonstrate complementary performance, in that different instances may be solved most effectively by different algorithms. We leverage this complementarity to build an algorithm selector, which selects the best TSP solver on a per-instance basis and thus achieves significantly improved performance compared to the single best solver, representing an advance in the state of the art in solving the Euclidean TSP. Our in-depth analysis of the selectors provides insight into what drives this performance improvement.}}, author = {{Kerschke, Pascal and Kotthoff, Lars and Bossek, Jakob and Hoos, Holger H. and Trautmann, Heike}}, issn = {{1063-6560}}, journal = {{Evolutionary Computation}}, keywords = {{automated algorithm selection, machine learning., performance modeling, Travelling Salesperson Problem}}, number = {{4}}, pages = {{597–620}}, title = {{{Leveraging TSP Solver Complementarity through Machine Learning}}}, doi = {{10.1162/evco_a_00215}}, volume = {{26}}, year = {{2018}}, } @inproceedings{97, abstract = {{Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets.}}, author = {{van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}}, booktitle = {{2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)}}, isbn = {{978-1-5386-3489-9}}, keywords = {{Software, Unified modeling language, Requirements engineering, Ontologies, Search problems, Natural languages}}, location = {{Lisbon, Portugal}}, pages = {{379--385}}, publisher = {{IEEE}}, title = {{{From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}}}, doi = {{10.1109/REW.2017.26}}, year = {{2017}}, } @inproceedings{9982, abstract = {{ln der industriellen Fertigung werden zum Transport von Bauteilen häufig Förderketten genutzt. Obwohl die Förderketten meist nicht direkt mit den Arbeitsmedien in Berührung kommen, werden sie indirekt durch vagabundierende Stäube und Pulver, die an der geölten Kette anhaften, im Laufe der Zeit stark verschmutzt. Ein derart im Betrieb verschmutztes Kettenglied ist in Abbildung 1 dargestellt. Um die Lebensdauer der Ketten zu erhöhen und das Herunterfallen von Schmutzpartikel auf die Produkte zu vermeiden, muss die Kette regelmäßig gereinigt werden. Ziel des hier beschriebenen Forschungsvorhabens ist die Entwicklung eines Systems, das in der Lage ist, ein einzelnes Kettenglied in unter 60 s mittels Ultraschall zu reinigen. In [1] wurde in ersten Versuchen nachgewiesen, dass Stabschwinger in Abhängigkeit des Sonotrodenabstands zum Reinigungsobjekt und der Ultraschallamplitude eine intensive Reinigungswirkung entfalten. Das Konzept der Reinigungsanlage sieht deshalb vor, im ersten Schritt die stark verschmutzten Kettenglieder durch ein hochintensives Kavitationsfeld von direkt eingetauchten Stabschwingern vorzureinigen und anschließend schwer zugängliche Be- reiche wie Hinterschneidungen oder Bohrungen mittels konventioneller Tauchschwinger von Verschmutzungen zu befreien. Für den Stabschwinger wird die sogenannte - Sonotrode untersucht; diese wird unter anderem auch in der Sonochemie verwendet. Ein wesentliches Merkmal der Sonotrode ist eine hohe Amplitudenübersetzung bei einer gleichzeitig großen Abstrahlfläche. Neben dem Entwurf mittels der L /2 -Synthese wird die Reinigungswirkung der Sonotrode in Abhängigkeit der Ultraschallamplitude und dem Abstand zum Reinigungsobjekt in einer Versuchsreihe untersucht. Zur genaueren Betrachtung der Reinigungs- mechanismen eines Stabschwingers werden abschließend Hochgeschwindigkeitsaufnahmen vorgestellt und analysieren.}}, author = {{Schemmel, Reinhard and Hemsel, Tobias and Sextro, Walter}}, booktitle = {{43. Deutsche Jahrestagung für Akustik}}, keywords = {{wire bonding, dynamic behavior, modeling}}, pages = {{611--614}}, title = {{{MoRFUS: Mobile Reinigungseinheit für Förderketten basierend auf Ultraschall}}}, year = {{2017}}, } @article{1452, abstract = {{Opinion leaders of an investment network can have a significant impact on capital mar-kets because their investment decisions are adopted by their peers and trigger large trad-ing cascades, increasing herding behavior and comovement among stock returns. This paper analyzes the interaction-based relations of traders from a large social trading plat-form and identifies the driving forces and the opinion leaders within a large online trading network as the nodes with the highest centrality and the highest force of infection, respec-tively. Relying on recent insights from epidemiological research, I maintain that central-ity identifies the most central traders in the network, while the expected force quantifies the most influential traders and their spreading power. I study the behavior and charac-teristics that set central and influential traders apart from other traders. The ability to identify focal points and their trading behavior within a trading network is important for investors, investment advisers, and policy makers.}}, author = {{Pelster, Matthias}}, journal = {{Proceedings of the International Conference on Information Systems}}, keywords = {{Online trading, investment advice, network modeling, Expected Force, herding.}}, title = {{{I’ll Have What S/he’s Having: A Case Study of a Social Trading Network}}}, year = {{2017}}, } @article{6075, abstract = {{For almost three decades, the theory of visual attention (TVA) has been successful in mathematically describing and explaining a wide variety of phenomena in visual selection and recognition with high quantitative precision. Interestingly, the influence of feature contrast on attention has been included in TVA only recently, although it has been extensively studied outside the TVA framework. The present approach further develops this extension of TVA’s scope by measuring and modeling salience. An empirical measure of salience is achieved by linking different (orientation and luminance) contrasts to a TVA parameter. In the modeling part, the function relating feature contrasts to salience is described mathematically and tested against alternatives by Bayesian model comparison. This model comparison reveals that the power function is an appropriate model of salience growth in the dimensions of orientation and luminance contrast. Furthermore, if contrasts from the two dimensions are comb}}, author = {{Krüger, Alexander and Tünnermann, Jan and Scharlau, Ingrid}}, issn = {{1943-3921}}, journal = {{Attention, Perception, & Psychophysics}}, keywords = {{Salience, Visual attention, Bayesian inference, Theory of visual attention, Computational modeling, Inference, Object Recognition, Theories, Visual Perception, Visual Attention, Luminance, Perceptual Orientation, Statistical Probability, Stimulus Salience, Computational Modeling}}, number = {{6}}, pages = {{1593 -- 1614}}, title = {{{Measuring and modeling salience with the theory of visual attention.}}}, doi = {{10.3758/s13414-017-1325-6}}, volume = {{79}}, year = {{2017}}, } @article{6071, abstract = {{Particular differences between an object and its surrounding cause salience, guide attention, and improve performance in various tasks. While much research has been dedicated to identifying which feature dimensions contribute to salience, much less regard has been paid to the quantitative strength of the salience caused by feature differences. Only a few studies systematically related salience effects to a common salience measure, and they are partly outdated in the light of new findings on the time course of salience effects. We propose Bundesen’s Theory of Visual Attention (TV A) as a theoretical basis for measuring salience and introduce an empirical and modeling approach to link this theory to data retrieved from temporal-order judgments. With this procedure, TV A becomes applicable to a broad range of salience-related stimulus material. Three experiments with orientation pop-out displays demonstrate the feasibility of the method. A 4th experiment substantiates its applicability t}}, author = {{Krüger, Alexander and Tünnermann, Jan and Scharlau, Ingrid}}, issn = {{1895-1171}}, journal = {{Advances in Cognitive Psychology}}, keywords = {{salience, visual attention, Bayesian inference, theory of visual attention, computational modeling, Visual Attention, Computational Modeling, Inference, Judgment, Statistical Probability}}, number = {{1}}, pages = {{20 -- 38}}, title = {{{Fast and conspicuous? Quantifying salience with the theory of visual attention.}}}, doi = {{10.5709/acp-0184-1}}, volume = {{12}}, year = {{2016}}, } @article{4691, abstract = {{Analysts have estimated that more than 80 percent of today’s data is stored in unstructured form (e.g., text, audio, image, video)—much of it expressed in rich and ambiguous natural language. Traditionally, to analyze natural language, one has used qualitative data-analysis approaches, such as manual coding. Yet, the size of text data sets obtained from the Internet makes manual analysis virtually impossible. In this tutorial, we discuss the challenges encountered when applying automated text-mining techniques in information systems research. In particular, we showcase how to use probabilistic topic modeling via Latent Dirichlet allocation, an unsupervised text-mining technique, with a LASSO multinomial logistic regression to explain user satisfaction with an IT artifact by automatically analyzing more than 12,000 online customer reviews. For fellow information systems researchers, this tutorial provides guidance for conducting text-mining studies on their own and for evaluating the quality of others.}}, author = {{Debortoli, Stefan and Müller, Oliver and Junglas, Iris and vom Brocke, Jan}}, isbn = {{9781615679119}}, issn = {{1529-3181}}, journal = {{Communications of the Association for Information Systems}}, keywords = {{Latent dirichlet allocation, Online customer reviews, Text mining, Topic modeling, User satisfaction}}, pages = {{555--582}}, title = {{{Text Mining for Information Systems Researchers: An Annotated Tutorial}}}, doi = {{10.17705/1CAIS.03907}}, year = {{2016}}, } @inproceedings{17660, author = {{Polevoy, Gleb and de Weerdt, Mathijs M.}}, booktitle = {{Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}}, isbn = {{978-1-4503-2738-1}}, keywords = {{dynamics, emotion modeling, negotiation, network interaction, shared effort game}}, pages = {{1741--1742}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{Improving Human Interaction in Crowdsensing}}}, year = {{2014}}, } @article{11861, abstract = {{In this contribution we present a theoretical and experimental investigation into the effects of reverberation and noise on features in the logarithmic mel power spectral domain, an intermediate stage in the computation of the mel frequency cepstral coefficients, prevalent in automatic speech recognition (ASR). Gaining insight into the complex interaction between clean speech, noise, and noisy reverberant speech features is essential for any ASR system to be robust against noise and reverberation present in distant microphone input signals. The findings are gathered in a probabilistic formulation of an observation model which may be used in model-based feature compensation schemes. The proposed observation model extends previous models in three major directions: First, the contribution of additive background noise to the observation error is explicitly taken into account. Second, an energy compensation constant is introduced which ensures an unbiased estimate of the reverberant speech features, and, third, a recursive variant of the observation model is developed resulting in reduced computational complexity when used in model-based feature compensation. The experimental section is used to evaluate the accuracy of the model and to describe how its parameters can be determined from test data.}}, author = {{Leutnant, Volker and Krueger, Alexander and Haeb-Umbach, Reinhold}}, issn = {{2329-9290}}, journal = {{IEEE/ACM Transactions on Audio, Speech, and Language Processing}}, keywords = {{computational complexity, reverberation, speech recognition, automatic speech recognition, background noise, clean speech, computational complexity, energy compensation, logarithmic mel power spectral domain, mel frequency cepstral coefficients, microphone input signals, model-based feature compensation schemes, noisy reverberant speech automatic recognition, noisy reverberant speech features, reverberation, Atmospheric modeling, Computational modeling, Noise, Noise measurement, Reverberation, Speech, Vectors, Model-based feature compensation, observation model for reverberant and noisy speech, recursive observation model, robust automatic speech recognition}}, number = {{1}}, pages = {{95--109}}, title = {{{A New Observation Model in the Logarithmic Mel Power Spectral Domain for the Automatic Recognition of Noisy Reverberant Speech}}}, doi = {{10.1109/TASLP.2013.2285480}}, volume = {{22}}, year = {{2014}}, }