Search results for "Modular"

Locust: C++ software for simulation of RF detection

2019

The Locust simulation package is a new C++ software tool developed to simulate the measurement of time-varying electromagnetic fields using RF detection techniques. Modularity and flexibility allow for arbitrary input signals, while concurrently supporting tight integration with physics-based simulations as input. External signals driven by the Kassiopeia particle tracking package are discussed, demonstrating conditional feedback between Locust and Kassiopeia during software execution. An application of the simulation to the Project 8 experiment is described. Locust is publicly available at https://github.com/project8/locust_mc.

Modular transformations of elliptic Feynman integrals

2021

We investigate the behaviour of elliptic Feynman integrals under modular transformations. This has a practical motivation: Through a suitable modular transformation we can achieve that the nome squared is a small quantity, leading to fast numerical evaluations. Contrary to the case of multiple polylogarithms, where it is sufficient to consider just variable transformations for the numerical evaluations of multiple polylogarithms, it is more natural in the elliptic case to consider a combination of a variable transformation (i.e. a modular transformation) together with a redefinition of the master integrals. Thus we combine a coordinate transformation on the base manifold with a basis transf…

2017

Micro-fluidic pumps as well as artificial micro-swimmers are conveniently realized exploiting phoretic solvent flows based on local gradients of temperature, electrolyte concentration or pH. We here present a facile micro-photometric method for monitoring pH gradients and demonstrate its performance and scope on different experimental situations including an electro-osmotic pump and modular micro-swimmers assembled from ion exchange resin beads and polystyrene colloids. In combination with the present microscope and DSLR camera our method offers a 2 \mu m spatial resolution at video frame rate over a field of view of 3920x2602 \mu m^2. Under optimal conditions we achieve a pH-resolution of …

Equivariance in topological gravity

1992

Abstract We present models of topological gravity for a variety of moduli space conditions. In four dimensions, we construct a model for self-dual gravity characterized by the moduli condition R + μν =0, and in two dimensions we treat the case of constant scalar curvature. Details are also given for both flat and Yang-Mills type moduli conditions in arbitrary dimensions. All models are based on the same fundamental multiplet which conveniently affords the construction of a complete hierarchy of observables. This approach is founded on a symmetry algebra which includes a local vector supersymmetry, in addition to a global BRST-like symmetry which is equivariant with respect to Lorentz transf…

FlexibleSUSY - a meta spectrum generator for supersymmetric models

2016

FlexibleSUSY is a software package that takes as input descriptions of (non-)minimal supersymmetric models written in Wolfram/Mathematica and generates a set of spectrum generator libraries and executables, with the aid of SARAH. The design goals are precision, reliability, modularity, speed, and readability of the code. The boundary conditions are independent C++ objects that are plugged into the boundary value problem solver together with the model objects. This clean separation makes it easy to adapt the generated code for individual projects. The current status of the interface and implementation is sketched.

The unequal mass sunrise integral expressed through iterated integrals on M‾1,3

2020

Abstract We solve the two-loop sunrise integral with unequal masses systematically to all orders in the dimensional regularisation parameter e. In order to do so, we transform the system of differential equations for the master integrals to an e-form. The sunrise integral with unequal masses depends on three kinematical variables. We perform a change of variables to standard coordinates on the moduli space M 1 , 3 of a genus one Riemann surface with three marked points. This gives us the solution as iterated integrals on M ‾ 1 , 3 . On the hypersurface τ = const our result reduces to elliptic polylogarithms. In the equal mass case our result reduces to iterated integrals of modular forms.

The CZT X-ray imager on AXO

2001

DSRI has initiated a development program of CZT X-ray and gamma ray detectors employing strip readout techniques. A dramatic improvement of the energy response was found operating the detectors as so-called drift detectors. For the electronic readout, modern ASIC chips were investigated. Modular design and the low power electronics will make large area detectors using the drift strip method feasible. The performance of a prototype CZT system will be presented and discussed. One such detector system has been proposed for future space missions: The X-Ray Imager (XRI) on the Atmospheric X-ray Observatory (AXO), which is a mission proposed to the Danish Small Satellite Program and is dedicated …

On a Class of Feynman Integrals Evaluating to Iterated Integrals of Modular Forms

2019

In this talk we discuss a class of Feynman integrals, which can be expressed to all orders in the dimensional regularisation parameter as iterated integrals of modular forms. We review the mathematical prerequisites related to elliptic curves and modular forms. Feynman integrals, which evaluate to iterated integrals of modular forms go beyond the class of multiple polylogarithms. Nevertheless, we may bring for all examples considered the associated system of differential equations by a non-algebraic transformation to an \(\varepsilon \)-form, which makes a solution in terms of iterated integrals immediate.

A classification of C-Fuchsian subgroups of Picard modular groups

2017

Optimal Impulse Control Problems and Linear Programming

2009

Optimal impulse control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions. In this paper, we identify a special class of optimal impulse control problems which are easy to solve. Easy to solve means that solution algorithms are polynomial in time and therefore suitable to the on-line implementation in real-time problems. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the optimal impulse control problem via a binary linear programming proble…