Search

We demonstrate the capabilities of a novel frequency-domain terahertz spectrometer based on a comb-locked frequency synthesizer, which provides absolute frequency calibration. The inherent stability and repeatability of the scans allow for the combination of fast data acquisition with an average time-limited signal-to-noise ratio. We demonstrate kilohertz level frequency resolution in terahertz precision spectroscopy of ultrahigh quality whispering-gallery-mode resonators. Spectra covering multiple free spectral ranges (>36GHz) with sub-20kHz resolution are acquired in 5s. We analyse the coupling behaviour and temperature tuning of single resonances and, for the first time, observe minute red and blue shifts of different mode families. The experimental results are supported with finite element simulations.

Detecting cosmic gamma rays at high rates is the key to time-resolve the acceleration of particles within some of the most powerful events in the universe. Time-resolving the emission of gamma rays from merging celestial bodies, apparently random bursts of gamma rays, recurring novas in binary systems, flaring jets from active galactic nuclei, clocking pulsars, and many more became a critical contribution to astronomy. For good timing on account of high rates, we would ideally collect the naturally more abundant, low energetic gamma rays in the domain of one giga electronvolt in large areas. Satellites detect low energetic gamma rays but only in small collecting areas. Cherenkov telescopes have large collecting areas but can only detect the rare, high energetic gamma rays. To detect gamma rays with lower energies, Cherenkov-telescopes need to increase in precision and size. But when we push the concept of the -- far/tele -- seeing Cherenkov telescope accordingly, the telescope's physical limits show more clearly. The narrower depth-of-field of larger mirrors, the aberrations of mirrors, and the deformations of mirrors and mechanics all blur the telescope's image. To overcome these limits, we propose to record the -- full/plenum -- Cherenkov-light field of an atmospheric shower, i.e. recording the directions and impacts of each individual Cherenkov photon simultaneously, with a novel class of instrument. This novel Cherenkov plenoscope can turn a narrow depth-of-field into the perception of depth, can compensate aberrations, and can tolerate deformations. We design a Cherenkov plenoscope to explore timing by detecting low energetic gamma rays in large areas., Comment: An interdisciplinary effort investigated by physicists and civil engineers. For simulations, see https://github.com/cherenkov-plenoscope. 28 pages, 25 figures, 50 references, 100% motivation. Log:(2024 February 09) Add journal reference, update email and affiliations

This paper investigates the issue of fairness in Distributed Ledger Technology (DLT), specifically focusing on the shortcomings observed in current blockchain systems due to Miner Extractable Value (MEV) phenomena and systemic centralization. We explore the potential of Directed Acyclic Graphs (DAGs) as a solution to address or mitigate these fairness concerns. Our objective is to gain a comprehensive understanding of fairness in DAG-based DLTs by examining its different aspects and measurement metrics. We aim to establish a shared knowledge base that facilitates accurate fairness assessment and allows for an evaluation of whether DAG-based DLTs offer a more equitable design. We describe the various dimensions of fairness and conduct a comparative analysis to examine how they relate to different components of DLTs. This analysis serves as a catalyst for further research, encouraging the development of cryptographic systems that promote fairness., Comment: 8 Pages, Accepted in 5th Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS 2023)

The Rashomon Effect describes the following phenomenon: for a given dataset there may exist many models with equally good performance but with different solution strategies. The Rashomon Effect has implications for Explainable Machine Learning, especially for the comparability of explanations. We provide a unified view on three different comparison scenarios and conduct a quantitative evaluation across different datasets, models, attribution methods, and metrics. We find that hyperparameter-tuning plays a role and that metric selection matters. Our results provide empirical support for previously anecdotal evidence and exhibit challenges for both scientists and practitioners.

Biological cells are built up from many different constituents of varying size and stiffness which all contribute to the cell's mechanical properties. Despite this heterogeneity, in the analysis of experimental measurements such as atomic force microscopy or microfluidic characterisation a strongly simplified homogeneous cell is typically assumed and a single elastic modulus is assigned to the entire cell. This ad-hoc simplification has so far mostly been used without proper justification. Here, we use computer simulations to show that indeed a heterogeneous cell can effectively be replaced by a homogeneous equivalent cell with a volume averaged elastic modulus. To study the validity of this approach, we investigate a hyperelastic cell with a heterogeneous interior under compression as well as in shear and channel flow, mimicking atomic force and microfluidic measurements, respectively. We find that the homogeneous equivalent cell reproduces quantitatively the behavior of its inhomogeneous counterpart, and that this equality is largely independent of the stiffness or spatial distribution of the heterogeneity.

