@unpublished{52691,
  abstract     = {{We prove Feynman-Kac formulas for the semigroups generated by selfadjoint
operators in a class containing Fr\"ohlich Hamiltonians known from solid state
physics. The latter model multi-polarons, i.e., a fixed number of quantum
mechanical electrons moving in a polarizable crystal and interacting with the
quantized phonon field generated by the crystal's vibrational modes. Both the
electrons and phonons can be confined to suitable open subsets of Euclidean
space. We also include possibly very singular magnetic vector potentials and
electrostatic potentials. Our Feynman-Kac formulas comprise Fock space
operator-valued multiplicative functionals and can be applied to every vector
in the underlying Hilbert space. In comparison to the renormalized Nelson
model, for which analogous Feynman-Kac formulas are known, the analysis of the
creation and annihilation terms in the multiplicative functionals requires
novel ideas to overcome difficulties caused by the phonon dispersion relation
being constant. Getting these terms under control and generalizing other
construction steps so as to cover confined systems are the main achievements of
this article.}},
  author       = {{Hinrichs, Benjamin and Matte, Oliver}},
  booktitle    = {{arXiv:2403.12147}},
  title        = {{{Feynman-Kac formulas for semigroups generated by multi-polaron  Hamiltonians in magnetic fields and on general domains}}},
  year         = {{2024}},
}

@article{52686,
  author       = {{Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco}},
  issn         = {{2509-3428}},
  journal      = {{Journal of Hardware and Systems Security}},
  keywords     = {{General Engineering, Energy Engineering and Power Technology}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Post-configuration Activation of Hardware Trojans in FPGAs}}},
  doi          = {{10.1007/s41635-024-00147-5}},
  year         = {{2024}},
}

@inproceedings{52379,
  author       = {{Hüsing, Sven and Schulte, Carsten and Sparmann, Sören and Bolte, Mario}},
  booktitle    = {{Proceedings of the 55th ACM Technical Symposium on Computer Science Education V. 1}},
  publisher    = {{ACM}},
  title        = {{{Using Worked Examples for Engaging in Epistemic Programming Projects}}},
  doi          = {{10.1145/3626252.3630961}},
  year         = {{2024}},
}

@article{52726,
  abstract     = {{Heteroclinic structures organize global features of dynamical systems. We analyse whether heteroclinic structures can arise in network dynamics with higher-order interactions which describe the nonlinear interactions between three or more units. We find that while commonly analysed model equations such as network dynamics on undirected hypergraphs may be useful to describe local dynamics such as cluster synchronization, they give rise to obstructions that allow to design of heteroclinic structures in phase space. By contrast, directed hypergraphs break the homogeneity and lead to vector fields that support heteroclinic structures.}},
  author       = {{Bick, Christian and von der Gracht, Sören}},
  issn         = {{2051-1329}},
  journal      = {{Journal of Complex Networks}},
  keywords     = {{Applied Mathematics, Computational Mathematics, Control and Optimization, Management Science and Operations Research, Computer Networks and Communications}},
  number       = {{2}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Heteroclinic dynamics in network dynamical systems with higher-order interactions}}},
  doi          = {{10.1093/comnet/cnae009}},
  volume       = {{12}},
  year         = {{2024}},
}

@article{49905,
  abstract     = {{For 0 ≤ t ≤ r let m(t, r) be the maximum number s such that every t-edge-connected r-graph has s pairwise disjoint perfect matchings. There are only a few values of m(t, r) known, for instance m(3, 3) = m(4, r) = 1, and m(t, r) ≤ r − 2 for all t  = 5,
and m(t, r) ≤ r − 3 if r is even. We prove that m(2l, r) ≤ 3l − 6 for every l ≥ 3 and r ≥ 2l.}},
  author       = {{Ma, Yulai and Mattiolo, Davide and Steffen, Eckhard and Wolf, Isaak Hieronymus}},
  issn         = {{0209-9683}},
  journal      = {{Combinatorica}},
  keywords     = {{Computational Mathematics, Discrete Mathematics and Combinatorics}},
  pages        = {{429--440}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs}}},
  doi          = {{10.1007/s00493-023-00078-9}},
  volume       = {{44}},
  year         = {{2024}},
}

@inproceedings{52744,
  author       = {{Jafarzadeh, Hanieh and Klemme, Florian and Amrouch, Hussam and Hellebrand, Sybille and Wunderlich, Hans-Joachim}},
  booktitle    = {{European Test Symposium, The Hague, Netherlands, May 20-24, 2024}},
  location     = {{The Hague, NL}},
  pages        = {{6}},
  publisher    = {{IEEE}},
  title        = {{{Time and Space Optimized Storage-based BIST under Multiple Voltages and Variations}}},
  year         = {{2024}},
}

