@article{64979, abstract = {{We investigate homogeneous coupled cell systems with high-dimensional internal dynamics. In many studies on network dynamics, the analysis is restricted to networks with one-dimensional internal dynamics. Here, we show how symmetry explains the relation between dynamical behavior of systems with one-dimensional internal dynamics and with higher dimensional internal dynamics, when the underlying network topology is the same. Fundamental networks of homogeneous coupled cell systems (B. Rink, J. Sanders. Coupled Cell Networks and Their Hidden Symmetries. SIAM J. Math. Anal. 46.2 (2014)) can be expressed in terms of monoid representations, which uniquely decompose into indecomposable subrepresentations. In the high-dimensional internal dynamics case, these subrepresentations are isomorphic to multiple copies of those one computes in the one-dimensional internal dynamics case. This has interesting implications for possible center subspaces in bifurcation analysis. We describe the effect on steady state and Hopf bifurcations in l-parameter families of network vector fields. The main results in that regard are that (1) generic one-parameter steady state bifurcations are qualitatively independent of the dimension of the internal dynamics and that, (2) in order to observe all generic l-parameter bifurcations that may occur for internal dynamics of any dimension, the internal dynamics has to be at least l-dimensional for steady state bifurcations and 2l-dimensional for Hopf bifurcations. Furthermore, we illustrate how additional structure in the network can be exploited to obtain even greater understanding of bifurcation scenarios in the high-dimensional case beyond qualitative statements about the collective dynamics. One-parameter steady state bifurcations in feedforward networks exhibit an unusual amplification in the asymptotic growth rates of individual cells, when these are one-dimensional (S. von der Gracht, E. Nijholt, B. Rink. Amplified steady state bifurcations in feedforward networks. Nonlinearity 35.4 (2022)). As another main result, we prove that (3) the same cells exhibit this amplifying effect with the same growth rates when the internal dynamics is high-dimensional.}}, author = {{von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}}, issn = {{0960-0779}}, journal = {{Chaos, Solitons & Fractals}}, keywords = {{Coupled cell systems, Network dynamics, Dimension reduction, Bifurcation theory, Symmetry, Monoid representation theory}}, publisher = {{Elsevier BV}}, title = {{{Homogeneous coupled cell systems with high-dimensional internal dynamics}}}, doi = {{10.1016/j.chaos.2026.118196}}, volume = {{208}}, year = {{2026}}, } @article{63498, author = {{Kirchgässner, Wilhelm and Förster, Nikolas and Piepenbrock, Till and Schweins, Oliver and Wallscheid, Oliver}}, journal = {{IEEE Transactions on Power Electronics}}, keywords = {{Mathematical models, Estimation, Data models, Convolutional neural networks, Accuracy, Magnetic hysteresis, Magnetic cores, Temperature measurement, Magnetic domains, Temperature distribution, Convolutional neural network (CNN), machine learning (ML), magnetics}}, number = {{2}}, pages = {{3326--3335}}, title = {{{HARDCORE: H-Field and Power Loss Estimation for Arbitrary Waveforms With Residual, Dilated Convolutional Neural Networks in Ferrite Cores}}}, doi = {{10.1109/TPEL.2024.3488174}}, volume = {{40}}, year = {{2025}}, } @article{59171, abstract = {{To model dynamical systems on networks with higher-order (non-pairwise) interactions, we recently introduced a new class of ordinary differential equations (ODEs) on hypernetworks. Here, we consider one-parameter synchrony breaking bifurcations in such ODEs. We call a synchrony breaking steady-state branch ‘reluctant’ if it is tangent to a synchrony space, but does not lie inside it. We prove that reluctant synchrony breaking is ubiquitous in hypernetwork systems, by constructing a large class of examples that support it. We also give an explicit formula for the order of tangency to the synchrony space of a reluctant steady-state branch.}}, author = {{von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}}, issn = {{1364-5021}}, journal = {{Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences}}, keywords = {{higher-order interactions, synchrony breaking, network dynamics, coupled cell systems}}, number = {{2301}}, publisher = {{The Royal Society}}, title = {{{Higher-order interactions lead to ‘reluctant’ synchrony breaking}}}, doi = {{10.1098/rspa.2023.0945}}, volume = {{480}}, year = {{2024}}, } @inproceedings{49109, abstract = {{We propose a diarization system, that estimates “who spoke when” based on spatial information, to be used as a front-end of a meeting transcription system running on the signals gathered from an acoustic sensor network (ASN). Although the spatial distribution of the microphones is advantageous, exploiting the spatial diversity for diarization and signal enhancement is challenging, because the microphones’ positions are typically unknown, and the recorded signals are initially unsynchronized in general. Here, we approach these issues by first blindly synchronizing the signals and then estimating time differences of arrival (TDOAs). The TDOA information is exploited to estimate the speakers’ activity, even in the presence of multiple speakers being simultaneously active. This speaker activity information serves as a guide for a spatial mixture model, on which basis the individual speaker’s signals are extracted via beamforming. Finally, the extracted signals are forwarded to a speech recognizer. Additionally, a novel initialization scheme for spatial mixture models based on the TDOA estimates is proposed. Experiments conducted on real recordings from the LibriWASN data set have shown that our proposed system is advantageous compared to a system using a spatial mixture model, which does not make use of external diarization information.}}, author = {{Gburrek, Tobias and Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}}, booktitle = {{Proc. Asilomar Conference on Signals, Systems, and Computers}}, keywords = {{Diarization, time difference of arrival, ad-hoc acoustic sensor network, meeting transcription}}, title = {{{Spatial Diarization for Meeting Transcription with Ad-Hoc Acoustic Sensor Networks}}}, year = {{2023}}, } @inproceedings{33734, abstract = {{Many applications require explainable node classification in knowledge graphs. Towards this end, a popular ``white-box'' approach is class expression learning: Given sets of positive and negative nodes, class expressions in description logics are learned that separate positive from negative nodes. Most existing approaches are search-based approaches generating many candidate class expressions and selecting the best one. However, they often take a long time to find suitable class expressions. In this paper, we cast class expression learning as a translation problem and propose a new family of class expression learning approaches which we dub neural class expression synthesizers. Training examples are ``translated'' into class expressions in a fashion akin to machine translation. Consequently, our synthesizers are not subject to the runtime limitations of search-based approaches. We study three instances of this novel family of approaches based on LSTMs, GRUs, and set transformers, respectively. An evaluation of our approach on four benchmark datasets suggests that it can effectively synthesize high-quality class expressions with respect to the input examples in approximately one second on average. Moreover, a comparison to state-of-the-art approaches suggests that we achieve better F-measures on large datasets. For reproducibility purposes, we provide our implementation as well as pretrained models in our public GitHub repository at https://github.com/dice-group/NeuralClassExpressionSynthesis}}, author = {{KOUAGOU, N'Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{The Semantic Web - 20th Extended Semantic Web Conference (ESWC 2023)}}, editor = {{Pesquita, Catia and Jimenez-Ruiz, Ernesto and McCusker, Jamie and Faria, Daniel and Dragoni, Mauro and Dimou, Anastasia and Troncy, Raphael and Hertling, Sven}}, keywords = {{Neural network, Concept learning, Description logics}}, location = {{Hersonissos, Crete, Greece}}, pages = {{209 -- 226}}, publisher = {{Springer International Publishing}}, title = {{{Neural Class Expression Synthesis}}}, doi = {{https://doi.org/10.1007/978-3-031-33455-9_13}}, volume = {{13870}}, year = {{2023}}, } @inproceedings{56477, abstract = {{We describe a prototype of a Clinical Decision Support System (CDSS) that provides (counterfactual) explanations to support accurate medical diagnosis. The prototype is based on an inherently interpretable Bayesian network (BN). Our research aims to investigate which explanations are most useful for medical experts and whether co-constructing explanations can foster trust and acceptance of CDSS.}}, author = {{Liedeker, Felix and Cimiano, Philipp}}, keywords = {{Explainable AI, Clinical decision support, Bayesian network, Counterfactual explanations}}, location = {{Lissabon}}, title = {{{A Prototype of an Interactive Clinical Decision Support System with Counterfactual Explanations}}}, year = {{2023}}, } @inproceedings{30236, abstract = {{Recent reinforcement learning approaches for continuous control in wireless mobile networks have shown impressive results. But due to the lack of open and compatible simulators, authors typically create their own simulation environments for training and evaluation. This is cumbersome and time-consuming for authors and limits reproducibility and comparability, ultimately impeding progress in the field. To this end, we propose mobile-env, a simple and open platform for training, evaluating, and comparing reinforcement learning and conventional approaches for continuous control in mobile wireless networks. mobile-env is lightweight and implements the common OpenAI Gym interface and additional wrappers, which allows connecting virtually any single-agent or multi-agent reinforcement learning framework to the environment. While mobile-env provides sensible default values and can be used out of the box, it also has many configuration options and is easy to extend. We therefore believe mobile-env to be a valuable platform for driving meaningful progress in autonomous coordination of wireless mobile networks.}}, author = {{Schneider, Stefan Balthasar and Werner, Stefan and Khalili, Ramin and Hecker, Artur and Karl, Holger}}, booktitle = {{IEEE/IFIP Network Operations and Management Symposium (NOMS)}}, keywords = {{wireless mobile networks, network management, continuous control, cognitive networks, autonomous coordination, reinforcement learning, gym environment, simulation, open source}}, location = {{Budapest}}, publisher = {{IEEE}}, title = {{{mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks}}}, year = {{2022}}, } @inproceedings{34140, abstract = {{In this paper, machine learning techniques will be used to classify different PCB layouts given their electromagnetic frequency spectra. These spectra result from a simulated near-field measurement of electric field strengths at different locations. Measured values consist of real and imaginary parts (amplitude and phase) in X, Y and Z directions. Training data was obtained in the time domain by varying transmission line geometries (size, distance and signaling). It was then transformed into the frequency domain and used as deep neural network input. Principal component analysis was applied to reduce the sample dimension. The results show that classifying different designs is possible with high accuracy based on synthetic data. Future work comprises measurements of real, custom-made PCB with varying parameters to adapt the simulation model and also test the neural network. Finally, the trained model could be used to give hints about the error’s cause when overshooting EMC limits.}}, author = {{Maalouly, Jad and Hemker, Dennis and Hedayat, Christian and Rückert, Christian and Kaufmann, Ivan and Olbrich, Marcel and Lange, Sven and Mathis, Harald}}, booktitle = {{2022 Kleinheubach Conference}}, keywords = {{emc, pcb, electronic system development, machine learning, neural network}}, location = {{Miltenberg, Germany}}, publisher = {{IEEE}}, title = {{{AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development}}}, year = {{2022}}, } @inproceedings{29220, abstract = {{Modern services often comprise several components, such as chained virtual network functions, microservices, or machine learning functions. Providing such services requires to decide how often to instantiate each component, where to place these instances in the network, how to chain them and route traffic through them. To overcome limitations of conventional, hardwired heuristics, deep reinforcement learning (DRL) approaches for self-learning network and service management have emerged recently. These model-free DRL approaches are more flexible but typically learn tabula rasa, i.e., disregard existing understanding of networks, services, and their coordination. Instead, we propose FutureCoord, a novel model-based AI approach that leverages existing understanding of networks and services for more efficient and effective coordination without time-intensive training. FutureCoord combines Monte Carlo Tree Search with a stochastic traffic model. This allows FutureCoord to estimate the impact of future incoming traffic and effectively optimize long-term effects, taking fluctuating demand and Quality of Service (QoS) requirements into account. Our extensive evaluation based on real-world network topologies, services, and traffic traces indicates that FutureCoord clearly outperforms state-of-the-art model-free and model-based approaches with up to 51% higher flow success ratios.}}, author = {{Werner, Stefan and Schneider, Stefan Balthasar and Karl, Holger}}, booktitle = {{IEEE/IFIP Network Operations and Management Symposium (NOMS)}}, keywords = {{network management, service management, AI, Monte Carlo Tree Search, model-based, QoS}}, location = {{Budapest}}, publisher = {{IEEE}}, title = {{{Use What You Know: Network and Service Coordination Beyond Certainty}}}, year = {{2022}}, } @article{35620, abstract = {{Deep learning models fuel many modern decision support systems, because they typically provide high predictive performance. Among other domains, deep learning is used in real-estate appraisal, where it allows to extend the analysis from hard facts only (e.g., size, age) to also consider more implicit information about the location or appearance of houses in the form of image data. However, one downside of deep learning models is their intransparent mechanic of decision making, which leads to a trade-off between accuracy and interpretability. This limits their applicability for tasks where a justification of the decision is necessary. Therefore, in this paper, we first combine different perspectives on interpretability into a multi-dimensional framework for a socio-technical perspective on explainable artificial intelligence. Second, we measure the performance gains of using multi-view deep learning which leverages additional image data (satellite images) for real estate appraisal. Third, we propose and test a novel post-hoc explainability method called Grad-Ram. This modified version of Grad-Cam mitigates the intransparency of convolutional neural networks (CNNs) for predicting continuous outcome variables. With this, we try to reduce the accuracy-interpretability trade-off of multi-view deep learning models. Our proposed network architecture outperforms traditional hedonic regression models by 34% in terms of MAE. Furthermore, we find that the used satellite images are the second most important predictor after square feet in our model and that the network learns interpretable patterns about the neighborhood structure and density.}}, author = {{Kucklick, Jan-Peter and Müller, Oliver}}, issn = {{2158-656X}}, journal = {{ACM Transactions on Management Information Systems}}, keywords = {{Interpretability, Convolutional Neural Network, Accuracy-Interpretability Trade-Of, Real Estate Appraisal, Hedonic Pricing, Grad-Ram}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Tackling the Accuracy–Interpretability Trade-off: Interpretable Deep Learning Models for Satellite Image-based Real Estate Appraisal}}}, doi = {{10.1145/3567430}}, year = {{2022}}, } @inproceedings{51343, abstract = {{This paper presents preliminary work on the formalization of three prominent cognitive biases in the diagnostic reasoning process over epileptic seizures, psychogenic seizures and syncopes. Diagnostic reasoning is understood as iterative exploration of medical evidence. This exploration is represented as a partially observable Markov decision process where the state (i.e., the correct diagnosis) is uncertain. Observation likelihoods and belief updates are computed using a Bayesian network which defines the interrelation between medical risk factors, diagnoses and potential findings. The decision problem is solved via partially observable upper confidence bounds for trees in Monte-Carlo planning. We compute a biased diagnostic exploration policy by altering the generated state transition, observation and reward during look ahead simulations. The resulting diagnostic policies reproduce reasoning errors which have only been described informally in the medical literature. We plan to use this formal representation in the future to inversely detect and classify biased reasoning in actual diagnostic trajectories obtained from physicians.}}, author = {{Battefeld, Dominik and Kopp, Stefan}}, booktitle = {{Proceedings of the 8th Workshop on Formal and Cognitive Reasoning}}, keywords = {{Diagnostic reasoning, Cognitive bias, Cognitive model, POMDP, Bayesian network, Epilepsy, CDSS}}, location = {{Trier}}, title = {{{Formalizing cognitive biases in medical diagnostic reasoning}}}, year = {{2022}}, } @inproceedings{25281, abstract = {{Wireless Acoustic Sensor Networks (WASNs) have a wide range of audio signal processing applications. Due to the spatial diversity of the microphone and their relative position to the acoustic source, not all microphones are equally useful for subsequent audio signal processing tasks, nor do they all have the same wireless data transmission rates. Hence, a central task in WASNs is to balance a microphone’s estimated acoustic utility against its transmission delay, selecting a best-possible subset of microphones to record audio signals. In this work, we use reinforcement learning to decide if a microphone should be used or switched off to maximize the acoustic quality at low transmission delays, while minimizing switching frequency. In experiments with moving sources in a simulated acoustic environment, our method outperforms naive baseline comparisons}}, author = {{Afifi, Haitham and Guenther, Michael and Brendel, Andreas and Karl, Holger and Kellermann, Walter}}, booktitle = {{14. ITG Conference on Speech Communication (ITG 2021)}}, keywords = {{microphone utility, microphone selection, wireless acoustic sensor network, network delay, reinforcement learning}}, title = {{{Reinforcement Learning-based Microphone Selection in Wireless Acoustic Sensor Networks considering Network and Acoustic Utilities}}}, year = {{2021}}, } @inproceedings{21543, abstract = {{Services often consist of multiple chained components such as microservices in a service mesh, or machine learning functions in a pipeline. Providing these services requires online coordination including scaling the service, placing instance of all components in the network, scheduling traffic to these instances, and routing traffic through the network. Optimized service coordination is still a hard problem due to many influencing factors such as rapidly arriving user demands and limited node and link capacity. Existing approaches to solve the problem are often built on rigid models and assumptions, tailored to specific scenarios. If the scenario changes and the assumptions no longer hold, they easily break and require manual adjustments by experts. Novel self-learning approaches using deep reinforcement learning (DRL) are promising but still have limitations as they only address simplified versions of the problem and are typically centralized and thus do not scale to practical large-scale networks. To address these issues, we propose a distributed self-learning service coordination approach using DRL. After centralized training, we deploy a distributed DRL agent at each node in the network, making fast coordination decisions locally in parallel with the other nodes. Each agent only observes its direct neighbors and does not need global knowledge. Hence, our approach scales independently from the size of the network. In our extensive evaluation using real-world network topologies and traffic traces, we show that our proposed approach outperforms a state-of-the-art conventional heuristic as well as a centralized DRL approach (60% higher throughput on average) while requiring less time per online decision (1 ms).}}, author = {{Schneider, Stefan Balthasar and Qarawlus, Haydar and Karl, Holger}}, booktitle = {{IEEE International Conference on Distributed Computing Systems (ICDCS)}}, keywords = {{network management, service management, coordination, reinforcement learning, distributed}}, location = {{Washington, DC, USA}}, publisher = {{IEEE}}, title = {{{Distributed Online Service Coordination Using Deep Reinforcement Learning}}}, year = {{2021}}, } @inproceedings{20693, abstract = {{In practical, large-scale networks, services are requested by users across the globe, e.g., for video streaming. Services consist of multiple interconnected components such as microservices in a service mesh. Coordinating these services requires scaling them according to continuously changing user demand, deploying instances at the edge close to their users, and routing traffic efficiently between users and connected instances. Network and service coordination is commonly addressed through centralized approaches, where a single coordinator knows everything and coordinates the entire network globally. While such centralized approaches can reach global optima, they do not scale to large, realistic networks. In contrast, distributed approaches scale well, but sacrifice solution quality due to their limited scope of knowledge and coordination decisions. To this end, we propose a hierarchical coordination approach that combines the good solution quality of centralized approaches with the scalability of distributed approaches. In doing so, we divide the network into multiple hierarchical domains and optimize coordination in a top-down manner. We compare our hierarchical with a centralized approach in an extensive evaluation on a real-world network topology. Our results indicate that hierarchical coordination can find close-to-optimal solutions in a fraction of the runtime of centralized approaches.}}, author = {{Schneider, Stefan Balthasar and Jürgens, Mirko and Karl, Holger}}, booktitle = {{IFIP/IEEE International Symposium on Integrated Network Management (IM)}}, keywords = {{network management, service management, coordination, hierarchical, scalability, nfv}}, location = {{Bordeaux, France}}, publisher = {{IFIP/IEEE}}, title = {{{Divide and Conquer: Hierarchical Network and Service Coordination}}}, year = {{2021}}, } @article{21808, abstract = {{Modern services consist of interconnected components,e.g., microservices in a service mesh or machine learning functions in a pipeline. These services can scale and run across multiple network nodes on demand. To process incoming traffic, service components have to be instantiated and traffic assigned to these instances, taking capacities, changing demands, and Quality of Service (QoS) requirements into account. This challenge is usually solved with custom approaches designed by experts. While this typically works well for the considered scenario, the models often rely on unrealistic assumptions or on knowledge that is not available in practice (e.g., a priori knowledge). We propose DeepCoord, a novel deep reinforcement learning approach that learns how to best coordinate services and is geared towards realistic assumptions. It interacts with the network and relies on available, possibly delayed monitoring information. Rather than defining a complex model or an algorithm on how to achieve an objective, our model-free approach adapts to various objectives and traffic patterns. An agent is trained offline without expert knowledge and then applied online with minimal overhead. Compared to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput (up to 76%) and overall network utility (more than 2x) on realworld network topologies and traffic traces. It also supports optimizing multiple, possibly competing objectives, learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic traffic, and scales to large real-world networks. For reproducibility and reuse, our code is publicly available.}}, author = {{Schneider, Stefan Balthasar and Khalili, Ramin and Manzoor, Adnan and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Hecker, Artur}}, journal = {{Transactions on Network and Service Management}}, keywords = {{network management, service management, coordination, reinforcement learning, self-learning, self-adaptation, multi-objective}}, publisher = {{IEEE}}, title = {{{Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning}}}, doi = {{10.1109/TNSM.2021.3076503}}, year = {{2021}}, } @inproceedings{19607, abstract = {{Modern services consist of modular, interconnected components, e.g., microservices forming a service mesh. To dynamically adjust to ever-changing service demands, service components have to be instantiated on nodes across the network. Incoming flows requesting a service then need to be routed through the deployed instances while considering node and link capacities. Ultimately, the goal is to maximize the successfully served flows and Quality of Service (QoS) through online service coordination. Current approaches for service coordination are usually centralized, assuming up-to-date global knowledge and making global decisions for all nodes in the network. Such global knowledge and centralized decisions are not realistic in practical large-scale networks. To solve this problem, we propose two algorithms for fully distributed service coordination. The proposed algorithms can be executed individually at each node in parallel and require only very limited global knowledge. We compare and evaluate both algorithms with a state-of-the-art centralized approach in extensive simulations on a large-scale, real-world network topology. Our results indicate that the two algorithms can compete with centralized approaches in terms of solution quality but require less global knowledge and are magnitudes faster (more than 100x).}}, author = {{Schneider, Stefan Balthasar and Klenner, Lars Dietrich and Karl, Holger}}, booktitle = {{IEEE International Conference on Network and Service Management (CNSM)}}, keywords = {{distributed management, service coordination, network coordination, nfv, softwarization, orchestration}}, publisher = {{IEEE}}, title = {{{Every Node for Itself: Fully Distributed Service Coordination}}}, year = {{2020}}, } @inproceedings{19609, abstract = {{Modern services comprise interconnected components, e.g., microservices in a service mesh, that can scale and run on multiple nodes across the network on demand. To process incoming traffic, service components have to be instantiated and traffic assigned to these instances, taking capacities and changing demands into account. This challenge is usually solved with custom approaches designed by experts. While this typically works well for the considered scenario, the models often rely on unrealistic assumptions or on knowledge that is not available in practice (e.g., a priori knowledge). We propose a novel deep reinforcement learning approach that learns how to best coordinate services and is geared towards realistic assumptions. It interacts with the network and relies on available, possibly delayed monitoring information. Rather than defining a complex model or an algorithm how to achieve an objective, our model-free approach adapts to various objectives and traffic patterns. An agent is trained offline without expert knowledge and then applied online with minimal overhead. Compared to a state-of-the-art heuristic, it significantly improves flow throughput and overall network utility on real-world network topologies and traffic traces. It also learns to optimize different objectives, generalizes to scenarios with unseen, stochastic traffic patterns, and scales to large real-world networks.}}, author = {{Schneider, Stefan Balthasar and Manzoor, Adnan and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Khalili, Ramin and Hecker, Artur}}, booktitle = {{IEEE International Conference on Network and Service Management (CNSM)}}, keywords = {{self-driving networks, self-learning, network coordination, service coordination, reinforcement learning, deep learning, nfv}}, publisher = {{IEEE}}, title = {{{Self-Driving Network and Service Coordination Using Deep Reinforcement Learning}}}, year = {{2020}}, } @inproceedings{16218, abstract = {{Despite recent progress in orchestration of Virtual Network Functions (VNFs) and in multi-technology SDN connectivity, the automated provisioning of end-to-end network services composed of virtual functions deployed across distributed compute locations remains an open challenge. This problem is especially relevant to support the deployment of future 5G networks, comprising virtual access and core network functions connected through a potentially multi-domain transport network. In this paper, we present and demonstrate the 5GOS, a lightweight end-to-end orchestration framework that enables the automated provisioning of virtual radio access network services. Using an experimental multi-domain testbed we demonstrate that the 5GOS can provision multi-domain virtual Wi-Fi and LTE services in less than three minutes.}}, author = {{Camps-Mur, Daniel and Canellas, Ferran and Machwe, Azahar and Paracuellos, Jorge and Choumas, Kostas and Giatsios, Dimitris and Korakis, Thanasis and Razzaghi Kouchaksaraei, Hadi}}, booktitle = {{the 6th IEEE International Conference on Network Softwarization (IEEE NetSoft 2020)}}, keywords = {{Orchestration, multi-domain, cellular network virtualization, SDN, 5G}}, location = {{Ghent, Belgium}}, title = {{{5GOS: Demonstrating multi-domain orchestration of end-to-end virtual RAN services}}}, year = {{2020}}, } @techreport{23568, abstract = {{We study the structure of power networks in consideration of local protests against certain power lines (’not-in-my-backyard’). An application of a network formation game is used to determine whether or not such protests arise. We examine the existence of stable networks and their characteristics, when no player wants to make an alteration. Stability within this game is only reached if each player is sufficiently connected to a power source but is not linked to more players than necessary. In addition we introduce an algorithm that creates a stable network.}}, author = {{Block, Lukas}}, keywords = {{Network formation, NIMBY, Power networks, Nash stability}}, title = {{{Network formation with NIMBY constraints}}}, year = {{2020}}, } @inproceedings{20504, abstract = {{In recent years time domain speech separation has excelled over frequency domain separation in single channel scenarios and noise-free environments. In this paper we dissect the gains of the time-domain audio separation network (TasNet) approach by gradually replacing components of an utterance-level permutation invariant training (u-PIT) based separation system in the frequency domain until the TasNet system is reached, thus blending components of frequency domain approaches with those of time domain approaches. Some of the intermediate variants achieve comparable signal-to-distortion ratio (SDR) gains to TasNet, but retain the advantage of frequency domain processing: compatibility with classic signal processing tools such as frequency-domain beamforming and the human interpretability of the masks. Furthermore, we show that the scale invariant signal-to-distortion ratio (si-SDR) criterion used as loss function in TasNet is related to a logarithmic mean square error criterion and that it is this criterion which contributes most reliable to the performance advantage of TasNet. Finally, we critically assess which gains in a noise-free single channel environment generalize to more realistic reverberant conditions.}}, author = {{Heitkaemper, Jens and Jakobeit, Darius and Boeddeker, Christoph and Drude, Lukas and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP 2020 Virtual Barcelona Spain}}, keywords = {{voice activity detection, speech activity detection, neural network, statistical speech processing}}, title = {{{Demystifying TasNet: A Dissecting Approach}}}, year = {{2020}}, }