DAG-based DLTs allow for parallel, asynchronous writing access to a ledger. Consequently, the perception of the most recent blocks may differ considerably between nodes, and the underlying network properties of the P2P layer have a direct impact on the performance of the protocol. Moreover, the stronger inter-dependencies of several core components demand a more complex and complete approach to studying such DLTs. This paper presents an agent-based, open-sourced simulator for large-scale networks that implement the leaderless Tangle 2.0 consensus protocol. Its scope includes modelling the underlying peer-to-peer communication with network topology, package loss, heterogeneous latency, the gossip protocol with reliable broadcast qualities, the underlying DAG-based data structure, and the consensus protocol. The simulator allows us to explore the performance of the protocol in different network environments, as well as different attack scenarios., Comment: IEEE ICBC 2023, short paper

The robust construction of the ledger data structure is an essential ingredient for the safe operation of a distributed ledger. While in traditional linear blockchain systems, permission to append to the structure is leader-based, in Directed Acyclic Graph-based ledgers, the writing access can be organised leaderless. However, this leaderless approach relies on fair treatment of non-referenced blocks, i.e. tips, by honest block issuers. We study the impact of a deviation from the standard tip selection by a subset of block issuers with the aim of halting the confirmation of honest blocks entirely. We provide models on this so-called orphanage of blocks and validate these through open-sourced simulation studies. A critical threshold for the adversary issuance rate is shown to exist, above which the tip pool becomes unstable, while for values below the orphanage decrease exponentially. We study the robustness of the protocol with an expiration time on tips, also called garbage collection, and modification of the parent references per block., Comment: IEEE ICBC 2023

This paper discusses congestion control and inconsistency problems in DAG-based distributed ledgers and proposes an additional filter to mitigate these issues. Unlike traditional blockchains, DAG-based DLTs use a directed acyclic graph structure to organize transactions, allowing higher scalability and efficiency. However, this also introduces challenges in controlling the rate at which blocks are added to the network and preventing the influence of spam attacks. To address these challenges, we propose a filter to limit the tip pool size and to avoid referencing old blocks. Furthermore, we present experimental results to demonstrate the effectiveness of this filter in reducing the negative impacts of various attacks. Our approach offers a lightweight and efficient solution for managing the flow of blocks in DAG-based DLTs, which can enhance the consistency and reliability of these systems. Index

In distributed ledger technologies (DLTs) with a directed acyclic graph (DAG) data structure, a block-issuing node can decide where to append new blocks and, consequently, how the DAG grows. This DAG data structure is typically decomposed into two pools of blocks, dependent on whether another block already references them. The unreferenced blocks are called the tips. Due to network delay, nodes can perceive the set of tips differently, giving rise to local tip pools. We present a new mathematical model to analyse the stability of the different local perceptions of the tip pools and allow heterogeneous and random network delay in the underlying peer-to-peer communication layer. Under natural assumptions, we prove that the number of tips is ergodic, converges to a stationary distribution, and provide quantitative bounds on the tip pool sizes. We conclude our study with agent-based simulations to illustrate the convergence of the tip pool sizes and the pool sizes' dependence on the communication delay and degree of centralization., Comment: 6 figures

Bioprinting of living cells can cause major shape deformations, which may severely affect cell survival and functionality. While the shear stresses occurring during cell flow through the printer nozzle have been quantified to some extent, the extensional stresses occurring as cells leave the nozzle into the free printing strand have been mostly ignored. Here we use Lattice-Boltzmann simulations together with a finite-element based cell model to study cell deformation at the nozzle exit. Our simulation results are in good qualitative agreement with experimental microscopy images. We show that for cells flowing in the center of the nozzle extensional stresses can be significant, while for cells flowing off-center their deformation is dominated by the shear flow inside the nozzle. From the results of these simulations, we develop two simple methods that only require the printing parameters (nozzle diameter, flow rate, bioink rheology) to (i) accurately predict the maximum cell stress occurring during the 3D bioprinting process and (ii) approximately predict the cell strains caused by the elongational flow at the nozzle exit., Comment: Manuscript: 14 pages, 14 figures Supplementary Information attached

In this paper, we investigate the performance of the Tangle 2.0 consensus protocol in a Byzantine environment. We use an agent-based simulation model that incorporates the main features of the Tangle 2.0 consensus protocol. Our experimental results demonstrate that the Tangle 2.0 protocol is robust to the bait-and-switch attack up to the theoretical upper bound of the adversary's 33% voting weight. We further show that the common coin mechanism in Tangle 2.0 is necessary for robustness against powerful adversaries. Moreover, the experimental results confirm that the protocol can achieve around 1s confirmation time in typical scenarios and that the confirmation times of non-conflicting transactions are not affected by the presence of conflicts.

We present a geometric multilevel optimization approach that smoothly incorporates box constraints. Given a box constrained optimization problem, we consider a hierarchy of models with varying discretization levels. Finer models are accurate but expensive to compute, while coarser models are less accurate but cheaper to compute. When working at the fine level, multilevel optimisation computes the search direction based on a coarser model which speeds up updates at the fine level. Moreover, exploiting geometry induced by the hierarchy the feasibility of the updates is preserved. In particular, our approach extends classical components of multigrid methods like restriction and prolongation to the Riemannian structure of our constraints., Comment: 25 pages, 6 figures

