@article{48063,
  abstract     = {{<jats:p>Brainwaves have demonstrated to be unique enough across individuals to be useful as biometrics. They also provide promising advantages over traditional means of authentication, such as resistance to external observability, revocability, and intrinsic liveness detection. However, most of the research so far has been conducted with expensive, bulky, medical-grade helmets, which offer limited applicability for everyday usage. With the aim to bring brainwave authentication and its benefits closer to real world deployment, we investigate brain biometrics with consumer devices. We conduct a comprehensive measurement experiment and user study that compare five authentication tasks on a user sample up to 10 times larger than those from previous studies, introducing three novel techniques based on cognitive semantic processing. Furthermore, we apply our analysis on high-quality open brainwave data obtained with a medical-grade headset, to assess the differences. We investigate both the performance, security, and usability of the different options and use this evidence to elicit design and research recommendations. Our results show that it is possible to achieve Equal Error Rates as low as 7.2% (a reduction between 68–72% with respect to existing approaches) based on brain responses to images with current inexpensive technology. We show that the common practice of testing authentication systems only with known attacker data is unrealistic and may lead to overly optimistic evaluations. With regard to adoption, users call for simpler devices, faster authentication, and better privacy.</jats:p>
          <jats:p />}},
  author       = {{Arias-Cabarcos, Patricia and Fallahi, Matin and Habrich, Thilo and Schulze, Karen and Becker, Christian and Strufe, Thorsten}},
  issn         = {{2471-2566}},
  journal      = {{ACM Transactions on Privacy and Security}},
  keywords     = {{Safety, Risk, Reliability and Quality, General Computer Science}},
  number       = {{3}},
  pages        = {{1--36}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Performance and Usability Evaluation of Brainwave Authentication Techniques with Consumer Devices}}},
  doi          = {{10.1145/3579356}},
  volume       = {{26}},
  year         = {{2023}},
}

@article{50271,
  author       = {{Gharibian, Sevag and Le Gall, François}},
  issn         = {{0097-5397}},
  journal      = {{SIAM Journal on Computing}},
  keywords     = {{General Mathematics, General Computer Science}},
  number       = {{4}},
  pages        = {{1009--1038}},
  publisher    = {{Society for Industrial & Applied Mathematics (SIAM)}},
  title        = {{{Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture}}},
  doi          = {{10.1137/22m1513721}},
  volume       = {{52}},
  year         = {{2023}},
}

@article{50458,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Consider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.</jats:p>}},
  author       = {{Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}},
  issn         = {{0178-4617}},
  journal      = {{Algorithmica}},
  keywords     = {{Applied Mathematics, Computer Science Applications, General Computer Science}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Server Cloud Scheduling}}},
  doi          = {{10.1007/s00453-023-01189-x}},
  year         = {{2023}},
}

@article{53263,
  author       = {{Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard A.}},
  issn         = {{2169-3536}},
  journal      = {{IEEE Access}},
  keywords     = {{General Engineering, General Materials Science, General Computer Science, Electrical and Electronic Engineering}},
  pages        = {{70833--70852}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Spectral and Energy Efficiency Maximization of MISO STAR-RIS-Assisted URLLC Systems}}},
  doi          = {{10.1109/access.2023.3294092}},
  volume       = {{11}},
  year         = {{2023}},
}

@article{53225,
  author       = {{Hilbert, Markus and Dellnitz, Andreas and Kleine, Andreas and Tavana, Madjid}},
  issn         = {{0360-8352}},
  journal      = {{Computers & Industrial Engineering}},
  keywords     = {{General Engineering, General Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{A novel indicator for sustainability in production planning using Center of Gravity-based assessment of Pareto fronts}}},
  doi          = {{10.1016/j.cie.2023.109618}},
  volume       = {{185}},
  year         = {{2023}},
}

@article{53541,
  author       = {{Robles-González, Antonio and Arias Cabarcos, Patricia and Parra-Arnau, Javier}},
  issn         = {{0167-4048}},
  journal      = {{Computers &amp; Security}},
  keywords     = {{Law, General Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{Privacy-centered authentication: A new framework and analysis}}},
  doi          = {{10.1016/j.cose.2023.103353}},
  volume       = {{132}},
  year         = {{2023}},
}

@article{47085,
  author       = {{Schubatzky, Thomas and Burde, Jan-Philipp and Große-Heilmann, Rike Isabel and Haagen-Schützenhöfer, Claudia and Riese, Josef and Weiler, David}},
  issn         = {{0360-1315}},
  journal      = {{Computers & Education}},
  keywords     = {{Education, General Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{Predicting the development of digital media PCK/TPACK: The role of PCK, motivation to use digital media, interest in and previous experience with digital media}}},
  doi          = {{10.1016/j.compedu.2023.104900}},
  volume       = {{206}},
  year         = {{2023}},
}

