@inbook{3593, author = {{Harteis, Christian and Fischer, Christoph}}, booktitle = {{Handbuch Gestaltung digitaler und vernetzter Arbeitswelten}}, editor = {{Maier, Günter W. and Engels, Gregor and Steffen, Eckhard}}, isbn = {{978-3-662-52903-4}}, keywords = {{i40, learning culture}}, pages = {{1----18}}, publisher = {{Springer}}, title = {{{Wissensmanagement unter Bedingungen von Arbeit 4.0}}}, year = {{2018}}, } @inbook{3594, author = {{Fischer, Christoph and Goller, Michael and Brinkmann, Lorraine and Harteis, Christian}}, booktitle = {{Digital Workplace Learning}}, editor = {{Ifenthaler, Dirk}}, isbn = {{978-3-319-46214-1 978-3-319-46215-8}}, keywords = {{i40, learning culture}}, pages = {{227----249}}, publisher = {{Springer}}, title = {{{Digitalisation of Work: Between Affordances and Constraints for Learning at Work}}}, year = {{2018}}, } @book{3595, author = {{Gruber, Hans and Harteis, Christian}}, pages = {{217}}, publisher = {{Springer}}, title = {{{Individual and social influences on professional learning. Supporting the acquisition and maintenance of expertise.}}}, doi = {{10.1007/978-3-319-97041-7}}, year = {{2018}}, } @book{3681, editor = {{Harteis, Christian}}, publisher = {{Springer}}, title = {{{The impact of digitalization in the workplace: an educational view}}}, year = {{2018}}, } @inbook{3682, author = {{Harteis, Christian}}, booktitle = {{The Impact of Digitalization in the Workplace}}, editor = {{Harteis, Christian}}, pages = {{1----10}}, publisher = {{Springer}}, title = {{{Machines, Change and Work: An Educational View on the Digitalization of Work}}}, year = {{2018}}, } @inbook{3683, author = {{Billett, Stephen and Harteis, Christian and Gruber, Hans}}, booktitle = {{The Cambridge Handbook of Expertise and Expert Performance}}, editor = {{Ericsson, Karl A and Hoffman, Robert R. and Kozbelt, Andrew and Wiliams, A M}}, pages = {{105}}, publisher = {{Cambridge University Press}}, title = {{{Developing Occupational Expertise through Everyday Work Activities and Interactions}}}, year = {{2018}}, } @phdthesis{3720, abstract = {{Traditional cache design uses a consolidated block of memory address bits to index a cache set, equivalent to the use of modulo functions. While this module-based mapping scheme is widely used in contemporary cache structures due to the simplicity of its hardware design and its good performance for sequences of consecutive addresses, its use may not be satisfactory for a variety of application domains having different characteristics.This thesis presents a new type of cache mapping scheme, motivated by programmable capabilities combined with Nature-inspired optimization of reconfigurable hardware. This research has focussed on an FPGA-based evolvable cache structure of the first level cache in a multi-core processor architecture, able to dynamically change cache indexing. To solve the challenge of reconfigurable cache mappings, a programmable Boolean circuit based on a combination of Look-up Table (LUT) memory elements is proposed. Focusing on optimization aspects at the system level, a Performance Measurement Infrastructure is introduced that is able to monitor the underlying microarchitectural metrics, and an adaptive evaluation strategy is presented that leverages on Evolutionary Algorithms, that is not only capable of evolving application-specific address-to-cache-index mappings for level one split caches but also of reducing optimization times. Putting this all together and prototyping in an FPGA for a LEON3/Linux-based multi-core processor, the creation of a system architecture reduces cache misses and improves performance over the use of conventional caches.}}, author = {{Ho, Nam}}, pages = {{139}}, publisher = {{Universität Paderborn}}, title = {{{FPGA-based Reconfigurable Cache Mapping Schemes: Design and Optimization}}}, doi = {{10.17619/UNIPB/1-376}}, year = {{2018}}, } @article{3740, abstract = {{Oblique propagation of semi-guided waves across slab waveguide structures with bent corners is investigated. A critical angle can be defined beyond which all radiation losses are suppressed. Additionally an increase of the curvature radius of the bends also leads to low-loss configurations for incidence angles below that critical angle. A combination of two bent corner systems represents a step-like structure, behaving like a Fabry-Perot interferometer, with two partial reflectors separated by the vertical height between the horizontal slabs. We numerically analyse typical high-index-contrast Si/SiO2 structures for their reflectance and transmittance properties. When increasing the curvature radius the resonant effect becomes less relevant such that full transmittance is reached with less critical conditions on the vertical distance or the incidence angle. For practical interest 3-D problems are considered, where the structures are excited by the fundamental mode of a wide, shallow rib waveguide. High transmittance levels can be observed also for these 3-D configurations depending on the width of the rib.}}, author = {{Ebers, Lena and Hammer, Manfred and Förstner, Jens}}, journal = {{Optics Express}}, keywords = {{tet_topic_waveguide}}, number = {{14}}, pages = {{18621--18632}}, publisher = {{OSA Publishing}}, title = {{{Oblique incidence of semi-guided planar waves on slab waveguide steps: effects of rounded edges}}}, doi = {{10.1364/OE.26.018621}}, volume = {{26}}, year = {{2018}}, } @inbook{3742, author = {{Hoof, Simon}}, booktitle = {{Static & Dynamic Game Theory: Foundations & Applications}}, isbn = {{9783319929873}}, issn = {{2363-8516}}, pages = {{13--23}}, publisher = {{Springer International Publishing}}, title = {{{Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution}}}, doi = {{10.1007/978-3-319-92988-0_2}}, year = {{2018}}, } @inproceedings{3804, author = {{Al Khatib, Khalid and Wachsmuth, Henning and Lang, Kevin and Herpel, Jakob and Hagen, Matthias and Stein, Benno}}, booktitle = {{Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}}, pages = {{2545--2555}}, title = {{{Modeling Deliberative Argumentation Strategies on Wikipedia}}}, year = {{2018}}, } @inproceedings{3806, author = {{Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}}, booktitle = {{Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers)}}, pages = {{386--396}}, title = {{{Before Name-Calling: Dynamics and Triggers of Ad Hominem Fallacies in Web Argumentation}}}, year = {{2018}}, } @inproceedings{3807, author = {{Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}}, booktitle = {{Proceedings of The 12th International Workshop on Semantic Evaluation}}, pages = {{763--772}}, title = {{{SemEval-2018 Task 12: The Argument Reasoning Comprehension Task}}}, year = {{2018}}, } @inproceedings{3821, author = {{Wachsmuth, Henning and Syed, Shahbaz and Stein, Benno}}, booktitle = {{Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}}, pages = {{241--251}}, title = {{{Retrieval of the Best Counterargument without Prior Topic Knowledge}}}, year = {{2018}}, } @misc{3851, author = {{Koop, Samuel}}, publisher = {{Universität Paderborn}}, title = {{{Congestion Games mit gewichteten Strategien}}}, year = {{2018}}, } @inproceedings{3852, abstract = {{In automated machine learning (AutoML), the process of engineering machine learning applications with respect to a specific problem is (partially) automated. Various AutoML tools have already been introduced to provide out-of-the-box machine learning functionality. More specifically, by selecting machine learning algorithms and optimizing their hyperparameters, these tools produce a machine learning pipeline tailored to the problem at hand. Except for TPOT, all of these tools restrict the maximum number of processing steps of such a pipeline. However, as TPOT follows an evolutionary approach, it suffers from performance issues when dealing with larger datasets. In this paper, we present an alternative approach leveraging a hierarchical planning to configure machine learning pipelines that are unlimited in length. We evaluate our approach and find its performance to be competitive with other AutoML tools, including TPOT.}}, author = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}}, booktitle = {{ICML 2018 AutoML Workshop}}, keywords = {{automated machine learning, complex pipelines, hierarchical planning}}, location = {{Stockholm, Sweden}}, title = {{{ML-Plan for Unlimited-Length Machine Learning Pipelines}}}, year = {{2018}}, } @proceedings{3874, editor = {{Scheideler, Christian and Fineman, Jeremy T.}}, isbn = {{978-1-4503-5799-9}}, location = {{Vienna, Austria}}, publisher = {{ACM}}, title = {{{Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures}}}, year = {{2018}}, } @article{3902, abstract = {{All over the world, firms and governments are increasingly concerned about the rise in tax complexity. To manage it and develop effective simplification measures, detailed information on the current drivers of complexity is required. However, research on this topic is scarce. This is surprising as the latest developments-for example, those triggered by the BEPS project-have given rise to the conjecture that complexity drivers may have changed, thus questioning the findings of prior studies. In this article, we shed light on this issue and provide a global picture of the current drivers of tax complexity that multinational corporations face based on a survey of 221 highly experienced tax consultants from 108 countries. Our results show that prior complexity drivers of the tax code are still important, with details and changes of tax regulations being the two most important complexity drivers. We also find evidence for new important complexity drivers emerging from different areas of the tax framework, such as inconsistent decisions among tax officers (tax audits) or retroactively applied tax law amendments (tax enactment). Based on the tax consultants' responses, we develop a concept of tax complexity that is characterized by two pillars, tax code and tax framework complexity and illustrates the various aspects that should be considered when assessing the complexity of a country's tax system.}}, author = {{Hoppe, Thomas and Schanz, Deborah and Sturm, Susann and Sureth-Sloane, Caren}}, issn = {{ 0165-2826}}, journal = {{Intertax}}, number = {{8/9}}, pages = {{654--675}}, publisher = {{Kluwer Law International}}, title = {{{What are the Drivers of Tax Complexity for MNCs? Global Evidence}}}, volume = {{46}}, year = {{2018}}, } @article{3912, abstract = {{DNA origami nanostructures are versatile substrates for the controlled arrangement of molecular capture sites with nanometer precision and thus have many promising applications in singlemolecule bioanalysis. Here, we investigate the adsorption of DNA origami nanostructures in nanohole arrays which represent an important class of biosensors and may benefit from the incorporation of DNA origami-based molecular probes. Nanoholes with well-defined diameter that enable the adsorption of single DNA origami triangles are fabricated in Au films on Siwafers by nanosphere lithography. The efficiency of directed DNA origami adsorption on the exposed SiO2 areas at the bottoms of the nanoholes is evaluated in dependence of various parameters, i.e., Mg2+ and DNA origami concentrations, buffer strength, adsorption time, and nanohole diameter. We observe that the buffer strength has a surprisingly strong effect on DNA origami adsorption in the nanoholes and that multiple DNA origami triangles with 120 nm edge length can adsorb in nanoholes as small as 120 nm in diameter. We attribute the latter observation to the low lateral mobility of once adsorbed DNA origami on the SiO2 surface, in combination with parasitic adsorption to the Au film. While parasitic adsorption can be suppressed by modifying the Au film with a hydrophobic self-assembled monolayer, the limited surface mobility of the adsorbed DNA origami still leads to poor localization accuracy in the nanoholes and results in many DNA origami crossing the boundary to the Au film even under optimized conditions. We discuss possible ways to minimize this effect by varying the composition of the adsorption buffer, employing different fabrication conditions, or using other substrate materials for nanohole array fabrication.}}, author = {{Brassat, Katharina and Ramakrishnan, Saminathan and Bürger, Julius and Hanke, Marcel and Doostdar, Mahnaz and Lindner, Jörg and Grundmeier, Guido and Keller, Adrian}}, issn = {{0743-7463}}, journal = {{Langmuir}}, publisher = {{American Chemical Society (ACS)}}, title = {{{On the Adsorption of DNA Origami Nanostructures in Nanohole Arrays}}}, doi = {{10.1021/acs.langmuir.8b00793}}, year = {{2018}}, } @techreport{2933, abstract = {{We establish axioms under which a bargaining solution can be found by the maximization of the CES function and is unique up to specification of the distribution and elasticity parameters. This solution is referred to as the CES solution which includes the NASH and egalitarian solutions as special cases. Next, we consider a normalization of the CES function and establish axioms, under which a bargaining solution can be found by the maximization of the normalized CES and is unique up to the specifications of the distribution and its substitution parameters. We refer to this solution as the normalized CES solution, which includes the Nash and Kalai-Smorodinsky solutions as special cases. Our paper contributes to bargaining theory by establishing unified characterizations of existing as well as a great variety of new bargaining solutions.}}, author = {{Haake, Claus-Jochen and Qin, Cheng-Zhong}}, keywords = {{Bargaining problem, CES Function, Normalized CES Function, Nash solution, Kalai-Smorodinsky Solution, Egalitarian Solution.}}, publisher = {{CIE Working Paper Series, Paderborn University}}, title = {{{On unification of solutions to the bargaining problem}}}, volume = {{113}}, year = {{2018}}, } @inproceedings{2965, author = {{Blömer, Johannes and Löken, Nils}}, booktitle = {{Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}}, isbn = {{978-1-4503-6448-5}}, location = {{Hamburg, Germany}}, pages = {{25:1----25:10}}, publisher = {{ACM}}, title = {{{Cloud Architectures for Searchable Encryption}}}, doi = {{10.1145/3230833.3230853}}, year = {{2018}}, }