University of Paderborn

About: University of Paderborn is a education organization based out in Paderborn, Nordrhein-Westfalen, Germany. It is known for research contribution in the topics: Computer science & Context (language use). The organization has 6684 authors who have published 16929 publications receiving 323154 citations.

Understanding anthropomorphism in service provision: a meta-analysis of physical robots, chatbots, and other AI

Abstract: An increasing number of firms introduce service robots, such as physical robots and virtual chatbots, to provide services to customers. While some firms use robots that resemble human beings by looking and acting humanlike to increase customers’ use intention of this technology, others employ machinelike robots to avoid uncanny valley effects, assuming that very humanlike robots may induce feelings of eeriness. There is no consensus in the service literature regarding whether customers’ anthropomorphism of robots facilitates or constrains their use intention. The present meta-analysis synthesizes data from 11,053 individuals interacting with service robots reported in 108 independent samples. The study synthesizes previous research to clarify this issue and enhance understanding of the construct. We develop a comprehensive model to investigate relationships between anthropomorphism and its antecedents and consequences. Customer traits and predispositions (e.g., computer anxiety), sociodemographics (e.g., gender), and robot design features (e.g., physical, nonphysical) are identified as triggers of anthropomorphism. Robot characteristics (e.g., intelligence) and functional characteristics (e.g., usefulness) are identified as important mediators, although relational characteristics (e.g., rapport) receive less support as mediators. The findings clarify contextual circumstances in which anthropomorphism impacts customer intention to use a robot. The moderator analysis indicates that the impact depends on robot type (i.e., robot gender) and service type (i.e., possession-processing service, mental stimulus-processing service). Based on these findings, we develop a comprehensive agenda for future research on service robots in marketing.

Single-Mode Parametric-Down-Conversion States with 50 Photons as a Source for Mesoscopic Quantum Optics.

Abstract: We generate pulsed, two-mode squeezed states in a single spatiotemporal mode with mean photon numbers up to 20. We directly measure photon-number correlations between the two modes with transition edge sensors up to 80 photons per mode. This corresponds roughly to a state dimensionality of 6400. We achieve detection efficiencies of 64% in the technologically crucial telecom regime and demonstrate the high quality of our measurements by heralded nonclassical distributions up to 50 photons per pulse and calculated correlation functions up to 40th order.

An approximate DFT method for QM/MM simulations of biological structures and processes

Abstract: In the last years, we have developed a computationally efficient approximation to density functional theory, the so called self-consistent charge density functional tight-binding scheme (SCC-DFTB). To extend its applicability to biomolecular structures, this method has been implemented into quantum mechanical/molecular mechanics (QM/MM) and linear scaling schemes and augmented with an empirical treatment of the dispersion forces. We review here applications of the SCC-DFTB QM/MM method to proton transfer (PT) reactions in enzymes like liver alcohol dehydrogenase and triosephosphate isomerase. The computational speed of SCC-DFTB allows not only to compute minimum energy pathways for the PT but also the potential of mean force. Further applications concern the dynamics of polypeptides in solution and of ligands in their biological environment. The developments reviewed allowed for the first time realistic QM simulations of polypeptides, a protein and a DNA dodecamer in the nanosecond time scale.

Dominating sets in planar graphs: branch-width and exponential speed-up

Abstract: Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known algorithms on different domination problems.

Towards the compositional verification of real-time UML designs

Abstract: Current techniques for the verification of software as e.g. model checking are limited when it comes to the verification of complex distributed embedded real-time systems. Our approach addresses this problem and in particular the state explosion problem for the software controlling mechatronic systems, as we provide a domain specific formal semantic definition for a subset of the UML 2.0 component model and an integrated sequence of design steps. These steps prescribe how to compose complex software systems from domain-specific patterns which model a particular part of the system behavior in a well-defined context. The correctness of these patterns can be verified individually because they have only simple communication behavior and have only a fixed number of participating roles. The composition of these patterns to describe the complete component behavior and the overall system behavior is prescribed by a rigorous syntactic definition which guarantees that the verification of component and system behavior can exploit the results of the verification of individual patterns.