We introduce the theoretical foundations of the Tangle 2.0, a probabilistic leaderless consensus protocol based on a directed acyclic graph (DAG) called the Tangle. The Tangle naturally succeeds the blockchain as its next evolutionary step as it offers features suited to establish more efficient and scalable distributed ledger solutions. Consensus is no longer found in the longest chain but on the heaviest DAG, where PoW is replaced by a stake- or reputation-based weight function. The DAG structure and the underlying Reality-based UTXO Ledger allow parallel validation of transactions without the need for total ordering. Moreover, it enables the removal of the intermediary of miners and validators, allowing a pure two-step process that follows the \emph{propose-vote} paradigm at the node level and not at the validator level. We propose a framework to analyse liveness and safety under different communication and adversary models. This allows providing impossibility results in some edge cases and in the asynchronous communication model. We provide formal proof of the security of the protocol assuming a common random coin., Comment: revised version, to appear in IEEE Access

The Unspent Transaction Output (UTXO) model is commonly used in the field of Distributed Ledger Technology (DLT) to transfer value between participants. One of its advantages is that it allows parallel processing of transactions, as independent transactions can be added in any order. This property of order invariance and parallelisability has potential benefits in terms of scalability. However, since the UTXO Ledger is an append-only data structure, this advantage is compromised through the presence of conflicting transactions. We propose an extended UTXO Ledger model that optimistically updates the ledger and keeps track of the dependencies of the possible conflicts. In the presence of a conflict resolution mechanism, we propose a method to reduce the extended ledger back to a consistent UTXO Ledger., Comment: revised version, accepted in ACM DLT

In this position paper, a large group of interdisciplinary experts outlines response strategies against the spread of SARS-CoV-2 in the winter of 2021/2022 in Germany. We review the current state of the COVID-19 pandemic, from incidence and vaccination efficacy to hospital capacity. Building on this situation assessment, we illustrate various possible scenarios for the winter, and detail the mechanisms and effectiveness of the non-pharmaceutical interventions, vaccination, and booster. With this assessment, we want to provide orientation for decision makers about the progress and mitigation of COVID-19., Comment: in German, Extensive expert assessment on COVID-19 response policies for the winter 2021/22

The security of any Distributed Ledger Technology (DLT) depends on the safety of the network layer. Much effort has been put into understanding the consensus layer of DLTs. However, many network layer designs seem ad-hoc and lack a careful analysis of the influence of the design decisions on the whole DLT system. We propose a salt-based automated neighbor selection protocol that shows the inherent tradeoffs of certain design decisions and allows a quantitative treatment of some network topology requirements. This example may serve as a design framework and facilitate future research. We provide a selection of results from simulations to highlight some tradeoffs in the design decisions., Comment: 4 pages

This paper addresses the numerical simulation of self-piercing rivetting processes to join fibre reinforced polymers and sheet metals. Special emphasis is placed on the modelling of the deformation and failure behaviour of the composite material. Different from the simulation of rivetting processes in metals, which requires the modelling of large plastic deformations, the mechanical response of composites is typically governed by intra- and interlaminar damage phenomena. Depending on the polymeric matrix, viscoelastic effects can interfere particularly with the long-term behaviour of the joint. We propose a systematic approach to the modelling of composite laminates, discuss limitations of the used model, and present details of parameter identification. Homogenisation techniques are applied to predict the mechanical behaviour of the composite in terms of effective anisotropic elastic and viscoelastic material properties. In combination with a continuum damage approach this model represents the deformation and failure behaviour of individual laminae. Cohesive zone elements enable the modelling of delamination processes. The parameters of the latter models are identified from experiments. The defined material model for the composite is eventually utilised in the simulation of an exemplary self-piercing rivetting process., Comment: Accepted manuscript

This survey presents an overview of integrating prior knowledge into machine learning systems in order to improve explainability. The complexity of machine learning models has elicited research to make them more explainable. However, most explainability methods cannot provide insight beyond the given data, requiring additional information about the context. We propose to harness prior knowledge to improve upon the explanation capabilities of machine learning models. In this paper, we present a categorization of current research into three main categories which either integrate knowledge into the machine learning pipeline, into the explainability method or derive knowledge from explanations. To classify the papers, we build upon the existing taxonomy of informed machine learning and extend it from the perspective of explainability. We conclude with open challenges and research directions.

We review probabilistic models known as majority dynamics (also known as threshold Voter Models) and discuss their possible applications for achieving consensus in cryptocurrency systems. In particular, we show that using this approach straightforwardly for practical consensus in Byzantine setting can be problematic and requires extensive further research. We then discuss the FPC consensus protocol which circumvents the problems mentioned above by using external randomness., Comment: revised version, accepted in Annals of Telecommunications