@misc{18006, author = {{Sundermeier, Jannik}}, publisher = {{Universität Paderborn}}, title = {{{Implementierung eines selbststabilisierenden verteilten Stacks}}}, year = {{2015}}, } @misc{18024, author = {{Knollmann, Till}}, publisher = {{Universität Paderborn}}, title = {{{Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix}}}, year = {{2015}}, } @article{228, abstract = {{We investigate the pervasiveness of lying in professional contexts such as insurance fraud, tax evasion and untrue job applications. We argue that lying in professional contexts share three characterizing features: (1) the gain from the dishonest behavior is uncertain, (2) the harm that lying may cause to the other party is only indirect and (3) lies are more indirect lies by action or written statements. Conducted as a field experiment with a heterogenous group of participants during a University ‘‘Open House Day’’, our ‘‘gumball-machineexperiment’’ provides field evidence on how preferences for lying are shaped in situations typically found in professional contexts which we consider to be particularly prone to lying behavior compared to other contexts. As a key innovation, our experimental design allows measuring exact levels of cheating behavior under anonymous conditions. We find clean evidence that cheating is prevalent across all sub groups and that more than 32% of the population cheats for their own gain. However, an analysis of the cheating rates with respect to highest educational degree and professional status reveals that students cheat more than non-students. This finding warrants a careful interpretation of generalizing laboratory findings with student subjects about the prevalence of cheating in the population.}}, author = {{Fahr, Rene and Mir Djawadi, Behnud}}, journal = {{Journal of Economic Psychology}}, pages = {{48--59}}, publisher = {{Elsevier}}, title = {{{“…and they are really lying”: Clean Evidence on the Pervasiveness of Cheating in Professional Contexts from a Field Experiment.}}}, doi = {{10.1016/j.joep.2015.03.002}}, year = {{2015}}, } @misc{229, author = {{Schulz, Hannah}}, publisher = {{Universität Paderborn}}, title = {{{Zur Verbreitung von Informationen in sozialen Netzwerken - eine wirtschaftspolitische Analyse}}}, year = {{2015}}, } @inproceedings{230, abstract = {{Cognitive fit theory (CFT) provides guidance for how best to represent information that is relevant for solving a given problem. CFT is widely established in information systems research and its validity has been demonstrated in a great variety of contexts. However, of the two major types of problems that exist (i.e., routine and creative problems) prior CFT research has addressed only one: routine problems. Creative problems, despite their importance, have been left unaddressed. Therefore, based on the visual sketching model of problem solving, we propose an extension of CFT and thereby demonstrate that cognitive fit can promote problem solving performance also for creative problems. In doing so, we extend the boundary of CFT and add to creativity research a previously unknown cognitive mechanism for promoting creative performance: cognitive fit. Moreover, we contribute to general problem solving research by bridging the gap between problem solving in creativity and information systems research.}}, author = {{John, Thomas and Kundisch, Dennis}}, booktitle = {{Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth, USA}}, location = {{Fort Worth, USA}}, title = {{{Why Fit Leads to Surprise: An Extension of Cognitive Fit Theory to Creative Problems}}}, year = {{2015}}, } @inproceedings{231, abstract = {{Existing approaches towards service composition demand requirements of the customers in terms of service templates, service query profiles, or partial process models. However, addressed non-expert customers may be unable to fill-in the slots of service templates as requested or to describe, for example, pre- and postconditions, or even have difficulties in formalizing their requirements. Thus, our idea is to provide non-experts with suggestions how to complete or clarify their requirement descriptions written in natural language. Two main issues have to be tackled: (1) partial or full inability (incapacity) of non-experts to specify their requirements correctly in formal and precise ways, and (2) problems in text analysis due to fuzziness in natural language. We present ideas how to face these challenges by means of requirement disambiguation and completion. Therefore, we conduct ontology-based requirement extraction and similarity retrieval based on requirement descriptions that are gathered from App marketplaces. The innovative aspect of our work is that we support users without expert knowledge in writing their requirements by simultaneously resolving ambiguity, vagueness, and underspecification in natural language.}}, author = {{Geierhos, Michaela and Schulze, Sabine and Bäumer, Frederik Simon}}, booktitle = {{Proceedings of the 7th International Conference on Agents and Artificial Intelligence (ICAART), Special Session on Partiality, Underspecification, and Natural Language Processing (PUaNLP 2015)}}, editor = {{Loiseau, Stephane and Filipe, Joaquim and Duval, Béatrice and van den Herik, Jaap}}, isbn = {{ 978-989-758-073-4}}, pages = {{277--283}}, publisher = {{SciTePress - Science and Technology Publications}}, title = {{{What did you mean? Facing the Challenges of User-generated Software Requirements}}}, doi = {{10.5220/0005346002770283}}, year = {{2015}}, } @inproceedings{232, abstract = {{We introduce weighted boolean formula games (WBFG) as a new class of succinct games. Each player has a set of boolean formulas she wants to get satisfied; the formulas involve a ground set of boolean variables each of which is controlled by some player. The payoff of a player is a weighted sum of the values of her formulas. We consider both pure equilibria and their refinement of payoff-dominant equilibria [34], where every player is no worse-off than in any other pure equilibrium. We present both structural and complexity results:We consider mutual weighted boolean formula games (MWBFG), a subclass of WBFG making a natural mutuality assumption on the formulas of players. We present a very simple exact potential for MWBFG. We establish a polynomial monomorphism from certain classes of weighted congestion games to subclasses of WBFG and MWBFG, respectively, indicating their rich structure.We present a collection of complexity results about decision (and search) problems for both pure and payoff-dominant equilibria in WBFG. The precise complexities depend crucially on five parameters: (i) the number of players; (ii) the number of variables per player; (iii) the number of formulas per player; (iv) the weights in the payoff functions (whether identical or not), and (v) the syntax of the formulas. These results imply that, unless the polynomial hierarchy collapses, decision (and search) problems for payoff-dominant equilibria are harde than for pure equilibria.}}, author = {{Monien, Burkhard and Mavronicolas, Marios and Wagner, Klaus}}, booktitle = {{the ´Festschrift´ Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday}}, pages = {{49--86}}, title = {{{Weighted Boolean Formula Games}}}, doi = {{10.1007/978-3-319-24024-4_6}}, year = {{2015}}, } @techreport{233, abstract = {{Motivated by the deterministic single exponential time algorithm of Micciancio and Voulgaris for solving the shortest and closest vector problem for the Euclidean norm, we study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms.On the positive side, we show that for strictly convex and smooth norms the geometry of Voronoi cells of lattices in any dimension is similar to the Euclidean case, i.e., the Voronoi cells are defined by the so-called Voronoi-relevant vectors and the facets of a Voronoi cell are in one-to-one correspondence with these vectors. On the negative side, we show that combinatorially Voronoi cells for arbitrary strictly convex and smooth norms are much more complicated than in the Euclidean case.In particular, we construct a family of three-dimensional lattices whose number of Voronoi-relevant vectors with respect to the l_3-norm is unbounded.Since the algorithm of Micciancio and Voulgaris and its run time analysis crucially dependonthefactthatfortheEuclidean normthenumber of Voronoi-relevant vectors is single exponential in the lattice dimension, this indicates that the techniques of Micciancio and Voulgaris cannot be extended to achieve deterministic single exponential time algorithms for lattice problems with respect to arbitrary l_p-norms.}}, author = {{Blömer, Johannes and Kohn, Kathlén}}, publisher = {{Universität Paderborn}}, title = {{{Voronoi Cells of Lattices with Respect to Arbitrary Norms}}}, year = {{2015}}, } @misc{5930, author = {{Mikroökonomie, Lehrstuhl}}, publisher = {{Universität Paderborn}}, title = {{{Bilateral matching and bargaining games}}}, year = {{2015}}, } @article{4792, author = {{Senge, Robin and Hüllermeier, Eyke}}, issn = {{1063-6706}}, journal = {{IEEE Transactions on Fuzzy Systems}}, number = {{6}}, pages = {{2024--2033}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Fast Fuzzy Pattern Tree Learning for Classification}}}, doi = {{10.1109/tfuzz.2015.2396078}}, volume = {{23}}, year = {{2015}}, } @article{491, abstract = {{In the framework of spatial competition, two or more players strategically choose a locationin order to attract consumers. It is assumed standardly that consumers with the same favorite location fully agree on the ranking of all possible locations. To investigate the necessity of this questionable and restrictive assumption, we model heterogeneity in consumers’ distance perceptions by individual edge lengths of a given graph. A profile of location choices is called a “robust equilibrium” if it is a Nash equilibrium in several games which differ only by the consumers’ perceptions of distances. For a finite number of players and any distribution of consumers, we provide a full characterization of all robust equilibria and derive structural conditions for their existence. Furthermore, we discuss whether the classical observations of minimal differentiation and inefficiency are robust phenomena. Thereby, we find strong support for an old conjecture that in equilibrium firms form local clusters.}}, author = {{Buechel, Berno and Röhl, Nils}}, journal = {{European Journal of Operational Research}}, number = {{2}}, pages = {{505--517}}, publisher = {{Elsevier}}, title = {{{Robust Equilibria in Location Games}}}, doi = {{10.1016/j.ejor.2014.07.019}}, volume = {{240}}, year = {{2015}}, } @inproceedings{743, author = {{Schwabe, Arne and Karl, Holger}}, booktitle = {{2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015}}, pages = {{6122----6127}}, title = {{{Topology model to generate realistic latency for simulations}}}, doi = {{10.1109/ICC.2015.7249298}}, year = {{2015}}, } @inproceedings{986, abstract = {{The increasing amount of mobile traffic leads to a significantly higher energy consumption of mobile networks that is mainly caused by the high number of required base stations. One recent solution for this is based on a two-layered network that uses long-range macro cells to provide a full coverage signaling overlay and short-range small cells for fast data transmissions. These small cells can be switched off when they are not needed and allow network-wide energy optimizations. This paper presents an architecture that extends existing mobile networks to integrate a small cell layer that supports on-demand cell activation. We discuss how additional small cells can be interconnected with existing core components and how they can be controlled by a resource management component. Finally, a Wi-Fi based proof of concept testbed implementation is presented that demonstrates the feasibility of the approach.}}, author = {{Peuster, Manuel and Karl, Holger}}, booktitle = {{Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges}}, location = {{London}}, title = {{{An Architecture for Energy-aware On-demand Mobile Network Management}}}, year = {{2015}}, } @article{398, abstract = {{We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer players where mixed equilibria always exist (Nash 1950; Nash Ann. Math. 54, 286–295, 1951), a mixed equilibrium for such games, called a V-equilibrium, may fail to exist, even though pure equilibria (if any) transfer over. What is the exact impact of such valuations on the existence, structure and complexity of mixed equilibria? We address this fundamental question in the context of expectation plus variance, a particular concave valuation denoted as RA, which stands for risk-averse; so, variance enters as a measure of risk and it is used as an additive adjustment to expectation. We obtain the following results about RA-equilibria:A collection of general structural properties of RA-equilibria connecting to (i) E-equilibria and Var-equilibria, which correspond to the expectation and variance valuations E and Var, respectively, and to (ii) other weaker or incomparable properties such as Weak Equilibrium and Strong Equilibrium. Some of these structural properties imply quantitative constraints on the existence of mixed RA-equilibria.A second collection of (i) existence, (ii) equivalence and separation (with respect to E-equilibria), and (iii) characterization results for RA-equilibria in the new class of player-specific scheduling games. We provide suitable examples with a mixed RA-equilibrium that is not an E-equilibrium and vice versa.A purification technique to transform a player-specific scheduling game on two identical links into a player-specific scheduling game on two links so that all non-pure RA-equilibria are eliminated while no new pure equilibria are created; so, a particular player-specific scheduling game on two identical links with no pure equilibrium yields a player-specific scheduling game with no RA-equilibrium (whether mixed or pure). As a by-product, the first PLS-completeness result for the computation of RA-equilibria follows.}}, author = {{Monien, Burkhard and Mavronicolas, Marios}}, journal = {{Theory of Computing Systems}}, number = {{3}}, pages = {{617--654}}, publisher = {{Springer}}, title = {{{Minimizing Expectation Plus Variance}}}, doi = {{10.1007/s00224-014-9542-z}}, volume = {{57}}, year = {{2015}}, } @misc{5090, author = {{Streck, Thomas}}, publisher = {{Universität Paderborn}}, title = {{{Praktikabilität des Adjusted Winner Verfahrens bei variablem Status Quo- Punkt und exogenen Einflüssen}}}, year = {{2015}}, } @inproceedings{5207, author = {{Li, Li and Bartel, Alexandre and Bissyande, Tegawende F. and Klein, Jacques and Le Traon, Yves and Arzt, Steven and Rasthofer, Siegfried and Bodden, Eric and Octeau, Damien and McDaniel, Patrick}}, booktitle = {{2015 International Conference on Software Engineering (ICSE)}}, isbn = {{978-1-4799-1934-5}}, keywords = {{CROSSING, ATTRACT, ITSECWEBSITE}}, pages = {{280--291}}, title = {{{IccTA: Detecting Inter-Component Privacy Leaks in Android Apps}}}, year = {{2015}}, } @misc{5413, author = {{Funke, Lukas}}, publisher = {{Universität Paderborn}}, title = {{{An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing Applications using FPGA Overlay Architectures}}}, year = {{2015}}, } @misc{5416, author = {{Löcke, Thomas}}, publisher = {{Universität Paderborn}}, title = {{{Instance-Specific Computing in Hard- and Software for Faster Solving of Complex Problems}}}, year = {{2015}}, } @misc{5419, author = {{Wallaschek, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Accelerating Programmable Logic Controllers with the use of FPGAs}}}, year = {{2015}}, } @misc{694, author = {{Stilow, Georg}}, publisher = {{Universität Paderborn}}, title = {{{Mobile Agenten in Netzwerken: Analyse von Hotspots}}}, year = {{2015}}, }