@inproceedings{52742,
  author       = {{Jafarzadeh, Hanieh and Klemme, Florian and Amrouch, Hussam and Hellebrand, Sybille and Wunderlich, Hans-Joachim}},
  booktitle    = {{IEEE Latin American Test Symposium (LATS), Maceió, Brazil, April 9-12, 2024}},
  location     = {{Maceió}},
  pages        = {{6}},
  publisher    = {{IEEE}},
  title        = {{{Vmin Testing under Variations: Defect vs. Fault Coverage}}},
  year         = {{2024}},
}

@inproceedings{52743,
  author       = {{Hellebrand, Sybille and Sadeghi-Kohan, Somayeh and Wunderlich, Hans-Joachim}},
  booktitle    = {{International Symposium of EDA (ISEDA), Xi'an, China, May 10-13, 2024}},
  location     = {{Xi'an, China}},
  pages        = {{1}},
  title        = {{{Functional Safety and Reliability of Interconnects throughout the Silicon Life Cycle}}},
  year         = {{2024}},
}

@inproceedings{52745,
  author       = {{Wunderlich, Hans-Joachim and Jafarzadeh, Hanieh and Hellebrand, Sybille}},
  booktitle    = {{International Symposium of EDA (ISEDA), Xi’an, China, May 10-13, 2024}},
  location     = {{Xi’an, China}},
  pages        = {{1}},
  title        = {{{Robust Test of Small Delay Faults under  PVT-Variations}}},
  year         = {{2024}},
}

@misc{50284,
  author       = {{Stiballe, Alisa and Reimer, Jan Dennis and Sadeghi-Kohan, Somayeh and Hellebrand, Sybille}},
  publisher    = {{37. ITG / GMM / GI -Workshop "Testmethoden und Zuverlässigkeit von Schaltungen und Systemen"  (TuZ'24), Feb. 2024}},
  title        = {{{Modeling Crosstalk-induced Interconnect Delay with Polynomial Regression}}},
  year         = {{2024}},
}

@inproceedings{52827,
  author       = {{Hu, Lijie and Habernal, Ivan and Shen, Lei and Wang, Di}},
  booktitle    = {{Findings of the Association for Computational Linguistics: EACL 2024, St. Julian’s, Malta, March 17-22, 2024}},
  editor       = {{Graham, Yvette and Purver, Matthew}},
  pages        = {{478–499}},
  publisher    = {{Association for Computational Linguistics}},
  title        = {{{Differentially Private Natural Language Models: Recent Advances and Future Directions}}},
  year         = {{2024}},
}

@inproceedings{52842,
  abstract     = {{Neural machine translation (NMT) is a widely popular text generation task, yet there is a considerable research gap in the development of privacy-preserving NMT models, despite significant data privacy concerns for NMT systems. Differentially private stochastic gradient descent (DP-SGD) is a popular method for training machine learning models with concrete privacy guarantees; however, the implementation specifics of training a model with DP-SGD are not always clarified in existing models, with differing software libraries used and code bases not always being public, leading to reproducibility issues. To tackle this, we introduce DP-NMT, an open-source framework for carrying out research on privacy-preserving NMT with DP-SGD, bringing together numerous models, datasets, and evaluation metrics in one systematic software package. Our goal is to provide a platform for researchers to advance the development of privacy-preserving NMT systems, keeping the specific details of the DP-SGD algorithm transparent and intuitive to implement. We run a set of experiments on datasets from both general and privacy-related domains to demonstrate our framework in use. We make our framework publicly available and welcome feedback from the community.}},
  author       = {{Igamberdiev, Timour and Vu, Doan Nam Long and Kuennecke, Felix and Yu, Zhuo and Holmer, Jannik and Habernal, Ivan}},
  booktitle    = {{Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics: System Demonstrations}},
  editor       = {{Aletras, Nikolaos and De Clercq, Orphee}},
  pages        = {{94–105}},
  publisher    = {{Association for Computational Linguistics}},
  title        = {{{DP-NMT: Scalable Differentially Private Machine Translation}}},
  year         = {{2024}},
}

@article{53101,
  abstract     = {{In this work, we consider optimal control problems for mechanical systems with fixed initial and free final state and a quadratic Lagrange term. Specifically, the dynamics is described by a second order ODE containing an affine control term. Classically, Pontryagin's maximum principle gives necessary optimality conditions for the optimal control problem. For smooth problems, alternatively, a variational approach based on an augmented objective can be followed. Here, we propose a new Lagrangian approach leading to equivalent necessary optimality conditions in the form of Euler-Lagrange equations. Thus, the differential geometric structure (similar to classical Lagrangian dynamics) can be exploited in the framework of optimal control problems. In particular, the formulation enables the symplectic discretisation of the optimal control problem via variational integrators in a straightforward way.}},
  author       = {{Leyendecker, Sigrid and Maslovskaya, Sofya and Ober-Blöbaum, Sina and Almagro, Rodrigo T. Sato Martín de and Szemenyei, Flóra Orsolya}},
  issn         = {{2158-2491}},
  journal      = {{Journal of Computational Dynamics}},
  keywords     = {{Optimal control problem, Lagrangian system, Hamiltonian system, Variations, Pontryagin's maximum principle.}},
  pages        = {{0--0}},
  publisher    = {{American Institute of Mathematical Sciences (AIMS)}},
  title        = {{{A new Lagrangian approach to control affine systems with a quadratic Lagrange term}}},
  doi          = {{10.3934/jcd.2024017}},
  year         = {{2024}},
}

@unpublished{53282,
  abstract     = {{Modern wireless communication systems are expected to provide improved
latency and reliability. To meet these expectations, a short packet length is
needed, which makes the first-order Shannon rate an inaccurate performance
metric for such communication systems. A more accurate approximation of the
achievable rates of finite-block-length (FBL) coding regimes is known as the
normal approximation (NA). It is therefore of substantial interest to study the
optimization of the FBL rate in multi-user multiple-input multiple-output
(MIMO) systems, in which each user may transmit and/or receive multiple data
streams. Hence, we formulate a general optimization problem for improving the
spectral and energy efficiency of multi-user MIMO-aided ultra-reliable
low-latency communication (URLLC) systems, which are assisted by reconfigurable
intelligent surfaces (RISs). We show that a RIS is capable of substantially
improving the performance of multi-user MIMO-aided URLLC systems. Moreover, the
benefits of RIS increase as the packet length and/or the tolerable bit error
rate are reduced. This reveals that RISs can be even more beneficial in URLLC
systems for improving the FBL rates than in conventional systems approaching
Shannon rates.}},
  author       = {{Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard and Schober, Robert and Hanzo, Lajos}},
  booktitle    = {{arXiv:2402.16434}},
  title        = {{{Optimization of the Downlink Spectral- and Energy-Efficiency of  RIS-aided Multi-user URLLC MIMO Systems}}},
  year         = {{2024}},
}

@inproceedings{53259,
  author       = {{Soleymani, Mohammad and Santamaria, Ignacio and Sezgin, Aydin and Jorswieck, Eduard}},
  booktitle    = {{2023 IEEE 9th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)}},
  publisher    = {{IEEE}},
  title        = {{{Maximization of Minimum Rate in MIMO OFDM RIS-Assisted Broadcast Channels}}},
  doi          = {{10.1109/camsap58249.2023.10403459}},
  year         = {{2024}},
}

@inproceedings{53258,
  author       = {{Soleymani, Mohammad and Santamaria, Ignacio and Jorswieck, Eduard}},
  booktitle    = {{GLOBECOM 2023 - 2023 IEEE Global Communications Conference}},
  publisher    = {{IEEE}},
  title        = {{{NOMA-Based Improper Signaling for MIMO STAR-RIS-Assisted Broadcast Channels with Hardware Impairments}}},
  doi          = {{10.1109/globecom54140.2023.10437458}},
  year         = {{2024}},
}

@inproceedings{53304,
  author       = {{Kuschel, Maurice and Hasija, Tanuj and Marrinan, Timothy}},
  booktitle    = {{ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}},
  publisher    = {{IEEE}},
  title        = {{{Rademacher Complexity Regularization for Correlation-Based Multiview Representation Learning}}},
  doi          = {{10.1109/icassp48485.2024.10446173}},
  year         = {{2024}},
}

@misc{53374,
  author       = {{De Groote, Carsten}},
  title        = {{{A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes}}},
  year         = {{2024}},
}

@misc{53373,
  author       = {{Doddegowda, Rajesh}},
  title        = {{{Optimal Drone Strategies For Packet Delivery}}},
  year         = {{2024}},
}

@misc{53372,
  author       = {{Thakur, Heena}},
  title        = {{{Evaluating the Implications}}},
  year         = {{2024}},
}

