TY - CHAP
AU - Bondarenko, Alexander
AU - Fröbe, Maik
AU - Kiesel, Johannes
AU - Syed, Shahbaz
AU - Gurcke, Timon
AU - Beloucif, Meriem
AU - Panchenko, Alexander
AU - Biemann, Chris
AU - Stein, Benno
AU - Wachsmuth, Henning
AU - Potthast, Martin
AU - Hagen, Matthias
ID - 34077
SN - 0302-9743
T2 - Lecture Notes in Computer Science
TI - Overview of Touché 2022: Argument Retrieval
ER -
TY - CHAP
AB - 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.
AU - Kärner, Tobias
AU - Goller, Michael
AU - Maier, Andreas
ED - Schumann, Stephan
ED - Seeber, Susan
ED - Abele, Stephan
ID - 33985
KW - Augmented Reality
KW - Ausbildung
KW - Weiterbildung
KW - Lernen mit digitalen Medien
KW - integratives Literaturreview
T2 - Digitalisierung und digitale Medien in der Berufsbildung: Konzepte, Befunde und Herausforderungen
TI - Augmented Reality Anwendungen in der betrieblichen Aus‐ und Weiterbildung
VL - 41
ER -
TY - JOUR
AB - 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.
AU - Bonnes, Caroline
AU - Binkert, Julia
AU - Goller, Michael
ID - 34080
IS - 4
JF - Berufsbildung in Wissenschaft und Praxis – BWP
TI - Kompetenzen des betrieblichen Ausbildungspersonals: Eine literaturbasierte Systematisierung
ER -
TY - CONF
AB - 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.
AU - Alshomary, Milad
AU - Stahl, Maja
ID - 34051
T2 - Proceedings of the 9th Workshop on Argument Mining
TI - Argument Novelty and Validity Assessment via Multitask and Transfer Learning
ER -
TY - JOUR
AB - 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.
AU - McShane, Eric J.
AU - Paul, Partha P.
AU - Tanim, Tanvir R.
AU - Cao, Chuntian
AU - Steinrück, Hans-Georg
AU - Thampy, Vivek
AU - Trask, Stephen E.
AU - Dunlop, Alison R.
AU - Jansen, Andrew N.
AU - Dufek, Eric J.
AU - Toney, Michael F.
AU - Weker, Johanna Nelson
AU - McCloskey, Bryan D.
ID - 34099
IS - 44
JF - Journal of Materials Chemistry A
KW - General Materials Science
KW - Renewable Energy
KW - Sustainability and the Environment
KW - General Chemistry
SN - 2050-7488
TI - Multimodal quantification of degradation pathways during extreme fast charging of lithium-ion batteries
VL - 10
ER -
TY - JOUR
AU - Yusuf, Maha
AU - LaManna, Jacob M.
AU - Paul, Partha P.
AU - Agyeman-Budu, David N.
AU - Cao, Chuntian
AU - Dunlop, Alison R.
AU - Jansen, Andrew N.
AU - Polzin, Bryant J.
AU - Trask, Stephen E.
AU - Tanim, Tanvir R.
AU - Dufek, Eric J.
AU - Thampy, Vivek
AU - Steinrück, Hans-Georg
AU - Toney, Michael F.
AU - Nelson Weker, Johanna
ID - 34098
IS - 11
JF - Cell Reports Physical Science
KW - General Physics and Astronomy
KW - General Energy
KW - General Engineering
KW - General Materials Science
KW - General Chemistry
SN - 2666-3864
TI - Simultaneous neutron and X-ray tomography for visualization of graphite electrode degradation in fast-charged lithium-ion batteries
VL - 3
ER -
TY - CONF
AB - 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.
AU - Fehring, Lukass
AU - Hanselle, Jonas Manuel
AU - Tornede, Alexander
ID - 34103
T2 - Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022
TI - HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection
ER -
TY - JOUR
AU - Robra-Bissantz, Susanne
AU - Lattemann, Christoph
AU - Laue, Ralf
AU - Leonhard-Pfleger, Raphaela
AU - Wagner, Luisa
AU - Gerundt, Oliver
AU - Schlimbach, Ricarda
AU - Baumann, Sabine
AU - Vorbohle, Christian
AU - Gottschalk, Sebastian
AU - Kundisch, Dennis
AU - Engels, Gregor
AU - Wünderlich, Nancy
AU - Nissen, Volker
AU - Lohrenz, Lisa
AU - Michalke, Simon
ID - 33251
IS - 5
JF - HMD Praxis der Wirtschaftsinformatik
TI - Methoden zum Design digitaler Plattformen, Geschäftsmodelle und Service-Ökosysteme
VL - 59
ER -
TY - CONF
AU - Althaus, Maike
AU - Poniatowski, Martin
AU - Kundisch, Dennis
ID - 33502
T2 - Proceedings of the 43rd International Conference on Information Systems (ICIS)
TI - Tackling Crises Together? – An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic
ER -
TY - GEN
AU - Laux, Florian
AU - Poniatowski, Martin
AU - Kundisch, Dennis
ID - 33882
TI - May I have your attention, please? Analyzing the effects of attention screening mechanisms on crowdworking platforms
ER -
TY - GEN
AU - Seutter, Janina
ID - 33885
TI - Online Reviews in B2B Markets: A Qualitative Study on the Underlying Motives
ER -
TY - CONF
AU - Padalkin, Andreas
AU - Scheideler, Christian
AU - Warner, Daniel
ED - Ouldridge, Thomas E.
ED - Wickham, Shelley F. J.
ID - 32602
SN - 1868-8969
T2 - 28th International Conference on DNA Computing and Molecular Programming (DNA 28)
TI - The Structural Power of Reconfigurable Circuits in the Amoebot Model
VL - 238
ER -
TY - CONF
AU - Kostitsyna, Irina
AU - Scheideler, Christian
AU - Warner, Daniel
ED - Ouldridge, Thomas E.
ED - Wickham, Shelley F. J.
ID - 32603
SN - 1868-8969
T2 - 28th International Conference on DNA Computing and Molecular Programming (DNA 28)
TI - Fault-Tolerant Shape Formation in the Amoebot Model
VL - 238
ER -
TY - GEN
AU - Seutter, Janina
ID - 30916
T2 - Proceedings of the 30th European Conference on Information Systems (ECIS)
TI - Online Reviews in B2B Markets: A Qualitative Study of Underlying Motivations
ER -
TY - GEN
AU - Poniatowski, Martin
ID - 31062
T2 - Proceedings of the 28th Americas Conference on Information Systems (AMCIS)
TI - How the Display of the Transaction Count Affects the Purchase Intention
ER -
TY - JOUR
AB - AbstractMany critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents VarAlyzer, a novel static analysis approach for software product lines. VarAlyzer first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. VarAlyzer ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying VarAlyzer enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems.
AU - Schubert, Philipp
AU - Gazzillo, Paul
AU - Patterson, Zach
AU - Braha, Julian
AU - Schiebel, Fabian
AU - Hermann, Ben
AU - Wei, Shiyi
AU - Bodden, Eric
ID - 30511
IS - 1
JF - Automated Software Engineering
KW - inter-procedural static analysis
KW - software product lines
KW - preprocessor
KW - LLVM
KW - C/C++
SN - 0928-8910
TI - Static data-flow analysis for software product lines in C
VL - 29
ER -
TY - CONF
AU - Vorbohle, Christian
AU - Kundisch, Dennis
ID - 30939
T2 - Proceedings of the 30th European Conference on Information Systems (ECIS)
TI - Overcoming Silos: A Review of Business Model Modeling Languages for Business Ecosystems
ER -
TY - GEN
AU - Althaus, Maike
AU - Poniatowski, Martin
AU - Kundisch, Dennis
ID - 30734
TI - Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic
ER -
TY - GEN
AU - Vorbohle, Christian
AU - Kundisch, Dennis
ID - 30212
TI - Key Properties of Sustainable Business Ecosystem Relationships
ER -
TY - CONF
AU - Grieger, Nicole
AU - Seutter, Janina
AU - Kundisch, Dennis
ID - 28999
T2 - Tagungsband der 17. Internationalen Tagung Wirtschaftsinformatik 2022
TI - Rollercoaster of Emotions – A Semantic Analysis of Fundraising Campaigns over the Course of the Covid-19 Pandemic
ER -
TY - CONF
AB - 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.
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 32811
T2 - Proceedings of the 58th Allerton Conference on Communication, Control, and Computing
TI - Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law
ER -
TY - CONF
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 30793
T2 - Proceedings of the 14th International Conference on Agents and Artificial Intelligence
TI - Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication
ER -
TY - CONF
AB - Gender bias may emerge from an unequal representation of agency and power, for example, by portraying women frequently as passive and powerless ("She accepted her future'') and men as proactive and powerful ("He chose his future''). When language models learn from respective texts, they may reproduce or even amplify the bias. An effective way to mitigate bias is to generate counterfactual sentences with opposite agency and power to the training. Recent work targeted agency-specific verbs from a lexicon to this end. We argue that this is insufficient, due to the interaction of agency and power and their dependence on context. In this paper, we thus develop a new rewriting model that identifies verbs with the desired agency and power in the context of the given sentence. The verbs' probability is then boosted to encourage the model to rewrite both connotations jointly. According to automatic metrics, our model effectively controls for power while being competitive in agency to the state of the art. In our evaluation, human annotators favored its counterfactuals in terms of both connotations, also deeming its meaning preservation better.
AU - Stahl, Maja
AU - Spliethöver, Maximilian
AU - Wachsmuth, Henning
ID - 34082
T2 - Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science
TI - To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation
ER -
TY - GEN
AB - Iterative distributed optimization algorithms involve multiple agents that
communicate with each other, over time, in order to minimize/maximize a global
objective. In the presence of unreliable communication networks, the
Age-of-Information (AoI), which measures the freshness of data received, may be
large and hence hinder algorithmic convergence. In this paper, we study the
convergence of general distributed gradient-based optimization algorithms in
the presence of communication that neither happens periodically nor at
stochastically independent points in time. We show that convergence is
guaranteed provided the random variables associated with the AoI processes are
stochastically dominated by a random variable with finite first moment. This
improves on previous requirements of boundedness of more than the first moment.
We then introduce stochastically strongly connected (SSC) networks, a new
stochastic form of strong connectedness for time-varying networks. We show: If
for any $p \ge0$ the processes that describe the success of communication
between agents in a SSC network are $\alpha$-mixing with $n^{p-1}\alpha(n)$
summable, then the associated AoI processes are stochastically dominated by a
random variable with finite $p$-th moment. In combination with our first
contribution, this implies that distributed stochastic gradient descend
converges in the presence of AoI, if $\alpha(n)$ is summable.
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 30790
T2 - arXiv:2201.11343
TI - Distributed gradient-based optimization in the presence of dependent aperiodic communication
ER -
TY - JOUR
AU - Hagengruber, Ruth Edith
ID - 34109
JF - La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris
TI - Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens
ER -
TY - CONF
AU - Clausing, Lennart
AU - Platzner, Marco
ID - 32855
T2 - 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
TI - ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support
ER -
TY - GEN
AB - We present sufficient conditions that ensure convergence of the multi-agent
Deep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of
the most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling
continuous action spaces: the actor-critic paradigm. In the setting considered
herein, each agent observes a part of the global state space in order to take
local actions, for which it receives local rewards. For every agent, DDPG
trains a local actor (policy) and a local critic (Q-function). The analysis
shows that multi-agent DDPG using neural networks to approximate the local
policies and critics converge to limits with the following properties: The
critic limits minimize the average squared Bellman loss; the actor limits
parameterize a policy that maximizes the local critic's approximation of
$Q_i^*$, where $i$ is the agent index. The averaging is with respect to a
probability distribution over the global state-action space. It captures the
asymptotics of all local training processes. Finally, we extend the analysis to
a fully decentralized setting where agents communicate over a wireless network
prone to delays and losses; a typical scenario in, e.g., robotic applications.
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 30791
T2 - arXiv:2201.00570
TI - Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms
ER -
TY - CONF
AU - Richter, Cedric
AU - Wehrheim, Heike
ID - 32590
T2 - 2022 IEEE Conference on Software Testing, Verification and Validation (ICST)
TI - Learning Realistic Mutations: Bug Creation for Neural Bug Detectors
ER -
TY - CONF
AU - Richter, Cedric
AU - Wehrheim, Heike
ID - 32591
T2 - 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)
TI - TSSB-3M: Mining single statement bugs at massive scale
ER -
TY - GEN
AU - Siek, Hanna
ID - 32398
TI - Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes
ER -
TY - GEN
AU - Kramer, Paul
ID - 31485
TI - On Transforming Lattice-Based Cryptography to the Ring Setting
ER -
TY - CONF
AB - The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds
AU - Dreßler, Kevin
AU - Sherif, Mohamed
AU - Ngonga Ngomo, Axel-Cyrille
ID - 31806
KW - 2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba
T2 - Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia
TI - ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning
ER -
TY - JOUR
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 32854
IS - 13
JF - IFAC-PapersOnLine
TI - Practical Network Conditions for the Convergence of Distributed Optimization
VL - 55
ER -
TY - CONF
AU - Hansmeier, Tim
AU - Brede, Mathis
AU - Platzner, Marco
ID - 33253
T2 - GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion
TI - XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion
ER -
TY - CONF
AU - Chen, Wei-Fan
AU - Chen, Mei-Hua
AU - Mudgal, Garima
AU - Wachsmuth, Henning
ID - 33274
T2 - Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)
TI - Analyzing Culture-Specific Argument Structures in Learner Essays
ER -
TY - CONF
AU - Maack, Marten
AU - Pukrop, Simon
AU - Rasmussen, Anna Rodriguez
ED - Chechik, Shiri
ED - Navarro, Gonzalo
ED - Rotenberg, Eva
ED - Herman, Grzegorz
ID - 33491
T2 - 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany
TI - (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
VL - 244
ER -
TY - GEN
AB - We study the consequences of modeling asymmetric bargaining power in two-person bargaining problems. Comparing application of an asymmetric version of a bargaining solution to an upfront modification of the disagreement point, the resulting distortion crucially depends on the bargaining solution concept. While for the Kalai-Smorodinsky solution weaker players benefit from modifying the disagreement point, the situation is reversed for the Nash bargaining solution. There, weaker players are better off in the asymmetric bargaining solution. When comparing application of the asymmetric versions of the Nash and the Kalai-Smorodinsky solutions, we demonstrate that there is an upper bound for the weight of a player, so that she is better off with the Nash bargaining solution. This threshold is ultimately determined by the relative utilitarian bargaining solution. From a mechanism design perspective, our results provide valuable information for a social planner, when implementing a bargaining solution for unequally powerful players.
AU - Haake, Claus-Jochen
AU - Streck, Thomas
ID - 32106
KW - Asymmetric bargaining power
KW - Nash bargaining solution
KW - Kalai-Smorodinsky bargaining solution
TI - Distortion through modeling asymmetric bargaining power
VL - 148
ER -
TY - GEN
AU - Grynko, Yevgen
AU - Shkuratov, Yuriy
AU - Alhaddad, Samer
AU - Förstner, Jens
ID - 34136
KW - tet_topic_scattering
TI - Light backscattering from numerical analog of planetary regoliths
ER -
TY - JOUR
AB - How can Knowledge In/Equity be addressed in qualitative research by taking the idea of Open Science into account? Two projects from the Open Science Fellows Programme by Wikimedia Deutschland will be used to illustrate how Open Science practices can succeed in qualitative research, thereby reducing In/Equity. In this context, In/Equity is considered as a fair and equal representation of people, their knowledge and insights and comprehends questions about how epistemic, structural, institutional and personal biases generate and shape knowledge as guidance. Three questions guide this approach: firstly, what do we understand by In/Equity in the context of knowledge production in these projects? Secondly, who will be involved in knowledge generation and to what extent will they be valued or unvalued? Thirdly, how can data be made accessible for re-use to enable true participation and sharing?
AU - Steinhardt, Isabel
AU - Kruschick, Felicitas
ID - 34132
JF - Research Ideas and Outcomes
KW - Open Science
KW - Knowledge Equity
KW - Qualitative Methods
SN - 2367-7163
TI - Knowledge Equity and Open Science in qualitative research – Practical research considerations
VL - 8
ER -
TY - JOUR
AB - Subwavelength dielectric resonators assembled into metasurfaces have become a versatile tool for miniaturizing optical components approaching the nanoscale. An important class of metasurface functionalities is associated with asymmetry in both the generation and transmission of light with respect to reversals of the positions of emitters and receivers. The nonlinear light–matter interaction in metasurfaces offers a promising pathway towards miniaturization of the asymmetric control of light. Here we demonstrate asymmetric parametric generation of light in nonlinear metasurfaces. We assemble dissimilar nonlinear dielectric resonators into translucent metasurfaces that produce images in the visible spectral range on being illuminated by infrared radiation. By design, the metasurfaces produce different and completely independent images for the reversed direction of illumination, that is, when the positions of the infrared emitter and the visible light receiver are exchanged. Nonlinearity-enabled asymmetric control of light by subwavelength resonators paves the way towards novel nanophotonic components via dense integration of large quantities of nonlinear resonators into compact metasurface designs.
AU - Kruk, Sergey S.
AU - Wang, Lei
AU - Sain, Basudeb
AU - Dong, Zhaogang
AU - Yang, Joel
AU - Zentgraf, Thomas
AU - Kivshar, Yuri
ID - 32088
JF - Nature Photonics
KW - Atomic and Molecular Physics
KW - and Optics
KW - Electronic
KW - Optical and Magnetic Materials
SN - 1749-4885
TI - Asymmetric parametric generation of images with nonlinear dielectric metasurfaces
VL - 16
ER -
TY - CONF
AB - In this paper, machine learning techniques will be used to classify different PCB layouts given their electromagnetic frequency spectra. These spectra result from a simulated near-field measurement of electric field strengths at different locations. Measured values consist of real and imaginary parts (amplitude and phase) in X, Y and Z directions. Training data was obtained in the time domain by varying transmission line geometries (size, distance and signaling). It was then transformed into the frequency domain and used as deep neural network input. Principal component analysis was applied to reduce the sample dimension. The results show that classifying different designs is possible with high accuracy based on synthetic data. Future work comprises measurements of real, custom-made PCB with varying parameters to adapt the simulation model and also test the neural network. Finally, the trained model could be used to give hints about the error’s cause when overshooting EMC limits.
AU - Maalouly, Jad
AU - Hemker, Dennis
AU - Hedayat, Christian
AU - Rückert, Christian
AU - Kaufmann, Ivan
AU - Olbrich, Marcel
AU - Lange, Sven
AU - Mathis, Harald
ID - 34140
KW - emc
KW - pcb
KW - electronic system development
KW - machine learning
KW - neural network
T2 - 2022 Kleinheubach Conference
TI - AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development
ER -
TY - CHAP
AU - Hagengruber, Ruth Edith
ED - Banse, Gerhard
ED - Fuchs-Kittowski, Klaus
ID - 34108
T2 - Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“
TI - Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt
ER -
TY - CHAP
AB - This work addresses the automatic resolution of software requirements. In the vision of On-The-Fly Computing, software services should be composed on demand, based solely on natural language input from human users. To enable this, we build a chatbot solution that works with human-in-the-loop support to receive, analyze, correct, and complete their software requirements. The chatbot is equipped with a natural language processing pipeline and a large knowledge base, as well as sophisticated dialogue management skills to enhance the user experience. Previous solutions have focused on analyzing software requirements to point out errors such as vagueness, ambiguity, or incompleteness. Our work shows how apps can collaborate with users to efficiently produce correct requirements. We developed and compared three different chatbot apps that can work with built-in knowledge. We rely on ChatterBot, DialoGPT and Rasa for this purpose. While DialoGPT provides its own knowledge base, Rasa is the best system to combine the text mining and knowledge solutions at our disposal. The evaluation shows that users accept 73% of the suggested answers from Rasa, while they accept only 63% from DialoGPT or even 36% from ChatterBot.
AU - Kersting, Joschka
AU - Ahmed, Mobeen
AU - Geierhos, Michaela
ED - Stephanidis, Constantine
ED - Antona, Margherita
ED - Ntoa, Stavroula
ID - 32179
KW - On-The-Fly Computing
KW - Chatbot
KW - Knowledge Base
SN - 1865-0929
T2 - HCI International 2022 Posters
TI - Chatbot-Enhanced Requirements Resolution for Automated Service Compositions
VL - 1580
ER -
TY - CONF
AU - Otroshi, Mortaza
AU - Meschut, Gerson
ID - 34152
TI - Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung
ER -
TY - CONF
AU - Krauter, Stefan
AU - Bendfeld, Jörg
ID - 34155
T2 - Proceedings of the 8th World Conference on Photovoltaik Energy Conversion
TI - Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter types
ER -
TY - CONF
AU - Kakande, Josephine Nakato
AU - Philipo, Godiana Hagile
AU - Krauter, Stefan
ID - 34156
T2 - Proceedings of the 8th World Conference on Photovoltaik Energy Conversion
TI - Optimal Design of a Semi Grid-Connected PV System for a Site in Lwak, Kenya Using HOMER
ER -
TY - GEN
AU - Otroshi, Mortaza
AU - Meschut, Gerson
ID - 34153
TI - Schädigungsmodellierung von Hilfsfügeelementen beim mechanischen Fügen von Stahlwerkstoffen
ER -
TY - THES
AB - Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen den Trojaner ``Heimtückische LUT'' stellen wir die allererste erfolgreiche Gegenmaßnahme vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.
AU - Ahmed, Qazi Arbab
ID - 29769
KW - FPGA Security
KW - Hardware Trojans
KW - Bitstream-level Trojans
KW - Bitstream Verification
TI - Hardware Trojans in Reconfigurable Computing
ER -
TY - CONF
AB - Within innovation management, choosing the best fitting product idea is the most important decision point. The future existence and success of the organization is depending on selected product ideas. To find the best fitting idea for an organization, it needs evaluation criteria representing the organizations mission Therefore, this study focuses on a holistic overview about evaluation criteria and on supporting organizations in the process to select its individual evaluation criteria. Based on a literature study, existing approaches regarding evaluation criteria in product idea selection are identified and a list of evaluation criteria is reworked. Using the list of evaluation criteria, a prioritization method is created. Within an interview with experts in innovation management, the method is discussed regarding usability and the level of assistance in product idea selection. The developed criteria can be used directly by innovation manager and industrial practitioners to evaluate potential product ideas.
AU - Gräßler, Iris
AU - Koch, Anna-Sophie
ID - 34166
KW - innovation management
KW - evaluation criteria
KW - idea selection
KW - idea evaluation
KW - meta-study
SN - 978-952-335-694-8
T2 - XXXIII Proceedings of the ISPIM Innovation Conference
TI - Evaluation Criteria in Product Idea Selection Decisions
ER -
TY - THES
AB - Anforderungsänderungen sind ein wesentlicher Grund für Ineffizienzen und Projektfehlschläge in der Entwicklung komplexer technischer Systeme. Proaktives Management von Anforderungsänderungen hat das Potenzial, den Umgang mit Anforderungsänderungen effizienter zu gestalten. Dafür ist ein systematischer Ansatz erforderlich, der eine ganzheitliche Bewertung und Handhabung des Änderungsrisikos im industriellen Entwicklungskontext ermöglicht. Im Rahmen dieser Dissertation wird mit der ProMaRC-Methodik ein neuartiger Ansatz für das proaktive Management von Anforderungsänderungen vorgestellt. Die Methodik wurde in enger Zusammenarbeit mit Industrieanwender:innen aus der Automobilindustrie entwickelt und anhand von fünf Fallstudien validiert. Mittels automatisierter Abhängigkeitsanalyse auf Grundlage künstlicher Intelligenz wird der Anwendungsaufwand gegenüber bestehenden Ansätzen reduziert. Die teilautomatisierte Bewertung und Handhabung der Änderungswahrscheinlichkeit und -auswirkung erfolgt anhand eines modifizierten PageRank-Algorithmus und umfasst erstmalig alle für die Risikoanalyse relevanten Einflussfaktoren. Die Validierung belegt, dass durch die ProMaRC-Methodik eine überzeugende Kombination aus praxistauglichem Anwendungsaufwand und Vollständigkeit der Analyse erzielt wird. Damit erschließt diese Dissertation das bisher kaum beachtete Forschungsfeld des proaktiven Managements von Anforderungsänderungen und fördert eine effizientere Produktentwicklung.
AU - Oleff, Christian
ID - 34174
TI - Proaktives Management von Anforderungsänderungen in der Entwicklung komplexer technischer Systeme
VL - 406
ER -