@article{33947,
  author       = {{Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  keywords     = {{General Computer Science, Theoretical Computer Science}},
  pages        = {{261--291}},
  publisher    = {{Elsevier BV}},
  title        = {{{Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}}},
  doi          = {{10.1016/j.tcs.2022.10.031}},
  volume       = {{939}},
  year         = {{2023}},
}

@article{38041,
  abstract     = {{<jats:p>While FPGA accelerator boards and their respective high-level design tools are maturing, there is still a lack of multi-FPGA applications, libraries, and not least, benchmarks and reference implementations towards sustained HPC usage of these devices. As in the early days of GPUs in HPC, for workloads that can reasonably be decoupled into loosely coupled working sets, multi-accelerator support can be achieved by using standard communication interfaces like MPI on the host side. However, for performance and productivity, some applications can profit from a tighter coupling of the accelerators. FPGAs offer unique opportunities here when extending the dataflow characteristics to their communication interfaces.</jats:p>
          <jats:p>In this work, we extend the HPCC FPGA benchmark suite by multi-FPGA support and three missing benchmarks that particularly characterize or stress inter-device communication: b_eff, PTRANS, and LINPACK. With all benchmarks implemented for current boards with Intel and Xilinx FPGAs, we established a baseline for multi-FPGA performance. Additionally, for the communication-centric benchmarks, we explored the potential of direct FPGA-to-FPGA communication with a circuit-switched inter-FPGA network that is currently only available for one of the boards. The evaluation with parallel execution on up to 26 FPGA boards makes use of one of the largest academic FPGA installations.</jats:p>}},
  author       = {{Meyer, Marius and Kenter, Tobias and Plessl, Christian}},
  issn         = {{1936-7406}},
  journal      = {{ACM Transactions on Reconfigurable Technology and Systems}},
  keywords     = {{General Computer Science}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks}}},
  doi          = {{10.1145/3576200}},
  year         = {{2023}},
}

@article{46213,
  author       = {{Weber, Daniel and Schenke, Maximilian and Wallscheid, Oliver}},
  issn         = {{2169-3536}},
  journal      = {{IEEE Access}},
  keywords     = {{General Engineering, General Materials Science, General Computer Science, Electrical and Electronic Engineering}},
  pages        = {{76524--76536}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems}}},
  doi          = {{10.1109/access.2023.3297274}},
  volume       = {{11}},
  year         = {{2023}},
}

@article{46517,
  author       = {{Ahmed, Abdullah Fathi and Sherif, Mohamed Ahmed and Ngomo, Axel-Cyrille Ngonga}},
  issn         = {{2169-3536}},
  journal      = {{IEEE Access}},
  keywords     = {{General Engineering, General Materials Science, General Computer Science, Electrical and Electronic Engineering}},
  pages        = {{1--1}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{NELLIE: Never-Ending Linking for Linked Open Data}}},
  doi          = {{10.1109/access.2023.3300694}},
  year         = {{2023}},
}

@article{44081,
  author       = {{Serino, Laura and Gil López, Jano and Stefszky, Michael and Ricken, Raimund and Eigner, Christof and Brecht, Benjamin and Silberhorn, Christine}},
  issn         = {{2691-3399}},
  journal      = {{PRX Quantum}},
  keywords     = {{General Physics and Astronomy, Mathematical Physics, Applied Mathematics, Electronic, Optical and Magnetic Materials, Electrical and Electronic Engineering, General Computer Science}},
  number       = {{2}},
  publisher    = {{American Physical Society (APS)}},
  title        = {{{Realization of a Multi-Output Quantum Pulse Gate for Decoding High-Dimensional Temporal Modes of Single-Photon States}}},
  doi          = {{10.1103/prxquantum.4.020306}},
  volume       = {{4}},
  year         = {{2023}},
}

@article{31844,
  abstract     = {{<jats:p>Encrypting data before sending it to the cloud ensures data confidentiality but requires the cloud to compute on encrypted data. Trusted execution environments, such as Intel SGX enclaves, promise to provide a secure environment in which data can be decrypted and then processed. However, vulnerabilities in the executed program give attackers ample opportunities to execute arbitrary code inside the enclave. This code can modify the dataflow of the program and leak secrets via SGX side channels. Fully homomorphic encryption would be an alternative to compute on encrypted data without data leaks. However, due to its high computational complexity, its applicability to general-purpose computing remains limited. Researchers have made several proposals for transforming programs to perform encrypted computations on less powerful encryption schemes. Yet current approaches do not support programs making control-flow decisions based on encrypted data.</jats:p>
          <jats:p>
            We introduce the concept of
            <jats:italic>dataflow authentication</jats:italic>
            (DFAuth) to enable such programs. DFAuth prevents an adversary from arbitrarily deviating from the dataflow of a program. Our technique hence offers protections against the side-channel attacks described previously. We implemented two flavors of DFAuth, a Java bytecode-to-bytecode compiler, and an SGX enclave running a small and program-independent trusted code base. We applied DFAuth to a neural network performing machine learning on sensitive medical data and a smart charging scheduler for electric vehicles. Our transformation yields a neural network with encrypted weights, which can be evaluated on encrypted inputs in
            <jats:inline-formula content-type="math/tex">
              <jats:tex-math notation="LaTeX" version="MathJax">\( 12.55 \,\mathrm{m}\mathrm{s} \)</jats:tex-math>
            </jats:inline-formula>
            . Our protected scheduler is capable of updating the encrypted charging plan in approximately 1.06 seconds.
          </jats:p>}},
  author       = {{Fischer, Andreas and Fuhry, Benny and Kußmaul, Jörn and Janneck, Jonas and Kerschbaum, Florian and Bodden, Eric}},
  issn         = {{2471-2566}},
  journal      = {{ACM Transactions on Privacy and Security}},
  keywords     = {{Safety, Risk, Reliability and Quality, General Computer Science}},
  number       = {{3}},
  pages        = {{1--36}},
  publisher    = {{Association for Computing Machinery (ACM)}},
  title        = {{{Computation on Encrypted Data Using Dataflow Authentication}}},
  doi          = {{10.1145/3513005}},
  volume       = {{25}},
  year         = {{2022}},
}

