@inproceedings{47245,
author = {{Stransky, Christian and Acar, Yasemin and Nguyen, Duc Cuong and Wermke, Dominik and Kim, Doowon and Redmiles, Elissa M. and Backes, Michael and Garfinkel, Simson L. and Mazurek, Michelle L. and Fahl, Sascha}},
booktitle = {{10th USENIX Workshop on Cyber Security Experimentation and Test, CSET 2017, Vancouver, BC, Canada, August 14, 2017}},
editor = {{Fernandez, José M. and Payer, Mathias}},
publisher = {{USENIX Association}},
title = {{{Lessons Learned from Using an Online Platform to Conduct Large-Scale, Online Controlled Security Experiments with Software Developers}}},
year = {{2017}},
}
@inproceedings{47243,
author = {{Fischer, Felix and Böttinger, Konstantin and Xiao, Huang and Stransky, Christian and Acar, Yasemin and Backes, Michael and Fahl, Sascha}},
booktitle = {{2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017}},
pages = {{121–136}},
publisher = {{IEEE Computer Society}},
title = {{{Stack Overflow Considered Harmful? The Impact of Copy&Paste on Android Application Security}}},
doi = {{10.1109/SP.2017.31}},
year = {{2017}},
}
@inproceedings{47250,
author = {{Nguyen, Duc Cuong and Wermke, Dominik and Acar, Yasemin and Backes, Michael and Weir, Charles and Fahl, Sascha}},
booktitle = {{Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security}},
publisher = {{ACM}},
title = {{{A Stitch in Time: Supporting Android Developers in Writing Secure Code}}},
doi = {{10.1145/3133956.3133977}},
year = {{2017}},
}
@inproceedings{47248,
author = {{Acar, Yasemin and Stransky, Christian and Wermke, Dominik and Weir, Charles and Mazurek, Michelle L. and Fahl, Sascha}},
booktitle = {{2017 IEEE Cybersecurity Development (SecDev)}},
publisher = {{IEEE}},
title = {{{Developers Need Support, Too: A Survey of Security Advice for Software Developers}}},
doi = {{10.1109/secdev.2017.17}},
year = {{2017}},
}
@inproceedings{47242,
author = {{Acar, Yasemin and Fahl, Sascha and Mazurek, Michelle L.}},
booktitle = {{2016 IEEE Cybersecurity Development (SecDev)}},
publisher = {{IEEE}},
title = {{{You are Not Your Developer, Either: A Research Agenda for Usable Security and Privacy Research Beyond End Users}}},
doi = {{10.1109/secdev.2016.013}},
year = {{2017}},
}
@inproceedings{47246,
author = {{Acar, Yasemin and Backes, Michael and Fahl, Sascha and Garfinkel, Simson and Kim, Doowon and Mazurek, Michelle L. and Stransky, Christian}},
booktitle = {{2017 IEEE Symposium on Security and Privacy (SP)}},
publisher = {{IEEE}},
title = {{{Comparing the Usability of Cryptographic APIs}}},
doi = {{10.1109/sp.2017.52}},
year = {{2017}},
}
@inproceedings{47244,
author = {{Acar, Yasemin and Stransky, Christian and Wermke, Dominik and Mazurek, Michelle L. and Fahl, Sascha}},
booktitle = {{Thirteenth Symposium on Usable Privacy and Security, SOUPS 2017, Santa Clara, CA, USA, July 12-14, 2017}},
pages = {{81–95}},
publisher = {{USENIX Association}},
title = {{{Security Developer Studies with GitHub Users: Exploring a Convenience Sample}}},
year = {{2017}},
}
@techreport{47873,
author = {{Redmiles, Elissa M. and Acar, Yasemin and Fahl, Sascha and Mazurek, Michelle L.}},
publisher = {{University of Maryland Computer Science Department}},
title = {{{A Summary of Survey Methodology Best Practices for Security and Privacy Researchers}}},
doi = {{10.13016/M22K2W}},
year = {{2017}},
}
@article{18,
abstract = {{Branch and bound (B&B) algorithms structure the search space as a tree and eliminate infeasible solutions early by pruning subtrees that cannot lead to a valid or optimal solution. Custom hardware designs significantly accelerate the execution of these algorithms. In this article, we demonstrate a high-performance B&B implementation on FPGAs. First, we identify general elements of B&B algorithms and describe their implementation as a finite state machine. Then, we introduce workers that autonomously cooperate using work stealing to allow parallel execution and full utilization of the target FPGA. Finally, we explore advantages of instance-specific designs that target a specific problem instance to improve performance.
We evaluate our concepts by applying them to a branch and bound problem, the reconstruction of corrupted AES keys obtained from cold-boot attacks. The evaluation shows that our work stealing approach is scalable with the available resources and provides speedups proportional to the number of workers. Instance-specific designs allow us to achieve an overall speedup of 47 × compared to the fastest implementation of AES key reconstruction so far. Finally, we demonstrate how instance-specific designs can be generated just-in-time such that the provided speedups outweigh the additional time required for design synthesis.}},
author = {{Riebler, Heinrich and Lass, Michael and Mittendorf, Robert and Löcke, Thomas and Plessl, Christian}},
issn = {{1936-7406}},
journal = {{ACM Transactions on Reconfigurable Technology and Systems (TRETS)}},
keywords = {{coldboot}},
number = {{3}},
pages = {{24:1--24:23}},
publisher = {{Association for Computing Machinery (ACM)}},
title = {{{Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs}}},
doi = {{10.1145/3053687}},
volume = {{10}},
year = {{2017}},
}
@inproceedings{1592,
abstract = {{Compared to classical HDL designs, generating FPGA with high-level synthesis from an OpenCL specification promises easier exploration of different design alternatives and, through ready-to-use infrastructure and common abstractions for host and memory interfaces, easier portability between different FPGA families. In this work, we evaluate the extent of this promise. To this end, we present a parameterized FDTD implementation for photonic microcavity simulations. Our design can trade-off different forms of parallelism and works for two independent OpenCL-based FPGA design flows. Hence, we can target FPGAs from different vendors and different FPGA families. We describe how we used pre-processor macros to achieve this flexibility and to work around different shortcomings of the current tools. Choosing the right design configurations, we are able to present two extremely competitive solutions for very different FPGA targets, reaching up to 172 GFLOPS sustained performance. With the portability and flexibility demonstrated, code developers not only avoid vendor lock-in, but can even make best use of real trade-offs between different architectures.}},
author = {{Kenter, Tobias and Förstner, Jens and Plessl, Christian}},
booktitle = {{Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}},
keywords = {{tet_topic_hpc}},
publisher = {{IEEE}},
title = {{{Flexible FPGA design for FDTD using OpenCL}}},
doi = {{10.23919/FPL.2017.8056844}},
year = {{2017}},
}
@article{1589,
author = {{Schumacher, Jörn and Plessl, Christian and Vandelli, Wainer}},
journal = {{Journal of Physics: Conference Series}},
publisher = {{IOP Publishing}},
title = {{{High-Throughput and Low-Latency Network Communication with NetIO}}},
doi = {{10.1088/1742-6596/898/8/082003}},
volume = {{898}},
year = {{2017}},
}
@techreport{20555,
author = {{Krüger, Stefan and Späth, Johannes and Ali, Karim and Bodden, Eric and Mezini, Mira}},
keywords = {{ITSECWEBSITE}},
title = {{{CrySL: Validating Correct Usage of Cryptographic APIs}}},
year = {{2017}},
}
@inbook{57234,
author = {{Meise, Bianca and Schloots, Franziska Margarete and Müller-Lietzkow, Jörg and Meister, Dorothee M.}},
booktitle = {{Interdisziplinäre Perspektiven zur Zukunft der Wertschöpfung}},
isbn = {{9783658202644}},
publisher = {{Springer Fachmedien Wiesbaden}},
title = {{{Interdisziplinäres Projektmanagement – Strategische Handlungsempfehlungen für Kooperationsverbünde in akademischen Kontexten}}},
doi = {{10.1007/978-3-658-20265-1_18}},
year = {{2017}},
}
@inproceedings{25069,
author = {{Adelt, Peer and Koppelmann, Bastian and Müller, Wolfgang and Kleinjohann, Bernd and Scheytt, J. Christoph}},
booktitle = {{Design Automation and Testing in Europe (DATE)}},
location = {{Lausanne, CH, Mrz. 2017}},
title = {{{ANALISA - A Tool for Static Instruction Set Analysis}}},
year = {{2017}},
}
@article{60399,
abstract = {{A variety of techniques were proposed to model smooth surfaces based on tensor product splines (e.g. subdivision surfaces, free-form splines, T-splines). Conversion of an input surface into such a representation is commonly achieved by constructing a global seamless parametrization, possibly aligned to a guiding cross-field (e.g. of principal curvature directions), and using this parametrization as domain to construct the spline-based surface.
One major fundamental difficulty in designing robust algorithms for this task is the fact that for common types, e.g. subdivision surfaces (requiring a conforming domain mesh) or T-spline surfaces (requiring a globally consistent knot interval assignment) reliably obtaining a suitable parametrization that has the same topological structure as the guiding field poses a major challenge. Even worse, not all fields do admit suitable parametrizations, and no concise conditions are known as to which fields do.
We present a class of surface constructions (T-splines with
halfedge knots
) and a class of parametrizations (
seamless similarity maps
) that are, in a sense, a perfect match for the task: for
any
given guiding field structure, a compatible parametrization of this kind exists and a smooth piecewise rational surface with exactly the same structure as the input field can be constructed from it. As a byproduct, this enables full control over extraordinary points. The construction is backward compatible with classical NURBS. We present efficient algorithms for building discrete conformal similarity maps and associated T-meshes and T-spline surfaces.
}},
author = {{Campen, Marcel and Zorin, Denis}},
issn = {{0730-0301}},
journal = {{ACM Transactions on Graphics}},
number = {{4}},
pages = {{1--16}},
publisher = {{Association for Computing Machinery (ACM)}},
title = {{{Similarity maps and field-guided T-splines}}},
doi = {{10.1145/3072959.3073647}},
volume = {{36}},
year = {{2017}},
}
@article{60398,
abstract = {{AbstractThe efficient and practical representation and processing of geometrically or topologically complex shapes often demands a partitioning into simpler patches. Possibilities range from unstructured arrangements of arbitrarily shaped patches on the one end, to highly structured conforming networks of all‐quadrilateral patches on the other end of the spectrum. Due to its regularity, this latter extreme of conforming partitions with quadrilateral patches, called quad layouts, is most beneficial in many application scenarios, for instance enabling the use of tensor‐product representations based on splines or Bézier patches, grid‐based multi‐resolution techniques and discrete pixel‐based map representations. However, this type of partition is also most complicated to create due to the strict inherent structural restrictions. Traditionally often performed manually in a tedious and demanding process, research in computer graphics and geometry processing has led to a number of computer‐assisted, semi‐automatic, as well as fully automatic approaches to address this problem more efficiently. This survey provides a detailed discussion of this range of methods, treats their strengths and weaknesses and outlines open problems in this field of research.}},
author = {{Campen, Marcel}},
issn = {{0167-7055}},
journal = {{Computer Graphics Forum}},
number = {{8}},
pages = {{567--588}},
publisher = {{Wiley}},
title = {{{Partitioning Surfaces Into Quadrilateral Patches: A Survey}}},
doi = {{10.1111/cgf.13153}},
volume = {{36}},
year = {{2017}},
}
@unpublished{60406,
abstract = {{An algorithm for the computation of global discrete conformal
parametrizations with prescribed global holonomy signatures for triangle meshes
was recently described in [Campen and Zorin 2017]. In this paper we provide a
detailed analysis of convergence and correctness of this algorithm. We
generalize and extend ideas of [Springborn et al. 2008] to show a connection of
the algorithm to Newton's algorithm applied to solving the system of
constraints on angles in the parametric domain, and demonstrate that this
system can be obtained as a gradient of a convex energy.}},
author = {{Campen, Marcel and Zorin, Denis}},
booktitle = {{arXiv:1705.02422}},
title = {{{On Discrete Conformal Seamless Similarity Maps}}},
year = {{2017}},
}
@article{60397,
author = {{Campen, Marcel}},
issn = {{0272-1716}},
journal = {{IEEE Computer Graphics and Applications}},
number = {{3}},
pages = {{88--95}},
publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}},
title = {{{Tiling the Bunny: Quad Layouts for Efficient 3D Geometry Representation}}},
doi = {{10.1109/mcg.2017.35}},
volume = {{37}},
year = {{2017}},
}
@inproceedings{25070,
abstract = {{In the Image Processing domain, automated generation of complex Image Processing functionality is highly desirable; e.g., for rapid prototyping. Service composition techniques, in turn, facilitate automated generation of complex functionality based on building blocks in terms of services. For that reason, we aim for transferring the Service Composition paradigm into the Image Processing domain. In this paper, we present our symbolic composition approach that enables us to automatically generate Image Processing applications. Functionality of Image Processing services is described by means of a variant of first-order logic, which grounds on domain knowledge operationalized in terms of ontologies. A Petri-net formalism serves as basis for modeling data-flow of services and composed services. A planning-based composition algorithm automatically composes complex data-flow for a required functionality. A brief evaluation serves as proof of concept.}},
author = {{Jungmann, Alexander and Kleinjohann, Bernd}},
booktitle = {{Proceedings of the 13th IEEE International Conference on Services Computing (SCC)}},
pages = {{106--113}},
publisher = {{IEEE Computer Society}},
title = {{{Automatic Composition of Service-based Image Processing Applications}}},
year = {{2016}},
}
@phdthesis{195,
author = {{Platenius, Marie Christin}},
publisher = {{Universität Paderborn}},
title = {{{Fuzzy Matching of Comprehensive Service Specifications}}},
year = {{2016}},
}