@inproceedings{47312, author = {{Neil, Lorenzo and Sri Ramulu, Harshini and Acar, Yasemin and Reaves, Bradley}}, booktitle = {{Nineteenth Symposium on Usable Privacy and Security, SOUPS 2023, Anaheim, CA, USA, August 5-7, 2023}}, pages = {{283–299}}, publisher = {{USENIX Association}}, title = {{{Who Comes Up with this Stuff? Interviewing Authors to Understand How They Produce Security Advice}}}, year = {{2023}}, } @article{47291, author = {{Klemmer, Jan H. and Gutfleisch, Marco and Stransky, Christian and Acar, Yasemin and Sasse, M. Angela and Fahl, Sascha}}, journal = {{CoRR}}, title = {{{"Make Them Change it Every Week!": A Qualitative Exploration of Online Developer Advice on Usable and Secure Authentication}}}, doi = {{10.48550/arXiv.2309.00744}}, volume = {{abs/2309.00744}}, year = {{2023}}, } @inproceedings{53362, author = {{Amft, Sabrina and Höltervennhoff, Sandra and Huaman, Nicolas and Krause, Alexander and Simko, Lucy and Acar, Yasemin and Fahl, Sascha}}, booktitle = {{Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, Copenhagen, Denmark, November 26-30, 2023}}, editor = {{Meng, Weizhi and Jensen, Christian Damsgaard and Cremers, Cas and Kirda, Engin}}, pages = {{3138–3152}}, publisher = {{ACM}}, title = {{{"We’ve Disabled MFA for You": An Evaluation of the Security and Usability of Multi-Factor Authentication Recovery Deployments}}}, doi = {{10.1145/3576915.3623180}}, year = {{2023}}, } @inproceedings{49438, author = {{Krüger, Stefan and Reif, Michael and Wickert, Anna-Katharina and Nadi, Sarah and Ali, Karim and Bodden, Eric and Acar, Yasemin and Mezini, Mira and Fahl, Sascha}}, booktitle = {{2023 IEEE Secure Development Conference (SecDev)}}, publisher = {{IEEE}}, title = {{{Securing Your Crypto-API Usage Through Tool Support - A Usability Study}}}, doi = {{10.1109/secdev56634.2023.00015}}, year = {{2023}}, } @article{53368, author = {{Fourné, Marcel and Wermke, Dominik and Fahl, Sascha and Acar, Yasemin}}, journal = {{IEEE Security & Privacy}}, number = {{6}}, pages = {{59–63}}, publisher = {{IEEE}}, title = {{{A Viewpoint on Human Factors in Software Supply Chain Security: A Research Agenda}}}, volume = {{21}}, year = {{2023}}, } @inproceedings{53366, author = {{Tran, Mindy and Munyendo, Collins W and Sri Ramulu, Harshini and Rodriguez, Rachel Gonzalez and Schnell, Luisa Ball and Sula, Cora and Simko, Lucy and Acar, Yasemin}}, booktitle = {{2024 IEEE Symposium on Security and Privacy (SP)}}, pages = {{4–4}}, title = {{{Security, Privacy, and Data-sharing Trade-offs When Moving to the United States: Insights from a Qualitative Study}}}, year = {{2023}}, } @article{53348, author = {{Fourné, Marcel and Wermke, Dominik and Fahl, Sascha and Acar, Yasemin}}, journal = {{IEEE Secur. Priv.}}, number = {{6}}, pages = {{59–63}}, title = {{{A Viewpoint on Human Factors in Software Supply Chain Security: A Research Agenda}}}, doi = {{10.1109/MSEC.2023.3316569}}, volume = {{21}}, year = {{2023}}, } @article{53352, author = {{Simko, Lucy and Sri Ramulu, Harshini and Kohno, Tadayoshi and Acar, Yasemin}}, journal = {{Proc. ACM Hum. Comput. Interact.}}, number = {{CSCW2}}, pages = {{1–54}}, title = {{{The Use and Non-Use of Technology During Hurricanes}}}, doi = {{10.1145/3610215}}, volume = {{7}}, year = {{2023}}, } @article{46310, abstract = {{Classic automated algorithm selection (AS) for (combinatorial) optimization problems heavily relies on so-called instance features, i.e., numerical characteristics of the problem at hand ideally extracted with computationally low-demanding routines. For the traveling salesperson problem (TSP) a plethora of features have been suggested. Most of these features are, if at all, only normalized imprecisely raising the issue of feature values being strongly affected by the instance size. Such artifacts may have detrimental effects on algorithm selection models. We propose a normalization for two feature groups which stood out in multiple AS studies on the TSP: (a) features based on a minimum spanning tree (MST) and (b) nearest neighbor relationships of the input instance. To this end we theoretically derive minimum and maximum values for properties of MSTs and k-nearest neighbor graphs (NNG) of Euclidean graphs. We analyze the differences in feature space between normalized versions of these features and their unnormalized counterparts. Our empirical investigations on various TSP benchmark sets point out that the feature scaling succeeds in eliminating the effect of the instance size. A proof-of-concept AS-study shows promising results: models trained with normalized features tend to outperform those trained with the respective vanilla features.}}, author = {{Heins, Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, keywords = {{Feature normalization, Algorithm selection, Traveling salesperson problem}}, pages = {{123--145}}, title = {{{A study on the effects of normalized TSP features for automated algorithm selection}}}, doi = {{https://doi.org/10.1016/j.tcs.2022.10.019}}, volume = {{940}}, year = {{2023}}, } @inproceedings{48898, abstract = {{Automated Algorithm Configuration (AAC) usually takes a global perspective: it identifies a parameter configuration for an (optimization) algorithm that maximizes a performance metric over a set of instances. However, the optimal choice of parameters strongly depends on the instance at hand and should thus be calculated on a per-instance basis. We explore the potential of Per-Instance Algorithm Configuration (PIAC) by using Reinforcement Learning (RL). To this end, we propose a novel PIAC approach that is based on deep neural networks. We apply it to predict configurations for the Lin\textendash Kernighan heuristic (LKH) for the Traveling Salesperson Problem (TSP) individually for every single instance. To train our PIAC approach, we create a large set of 100000 TSP instances with 2000 nodes each \textemdash currently the largest benchmark set to the best of our knowledge. We compare our approach to the state-of-the-art AAC method Sequential Model-based Algorithm Configuration (SMAC). The results show that our PIAC approach outperforms this baseline on both the newly created instance set and established instance sets.}}, author = {{Seiler, Moritz and Rook, Jeroen and Heins, Jonathan and Preuß, Oliver Ludger and Bossek, Jakob and Trautmann, Heike}}, booktitle = {{2023 IEEE Symposium Series on Computational Intelligence (SSCI)}}, pages = {{361 -- 368}}, title = {{{Using Reinforcement Learning for Per-Instance Algorithm Configuration on the TSP}}}, doi = {{10.1109/SSCI52147.2023.10372008}}, year = {{2023}}, } @inproceedings{54838, author = {{Boshoff, Septimus and Stenner, Jan and Weber, Daniel and Meyer, Marvin and Chidananda, Vikas and Peitz, Sebastian and Wallscheid, Oliver}}, booktitle = {{IEEE Power and Energy Student Summit (PESS)}}, isbn = {{978-3-8007-6318-4}}, pages = {{124--129}}, publisher = {{VDE}}, title = {{{Hybrid control of interconnected power converters using both expert-driven droop and data-driven reinforcement learning approaches}}}, year = {{2023}}, } @inproceedings{54839, author = {{Meyer, Marvin and Weber, Daniel and Chidananda, Vikas and Schweins, Oliver and Stenner, Jan and Boshoff, Septimus and Peitz, Sebastian and Wallscheid, Oliver}}, booktitle = {{IEEE Power and Energy Student Summit (PESS)}}, isbn = {{978-3-8007-6318-4}}, pages = {{112--117}}, publisher = {{VDE}}, title = {{{ElectricGrid.jl – Automated modeling of decentralized electrical energy grids}}}, year = {{2023}}, } @article{46467, author = {{Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}}, journal = {{Distributed Comput.}}, number = {{2}}, pages = {{159–192}}, title = {{{The canonical amoebot model: algorithms and concurrency control}}}, doi = {{10.1007/s00446-023-00443-3}}, volume = {{36}}, year = {{2023}}, } @book{45863, abstract = {{In the proposal for our CRC in 2011, we formulated a vision of markets for IT services that describes an approach to the provision of such services that was novel at that time and, to a large extent, remains so today: „Our vision of on-the-fly computing is that of IT services individually and automatically configured and brought to execution from flexibly combinable services traded on markets. At the same time, we aim at organizing markets whose participants maintain a lively market of services through appropriate entrepreneurial actions.“ Over the last 12 years, we have developed methods and techniques to address problems critical to the convenient, efficient, and secure use of on-the-fly computing. Among other things, we have made the description of services more convenient by allowing natural language input, increased the quality of configured services through (natural language) interaction and more efficient configuration processes and analysis procedures, made the quality of (the products of) providers in the marketplace transparent through reputation systems, and increased the resource efficiency of execution through reconfigurable heterogeneous computing nodes and an integrated treatment of service description and configuration. We have also developed network infrastructures that have a high degree of adaptivity, scalability, efficiency, and reliability, and provide cryptographic guarantees of anonymity and security for market participants and their products and services. To demonstrate the pervasiveness of the OTF computing approach, we have implemented a proof-of-concept for OTF computing that can run typical scenarios of an OTF market. We illustrated the approach using a cutting-edge application scenario – automated machine learning (AutoML). Finally, we have been pushing our work for the perpetuation of On-The-Fly Computing beyond the SFB and sharing the expertise gained in the SFB in events with industry partners as well as transfer projects. This work required a broad spectrum of expertise. Computer scientists and economists with research interests such as computer networks and distributed algorithms, security and cryptography, software engineering and verification, configuration and machine learning, computer engineering and HPC, microeconomics and game theory, business informatics and management have successfully collaborated here.}}, author = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}}, pages = {{247}}, publisher = {{Heinz Nixdorf Institut, Universität Paderborn}}, title = {{{On-The-Fly Computing -- Individualized IT-services in dynamic markets}}}, doi = {{10.17619/UNIPB/1-1797}}, volume = {{412}}, year = {{2023}}, } @article{50012, abstract = {{Silicon photonics, in conjunction with complementary metal-oxide-semiconductor (CMOS) fabrication, has greatly enhanced the development of integrated optical phased arrays. This facilitates a dynamic control of light in a compact form factor that enables the synthesis of arbitrary complex wavefronts in the infrared spectrum. We numerically demonstrate a large-scale two-dimensional silicon-based optical phased array (OPA) composed of nanoantennas with circular gratings that are balanced in power and aligned in phase, required for producing elegant radiation patterns in the far-field. For a wavelength of 1.55 μm, we optimize two antennas for the OPA exhibiting an upward radiation efficiency as high as 90%, with almost 6.8% of optical power concentrated in the field of view. Additionally, we believe that the proposed OPAs can be easily fabricated and would have the ability to generate complex holographic images, rendering them an attractive candidate for a wide range of applications like LiDAR sensors, optical trapping, optogenetic stimulation, and augmented-reality displays.}}, author = {{Farheen, Henna and Strauch, Andreas and Scheytt, J. Christoph and Myroshnychenko, Viktor and Förstner, Jens}}, issn = {{1569-4410}}, journal = {{Photonics and Nanostructures - Fundamentals and Applications}}, keywords = {{tet_topic_opticalantenna}}, pages = {{101207}}, publisher = {{Elsevier BV}}, title = {{{Optimized, Highly Efficient Silicon Antennas for Optical Phased Arrays}}}, doi = {{10.1016/j.photonics.2023.101207}}, volume = {{58}}, year = {{2023}}, } @article{43245, abstract = {{High-contrast slab waveguide Bragg gratings with 1D periodicity are investigated. For specific oblique excitation by semi-guided waves at sufficiently high angles of incidence, the idealized structures do not exhibit any radiative losses, such that reflectance and transmittance for the single port mode add strictly up to one. We consider a series of symmetric, fully and partly etched finite gratings, for parameters found in integrated silicon photonics. These can act as spectral filters with a reasonably flattop response. Apodization can lead to more box shaped reflectance and transmittance spectra. Together with a narrowband Fabry–Perot filter, these configurations are characterized by reflection bands, or transmittance peaks, with widths that span three orders of magnitude.}}, author = {{Hammer, Manfred and Farheen, Henna and Förstner, Jens}}, issn = {{0740-3224}}, journal = {{Journal of the Optical Society of America B}}, keywords = {{tet_topic_waveguide}}, number = {{4}}, pages = {{862}}, publisher = {{Optica Publishing Group}}, title = {{{How to suppress radiative losses in high-contrast integrated Bragg gratings}}}, doi = {{10.1364/josab.485725}}, volume = {{40}}, year = {{2023}}, } @inproceedings{43052, abstract = {{We demonstrate a large-scale two dimensional silicon-based optical phased array (OPA) composed of nanoantennas with circular gratings that are balanced in power and aligned in phase, required for producing desired radiation patterns in the far-field. The OPAs are numerically optimized to have an upward efficiency of up to 90%, targeting radiation concentration mainly in the field of view. We envision that our OPAs have the ability of generating complex holographic images, rendering them an attractive candidate for a wide range of applications like LiDAR sensors, optical trapping, optogenetic stimulation and augmented-reality displays.}}, author = {{Farheen, Henna and Strauch, Andreas and Scheytt, J. Christoph and Myroshnychenko, Viktor and Förstner, Jens}}, booktitle = {{Integrated Optics: Devices, Materials, and Technologies XXVII}}, editor = {{García-Blanco, Sonia M. and Cheben, Pavel}}, keywords = {{tet_topic_opticalantenna}}, pages = {{124241D }}, publisher = {{SPIE}}, title = {{{Optimized silicon antennas for optical phased arrays}}}, doi = {{10.1117/12.2658716}}, year = {{2023}}, } @inproceedings{50466, abstract = {{A key challenge in designing efficient optical phased arrays is the lack of a well-designed radiator. This work explores horn antennas numerically optimized to target high upward radiation efficiency to be employed in silicon-based phased arrays capable of producing elegant radiation patterns in the far-field.}}, author = {{Farheen, Henna and Joshi, S. and Scheytt, J. Christoph and Myroshnychenko, Viktor and Förstner, Jens}}, booktitle = {{2023 IEEE Photonics Conference (IPC)}}, keywords = {{tet_topic_opticalantenna}}, publisher = {{IEEE}}, title = {{{Increasing the upward radiation efficiency of optical phased arrays using asymmetric silicon horn antennas}}}, doi = {{10.1109/ipc57732.2023.10360519}}, year = {{2023}}, } @article{48596, author = {{Häsel-Weide, Uta and Schmidt, R. and Büker, Petra}}, journal = {{Zeitschrift für Schul- und Professionsentwicklung (PFLB)}}, number = {{1}}, pages = {{215--229}}, title = {{{„FInDig“: Fach – Inklusion – Digitalisierung vernetzen. Ein Planungs- und Reflexionsmodell für die Lehrkräftebildung}}}, volume = {{5}}, year = {{2023}}, } @article{55277, author = {{Klahn, B. and Technau, Marc}}, journal = {{Int. J. Number Theory}}, number = {{10}}, pages = {{2443–2450}}, title = {{{Galois groups of (ⁿ₀)+(ⁿ₁)X+…+(ⁿ₆)X⁶}}}, doi = {{10.1142/S1793042123501208}}, volume = {{19}}, year = {{2023}}, }