@inproceedings{9718, author = {{Johannesmann, Sarah and Webersen, Manuel and Düchting, Julia and Claes, Leander and Henning, Bernd}}, booktitle = {{45th Annual Review of Progress in Quantitative Nondestructive Evaluation }}, location = {{Burlington}}, title = {{{Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves}}}, doi = {{10.1063/1.5099742}}, volume = {{38}}, year = {{2019}}, } @book{9719, editor = {{Flotmann-Scholz, Christina and Lienen, Anna}}, publisher = {{Universitätsverlag Winter}}, title = {{{Victorian Ideologies in Contemporary British Cultures}}}, year = {{2019}}, } @inbook{9720, author = {{Flotmann-Scholz, Christina and Lienen, Anna}}, booktitle = {{Victorian Ideologies in Contemporary British Cultures}}, editor = {{Flotmann-Scholz, Christina and Lienen, Anna}}, pages = {{135--173}}, publisher = {{Universitätsverlag Winter}}, title = {{{(New?) Masculinities in Nineteenth-Century Sensation Fiction and Contemporary Black British Fiction}}}, year = {{2019}}, } @inbook{9721, author = {{Flotmann-Scholz, Christina and Lienen, Anna}}, booktitle = {{Victorian Ideologies in Contemporary British Cultures}}, editor = {{Flotmann-Scholz, Christina and Lienen, Anna}}, publisher = {{Universitätsverlag Winter}}, title = {{{Introduction}}}, year = {{2019}}, } @inproceedings{9774, author = {{Neumann, Jürgen and Gutt, Dominik}}, booktitle = {{Proceedings of the 25th Americas Conference on Information Systems (AMCIS)}}, location = {{Cancun, Mexico}}, title = {{{Money Makes the Reviewer Go Round – Ambivalent Effects of Online Review Elicitation in B2B Markets}}}, year = {{2019}}, } @inproceedings{9775, author = {{Neumann, Jürgen and Gutt, Dominik and Görzen, Thomas and Kundisch, Dennis}}, booktitle = {{Proceedings of the 25th Americas Conference on Information Systems (AMCIS)}}, location = {{Cancun, Mexico}}, title = {{{When does Local Status Matter? – The Relationship between Reviewer Location and Perceived Usefulness of Online Reviews}}}, year = {{2019}}, } @inproceedings{9776, author = {{Poniatowski, Martin and Neumann, Jürgen and Kundisch, Dennis}}, booktitle = {{Proceedings of the 25th Americas Conference on Information Systems (AMCIS)}}, location = {{Cancun, Mexico}}, title = {{{Reviewing the Vendor or the Product – Analyzing Vendor versus Product Representation in B2B Review Systems}}}, year = {{2019}}, } @inproceedings{9777, author = {{Poniatowski, Martin and Neumann, Jürgen and Görzen, Thomas and Kundisch, Dennis}}, booktitle = {{Proceedings of the 27th European Conference on Information Systems (ECIS)}}, location = {{Stockholm, Sweden}}, title = {{{Organizing Their Thoughts – How Online Review Templates Affect the Review Text}}}, year = {{2019}}, } @inproceedings{9778, author = {{Gutt, Dominik and Neumann, Jürgen}}, booktitle = {{Proceedings of the 27th European Conference on Information Systems (ECIS)}}, location = {{Stockholm, Sweden}}, title = {{{The Virtues of Anonymity - An Empirical Investigation of the Relationship between B2B Online Ratings and Reviewer Self-Disclosure}}}, year = {{2019}}, } @inproceedings{9779, author = {{Neumann, Jürgen and Gutt, Dominik}}, booktitle = {{Proceedings of the 27th European Conference on Information Systems (ECIS)}}, location = {{Stockholm, Sweden}}, title = {{{He Who Pays the Piper Calls the Tune: Online Review Elicitation by Sellers and Third-Party Platforms in B2B Markets}}}, year = {{2019}}, } @inproceedings{9780, author = {{Bohn, Nicolai}}, booktitle = {{Proceedings of the 25th Americas Conference on Information Systems (AMCIS)}}, location = {{Cancun, Mexico}}, title = {{{Do Digital Startups Prepare for Technology Pivots? - An Initial Analysis of Job Adverts}}}, year = {{2019}}, } @inbook{9798, author = {{Herzig, Bardo and Klar, Tilman-Mathies}}, booktitle = {{Digitale Transformation in der Bildungslandschaft- den analogen Stecker ziehen?}}, editor = {{Heider-Lang, J. and Merkert, A.}}, pages = {{115--128}}, publisher = {{Rainer Hampp Verlag}}, title = {{{Digitale Modellierungen sozialer Räume}}}, year = {{2019}}, } @inproceedings{9809, abstract = {{Remarkable advantages of Containers (CNs) over Virtual Machines (VMs) such as lower overhead and faster startup has gained the attention of Communication Service Providers (CSPs) as using CNs for providing Virtual Network Functions (VNFs) can save costs while increasing the service agility. However, as it is not feasible to realise all types of VNFs in CNs, the coexistence of VMs and CNs is proposed. To put VMs and CNs together, an orchestration framework that can chain services across distributed and heterogeneous domains is required. To this end, we implemented a framework by extending and consolidating state-of-the-art tools and technologies originated from Network Function Virtualization (NFV), Software-defined Networking (SDN) and cloud computing environments. This framework chains services provisioned across Kubernetes and OpenStack domains. During the demo, we deploy a service consist of CN- and VM-based VNFs to demonstrate different features provided by our framework.}}, author = {{Razzaghi Kouchaksaraei, Hadi and Karl, Holger}}, booktitle = {{13th ACM International Conference on Distributed and Event-based Systems}}, keywords = {{Network Function Virtualization, Software-defined Networking, Cloud Computing, service orchestration, OpenStack, Kubernetes}}, location = {{Darmstadt}}, title = {{{Service Function Chaining Across OpenStack and Kubernetes Domains}}}, doi = {{10.1145/3328905.3332505}}, year = {{2019}}, } @book{9810, editor = {{Flotmann-Scholz, Christina and Lienen, Anna}}, publisher = {{Universitätsverlag Winter}}, title = {{{Victorian Ideologies in Contemporary British Cultures}}}, year = {{2019}}, } @inproceedings{9821, author = {{Betzing, Jan H and Niemann, Marco and Berendes, Carsten Ingo}}, booktitle = {{Human Practice. Digital Ecologies. Our Future. - Tagungsband der 14. Internationalen Tagung Wirtschaftsinformatik (WI 2019)}}, location = {{Siegen}}, title = {{{ Privacy-friendly User Location Tracking with Smart Devices: The BeaT Prototype}}}, year = {{2019}}, } @article{9823, author = {{Soenen, Thomas and Tavernier, Wouter and Peuster, Manuel and Vicens, Felipe and Xilouris, George and Kolometsos, Stavros and Kourtis, Michail-Alexandros and Colle, Didier}}, issn = {{0163-6804}}, journal = {{IEEE Communications Magazine}}, pages = {{89--95}}, title = {{{Empowering Network Service Developers: Enhanced NFV DevOps and Programmable MANO}}}, doi = {{10.1109/mcom.2019.1800810}}, year = {{2019}}, } @article{9824, author = {{Peuster, Manuel and Schneider, Stefan Balthasar and Zhao, Mengxuan and Xilouris, George and Trakadas, Panagiotis and Vicens, Felipe and Tavernier, Wouter and Soenen, Thomas and Vilalta, Ricard and Andreou, George and Kyriazis, Dimosthenis and Karl, Holger}}, issn = {{0163-6804}}, journal = {{IEEE Communications Magazine}}, pages = {{96--102}}, title = {{{Introducing Automated Verification and Validation for Virtualized Network Functions and Services}}}, doi = {{10.1109/mcom.2019.1800873}}, year = {{2019}}, } @article{9826, author = {{Tiedau, Johannes and Meyer-Scott, Evan and Nitsche, Thomas and Barkhofen, Sonja and Bartley, Tim and Silberhorn, Christine}}, issn = {{1094-4087}}, journal = {{Optics Express}}, title = {{{A high dynamic range optical detector for measuring single photons and bright light}}}, doi = {{10.1364/oe.27.000001}}, year = {{2019}}, } @inproceedings{9850, abstract = {{A business model describes the mechanisms whereby a firm creates, delivers, and captures value. Following the steadily growing interest in business model innovation, software tools have shown great potential in supporting business model development and innovation. Yet, understanding the cognitive processes involved in the generation of business model ideas is an aspect of software design-knowledge that has so far been neglected. To investigate whether providing stimuli – in this case, brainstorming questions – can enhance individual creativity in this context, we conduct an exploratory experiment with over 100 participants. Our study is the first to systematically investigate the process of idea generation using a software-based business model development tool with stimuli. Our preliminary findings have the potential to support the future development of business model development tools and to refine the research design used to evaluate such tools.}}, author = {{Szopinski, Daniel}}, booktitle = {{Proceedings of the ACM Creativity & Cognition}}, keywords = {{Business model innovation, idea generation, cognitive stimuli, business model development tools, experiment, creativity support system}}, location = {{San Diego, USA}}, title = {{{Can stimuli improve business model idea generation? Developing software-based tools for business model innovation}}}, year = {{2019}}, } @article{9853, abstract = {{Business model innovation is typically taught in small seminars at universities. Teaching this intrinsically task-oriented subject to a large number of students is a challenge. In this paper we address this challenge by proposing an experiential and interactive approach to teaching business models in a large classroom setting.}}, author = {{Szopinski, Daniel}}, journal = {{Journal of Business Models}}, keywords = {{Business model teaching, peer assessment, experiential learning}}, number = {{3}}, pages = {{90--100}}, title = {{{Squaring the circle: Business model teaching in large classroom settings}}}, volume = {{7}}, year = {{2019}}, } @article{9897, author = {{Protte, Maximilian and Weber, Nils and Golla, Christian and Zentgraf, Thomas and Meier, Cedrik}}, issn = {{0021-8979}}, journal = {{Journal of Applied Physics}}, title = {{{Strong nonlinear optical response from ZnO by coupled and lattice-matched nanoantennas}}}, doi = {{10.1063/1.5093257}}, volume = {{125}}, year = {{2019}}, } @article{9920, author = {{Fritz, Marlon and Gries, Thomas and Feng, Yuanhua}}, issn = {{0165-1765}}, journal = {{Economics Letters}}, pages = {{47--50}}, title = {{{Secular stagnation? Is there statistical evidence of an unprecedented, systematic decline in growth?}}}, doi = {{10.1016/j.econlet.2019.04.021}}, volume = {{181}}, year = {{2019}}, } @inproceedings{9939, author = {{Yigitbas, Enes and Jovanovikj, Ivan and Josifovska, Klementina and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019)}}, pages = {{563--567}}, publisher = {{Springer, LNCS}}, title = {{{On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback }}}, year = {{2019}}, } @article{3936, author = {{Gutt, Dominik and Herrmann, Philipp and Rahman, Mohammad}}, journal = {{Information Systems Research}}, number = {{3}}, pages = {{980--994}}, title = {{{Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions}}}, volume = {{30}}, year = {{2019}}, } @inproceedings{4400, author = {{Görzen, Thomas}}, booktitle = {{Proceedings of the 52nd Hawaii International Conference on System Sciences (HICSS)}}, location = {{Maui, Hawaii, USA}}, title = {{{Can Experience be Trusted? Investigating the Effect of Experience on Decision Biases in Crowdworking Platforms}}}, year = {{2019}}, } @techreport{5411, abstract = {{Öffentlich gelistete Firmen, die die Mehrheit an anderen börsennotierten Unternehmen er-werben und den Kapitalmarkt an den Synergieerwartungen teilhaben lassen, werden mit höheren kumulativen abnormalen Renditen im Ankündigungszeitpunkt belohnt verglichen mit solchen Unternehmen, die diese geheim halten. Des Weiteren ist die empirische Evi-denz konsistent mit der Idee, dass diese Käuferunternehmen ihre Transaktionen besser in-tegrieren, weil auch die industrieadjustierten Ein- und Zweijahresrenditen der ankündigen-den Unternehmen ökonomisch und statistisch signifikant höher sind als die der zurückhal-tenden Käuferfirmen. }}, author = {{Mehring, Oliver and Sievers, Sönke and Keienburg, Georg and Kengelbach, Jens}}, pages = {{76--84}}, publisher = {{Corporate Finance}}, title = {{{Wertgenerierung bei M&A Transaktionen durch Bekanntgabe von Synergien?}}}, volume = {{3-4}}, year = {{2019}}, } @inproceedings{5471, abstract = {{We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. Furthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting.}}, author = {{Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and Gerstgrasser, Matthias and de Keijzer, Bart}}, booktitle = {{Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)}}, location = {{Honolulu, Hawaii, USA}}, title = {{{ Multi-unit Bilateral Trade}}}, doi = {{10.1609/aaai.v33i01.33011973}}, year = {{2019}}, } @article{6512, abstract = {{Scheduling problems are essential for decision making in many academic disciplines, including operations management, computer science, and information systems. Since many scheduling problems are NP-hard in the strong sense, there is only limited research on exact algorithms and how their efficiency scales when implemented on parallel computing architectures. We address this gap by (1) adapting an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence- and machine-dependent setup times, (2) parallelizing the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach, and (3) conducting extensive computational experiments using up to 960 MPI processes on a modern high performance computing cluster. With our experiments, we show that the efficiency of our parallelization approach can lead to superlinear speedup but can vary substantially between instances. We further show that the wall time of serial execution can be substantially reduced through our parallelization, in some cases from 94 hours to less than six minutes when our algorithm is executed on 960 processes.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, journal = {{Computers & Operations Research}}, keywords = {{parallel machine scheduling with setup times, parallel branch-and-price algorithm, high performance computing, master/worker parallelization}}, number = {{104}}, pages = {{338--357}}, publisher = {{Elsevier}}, title = {{{Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm}}}, year = {{2019}}, } @inproceedings{6514, abstract = {{Recommender Agents (RAs) facilitate consumers’ online purchase decisions for complex, multi-attribute products. As not all combinations of attribute levels can be obtained, users are forced into trade-offs. The exposure of trade-offs in a RA has been found to affect consumers’ perceptions. However, little is known about how different preference elicitation methods in RAs affect consumers by varying degrees of trade-off exposure. We propose a research model that investigates how different levels of trade-off exposure cognitively and affectively influence consumers’ satisfaction with RAs. We operationalize these levels in three different RA types and test our hypotheses in a laboratory experiment with 116 participants. Our results indicate that with increasing tradeoff exposure, perceived enjoyment and perceived control follow an inverted Ushaped relationship. Hence, RAs using preference elicitation methods with medium trade-off exposure yield highest consumer satisfaction. This contributes to the understanding of trade-offs in RAs and provides valuable implications to e-commerce practitioners.}}, author = {{Schuhbeck, Veronika and Siegfried, Nils and Dorner, Verena and Benlian, Alexander and Scholz, Michael and Schryen, Guido}}, booktitle = {{Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik}}, keywords = {{Recommender Agents, Preference Elicitation Method, Trade-off Exposure, Customer Satisfaction}}, location = {{Siegen, Germany}}, pages = {{55--64}}, title = {{{Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents}}}, year = {{2019}}, } @misc{6628, author = {{Seutter, Janina}}, title = {{{Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung}}}, year = {{2019}}, } @article{6734, author = {{Gries, Thomas and Fritz, Marlon and Yuanhua, Feng}}, journal = {{Oxford Bulletin of Economics and Statistics}}, number = {{1}}, pages = {{62--78}}, title = {{{Growth Trends and Systematic Patterns of Boom and Busts –Testing 200 Years of Business Cycle Dynamics}}}, doi = {{10.1111/obes.12267}}, volume = {{81}}, year = {{2019}}, } @inproceedings{6856, author = {{Müller, Michelle and Gutt, Dominik}}, booktitle = {{Wirtschaftsinformatik Proceedings 2019}}, location = {{Siegen, Germany}}, title = {{{Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods}}}, year = {{2019}}, } @inproceedings{6857, author = {{Poniatowski, Martin and Neumann, Jürgen and Görzen, Thomas and Kundisch, Dennis}}, booktitle = {{Wirtschaftsinformatik Proceedings 2019}}, location = {{Siegen, Germany}}, title = {{{A Semi-Automated Approach for Generating Online Review Templates, }}}, year = {{2019}}, } @inproceedings{6860, author = {{Afifi, Haitham and Karl, Holger}}, booktitle = {{2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019)}}, publisher = {{IEEE}}, title = {{{Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding}}}, year = {{2019}}, } @inproceedings{6976, abstract = {{We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network. We assume an adversary that may churn a constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$ rounds. In particular, the adversary has an almost up-to-date information of the network topology as it can observe an only slightly outdated topology that is at least $2$ rounds old. Other than that, we only have the provably minimal restriction that new nodes can only join the network via nodes that have taken part in the network for at least one round. Our contributions are as follows: First, we show that it is impossible to maintain a connected topology if adversary has up-to-date information about the nodes' connections. Further, we show that our restriction concerning the join is also necessary. As our main result present an algorithm that constructs a new overlay- completely independent of all previous overlays - every $2$ rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$ messages each round. As part of our solution we propose the Linearized DeBruijn Swarm (LDS), a highly churn resistant overlay, which will be maintained by the algorithm. However, our approaches can be transferred to a variety of classical P2P Topologies where nodes are mapped into the $[0,1)$-interval.}}, author = {{Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}}, booktitle = {{Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}}, location = {{Rio de Janeiro, Brazil}}, publisher = {{IEEE}}, title = {{{Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}}}, year = {{2019}}, } @inproceedings{16411, abstract = {{FPGA devices have been proving to be good candidates to accelerate applications from different research topics. For instance, machine learning applications such as K-Means clustering usually relies on large amount of data to be processed, and, despite the performance offered by other architectures, FPGAs can offer better energy efficiency. With that in mind, Intel has launched a platform that integrates a multicore and an FPGA in the same package, enabling low latency and coherent fine-grained data offload. In this paper, we present a parallel implementation of the K-Means clustering algorithm, for this novel platform, using OpenCL language, and compared it against other platforms. We found that the CPU+FPGA platform was more energy efficient than the CPU-only approach from 70.71% to 85.92%, with Standard and Tiny input sizes respectively, and up to 68.21% of performance improvement was obtained with Tiny input size. Furthermore, it was up to 7.2×more energy efficient than an Intel® Xeon Phi ™, 21.5×than a cluster of Raspberry Pi boards, and 3.8×than the low-power MPPA-256 architecture, when the Standard input size was used.}}, author = {{Souza, Matheus A. and Maciel, Lucas A. and Penna, Pedro Henrique and Freitas, Henrique C.}}, booktitle = {{2018 30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)}}, isbn = {{9781538677698}}, keywords = {{pc2-harp-ressources}}, title = {{{Energy Efficient Parallel K-Means Clustering for an Intel® Hybrid Multi-Chip Package}}}, doi = {{10.1109/cahpc.2018.8645850}}, year = {{2019}}, } @inproceedings{16413, abstract = {{In recent years, FPGAs have been successfully employed for the implementation of efficient, application-specific accelerators for a wide range of machine learning tasks. In this work, we consider probabilistic models, namely, (Mixed) Sum-Product Networks (SPN), a deep architecture that can provide tractable inference for multivariate distributions over mixed data-sources. We develop a fully pipelined FPGA accelerator architecture, including a pipelined interface to external memory, for the inference in (mixed) SPNs. To meet the precision constraints of SPNs, all computations are conducted using double-precision floating point arithmetic. Starting from an input description, the custom FPGA-accelerator is synthesized fully automatically by our tool flow. To the best of our knowledge, this work is the first approach to offload the SPN inference problem to FPGA-based accelerators. Our evaluation shows that the SPN inference problem benefits from offloading to our pipelined FPGA accelerator architecture.}}, author = {{Sommer, Lukas and Oppermann, Julian and Molina, Alejandro and Binnig, Carsten and Kersting, Kristian and Koch, Andreas}}, booktitle = {{2018 IEEE 36th International Conference on Computer Design (ICCD)}}, isbn = {{9781538684771}}, keywords = {{pc2-harp-ressources}}, title = {{{Automatic Mapping of the Sum-Product Network Inference Problem to FPGA-Based Accelerators}}}, doi = {{10.1109/iccd.2018.00060}}, year = {{2019}}, } @misc{16415, author = {{Lienen, Julian}}, title = {{{Automated Feature Engineering on Time Series Data}}}, year = {{2019}}, } @inproceedings{16417, abstract = {{The performance of High-Level Synthesis (HLS) applications with irregular data structures is limited by its imperative programming paradigm like C/C++. In this paper, we show that constructing concurrent data structures with channels, a programming construct derived from CSP (communicating sequential processes) paradigm, is an effective approach to improve the performance of these applications. We evaluate concurrent data structure for FPGA by synthesizing a K-means clustering algorithm on the Intel HARP2 platform. A fully pipelined KMC processing element can be synthesized from OpenCL with the help of a SPSC (single-producer-single-consumer) queue and stack built from channels, achieving 15.2x speedup over a sequential baseline. The number of processing element can be scaled up by leveraging a MPMC (multiple-producer-multiple-consumer) stack with work distribution for dynamic load balance. Evaluation shows that an additional 3.5x speedup can be achieved when 4 processing element is instantiated. These results show that the concurrent data structure built with channels has great potential for improving the parallelism of HLS applications. We hope that our study will stimulate further research into the potential of channel-based HLS.}}, author = {{Yan, Hui and Li, Zhaoshi and Liu, Leibo and Yin, Shouyi and Wei, Shaojun}}, booktitle = {{Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays}}, isbn = {{9781450361378}}, keywords = {{pc2-harp-ressources}}, title = {{{Constructing Concurrent Data Structures on FPGA with Channels}}}, doi = {{10.1145/3289602.3293921}}, year = {{2019}}, } @article{16420, abstract = {{ Field-Programmable Gate Arrays (FPGAs) are widely used in the central signal processing design of the Square Kilometer Array (SKA) as hardware accelerators. The frequency domain acceleration search (FDAS) module is an important part of the SKA1-MID pulsar search engine. To develop for a yet to be finalized hardware, for cross-discipline interoperability and to achieve fast prototyping, OpenCL as a high-level FPGA synthesis approaches employed to create the sub-modules of FDAS. The FT convolution and the harmonic-summing plus some other minor sub-modules are elements in the FDAS module that have been well-optimized separately before. In this paper, we explore the design space of combining well-optimized designs, dealing with the ensuing need to trade-off and compromise. Pipeline computing is employed to handle multiple input arrays at high speed. The hardware target is to employ multiple high-end FPGAs to process the combined FDAS module. The results show interesting consequences, where the best individual solutions are not necessarily the best solutions for the speed of a pipeline where FPGA resources and memory bandwidth need to be shared. By proposing multiple buffering techniques to the pipeline, the combined FDAS module can achieve up to 2[Formula: see text] speedup over implementations without pipeline computing. We perform an extensive experimental evaluation on multiple high-end FPGA cards hosted in a workstation and compare to a technology comparable mid-range GPU. }}, author = {{Wang, Haomiao and Thiagaraj, Prabu and Sinnen, Oliver}}, issn = {{2251-1717}}, journal = {{Journal of Astronomical Instrumentation}}, keywords = {{pc2-harp-ressources}}, title = {{{Combining Multiple Optimized FPGA-based Pulsar Search Modules Using OpenCL}}}, doi = {{10.1142/s2251171719500089}}, year = {{2019}}, } @article{16422, abstract = {{Intel recently introduced the Heterogeneous Architecture Research Platform, HARP. In this platform, the Central Processing Unit and a Field-Programmable Gate Array are connected through a high-bandwidth, low-latency interconnect and both share DRAM memory. For this platform, Open Computing Language (OpenCL), a High-Level Synthesis (HLS) language, is made available. By making use of HLS, a faster design cycle can be achieved compared to programming in a traditional hardware description language. This, however, comes at the cost of having less control over the hardware implementation. We will investigate how OpenCL can be applied to implement a real-time guided image filter on the HARP platform. In the first phase, the performance-critical parameters of the OpenCL programming model are defined using several specialized benchmarks. In a second phase, the guided image filter algorithm is implemented using the insights gained in the first phase. Both a floating-point and a fixed-point implementation were developed for this algorithm, based on a sliding window implementation. This resulted in a maximum floating-point performance of 135 GFLOPS, a maximum fixed-point performance of 430 GOPS and a throughput of HD color images at 74 frames per second.}}, author = {{Faict, Thomas and D’Hollander, Erik H. and Goossens, Bart}}, issn = {{1999-4893}}, journal = {{Algorithms}}, keywords = {{pc2-harp-ressources}}, title = {{{Mapping a Guided Image Filter on the HARP Reconfigurable Architecture Using OpenCL}}}, doi = {{10.3390/a12080149}}, year = {{2019}}, } @article{16423, abstract = {{Heterogeneous computing that exploits simultaneous co-processing with different device types has been shown to be effective at both increasing performance and reducing energy consumption. In this paper, we extend a scheduling framework encapsulated in a high-level C++ template and previously developed for heterogeneous chips comprising CPU and GPU cores, to new high-performance platforms for the data center, which include a cache coherent FPGA fabric and many-core CPU resources. Our goal is to evaluate the suitability of our framework with these new FPGA-based platforms, identifying performance benefits and limitations.We target the state-of-the-art HARP processor that includes 14 high-end Xeon classes tightly coupled to a FPGA device located in the same package. We select eight benchmarks from the high-performance computing domain that have been ported and optimized for this heterogeneous platform. The results show that a dynamic and adaptive scheduler that exploits simultaneous processing among the devices can improve performance up to a factor of 8 × compared to the best alternative solutions that only use the CPU cores or the FPGA fabric. Moreover, our proposal achieves up to 15% and 37% of improvement compared to the best heterogeneous solutions found with a dynamic and static schedulers, respectively.}}, author = {{Rodríguez, Andrés and Navarro, Angeles and Asenjo, Rafael and Corbera, Francisco and Gran, Rubén and Suárez, Darío and Nunez-Yanez, Jose}}, issn = {{0920-8542}}, journal = {{The Journal of Supercomputing}}, keywords = {{pc2-harp-ressources}}, title = {{{Parallel multiprocessing and scheduling on the heterogeneous Xeon+FPGA platform}}}, doi = {{10.1007/s11227-019-02935-1}}, year = {{2019}}, } @inproceedings{16427, abstract = {{Transactional Memory (TM) has been considered as a promising alternative to existing synchronization operations, which are often the largest stumbling block to unleashing parallelism of applications. Efficient implementations of TM, however, are challenging due to the tension between lowering performance overhead and avoiding unnecessary aborts. In this paper, we present Reachability-based Optimistic Concurrency Control for Transactional Memory (ROCoCoTM), a novel scheme which offloads concurrency control (CC) algorithms, the central building blocks of TM systems, to reconfigurable hardware. To reduce the abort rate, an innovative formalization of mainstream CC algorithms is developed to reveal a common restriction that leads to unnecessary aborts. This restriction is resolved by the ROCoCo algorithm with a centralized validation phase, which can be efficiently pipelined in hardware. Thanks to a high-performance offloading engine implemented in reconfigurable hardware, ROCoCo algorithm results in decreased abort rates and reduced performance overhead. The whole system is implemented on Intel's HARP2 platform and evaluated with the STAMP benchmark suite. Experiments show 1.55x and 8.05x geomean speedup over TinySTM and an HTM based on Intel TSX, respectively. Given the fast-growing deployment of commodity CPU-FPGA platforms, ROCoCoTM paves the way for software programmers to exploit heterogeneous computing resources with a high-level transactional abstraction to effectively extract the parallelism in modern applications.}}, author = {{Li, Zhaoshi and Liu, Leibo and Deng, Yangdong and Wang, Jiawei and Liu, Zhiwei and Yin, Shouyi and Wei, Shaojun}}, booktitle = {{Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture}}, isbn = {{9781450369381}}, keywords = {{pc2-harp-ressources}}, title = {{{FPGA-Accelerated Optimistic Concurrency Control for Transactional Memory}}}, doi = {{10.1145/3352460.3358270}}, year = {{2019}}, } @inproceedings{16433, author = {{Rehlaender, Philipp and Grote, Tobias and Tikhonov, Sergey and Niejende, Hugues and Schafmeister, Frank and Bocker, Joachim and Thiemann, Peter}}, booktitle = {{2019 21st European Conference on Power Electronics and Applications (EPE '19 ECCE Europe)}}, isbn = {{9789075815313}}, title = {{{A PCB Integrated Winding Using a Litz Structure for a Wireless Charging Coil}}}, doi = {{10.23919/epe.2019.8914900}}, year = {{2019}}, } @inproceedings{16438, author = {{Rehlaender, Philipp and Schafmeister, Frank and Bocker, Joachim and Grote, Tobias}}, booktitle = {{2019 IEEE 28th International Symposium on Industrial Electronics (ISIE)}}, isbn = {{9781728136660}}, title = {{{Analytical Topology Comparison for a Single Stage On-Board EV-Battery Converter}}}, doi = {{10.1109/isie.2019.8781222}}, year = {{2019}}, } @inbook{16443, author = {{Rehlaender, Philipp and Schroeer, Maik and Chadha, Gavneet and Schwung, Andreas}}, booktitle = {{Proceedings of the International Neural Networks Society}}, isbn = {{9783030168407}}, issn = {{2661-8141}}, title = {{{Traffic Sign Detection Using R-CNN}}}, doi = {{10.1007/978-3-030-16841-4_24}}, year = {{2019}}, } @article{16709, author = {{Sahai, Tuhin and Ziessler, Adrian and Klus, Stefan and Dellnitz, Michael}}, issn = {{0924-090X}}, journal = {{Nonlinear Dynamics}}, title = {{{Continuous relaxations for the traveling salesman problem}}}, doi = {{10.1007/s11071-019-05092-5}}, year = {{2019}}, } @inproceedings{16793, author = {{Pfeifer, Florian and Dietrich, André and Marten, Thorsten and Tröster, Thomas and Nacke, Bernard}}, booktitle = {{Proceedings of 7th International Conference on Hot Sheet Metal Forming of High-Performance Steel}}, isbn = {{978-3-95735-104-3}}, location = {{Luleå}}, pages = {{585--593}}, title = {{{Investigation on Inductive Heating of Sheet Metal for an Industrial Hot Stamping Process}}}, year = {{2019}}, } @inproceedings{16794, author = {{Striewe, Jan André and Thomas, Robert and Fischer, Fabian and Wiens, Timo and Tröster, Thomas}}, location = {{Neu-Ulm}}, publisher = {{DGM-Inventum GmbH }}, title = {{{Energieabsorptions- und Versagensverhalten eines automobilen Seitenschwellers mit lokaler Verstärkung aus kohlenstofffaserverstärktem Kunststoff nach Alterung}}}, year = {{2019}}, } @misc{16825, author = {{Ahlers, Dominik and Tröster, Thomas}}, publisher = {{EuroPM}}, title = {{{Performance Parameters and HIP Routes for additively manufactured titanium alloy Ti6Al4V}}}, year = {{2019}}, }