@misc{1049, author = {{Beckendorfer, Björn}}, publisher = {{Universität Paderborn}}, title = {{{Visualisierung zu Algorithmen verteilter Netzwerksysteme}}}, year = {{2017}}, } @inproceedings{105, abstract = {{We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature.}}, author = {{Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian}}, booktitle = {{Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)}}, pages = {{137:1----137:15}}, title = {{{Distributed Monitoring of Network Properties: The Power of Hybrid Networks}}}, doi = {{10.4230/LIPIcs.ICALP.2017.137}}, year = {{2017}}, } @article{1054, abstract = {{We explore how competition between physicians affects medical service provision. Previous research has shown that, without competition, physicians deviate from patient‐optimal treatment under payment systems like capitation and fee‐for‐service. Although competition might reduce these distortions, physicians usually interact with each other repeatedly over time and only a fraction of patients switches providers at all. Both patterns might prevent competition to work in the desired direction. To analyze the behavioral effects of competition, we develop a theoretical benchmark that is then tested in a controlled laboratory experiment. Experimental conditions vary physician payment and patient characteristics. Real patients benefit from provision decisions made in the experiment. Our results reveal that, in line with the theoretical prediction, introducing competition can reduce overprovision and underprovision, respectively. The observed effects depend on patient characteristics and the payment system, though. Tacit collusion is observed and particularly pronounced with fee‐for‐service payment, but it appears to be less frequent than in related experimental research on price competition. }}, author = {{Brosig-Koch, Janet and Hehenkamp, Burkhard and Kokot, Johanna}}, journal = {{Health Economics}}, number = {{53}}, pages = {{6--20}}, publisher = {{Wiley Online Library}}, title = {{{The effects of competition on medical service provision}}}, doi = {{10.1002/hec.3583}}, volume = {{26}}, year = {{2017}}, } @techreport{1055, author = {{Hehenkamp, Burkhard and Kaarboe, Oddvar}}, publisher = {{Universität Paderborn}}, title = {{{Location Choice and Quality Competition in Mixed Hospital Markets}}}, year = {{2017}}, } @techreport{1056, author = {{Gu, Yiguan and Hehenkamp, Burkhard and Leininger, Wolfgang}}, publisher = {{Universität Paderborn}}, title = {{{Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation}}}, year = {{2017}}, } @techreport{1057, author = {{Sürücü, Oktay and Mir Djawadi, Behnud and Brangewitz, Sonja}}, publisher = {{Universität Paderborn}}, title = {{{Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries}}}, year = {{2017}}, } @misc{10589, author = {{Fürnkranz, J. and Hüllermeier, Eyke}}, booktitle = {{Encyclopedia of Machine Learning and Data Mining}}, pages = {{1000--1005}}, title = {{{Preference Learning}}}, year = {{2017}}, } @phdthesis{10594, abstract = {{Multiobjective optimization plays an increasingly important role in modern applications, where several criteria are often of equal importance. The task in multiobjective optimization and multiobjective optimal control is therefore to compute the set of optimal compromises (the Pareto set) between the conflicting objectives. Since – in contrast to the solution of a single objective optimization problem – the Pareto set generally consists of an infinite number of solutions, the computational effort can quickly become challenging. This is even more the case when many problems have to be solved, when the number of objectives is high, or when the objectives are costly to evaluate. Consequently, this thesis is devoted to the identification and exploitation of structure both in the Pareto set and the dynamics of the underlying model as well as to the development of efficient algorithms for solving problems with additional parameters, with a high number of objectives or with PDE-constraints. These three challenges are addressed in three respective parts. In the first part, predictor-corrector methods are extended to entire Pareto sets. When certain smoothness assumptions are satisfied, then the set of parameter dependent Pareto sets possesses additional structure, i.e. it is a manifold. The tangent space can be approximated numerically which yields a direction for the predictor step. In the corrector step, the predicted set converges to the Pareto set at a new parameter value. The resulting algorithm is applied to an example from autonomous driving. In the second part, the hierarchical structure of Pareto sets is investigated. When considering a subset of the objectives, the resulting solution is a subset of the Pareto set of the original problem. Under additional smoothness assumptions, the respective subsets are located on the boundary of the Pareto set of the full problem. This way, the “skeleton” of a Pareto set can be computed and due to the exponential increase in computing time with the number of objectives, the computations of these subsets are significantly faster which is demonstrated using an example from industrial laundries. In the third part, PDE-constrained multiobjective optimal control problems are addressed by reduced order modeling methods. Reduced order models exploit the structure in the system dynamics, for example by describing the dynamics of only the most energetic modes. The model reduction introduces an error in both the function values and their gradients, which has to be taken into account in the development of algorithms. Both scalarization and set-oriented approaches are coupled with reduced order modeling. Convergence results are presented and the numerical benefit is investigated. The algorithms are applied to semi-linear heat flow problems as well as to the Navier-Stokes equations. }}, author = {{Peitz, Sebastian}}, title = {{{ Exploiting structure in multiobjective optimization and optimal control}}}, doi = {{10.17619/UNIPB/1-176}}, year = {{2017}}, } @misc{106, author = {{Krammer, Isabel}}, publisher = {{Universität München}}, title = {{{Denn wir wissen, was gemeint ist: Erweiterung bestehender Lösungen zur lexikalischen Disambiguierung durch einen kontextsensitiven Whitelist-Ansatz}}}, year = {{2017}}, } @article{10600, author = {{H.W. Leong, Philip and Amano, Hideharu and Anderson, Jason and Bertels, Koen and M.P. Cardoso, Jo\~{a}o and Diessel, Oliver and Gogniat, Guy and Hutton, Mike and Lee, JunKyu and Luk, Wayne and Lysaght, Patrick and Platzner, Marco and K. Prasanna, Viktor and Rissa, Tero and Silvano, Cristina and So, Hayden and Wang, Yu}}, journal = {{ACM Transactions on Reconfigurable Technology and Systems}}, title = {{{The First 25 Years of the FPL Conference – Significant Papers}}}, doi = {{10.1145/2996468}}, year = {{2017}}, } @article{10601, author = {{F. DeMara, Ronald and Platzner, Marco and Ottavi, Marco}}, journal = {{IEEE Transactions on Computers and IEEE Transactions on Emerging Topics in Computing}}, title = {{{Innovation in Reconfigurable Computing Fabrics: from Devices to Architectures (guest editorial)}}}, doi = {{10.1109/TETC.2016.2641599}}, year = {{2017}}, } @article{10611, author = {{Anwer, Jahanzeb and Platzner, Marco}}, journal = {{Microprocessors and Microsystems}}, pages = {{160--172}}, publisher = {{Elsevier}}, title = {{{Evaluating fault-tolerance of redundant FPGA structures using Boolean difference calculus}}}, doi = {{10.1016/j.micpro.2017.06.002}}, year = {{2017}}, } @misc{10613, author = {{Kaltschmidt, Christian}}, publisher = {{Paderborn University}}, title = {{{An AR-based Training and Assessment System for Myoelectrical Prosthetic Control}}}, year = {{2017}}, } @article{1062, author = {{Frick, Bernd and Gergaud, Olivier and Winter, Petra}}, journal = {{Gastronomy and Tourism}}, number = {{4}}, pages = {{259--271(13)}}, publisher = {{Cognizant Communication Corporation}}, title = {{{The revenue potential of product differentiation: Empirical evidence fro the Croation restaurant industry}}}, doi = {{10.3727/216929717X15046207899410}}, volume = {{2}}, year = {{2017}}, } @inproceedings{10630, author = {{Boschmann, Alexander and Thombansen, Georg and Witschen, Linus Matthias and Wiens, Alex and Platzner, Marco}}, booktitle = {{Design, Automation and Test in Europe (DATE)}}, title = {{{A Zynq-based dynamically reconfigurable high density myoelectric prosthesis controller}}}, doi = {{10.23919/DATE.2017.7927137}}, year = {{2017}}, } @misc{10666, author = {{Riaz, Umair}}, publisher = {{Paderborn University}}, title = {{{Acceleration of Industrial Analytics Functions on a Platform FPGA}}}, year = {{2017}}, } @inproceedings{10672, author = {{Ho, Nam and Ashraf, Ishraq Ibne and Kaufmann, Paul and Platzner, Marco}}, booktitle = {{Proc. Design, Automation and Test in Europe Conf. (DATE)}}, title = {{{Accurate Private/Shared Classification of Memory Accesses: a Run-time Analysis System for the LEON3 Multi-core Processor}}}, doi = {{10.23919/DATE.2017.7927096}}, year = {{2017}}, } @inproceedings{10676, author = {{Ho, Nam and Kaufmann, Paul and Platzner, Marco}}, booktitle = {{2017 International Conference on Field Programmable Technology (ICFPT)}}, keywords = {{Linux, cache storage, microprocessor chips, multiprocessing systems, LEON3-Linux based multicore processor, MiBench suite, block sizes, cache adaptation, evolvable caches, memory-to-cache-index mapping function, processor caches, reconfigurable cache mapping optimization, reconfigurable hardware technology, replacement strategies, standard Linux OS, time a complete hardware implementation, Hardware, Indexes, Linux, Measurement, Multicore processing, Optimization, Training}}, pages = {{215--218}}, title = {{{Evolvable caches: Optimization of reconfigurable cache mappings for a LEON3/Linux-based multi-core processor}}}, doi = {{10.1109/FPT.2017.8280144}}, year = {{2017}}, } @misc{1069, author = {{Petersen, Henning Cornelius}}, publisher = {{Universität Paderborn}}, title = {{{Zu den Wechselwirkungen von Wettbewerb und Innovation - Eine ökonomische Analyse}}}, year = {{2017}}, } @article{10692, author = {{Shen, Cong and Kaufmann, Paul and Braun, Martin}}, journal = {{Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)}}, title = {{{Three-Stage Power System Restoration Methodology Considering Renewable Energies}}}, year = {{2017}}, } @misc{1070, author = {{Turan, Alparslan}}, publisher = {{Universität Paderborn}}, title = {{{Zu den Anreizwirkungen der Kronzeugenregelung - Eine spieltheoretische Analyse}}}, year = {{2017}}, } @misc{10708, author = {{Dietrich, Andreas}}, publisher = {{Paderborn University}}, title = {{{Reconfigurable Cryptographic Services}}}, year = {{2017}}, } @misc{1071, author = {{Iding, Jerome}}, publisher = {{Universität Paderborn}}, title = {{{Zu den Anreiz- und Wohlfahrtswirkungen der Kronzeugenregelung - Das Fallbeispiel des LKW-Kartells (1997-2011)}}}, year = {{2017}}, } @misc{1072, author = {{Lütkevedder, Dennis}}, publisher = {{Universität Paderborn}}, title = {{{Vertikale Wettbewerbsbeschränkung auf Hotelreservierungsportalen - eine ökonomische Analyse anhand der Bestpreisklausel von Booking}}}, year = {{2017}}, } @misc{1073, author = {{Nachtigall, Simon}}, publisher = {{Universität Paderborn}}, title = {{{Sortieren dynamischer Daten}}}, year = {{2017}}, } @misc{1074, author = {{Pukrop, Simon}}, publisher = {{Universität Paderborn}}, title = {{{Robuste Optimierung in Congestion Games}}}, year = {{2017}}, } @article{10740, author = {{Shen, Cong and Kaufmann, Paul and Braun, Martin}}, journal = {{The Journal of Engineering}}, pages = {{19pp}}, title = {{{Fast Network Restoration by Partitioning of Parallel Black Start Zones}}}, doi = {{10.1049/joe.2017.0032}}, year = {{2017}}, } @misc{1075, author = {{Laudage, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Open Innovation - Eine ökonimische Perspektive}}}, year = {{2017}}, } @book{10759, author = {{Squillero, Giovanni and Burelli, Paolo and M. Mora, Antonio and Agapitos, Alexandros and S. Bush, William and Cagnoni, Stefano and Cotta, Carlos and De Falco, Ivanoe and Della Cioppa, Antonio and Divina, Federico and Eiben, A.E. and I. Esparcia-Alc{\'a}zar, Anna and Fern{\'a}ndez de Vega, Francisco and Glette, Kyrre and Haasdijk, Evert and Ignacio Hidalgo, J. and Kampouridis, Michael and Kaufmann, Paul and Mavrovouniotis, Michalis and Thanh Nguyen, Trung and Schaefer, Robert and Sim, Kevin and Tarantino, Ernesto and Urquhart, Neil and Zhang (editors), Mengjie}}, publisher = {{Springer}}, title = {{{Applications of Evolutionary Computation - 20th European Conference, EvoApplications}}}, year = {{2017}}, } @misc{1076, author = {{Goebel, Marion}}, publisher = {{Universität Paderborn}}, title = {{{Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay}}}, year = {{2017}}, } @inproceedings{10760, author = {{Kaufmann, Paul and Kalkreuth, Roman}}, booktitle = {{KI 2017: Advances in Artificial Intelligence: 40th Annual German Conference on AI}}, publisher = {{Springer International Publishing}}, title = {{{Parametrizing Cartesian Genetic Programming: An Empirical Study}}}, doi = {{10.1007/978-3-319-67190-1_26}}, year = {{2017}}, } @inproceedings{10761, author = {{Kaufmann, Paul and Ho, Nam and Platzner, Marco}}, booktitle = {{Adaptive Hardware and Systems (AHS)}}, publisher = {{IEEE}}, title = {{{Evaluation Methodology for Complex Non-deterministic Functions: A Case Study in Metaheuristic Optimization of Caches}}}, doi = {{10.1109/AHS.2017.8046380}}, year = {{2017}}, } @inproceedings{10762, author = {{Kaufmann, Paul and Kalkreuth, Roman}}, booktitle = {{Genetic and Evolutionary Computation (GECCO), Compendium}}, publisher = {{ACM}}, title = {{{An Empirical Study on the Parametrization of Cartesian Genetic Programming}}}, doi = {{10.1145/3067695.3075980}}, year = {{2017}}, } @misc{1077, author = {{Wagemeyer, Marleen}}, publisher = {{Universität Paderborn}}, title = {{{Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet}}}, year = {{2017}}, } @misc{1078, author = {{Shabani, Albana}}, publisher = {{Universität Paderborn}}, title = {{{Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse}}}, year = {{2017}}, } @inproceedings{10780, author = {{Guettatfi, Zakarya and Hübner, Philipp and Platzner, Marco and Rinner, Bernhard}}, booktitle = {{12th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)}}, keywords = {{embedded systems, image sensors, power aware computing, wireless sensor networks, Zynq-based VSN node prototype, computational self-awareness, design approach, platform levels, power consumption, visual sensor networks, visual sensor nodes, Cameras, Hardware, Middleware, Multicore processing, Operating systems, Runtime, Reconfigurable platforms, distributed embedded systems, performance-resource trade-off, self-awareness, visual sensor nodes}}, pages = {{1--8}}, title = {{{Computational self-awareness as design approach for visual sensor nodes}}}, doi = {{10.1109/ReCoSoC.2017.8016147}}, year = {{2017}}, } @inbook{10784, author = {{Fürnkranz, J. and Hüllermeier, Eyke}}, booktitle = {{Encyclopedia of Machine Learning and Data Mining}}, editor = {{Sammut, C. and Webb, G.I.}}, pages = {{1000--1005}}, publisher = {{Springer}}, title = {{{Preference Learning}}}, volume = {{107}}, year = {{2017}}, } @inproceedings{10789, author = {{Trier, Matthias and Fung, Magdalene and Hansen, Abigail}}, booktitle = {{25th European Conference on Information Systems, {ECIS} 2017, Guimar{\~{a}}es, Portugal, June 5-10, 2017}}, pages = {{104}}, title = {{{Uncertainties as Barriers for Knowledge Sharing with Enterprise Social Media}}}, year = {{2017}}, } @misc{1079, author = {{Hamacher, Dustin Stefan}}, publisher = {{Universität Paderborn}}, title = {{{Das Zusammenschlussvorhaben von Edeka und Kaiser's Tengelmann - eine ökonomische Analyse}}}, year = {{2017}}, } @misc{1080, author = {{Bürmann, Jan}}, publisher = {{Universität Paderborn}}, title = {{{Complexity of Signalling in Routing Games under Uncertainty}}}, year = {{2017}}, } @misc{1081, author = {{Vijayalakshmi, Vipin Ravindran}}, publisher = {{Universität Paderborn}}, title = {{{Bounding the Inefficiency of Equilibria in Congestion Games under Taxation}}}, year = {{2017}}, } @techreport{1083, abstract = {{In actual school choice applications the theoretical underpinnings of the Boston School Choice Mechanism (BM) (complete information and rationality of the agents) are often not given. We analyze the actual behavior of agents in such a matching mechanism, using data from the matching mechanism currently used in a clearinghouse at a faculty of Business Administration and Economics at a German university, where a variant of the BM is used, and supplement this data with data generated in a survey among students who participated in the clearinghouse. We find that under the current mechanism over 70% of students act strategically. Controlling for students' limited information, we find that they do act rationally in their decision to act strategically. While students thus seem to react to the incentives to act strategically under the BM, they do not seem to be able to use this to their own advantage. However, those students acting in line with their beliefs manage a significantly better personal outcome than those who do not. We also run simulations by using a variant of the deferred acceptance algorithm, adapted to our situation, to show that the use of a different algorithm may be to the students' advantage.}}, author = {{Hoyer, Britta and Stroh-Maraun, Nadja}}, publisher = {{CIE Working Paper Series, Paderborn University}}, title = {{{Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse}}}, volume = {{110}}, year = {{2017}}, } @misc{109, author = {{Pauck, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Cooperative static analysis of Android applications}}}, year = {{2017}}, } @inproceedings{1094, abstract = {{Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, gamification is hardly used in education, because current approaches to gamification require instructors to engage in the time-consuming preparation of their course contents for use in quizzes, mini-games and the like. Drawing on research on limited attention and present bias, we propose a "lean" approach to gamification, which relies on gamifying learning activities (rather than learning contents) and increasing their salience. In this paper, we present the app StudyNow that implements such a lean gamification approach. With this app, we aim to enable more students and instructors to benefit from the advantages of gamification.}}, author = {{Feldotto, Matthias and John, Thomas and Kundisch, Dennis and Hemsen, Paul and Klingsieck, Katrin and Skopalik, Alexander}}, booktitle = {{Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)}}, pages = {{462--467}}, title = {{{Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App}}}, doi = {{10.1007/978-3-319-59144-5_32}}, year = {{2017}}, } @inproceedings{1095, abstract = {{Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, using gamification currently is rather tedious and time-consuming for instructors because current approaches to gamification require instructors to engage in the time-consuming preparation of course contents (e.g., for quizzes or mini-games). In reply to this issue, we propose a “lean” approach to gamification, which relies on gamifying learning activities rather than learning contents. The learning activities that are gamified in the lean approach can typically be drawn from existing course syllabi (e.g., attend certain lectures, hand in assignments, read book chapters and articles). Hence, compared to existing approaches, lean gamification substantially lowers the time requirements posed on instructors for gamifying a given course. Drawing on research on limited attention and the present bias, we provide the theoretical foundation for the lean gamification approach. In addition, we present a mobile application that implements lean gamification and outline a mixed-methods study that is currently under way for evaluating whether lean gamification does indeed have the potential to increase students’ motivation. We thereby hope to allow more students and instructors to benefit from the advantages of gamification. }}, author = {{John, Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch, Dennis and Langendorf, Mike}}, booktitle = {{Proceedings of the 25th European Conference on Information Systems (ECIS)}}, pages = {{2970--2979}}, title = {{{Towards a Lean Approach for Gamifying Education}}}, year = {{2017}}, } @article{1098, abstract = {{An end user generally writes down software requirements in ambiguous expressions using natural language; hence, a software developer attuned to programming language finds it difficult to understand th meaning of the requirements. To solve this problem we define semantic categories for disambiguation and classify/annotate the requirement into the categories by using machine-learning models. We extensively use a language frame closely related to such categories for designing features to overcome the problem of insufficient training data compare to the large number of classes. Our proposed model obtained a micro-average F1-score of 0.75, outperforming the previous model, REaCT.}}, author = {{Kim, Yeong-Su and Lee, Seung-Woo and Dollmann, Markus and Geierhos, Michaela}}, issn = {{2205-8494}}, journal = {{International Journal of Software Engineering for Smart Device}}, keywords = {{Natural Language Processing, Semantic Annotation, Machine Learning}}, number = {{2}}, pages = {{1--6}}, publisher = {{Global Vision School Publication}}, title = {{{Semantic Annotation of Software Requirements with Language Frame}}}, volume = {{4}}, year = {{2017}}, } @article{110, abstract = {{We consider an extension of the dynamic speed scaling scheduling model introduced by Yao et al.: A set of jobs, each with a release time, deadline, and workload, has to be scheduled on a single, speed-scalable processor. Both the maximum allowed speed of the processor and the energy costs may vary continuously over time. The objective is to find a feasible schedule that minimizes the total energy costs. Theoretical algorithm design for speed scaling problems often tends to discretize problems, as our tools in the discrete realm are often better developed or understood. Using the above speed scaling variant with variable, continuous maximal processor speeds and energy prices as an example, we demonstrate that a more direct approach via tools from variational calculus can not only lead to a very concise and elegant formulation and analysis, but also avoids the “explosion of variables/constraints” that often comes with discretizing. Using well-known tools from calculus of variations, we derive combinatorial optimality characteristics for our continuous problem and provide a quite concise and simple correctness proof.}}, author = {{Antoniadis, Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}}, journal = {{Theoretical Computer Science}}, pages = {{1--13}}, publisher = {{Elsevier}}, title = {{{Continuous Speed Scaling with Variability: A Simple and Direct Approach}}}, doi = {{10.1016/j.tcs.2017.03.021}}, year = {{2017}}, } @misc{117, author = {{Bemmann, Pascal}}, publisher = {{Universität Paderborn}}, title = {{{Attribute-based Signatures using Structure Preserving Signatures}}}, year = {{2017}}, } @inproceedings{11717, abstract = {{In this work, we address the limited availability of large annotated databases for real-life audio event detection by utilizing the concept of transfer learning. This technique aims to transfer knowledge from a source domain to a target domain, even if source and target have different feature distributions and label sets. We hypothesize that all acoustic events share the same inventory of basic acoustic building blocks and differ only in the temporal order of these acoustic units. We then construct a deep neural network with convolutional layers for extracting the acoustic units and a recurrent layer for capturing the temporal order. Under the above hypothesis, transfer learning from a source to a target domain with a different acoustic event inventory is realized by transferring the convolutional layers from the source to the target domain. The recurrent layer is, however, learnt directly from the target domain. Experiments on the transfer from a synthetic source database to the reallife target database of DCASE 2016 demonstrate that transfer learning leads to improved detection performance on average. However, the successful transfer to detect events which are very different from what was seen in the source domain, could not be verified.}}, author = {{Arora, Prerna and Haeb-Umbach, Reinhold}}, booktitle = {{IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)}}, title = {{{A Study on Transfer Learning for Acoustic Event Detection in a Real Life Scenario}}}, year = {{2017}}, } @techreport{11735, abstract = {{This report describes the computation of gradients by algorithmic differentiation for statistically optimum beamforming operations. Especially the derivation of complex-valued functions is a key component of this approach. Therefore the real-valued algorithmic differentiation is extended via the complex-valued chain rule. In addition to the basic mathematic operations the derivative of the eigenvalue problem with complex-valued eigenvectors is one of the key results of this report. The potential of this approach is shown with experimental results on the CHiME-3 challenge database. There, the beamforming task is used as a front-end for an ASR system. With the developed derivatives a joint optimization of a speech enhancement and speech recognition system w.r.t. the recognition optimization criterion is possible.}}, author = {{Boeddeker, Christoph and Hanebrink, Patrick and Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold}}, title = {{{On the Computation of Complex-valued Gradients with Application to Statistically Optimum Beamforming}}}, year = {{2017}}, } @inproceedings{11736, abstract = {{In this paper we show how a neural network for spectral mask estimation for an acoustic beamformer can be optimized by algorithmic differentiation. Using the beamformer output SNR as the objective function to maximize, the gradient is propagated through the beamformer all the way to the neural network which provides the clean speech and noise masks from which the beamformer coefficients are estimated by eigenvalue decomposition. A key theoretical result is the derivative of an eigenvalue problem involving complex-valued eigenvectors. Experimental results on the CHiME-3 challenge database demonstrate the effectiveness of the approach. The tools developed in this paper are a key component for an end-to-end optimization of speech enhancement and speech recognition.}}, author = {{Boeddeker, Christoph and Hanebrink, Patrick and Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold}}, booktitle = {{Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)}}, title = {{{Optimizing Neural-Network Supported Acoustic Beamforming by Algorithmic Differentiation}}}, year = {{2017}}, } @inproceedings{11737, abstract = {{The benefits of both a logarithmic spectral amplitude (LSA) estimation and a modeling in a generalized spectral domain (where short-time amplitudes are raised to a generalized power exponent, not restricted to magnitude or power spectrum) are combined in this contribution to achieve a better tradeoff between speech quality and noise suppression in single-channel speech enhancement. A novel gain function is derived to enhance the logarithmic generalized spectral amplitudes of noisy speech. Experiments on the CHiME-3 dataset show that it outperforms the famous minimum mean squared error (MMSE) LSA gain function of Ephraim and Malah in terms of noise suppression by 1.4 dB, while the good speech quality of the MMSE-LSA estimator is maintained.}}, author = {{Chinaev, Alleksej and Haeb-Umbach, Reinhold}}, booktitle = {{Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)}}, title = {{{A Generalized Log-Spectral Amplitude Estimator for Single-Channel Speech Enhancement}}}, year = {{2017}}, } @inproceedings{11754, abstract = {{Recent advances in discriminatively trained mask estimation networks to extract a single source utilizing beamforming techniques demonstrate, that the integration of statistical models and deep neural networks (DNNs) are a promising approach for robust automatic speech recognition (ASR) applications. In this contribution we demonstrate how discriminatively trained embeddings on spectral features can be tightly integrated into statistical model-based source separation to separate and transcribe overlapping speech. Good generalization to unseen spatial configurations is achieved by estimating a statistical model at test time, while still leveraging discriminative training of deep clustering embeddings on a separate training set. We formulate an expectation maximization (EM) algorithm which jointly estimates a model for deep clustering embeddings and complex-valued spatial observations in the short time Fourier transform (STFT) domain at test time. Extensive simulations confirm, that the integrated model outperforms (a) a deep clustering model with a subsequent beamforming step and (b) an EM-based model with a beamforming step alone in terms of signal to distortion ratio (SDR) and perceptually motivated metric (PESQ) gains. ASR results on a reverberated dataset further show, that the aforementioned gains translate to reduced word error rates (WERs) even in reverberant environments.}}, author = {{Drude, Lukas and Haeb-Umbach, Reinhold}}, booktitle = {{INTERSPEECH 2017, Stockholm, Schweden}}, title = {{{Tight integration of spatial and spectral features for BSS with Deep Clustering embeddings}}}, year = {{2017}}, } @inproceedings{11770, abstract = {{In this contribution we show how to exploit text data to support word discovery from audio input in an underresourced target language. Given audio, of which a certain amount is transcribed at the word level, and additional unrelated text data, the approach is able to learn a probabilistic mapping from acoustic units to characters and utilize it to segment the audio data into words without the need of a pronunciation dictionary. This is achieved by three components: an unsupervised acoustic unit discovery system, a supervisedly trained acoustic unit-to-grapheme converter, and a word discovery system, which is initialized with a language model trained on the text data. Experiments for multiple setups show that the initialization of the language model with text data improves the word segementation performance by a large margin.}}, author = {{Glarner, Thomas and Boenninghoff, Benedikt and Walter, Oliver and Haeb-Umbach, Reinhold}}, booktitle = {{INTERSPEECH 2017, Stockholm, Schweden}}, title = {{{Leveraging Text Data for Word Segmentation for Underresourced Languages}}}, year = {{2017}}, } @misc{118, author = {{Chi Banh, Ngoc}}, publisher = {{Universität Paderborn}}, title = {{{An Asynchronous Adaptation of a Churn-resistant Overlay Network}}}, year = {{2017}}, } @inproceedings{1180, abstract = {{These days, there is a strong rise in the needs for machine learning applications, requiring an automation of machine learning engineering which is referred to as AutoML. In AutoML the selection, composition and parametrization of machine learning algorithms is automated and tailored to a specific problem, resulting in a machine learning pipeline. Current approaches reduce the AutoML problem to optimization of hyperparameters. Based on recursive task networks, in this paper we present one approach from the field of automated planning and one evolutionary optimization approach. Instead of simply parametrizing a given pipeline, this allows for structure optimization of machine learning pipelines, as well. We evaluate the two approaches in an extensive evaluation, finding both approaches to have their strengths in different areas. Moreover, the two approaches outperform the state-of-the-art tool Auto-WEKA in many settings.}}, author = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}}, booktitle = {{27th Workshop Computational Intelligence}}, location = {{Dortmund}}, title = {{{Automatic Machine Learning: Hierachical Planning Versus Evolutionary Optimization}}}, year = {{2017}}, } @inproceedings{11809, abstract = {{This paper presents an end-to-end training approach for a beamformer-supported multi-channel ASR system. A neural network which estimates masks for a statistically optimum beamformer is jointly trained with a network for acoustic modeling. To update its parameters, we propagate the gradients from the acoustic model all the way through feature extraction and the complex valued beamforming operation. Besides avoiding a mismatch between the front-end and the back-end, this approach also eliminates the need for stereo data, i.e., the parallel availability of clean and noisy versions of the signals. Instead, it can be trained with real noisy multichannel data only. Also, relying on the signal statistics for beamforming, the approach makes no assumptions on the configuration of the microphone array. We further observe a performance gain through joint training in terms of word error rate in an evaluation of the system on the CHiME 4 dataset.}}, author = {{Heymann, Jahn and Drude, Lukas and Boeddeker, Christoph and Hanebrink, Patrick and Haeb-Umbach, Reinhold}}, booktitle = {{Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)}}, title = {{{BEAMNET: End-to-End Training of a Beamformer-Supported Multi-Channel ASR System}}}, year = {{2017}}, } @article{11811, abstract = {{Acoustic beamforming can greatly improve the performance of Automatic Speech Recognition (ASR) and speech enhancement systems when multiple channels are available. We recently proposed a way to support the model-based Generalized Eigenvalue beamforming operation with a powerful neural network for spectral mask estimation. The enhancement system has a number of desirable properties. In particular, neither assumptions need to be made about the nature of the acoustic transfer function (e.g., being anechonic), nor does the array configuration need to be known. While the system has been originally developed to enhance speech in noisy environments, we show in this article that it is also effective in suppressing reverberation, thus leading to a generic trainable multi-channel speech enhancement system for robust speech processing. To support this claim, we consider two distinct datasets: The CHiME 3 challenge, which features challenging real-world noise distortions, and the Reverb challenge, which focuses on distortions caused by reverberation. We evaluate the system both with respect to a speech enhancement and a recognition task. For the first task we propose a new way to cope with the distortions introduced by the Generalized Eigenvalue beamformer by renormalizing the target energy for each frequency bin, and measure its effectiveness in terms of the PESQ score. For the latter we feed the enhanced signal to a strong DNN back-end and achieve state-of-the-art ASR results on both datasets. We further experiment with different network architectures for spectral mask estimation: One small feed-forward network with only one hidden layer, one Convolutional Neural Network and one bi-directional Long Short-Term Memory network, showing that even a small network is capable of delivering significant performance improvements.}}, author = {{Heymann, Jahn and Drude, Lukas and Haeb-Umbach, Reinhold}}, journal = {{Computer Speech and Language}}, title = {{{A Generic Neural Acoustic Beamforming Architecture for Robust Multi-Channel Speech Processing}}}, year = {{2017}}, } @misc{119, author = {{Wever, Marcel Dominik}}, publisher = {{Universität Paderborn}}, title = {{{Active Learning of User Requirement Specifications in Dynamic Software Service Markets}}}, year = {{2017}}, } @article{11984, author = {{Bloessl, Bastian and Segata, Michele and Sommer, Christoph and Dressler, Falko}}, issn = {{1536-1233}}, journal = {{IEEE Transactions on Mobile Computing}}, pages = {{1162--1175}}, title = {{{Performance Assessment of IEEE 802.11p with an Open Source SDR-Based Prototype}}}, doi = {{10.1109/tmc.2017.2751474}}, year = {{2017}}, } @article{1199, author = {{Li, Guixin and Wu, Lin and Li, King F. and Chen, Shumei and Schlickriede, Christian and Xu, Zhengji and Huang, Siya and Li, Wendi and Liu, Yanjun and Pun, Edwin Y. B. and Zentgraf, Thomas and Cheah, Kok W. and Luo, Yu and Zhang, Shuang}}, issn = {{1530-6984}}, journal = {{Nano Letters}}, number = {{12}}, pages = {{7974--7979}}, publisher = {{American Chemical Society (ACS)}}, title = {{{Nonlinear Metasurface for Simultaneous Control of Spin and Orbital Angular Momentum in Second Harmonic Generation}}}, doi = {{10.1021/acs.nanolett.7b04451}}, volume = {{17}}, year = {{2017}}, } @inproceedings{120, abstract = {{Within software engineering, requirements engineering starts from imprecise and vague user requirements descriptions and infers precise, formalized specifications. Techniques, such as interviewing by requirements engineers, are typically applied to identify the user’s needs. We want to partially automate even this first step of requirements elicitation by methods of evolutionary computation. The idea is to enable users to specify their desired software by listing examples of behavioral descriptions. Users initially specify two lists of operation sequences, one with desired behaviors and one with forbidden behaviors. Then, we search for the appropriate formal software specification in the form of a deterministic finite automaton. We solve this problem known as grammatical inference with an active coevolutionary approach following Bongard and Lipson [2]. The coevolutionary process alternates between two phases: (A) additional training data is actively proposed by an evolutionary process and the user is interactively asked to label it; (B) appropriate automata are then evolved to solve this extended grammatical inference problem. Our approach leverages multi-objective evolution in both phases and outperforms the state-of-the-art technique [2] for input alphabet sizes of three and more, which are relevant to our problem domain of requirements specification.}}, author = {{Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)}}, pages = {{1327----1334}}, title = {{{Active Coevolutionary Learning of Requirements Specifications from Examples}}}, doi = {{10.1145/3071178.3071258}}, year = {{2017}}, } @inproceedings{12005, author = {{Eckhoff, David and Brummer, Alexander and Sommer, Christoph}}, booktitle = {{2016 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781509051977}}, title = {{{On the impact of antenna patterns on VANET simulation}}}, doi = {{10.1109/vnc.2016.7835925}}, year = {{2017}}, } @inproceedings{12006, author = {{Eckhoff, David and Sommer, Christoph}}, booktitle = {{2016 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781509051977}}, title = {{{Marrying safety with privacy: A holistic solution for location privacy in VANETs}}}, doi = {{10.1109/vnc.2016.7835971}}, year = {{2017}}, } @inproceedings{12014, author = {{Hagenauer, Florian and Sommer, Christoph and Higuchi, Takamasa and Altintas, Onur and Dressler, Falko}}, booktitle = {{2016 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781509051977}}, title = {{{Poster: Using clusters of parked cars as virtual vehicular network infrastructure}}}, doi = {{10.1109/vnc.2016.7835943}}, year = {{2017}}, } @inproceedings{12015, author = {{Hagenauer, Florian and Sommer, Christoph and Higuchi, Takamasa and Altintas, Onur and Dressler, Falko}}, booktitle = {{Proceedings of the 2nd ACM International Workshop on Smart, Autonomous, and Connected Vehicular Systems and Services - CarSys '17}}, isbn = {{9781450351461}}, title = {{{Parked Cars as Virtual Network Infrastructure}}}, doi = {{10.1145/3131944.3131952}}, year = {{2017}}, } @inproceedings{12016, author = {{Hagenauer, Florian and Sommer, Christoph and Higuchi, Takamasa and Altintas, Onur and Dressler, Falko}}, booktitle = {{Proceedings of the 2nd ACM International Workshop on Smart, Autonomous, and Connected Vehicular Systems and Services - CarSys '17}}, isbn = {{9781450351461}}, title = {{{Vehicular Micro Clouds as Virtual Edge Servers for Efficient Data Collection}}}, doi = {{10.1145/3131944.3133937}}, year = {{2017}}, } @inproceedings{12018, author = {{Hardes, Tobias and Dressler, Falko and Sommer, Christoph}}, booktitle = {{2017 International Conference on Networked Systems (NetSys)}}, isbn = {{9781509043941}}, title = {{{Simulating a city-scale community network: From models to first improvements for Freifunk}}}, doi = {{10.1109/netsys.2017.7903954}}, year = {{2017}}, } @inproceedings{12019, author = {{Heinovski, Julian and Klingler, Florian and Dressler, Falko and Sommer, Christoph}}, booktitle = {{2016 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781509051977}}, title = {{{Performance comparison of IEEE 802.11p and ARIB STD-T109}}}, doi = {{10.1109/vnc.2016.7835923}}, year = {{2017}}, } @inproceedings{12031, author = {{Klingler, Florian and Pannu, Gurjashan Singh and Sommer, Christoph and Dressler, Falko}}, booktitle = {{Proceedings of the 23rd Annual International Conference on Mobile Computing and Networking - MobiCom '17}}, isbn = {{9781450349161}}, title = {{{Poster}}}, doi = {{10.1145/3117811.3131265}}, year = {{2017}}, } @inproceedings{12032, author = {{Klingler, Florian and Pannu, Gurjashan Singh and Sommer, Christoph and Bloessl, Bastian and Dressler, Falko}}, booktitle = {{Proceedings of the 15th Annual International Conference on Mobile Systems, Applications, and Services - MobiSys '17}}, isbn = {{9781450349284}}, title = {{{Poster}}}, doi = {{10.1145/3081333.3089322}}, year = {{2017}}, } @inproceedings{12074, author = {{Turcanu, Ion and Sommer, Christoph and Baiocchi, Andrea and Dressler, Falko}}, booktitle = {{2016 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781509051977}}, title = {{{Pick the right guy: CQI-based LTE forwarder selection in VANETs}}}, doi = {{10.1109/vnc.2016.7835938}}, year = {{2017}}, } @misc{12081, abstract = {{The invention relates to a building or enclosure termination opening and/or closing apparatus having communication signed or encrypted by means of a key, and to a method for operating such. To allow simple, convenient and secure use by exclusively authorised users, the apparatus comprises: a first and a second user terminal, with secure forwarding of a time-limited key from the first to the second user terminal being possible. According to an alternative, individual keys are generated by a user identification and a secret device key.}}, author = {{Jacob, Florian and Schmalenstroeer, Joerg}}, title = {{{Building or Enclosure Termination Closing and/or Opening Apparatus, and Method for Operating a Building or Enclosure Termination}}}, year = {{2017}}, } @inproceedings{121, abstract = {{Research on ad copy design is well-studied in the context of offline marketing. However, researchers have only recently started to investigate ad copies in the context of paid search, and have not yet explored the potential of information cues to enhance customers’ search process. In this paper we analyze the impact of an information cue on user behavior in ad copies. Contrary to prevalent advice, results suggest that reducing the number of words in an ad is not always beneficial. Users act quite differently (and unexpectedly) in response to an information cue depending on their search phrases. In turn, practitioners could leverage the observed moderating effect of an information cue to enhance paid search success. Furthermore, having detected deviating user behavior in terms of clicks and conversions, we provide first indicative evidence of a self-selection mechanism at play when paid search users respond to differently phrased ad copies.}}, author = {{Schlangenotto, Darius and Kundisch, Dennis}}, booktitle = {{Proceedings of the 50th annual Hawaii International Conference on System Sciences (HICSS), Waikoloa Village, HI, USA}}, title = {{{Achieving more by saying less? On the Moderating Effect of Information Cues in Paid Search}}}, year = {{2017}}, } @inproceedings{122, abstract = {{Current research on paid search highlights its ability to enhance both online and offline conversions. Yet, research investigating the impact of placing paid search ads on less prominent positions on subsequent consumer behavior is limited to the online environment. This paper presents a field experiment using differences-in-differences analysis to investigate whether the targeting of a less prominent ad position can be beneficial for bricks-and-mortar retailers. Results indicate that paid search advertising budgets could be allocated more efficiently by targeting less prominent ad positions, thus allowing bricks-and-mortar retailers with a limited marketing budget to increase the reach of their marketing campaign, attract more consumers to their website and achieve an overall increase in conversions. Furthermore, the pay-per-click billing mechanism allows advertisers to increase their marketing reach at no additional cost. Consequently, bricks-and-mortar retailers should consider targeting less prominent ad positions to reduce advertising costs while simultaneously enhancing advertising benefits.}}, author = {{Schlangenotto, Darius and Kundisch, Dennis and Gutt, Dominik}}, booktitle = {{Proceedings of the 38th International Conference on Information Systems (ICIS), Seoul, South Korea}}, location = {{Seoul, South Korea}}, title = {{{Achieving More by Paying Less? How Bricks-and-Mortar Retailers Can Benefit by Bidding Less Aggressively in Paid Search}}}, year = {{2017}}, } @techreport{123, author = {{Jazayeri, Bahar and Zimmermann, Olaf and Engels, Gregor and Kundisch, Dennis}}, publisher = {{Universität Paderborn}}, title = {{{A Variability Model for Store-oriented Software Ecosystems: An Enterprise Perspective (Supplementary Material)}}}, year = {{2017}}, } @inproceedings{124, abstract = {{Pioneers of today’s software industry like Salesforce and Apple have established successful ecosystems around their software platforms. Architectural knowledge of the existing ecosystems is implicit and fragmented among online documentation. In protection of intellectual property, existing documentation hardly reveals influential business strategies that affect the ecosystem structure. Thus, other platform providers can hardly learn from the existing ecosystems in order to systematically make reasonable design decisions with respect to their business strategies to create their own ecosystems. In this paper, we identify a variability model for architectural design decisions of a store-oriented software ecosystem product line from an enterprise perspective, comprising business, application, and infrastructure views. We derive the variability model from fragmentary material of existing ecosystems and a rigorous literature review using a research method based on the design science paradigm. To show its validity, we describe real-world ecosystems from diverse domains using the variability model. This knowledge helps platform providers to develop customized ecosystems or to recreate existing designs in a systematic way. This, in turn, contributes to an increase in designer and developer productivity.}}, author = {{Jazayeri, Bahar and Zimmermann, Olaf and Engels, Gregor and Kundisch, Dennis}}, booktitle = {{Proceedings of the 15th International Conference on Service Oriented Computing (ICSOC)}}, publisher = {{Springer}}, title = {{{A Variability Model for Store-oriented Software Ecosystems: An Enterprise Perspective}}}, doi = {{10.1007/978-3-319-69035-3_42}}, volume = {{10601}}, year = {{2017}}, } @inproceedings{125, abstract = {{Searching for other participants is one of the most important operations in a distributed system.We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination.Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\mathcal O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The protocol keeps the expected amount of edge redirections per node in $\mathcal O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The number of messages that are periodically sent out by nodes is constant.}}, author = {{Feldmann, Michael and Scheideler, Christian}}, booktitle = {{Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, isbn = {{978-3-319-69083-4}}, pages = {{250--264 }}, publisher = {{Springer, Cham}}, title = {{{A Self-Stabilizing General De Bruijn Graph}}}, doi = {{10.1007/978-3-319-69084-1_17}}, volume = {{10616}}, year = {{2017}}, } @inproceedings{126, abstract = {{Optimal price setting in peer-to-peer markets featuring online ratings requires incorporating interactions between prices and ratings. Additionally, recent literature reports that online ratings in peer-to-peer markets tend to be inflated overall, undermining the reliability of online ratings as a quality signal. This study proposes a two-period model for optimal price setting that takes (potentially inflated) ratings into account. Our theoretical findings suggest that sellers in the medium-quality segment have an incentive to lower first-period prices to monetize on increased second-period ratings and that the possibility on monetizing on second-period ratings depends on the reliability of the rating system. Additionally, we find that total profits and prices increase with online ratings and additional quality signals. Empirically, conducting Difference-in-Difference regressions on a comprehensive panel data set from Airbnb, we can validate that price increases lead to lower ratings, and we find empirical support for the prediction that additional quality signals increase prices. Our work comes with substantial implications for sellers in peer-to-peer markets looking for an optimal price setting strategy. Moreover, we argue that our theoretical finding on the weights between online ratings and additional quality signals translates to conventional online markets.}}, author = {{Neumann, Jürgen and Gutt, Dominik}}, booktitle = {{Proceedings of the 25th Conference on Information Systems (ECIS)}}, location = {{Guimaraes, Portugal}}, title = {{{A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings}}}, year = {{2017}}, } @inproceedings{12973, author = {{Deshmukh, Jyotirmoy and Kunz, Wolfgang and Wunderlich, Hans-Joachim and Hellebrand, Sybille}}, booktitle = {{35th IEEE VLSI Test Symposium (VTS'17)}}, publisher = {{IEEE}}, title = {{{Special Session on Early Life Failures}}}, doi = {{10.1109/vts.2017.7928933}}, year = {{2017}}, } @inproceedings{15397, author = {{Melnikov, Vitaly and Hüllermeier, Eyke}}, booktitle = {{in Proceedings 27th Workshop Computational Intelligence, Dortmund Germany}}, editor = {{Hoffmann, F. and Hüllermeier, Eyke and Mikut, R.}}, pages = {{1--12}}, publisher = {{KIT Scientific Publishing}}, title = {{{Optimizing the structure of nested dichotomies. A comparison of two heuristics}}}, year = {{2017}}, } @inproceedings{15399, author = {{Czech, M. and Hüllermeier, Eyke and Jacobs, M.C. and Wehrheim, Heike}}, booktitle = {{in Proceedings ESEC/FSE Workshops 2017 - 3rd ACM SIGSOFT, International Workshop on Software Analytics (SWAN 2017), Paderborn Germany}}, title = {{{Predicting rankings of software verification tools}}}, year = {{2017}}, } @article{15428, author = {{Lehmann, T and Paschen, Linda and Baumeister, Jochen}}, issn = {{2199-1170}}, journal = {{Sports Med Open}}, number = {{1}}, pages = {{32}}, title = {{{Single-Leg Assessment of Postural Stability After Anterior Cruciate Ligament Injury: a Systematic Review and Meta-Analysis.}}}, doi = {{10.1186/s40798-017-0100-5}}, volume = {{3}}, year = {{2017}}, } @inproceedings{15589, author = {{Schulte, Carsten and Magenheim, Johannes and Müller, Kathrin and Budde, Lea}}, booktitle = {{2017 (IEEE) Global Engineering Education Conference, (EDUCON) 2017, Athens, Greece, April 25-28, 2017}}, pages = {{867--876}}, title = {{{The design and exploration cycle as research and development framework in computing education}}}, doi = {{10.1109/EDUCON.2017.7942950}}, year = {{2017}}, } @inproceedings{15590, author = {{Bergner, Nadine and Köster, Hilde and Magenheim, Johannes and Müller, Kathrin and Romeike, Ralf and Schroeder, Ulrik and Schulte, Carsten}}, booktitle = {{Informatische Bildung zum Verstehen und Gestalten der digitalen Welt, Proceedings der 17. GI-Fachtagung Informatik und Schule, (INFOS) 2017, 13.-15. September 2017, Oldenburg}}, pages = {{53--62}}, title = {{{Zieldimensionen für frühe informatische Bildung im Kindergarten und in der Grundschule}}}, year = {{2017}}, } @inproceedings{15591, author = {{Müller, Kathrin and Schulte, Carsten}}, booktitle = {{Informatische Bildung zum Verstehen und Gestalten der digitalen Welt, Proceedings der 17. GI-Fachtagung Informatik und Schule, (INFOS) 2017, 13.-15. September 2017, Oldenburg}}, pages = {{109--118}}, title = {{{Ein Modell zur Analyse von Vorstellungen über Roboter und ihrer Funktionsweise}}}, year = {{2017}}, } @inproceedings{15592, author = {{Budde, Lea and Heinemann, Birte and Schulte, Carsten}}, booktitle = {{Proceedings of the 12th Workshop on Primary and Secondary Computing Education, WiPSCE 2017, Nijmegen, The Netherlands, November 8-10, 2017}}, pages = {{83--86}}, title = {{{A theory based tool set for analysing reading processes in the context of learning programming}}}, doi = {{10.1145/3137065.3137077}}, year = {{2017}}, } @article{15593, author = {{Bergner, Nadine and Köster, Hilde and Magenheim, Johannes and Müller, Kathrin and Romeike, Ralf and Schroeder, Ulrik and Schulte, Carsten}}, journal = {{Frühe informatische Bildung - Ziele und Gelingensbedingungen für den Elementar- und Primarbereich. Berlin}}, title = {{{Zieldimensionen informatischer Bildung im Elementar-und Primarbereich}}}, year = {{2017}}, } @article{15594, author = {{Danielsiek, Holger and Hubwieser, Peter and Krugel, Johannes and Magenheim, Johannes and Ohrndorf, Laura and Ossenschmidt, Daniel and Schaper, Niclas and Vahrenhold, Jan}}, journal = {{INFORMATIK 2017}}, publisher = {{Gesellschaft für Informatik, Bonn}}, title = {{{Kompetenzbasierte Gestaltungsempfehlungen für Informatik-Tutorenschulungen}}}, year = {{2017}}, } @inproceedings{15597, author = {{Biehler, Rolf and Schulte, Carsten}}, booktitle = {{Paderborn Symposium on Data Science Education at School Level}}, pages = {{2--14}}, title = {{{PERSPECTIVES FOR AN INTERDISCIPLINARY DATA SCIENCE CURRICULUM IN GERMAN SECONDARY SCHOOLS}}}, year = {{2017}}, } @inproceedings{15895, author = {{Muller, Jens and Mladenov, Vladislav and Somorovsky, Juraj and Schwenk, Jörg}}, booktitle = {{2017 IEEE Symposium on Security and Privacy (SP)}}, isbn = {{9781509055333}}, title = {{{SoK: Exploiting Network Printers}}}, doi = {{10.1109/sp.2017.47}}, year = {{2017}}, } @inproceedings{15912, author = {{Grothe, Martin and Niemann, Tobias and Somorovsky, Juraj and Schwenk, Jörg}}, booktitle = {{11th {USENIX} Workshop on Offensive Technologies ({WOOT} 17)}}, publisher = {{{USENIX} Association}}, title = {{{Breaking and Fixing Gridcoin}}}, year = {{2017}}, } @article{15941, author = {{Reuter, Corin and Sauerland, Kim-Henning and Tröster, Thomas}}, issn = {{0263-8223}}, journal = {{Composite Structures}}, pages = {{33--44}}, title = {{{Experimental and numerical crushing analysis of circular CFRP tubes under axial impact loading}}}, doi = {{10.1016/j.compstruct.2017.04.052}}, year = {{2017}}, } @article{15942, author = {{Reuter, Corin and Tröster, Thomas}}, issn = {{0263-8231}}, journal = {{Thin-Walled Structures}}, pages = {{1--9}}, title = {{{Crashworthiness and numerical simulation of hybrid aluminium-CFRP tubes under axial impact}}}, doi = {{10.1016/j.tws.2017.03.034}}, volume = {{117}}, year = {{2017}}, } @article{15944, author = {{Striewe, Jan André and Reuter, Corin and Sauerland, Kim-Henning and Tröster, Thomas}}, issn = {{0263-8231}}, journal = {{Thin-Walled Structures}}, pages = {{501--508}}, title = {{{Manufacturing and crashworthiness of fabric-reinforced thermoplastic composites}}}, doi = {{10.1016/j.tws.2017.11.011}}, year = {{2017}}, } @inbook{14857, author = {{Beckschäfer, Michaela and Malberg, Simon and Tierney, Kevin and Weskamp, Christoph}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783319684956}}, issn = {{0302-9743}}, title = {{{Simulating Storage Policies for an Automated Grid-Based Warehouse System}}}, doi = {{10.1007/978-3-319-68496-3_31}}, year = {{2017}}, } @misc{14862, author = {{Webersen, Manuel and Henning, Bernd}}, title = {{{Ultraschallbasierte Charakterisierung des Alterungsverhaltens von Polymeren}}}, year = {{2017}}, } @inproceedings{14884, author = {{Chen, Wei-Fan and Chen, Yi-Pei and Ku, Lun-Wei}}, booktitle = {{International Conference on HCI in Business, Government, and Organizations}}, pages = {{190--202}}, title = {{{How to Get Endorsements? Predicting Facebook Likes Using Post Content and User Engagement}}}, year = {{2017}}, } @inproceedings{14893, author = {{Ghribi, Ines and Abdallah, Riadh Ben and Khalgui, Mohamed and Platzner, Marco}}, booktitle = {{Communications in Computer and Information Science}}, isbn = {{9783319625683}}, issn = {{1865-0929}}, publisher = {{Springer }}, title = {{{I-Codesign: A Codesign Methodology for Reconfigurable Embedded Systems}}}, doi = {{10.1007/978-3-319-62569-0_8}}, year = {{2017}}, } @inproceedings{15032, author = {{Spoelstra, Paul and Djakow, Eugen and Homberg, Werner}}, title = {{{Rubber pad forming - Efficient approach for the manufacturing of complex structured sheet metal blanks for food industry}}}, doi = {{10.1063/1.5008084}}, year = {{2017}}, }