@phdthesis{154, author = {{Cord-Landwehr, Andreas}}, isbn = {{978-3-942647-72-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Selfish Network Creation - On Variants of Network Creation Games}}}, volume = {{353}}, year = {{2016}}, } @inproceedings{15400, author = {{Labreuche, C. and Hüllermeier, Eyke and Vojtas, P. and Fallah Tehrani, A.}}, booktitle = {{in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{On the identifiability of models in multi-criteria preference learning}}}, year = {{2016}}, } @inproceedings{15401, author = {{Schäfer, D. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{Preference -based reinforcement learning using dyad ranking}}}, year = {{2016}}, } @inproceedings{15402, author = {{Couso, Ines and Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}}, booktitle = {{in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators}}}, year = {{2016}}, } @inproceedings{15403, author = {{Lu, S. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany}}, editor = {{Hüllermeier, Eyke and Hoffmann, F. and Mikut, R.}}, pages = {{1--8}}, publisher = {{KIT Scientific Publishing}}, title = {{{Support vector classification on noisy data using fuzzy superset losses}}}, year = {{2016}}, } @inproceedings{15404, author = {{Schäfer, D. and Hüllermeier, Eyke}}, booktitle = {{in Workshop LWDA "Lernen, Wissen, Daten, Analysen" Potsdam, Germany}}, title = {{{Plackett-Luce networks for dyad ranking}}}, year = {{2016}}, } @inproceedings{15435, author = {{Domik, Gitta}}, booktitle = {{Pedagogy Data Visualization, IEEE VIS Workshop}}, title = {{{A data visualization course at the university of paderborn}}}, year = {{2016}}, } @inproceedings{155, abstract = {{We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.}}, author = {{Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}}, booktitle = {{Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{248----262}}, title = {{{Self-stabilizing Metric Graphs}}}, doi = {{10.1007/978-3-319-49259-9_20}}, year = {{2016}}, } @inproceedings{157, abstract = {{Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.}}, author = {{König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{563----577}}, title = {{{Scheduling with Interjob Communication on Parallel Processors}}}, doi = {{10.1007/978-3-319-48749-6_41}}, year = {{2016}}, } @article{15731, author = {{Thonig, Danny and Rauch, Tomáš and Mirhosseini, Hossein and Henk, Jürgen and Mertig, Ingrid and Wortelen, Henry and Engelkamp, Bernd and Schmidt, Anke B. and Donath, Markus}}, issn = {{2469-9950}}, journal = {{Physical Review B}}, title = {{{Existence of topological nontrivial surface states in strained transition metals: W, Ta, Mo, and Nb}}}, doi = {{10.1103/physrevb.94.155132}}, year = {{2016}}, } @article{15732, author = {{Mirhosseini, Hossein and Kiss, Janos and Roma, Guido and Felser, Claudia}}, issn = {{0040-6090}}, journal = {{Thin Solid Films}}, pages = {{143--147}}, title = {{{Reducing the Schottky barrier height at the MoSe2/Mo(110) interface in thin-film solar cells: Insights from first-principles calculations}}}, doi = {{10.1016/j.tsf.2016.03.053}}, year = {{2016}}, } @article{15733, author = {{Miyamoto, K. and Wortelen, H. and Mirhosseini, Hossein and Okuda, T. and Kimura, A. and Iwasawa, H. and Shimada, K. and Henk, J. and Donath, M.}}, issn = {{2469-9950}}, journal = {{Physical Review B}}, title = {{{Orbital-symmetry-selective spin characterization of Dirac-cone-like state on W(110)}}}, doi = {{10.1103/physrevb.93.161403}}, year = {{2016}}, } @article{15734, author = {{Ghorbani, Elaheh and Kiss, Janos and Mirhosseini, Hossein and Schmidt, Markus and Windeln, Johannes and Kühne, Thomas and Felser, Claudia}}, issn = {{1932-7447}}, journal = {{The Journal of Physical Chemistry C}}, pages = {{2064--2069}}, title = {{{Insights into Intrinsic Defects and the Incorporation of Na and K in the Cu2ZnSnSe4 Thin-Film Solar Cell Material from Hybrid-Functional Calculations}}}, doi = {{10.1021/acs.jpcc.5b11022}}, year = {{2016}}, } @inproceedings{158, abstract = {{While requirements focus on how the user interacts with the system, user stories concentrate on the purpose of software features. But in practice, functional requirements are also described in user stories. For this reason, requirements clarification is needed, especially when they are written in natural language and do not stick to any templates (e.g., "as an X, I want Y so that Z ..."). However, there is a lot of implicit knowledge that is not expressed in words. As a result, natural language requirements descriptions may suffer from incompleteness. Existing approaches try to formalize natural language or focus only on entirely missing and not on deficient requirements. In this paper, we therefore present an approach to detect knowledge gaps in user-generated software requirements for interactive requirement clarification: We provide tailored suggestions to the users in order to get more precise descriptions. For this purpose, we identify not fully instantiated predicate argument structures in requirements written in natural language and use context information to realize what was meant by the user.}}, author = {{Bäumer, Frederik Simon and Geierhos, Michaela}}, booktitle = {{Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST)}}, editor = {{Dregvaite, Giedre and Damasevicius, Robertas }}, isbn = {{978-3-319-46253-0}}, keywords = {{Natural language requirements clarification, Syntactically incomplete requirements, Compensatory user stories}}, location = {{Druskininkai, Lithuania}}, pages = {{549--558}}, publisher = {{Springer}}, title = {{{Running out of Words: How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions}}}, doi = {{10.1007/978-3-319-46254-7_44}}, volume = {{639}}, year = {{2016}}, } @inproceedings{15873, author = {{Boschmann, Alexander and Agne, Andreas and Witschen, Linus Matthias and Thombansen, Georg and Kraus, Florian and Platzner, Marco}}, booktitle = {{2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)}}, isbn = {{9781467394062}}, keywords = {{Electromyography, Feature extraction, Delays, Hardware Pattern recognition, Prosthetics, High definition video}}, location = {{Mexiko City, Mexiko}}, publisher = {{IEEE}}, title = {{{FPGA-based acceleration of high density myoelectric signal processing}}}, doi = {{10.1109/reconfig.2015.7393312}}, year = {{2016}}, } @article{15879, author = {{Ghasemzadeh Mohammadi, Hassan and Gaillardon, Pierre-Emmanuel and Zhang, Jian and Micheli, Giovanni De and Sanchez, Ernesto and Reorda, Matteo Sonza}}, issn = {{1550-4832}}, journal = {{ACM Journal on Emerging Technologies in Computing Systems}}, pages = {{1--13}}, title = {{{A Fault-Tolerant Ripple-Carry Adder with Controllable-Polarity Transistors}}}, doi = {{10.1145/2988234}}, year = {{2016}}, } @inproceedings{15896, author = {{Somorovsky, Juraj}}, booktitle = {{Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16}}, isbn = {{9781450341394}}, title = {{{Systematic Fuzzing and Testing of TLS Libraries}}}, doi = {{10.1145/2976749.2978411}}, year = {{2016}}, } @article{159, abstract = {{Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived.}}, author = {{Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}}, journal = {{IEEE/ACM Transactions on Networking}}, number = {{4}}, pages = {{2553 -- 2562}}, publisher = {{IEEE}}, title = {{{Routing Games With Progressive Filling}}}, doi = {{10.1109/TNET.2015.2468571}}, year = {{2016}}, } @inproceedings{15907, author = {{Aviram, Nimrod and Schinzel, Sebastian and Somorovsky, Juraj and Heninger, Nadia and Dankel, Maik and Steube, Jens and Valenta, Luke and Adrian, David and Halderman, J. Alex and Dukhovni, Viktor and Käsper, Emilia and Cohney, Shaanan and Engels, Susanne and Paar, Christof and Shavitt, Yuval}}, booktitle = {{25th {USENIX} Security Symposium ({USENIX} Security 16)}}, isbn = {{978-1-931971-32-4}}, pages = {{689--706}}, publisher = {{{USENIX} Association}}, title = {{{DROWN: Breaking TLS Using SSLv2}}}, year = {{2016}}, } @inproceedings{15913, author = {{Böck, Hanno and Zauner, Aaron and Devlin, Sean and Somorovsky, Juraj and Jovanovic, Philipp}}, booktitle = {{10th {USENIX} Workshop on Offensive Technologies ({WOOT} 16)}}, publisher = {{{USENIX} Association}}, title = {{{Nonce-Disrespecting Adversaries: Practical Forgery Attacks on GCM in TLS}}}, year = {{2016}}, }