@article{31479,
  author       = {{Baswana, Surender and Gupta, Shiv and Knollmann, Till}},
  issn         = {{0178-4617}},
  journal      = {{Algorithmica}},
  keywords     = {{Applied Mathematics, Computer Science Applications, General Computer Science}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Mincut Sensitivity Data Structures for the Insertion of an Edge}}},
  doi          = {{10.1007/s00453-022-00978-0}},
  year         = {{2022}},
}

@article{33869,
  author       = {{Bonnard, B. and Cots, O. and Gergaud, J. and Wembe Moafo, Boris Edgar}},
  issn         = {{0167-6911}},
  journal      = {{Systems &amp; Control Letters}},
  keywords     = {{Electrical and Electronic Engineering, Mechanical Engineering, General Computer Science, Control and Systems Engineering}},
  publisher    = {{Elsevier BV}},
  title        = {{{Abnormal geodesics in 2D-Zermelo navigation problems in the case of revolution and the fan shape of the small time balls}}},
  doi          = {{10.1016/j.sysconle.2022.105140}},
  volume       = {{161}},
  year         = {{2022}},
}

@article{33657,
  author       = {{Mirhosseini, Hossein and Tahmasbi, Hossein and Kuchana, Sai Ram and Ghasemi, Alireza and Kühne, Thomas}},
  issn         = {{0927-0256}},
  journal      = {{Computational Materials Science}},
  keywords     = {{Computational Mathematics, General Physics and Astronomy, Mechanics of Materials, General Materials Science, General Chemistry, General Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{An automated approach for developing neural network interatomic potentials with FLAME}}},
  doi          = {{10.1016/j.commatsci.2021.110567}},
  volume       = {{197}},
  year         = {{2021}},
}

@article{53268,
  author       = {{Soleymani, Mohammad and Santamaria, Ignacio and Schreier, Peter J.}},
  issn         = {{2169-3536}},
  journal      = {{IEEE Access}},
  keywords     = {{General Engineering, General Materials Science, General Computer Science}},
  pages        = {{96948--96963}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Distributed Algorithms for Spectral and Energy-Efficiency Maximization of <i>K</i>-User Interference Channels}}},
  doi          = {{10.1109/access.2021.3094976}},
  volume       = {{9}},
  year         = {{2021}},
}

@article{30372,
  author       = {{Zahera, H.M.A and Jalota, Rricha and Sherif, Mohamed Ahmed and Ngomo, Axel-Cyrille Ngonga}},
  issn         = {{2169-3536}},
  journal      = {{IEEE Access}},
  keywords     = {{General Engineering, General Materials Science, General Computer Science}},
  pages        = {{118861--118870}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{I-AID: Identifying Actionable Information From Disaster-Related Tweets}}},
  doi          = {{10.1109/access.2021.3107812}},
  volume       = {{9}},
  year         = {{2021}},
}

@article{42803,
  abstract     = {{We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related problems, including the computation of two-sided ideal classes, isomorphism classes of orders, connecting ideals for orders, and ideal principalization. We conclude by giving the complete list of definite Eichler orders with class number at most 2.}},
  author       = {{Kirschmer, Markus and Voight, John}},
  issn         = {{0097-5397}},
  journal      = {{SIAM Journal on Computing}},
  keywords     = {{General Mathematics, General Computer Science}},
  number       = {{5}},
  pages        = {{1714--1747}},
  publisher    = {{Society for Industrial & Applied Mathematics (SIAM)}},
  title        = {{{Algorithmic Enumeration of Ideal Classes for Quaternion Orders}}},
  doi          = {{10.1137/080734467}},
  volume       = {{39}},
  year         = {{2010}},
}

@article{35857,
  author       = {{Blömer, J.}},
  issn         = {{0178-4617}},
  journal      = {{Algorithmica}},
  keywords     = {{Applied Mathematics, Computer Science Applications, General Computer Science}},
  number       = {{1}},
  pages        = {{2--15}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Denesting by Bounded Degree Radicals}}},
  doi          = {{10.1007/s004530010028}},
  volume       = {{28}},
  year         = {{2002}},
}