Tootfinder

Managing Differentiated Secure Connectivity using Intents
Loay Abdelrazek, Filippo Rebecchi
https://arxiv.org/abs/2509.25462 https://arxiv.org/pdf/2509.254…

Managing Differentiated Secure Connectivity using Intents
Mobile networks in the 5G and 6G era require to rethink how to manage security due to the introduction of new services, use cases, each with its own security requirements, while simultaneously expanding the threat landscape. Although automation has emerged as a key enabler to address complexity in networks, existing approaches lack the expressiveness to define and enforce complex, goal-driven, and measurable security requirements. In this paper, we propose the concept of differentiated security…

Energy management and flexibility quantification in a discrete event distribution grid simulation
Sebastian Peter, Daniel Feismann, Johannes Bao, Thomas Oberlie{\ss}en, Christian Rehtanz
https://arxiv.org/abs/2507.23396

Energy management and flexibility quantification in a discrete event distribution grid simulation
Distribution grid operation faces new challenges caused by a rising share of renewable energy sources and the introduction of additional types of loads to the grid. With the increasing adoption of distributed generation and emerging prosumer households, Energy Management Systems, which manage and apply flexibility of connected devices, are gaining popularity. While potentially beneficial to grid capacity, strategic energy management also adds to the complexity of distribution grid operation and…

A Brief Introduction to Quantum Query Complexity
Yassine Hamoudi
https://arxiv.org/abs/2508.08852 https://arxiv.org/pdf/2508.08852

A Brief Introduction to Quantum Query Complexity
Quantum query complexity is a fundamental model for analyzing the computational power of quantum algorithms. It has played a key role in characterizing quantum speedups, from early breakthroughs such as Grover's and Simon's algorithms to more recent developments in quantum cryptography and complexity theory. This document provides a structured introduction to quantum query lower bounds, focusing on four major techniques: the hybrid method, the polynomial method, the recording method, and the ad…

Counting Chemical Isomers with Multivariate Generating Functions
Rana Shojaei, Thilo Gross
https://arxiv.org/abs/2507.21713 https://arxiv.org/pdf/2507.2171…

Counting Chemical Isomers with Multivariate Generating Functions
Counting the number of isomers of a chemical molecule is one of the formative problems of graph theory. However, recent progress has been slow, and the problem has largely been ignored in modern network science. Here we provide an introduction to the mathematics of counting network structures and then use it to derive results for two new classes of molecules. In contrast to previously studied examples, these classes take additional chemical complexity into account and thus require the use of mu…

Accelerating Signal-Temporal-Logic-Based Task and Motion Planning of Bipedal Navigation using Benders Decomposition
Jiming Ren, Xuan Lin, Roman Mineyev, Karen M. Feigh, Samuel Coogan, Ye Zhao
https://arxiv.org/abs/2508.13407

Accelerating Signal-Temporal-Logic-Based Task and Motion Planning of Bipedal Navigation using Benders Decomposition
Task and motion planning under Signal Temporal Logic constraints is known to be NP-hard. A common class of approaches formulates these hybrid problems, which involve discrete task scheduling and continuous motion planning, as mixed-integer programs (MIP). However, in applications for bipedal locomotion, introduction of non-convex constraints such as kinematic reachability and footstep rotation exacerbates the computational complexity of MIPs. In this work, we present a method based on Benders D…