@article{3551,
  author       = {{König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}},
  journal      = {{Journal of Combinatorial Optimization}},
  number       = {{4}},
  pages        = {{1356--1379}},
  title        = {{{Scheduling with interjob communication on parallel processors}}},
  doi          = {{10.1007/s10878-018-0325-3}},
  volume       = {{36}},
  year         = {{2018}},
}

@inproceedings{3552,
  author       = {{Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}},
  booktitle    = {{Proceedings of the Symposium on Intelligent Data Analysis}},
  location     = {{‘s-Hertogenbosch, the Netherlands}},
  title        = {{{Reduction Stumps for Multi-Class Classification}}},
  doi          = {{10.1007/978-3-030-01768-2_19}},
  year         = {{2018}},
}

@unpublished{3586,
  abstract     = {{Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments.}},
  author       = {{Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco}},
  booktitle    = {{Third Workshop on Approximate Computing (AxC 2018)}},
  keywords     = {{Approximate Computing, Framework, Pareto Front, Accuracy}},
  pages        = {{6}},
  title        = {{{CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}}},
  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}},
}

@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}},
}

@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}},
}

@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}},
}

@inbook{3098,
  abstract     = {{One of the fundamental problems in applications of methods and results
from mechanism design and implementation theory is the effective enforcement of
theoretically established equilibria by which social choice rules are implemented.
Hurwicz (2008) and Myerson (2009) introduce different concepts of formalizing
enforcement of institutional rules via the introduction of legal and illegal games. In
this note the relation of their concepts with that of a social system defined inDebreu
(1952) is analyzed and its potential of being instrumental for modelling institution
design is discussed. The existence proof for such a system, also known as generalized
game or abstract economy had been the basis for the existence proof of a
competitive equilibrium of an economy.}},
  author       = {{Trockel, Walter and Haake, Claus-Jochen}},
  booktitle    = {{Studies in Economic Design}},
  editor       = {{Laslier, Jean-Francois and Moulin, Herve and Sanver, Remzi and Zwicker, William}},
  issn         = {{2510-3970}},
  publisher    = {{Springer}},
  title        = {{{Thoughts on Social Design}}},
  volume       = {{(n.d.)}},
  year         = {{2018}},
}

@article{3152,
  abstract     = {{To adapt to continuously changing workloads in networks, components of the running network services may need to be replicated (scaling the network service) and allocated to physical resources (placement) dynamically, also necessitating dynamic re-routing of flows between service components. In this paper, we propose JASPER, a fully automated approach to jointly optimizing scaling, placement, and routing for complex network services, consisting of multiple (virtualized) components. JASPER handles multiple network services that share the same substrate network; services can be dynamically added or removed and dynamic workload changes are handled. Our approach lets service designers specify their services on a high level of abstraction using service templates. JASPER automatically makes scaling, placement and routing decisions, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability and effectiveness of the proposed approach.}},
  author       = {{Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}},
  journal      = {{IEEE Transactions on Network and Service Management}},
  publisher    = {{IEEE}},
  title        = {{{JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}}},
  doi          = {{10.1109/TNSM.2018.2846572}},
  year         = {{2018}},
}

@unpublished{2711,
  abstract     = {{In recent years, researchers have developed a number of tools to conduct
taint analysis of Android applications. While all the respective papers aim at
providing a thorough empirical evaluation, comparability is hindered by varying
or unclear evaluation targets. Sometimes, the apps used for evaluation are not
precisely described. In other cases, authors use an established benchmark but
cover it only partially. In yet other cases, the evaluations differ in terms of
the data leaks searched for, or lack a ground truth to compare against. All
those limitations make it impossible to truly compare the tools based on those
published evaluations.
  We thus present ReproDroid, a framework allowing the accurate comparison of
Android taint analysis tools. ReproDroid supports researchers in inferring the
ground truth for data leaks in apps, in automatically applying tools to
benchmarks, and in evaluating the obtained results. We use ReproDroid to
comparatively evaluate on equal grounds the six prominent taint analysis tools
Amandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are
largely positive although four tools violate some promises concerning features
and accuracy. Finally, we contribute to the area of unbiased benchmarking with
a new and improved version of the open test suite DroidBench.}},
  author       = {{Pauck, Felix and Bodden, Eric and Wehrheim, Heike}},
  booktitle    = {{arXiv:1804.02903}},
  title        = {{{Do Android Taint Analysis Tools Keep their Promises?}}},
  year         = {{2018}},
}

@phdthesis{2712,
  author       = {{Schlangenotto, Darius}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer}}},
  doi          = {{10.17619/UNIPB/1-312}},
  year         = {{2018}},
}

@phdthesis{1138,
  author       = {{Gmyr, Robert}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Distributed Algorithms for Overlay Networks and Programmable Matter}}},
  doi          = {{10.17619/UNIPB/1-265}},
  year         = {{2018}},
}

@inproceedings{1163,
  abstract     = {{In this paper we present two major results:
First, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.
Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.
That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.
}},
  author       = {{Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}},
  booktitle    = {{Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}},
  keywords     = {{Topological Self-stabilization, Supervised Overlay, Publish-Subscribe System}},
  location     = {{Vancouver}},
  publisher    = {{IEEE}},
  title        = {{{Self-Stabilizing Supervised Publish-Subscribe Systems}}},
  doi          = {{10.1109/IPDPS.2018.00114}},
  year         = {{2018}},
}

@inproceedings{1164,
  abstract     = {{We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.
Skueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.
Furthermore Skueue satisfies sequential consistency in the asynchronous message passing model.
Scalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.
Operations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests.}},
  author       = {{Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}},
  booktitle    = {{Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}},
  location     = {{Vancouver}},
  publisher    = {{IEEE}},
  title        = {{{Skueue: A Scalable and Sequentially Consistent Distributed Queue}}},
  doi          = {{10.1109/IPDPS.2018.00113}},
  year         = {{2018}},
}

@unpublished{1165,
  author       = {{Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}},
  booktitle    = {{4th Workshop On Approximate Computing (WAPCO 2018)}},
  title        = {{{Making the Case for Proof-carrying Approximate Circuits}}},
  year         = {{2018}},
}

@inproceedings{2109,
  abstract     = {{In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance.}},
  author       = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}},
  keywords     = {{Classification, Hierarchical Decomposition, Indirect Encoding}},
  location     = {{Kyoto, Japan}},
  publisher    = {{ACM}},
  title        = {{{Ensembles of Evolved Nested Dichotomies for Classification}}},
  doi          = {{10.1145/3205455.3205562}},
  year         = {{2018}},
}

@unpublished{17713,
  author       = {{Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}},
  publisher    = {{Arxiv}},
  title        = {{{Automated Multi-Label Classification based on ML-Plan}}},
  year         = {{2018}},
}

@unpublished{17714,
  author       = {{Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}},
  title        = {{{Automated machine learning service composition}}},
  year         = {{2018}},
}