A5074453820- Particle physics theoretical and experimental studies
- Quantum Chromodynamics and Particle Interactions
- High-Energy Particle Collisions Research
- Stochastic processes and financial applications
- Particle Detector Development and Performance
- Advanced Graph Theory Research
- Particle Accelerators and Free-Electron Lasers
- Radiation Detection and Scintillator Technologies
- Financial Risk and Volatility Modeling
- Financial Markets and Investment Strategies
- Complexity and Algorithms in Graphs
- Monetary Policy and Economic Impact
- Computational Physics and Python Applications
- Graph Labeling and Dimension Problems
- Dark Matter and Cosmic Phenomena
- Neutrino Physics Research
- Natural Language Processing Techniques
- Market Dynamics and Volatility
- Authorship Attribution and Profiling
- Superconducting Materials and Applications
- Data Management and Algorithms
- Black Holes and Theoretical Physics
- Medical Imaging Techniques and Applications
- graph theory and CDMA systems
- Advanced Text Analysis Techniques
Universität Ulm
2023-2024
University of Sussex
2012-2020
Technical University of Munich
2012-2018
GSI Helmholtz Centre for Heavy Ion Research
2017
University of Cincinnati
2016
Deutsches Elektronen-Synchrotron DESY
2016
University of Bonn
2016
University of the Basque Country
2016
University of Florida
2016
University of Giessen
2016
Identifying the language used will typically be first step in most natural processing tasks. Among wide variety of identification methods discussed literature, ones employing Cavnar and Trenkle (1994) approach to text categorization based on character n-gram frequencies have been particularly successful. This paper presents R extension package <b>textcat</b> for which implements both as well a reduced designed remove redundancies original approach. A multi-lingual corpus obtained from...
We provide theoretical insights around the cutwidth of a graph and One-Sided Crossing Minimization (OSCM) problem. OSCM was posed in Parameterized Algorithms Computational Experiments Challenge 2024, where input parameter parameterized track. prove an asymptotically sharp upper bound on size terms its order cutwidth. As number so-called unsuited pairs is one factors that determine difficulty instance, we them $n$ graph. If bounded by constant, this implies $\mathcal{O}(2^n)$-time algorithm,...
GENFIT is an experiment-independent track-fitting toolkit that combines fitting algorithms, track representations, and measurement geometries into a modular framework. We report on significantly improved version of GENFIT, based experience gained in the Belle II, ANDA, FOPI experiments. Improvements concern implementation additional enhanced implementations Kalman fitters, visualization capabilities, types suited for various kinds tracking detectors. The data model has been revised, allowing...
We report a measurement of the time-integrated $CP$ asymmetry in neutral charm meson decay $D^0 \to K^0_S K^0_S$ using 921~fb$^{-1}$ data collected at $Υ(4S)$ and $Υ(5S)$ resonances with Belle detector KEKB asymmetric-energy $e^+e^-$ collider. The observed is $$ A_{CP}(D^0 K^0_S) = (-0.02 \pm 1.53 0.17) \%, where first uncertainty statistical second systematic. This latter dominated by error normalisation channel. result consistent Standard Model expectations improves respect to previous...
One way to define the Matching Cut problem is: Given a graph G, is there an edge-cut M of G such that independent set in line G? We propose more general Conflict-Free problem: Together with we are given so-called conflict Gˆ on edges and ask for edge-cutset Gˆ. Since conflict-free settings popular generalizations classical optimization problems was not considered literature so far, start study problem. show NP-complete even when maximum degree 5 1-regular. The same reduction implies...
The future Belle II experiment will employ a computer-farm based data reduction system for the readout of its innermost detector, DEPFET-technology silicon detector with pixel readout. A large fraction background hits can be rejected by defining set Regions Of Interest (ROI) on sensors and then recording just from pixels inside ROI. ROIs are defined an event basis extrapolating back onto PXD charged tracks detected in outer trackers (a 4 layer double-sided strip surrounded wire chamber)....
We present a computer-farm based data reduction system for the pixel detector of future Belle II experiment. is major upgrade that currently ongoing in KEK (Tsukuba, Japan). will collect from SuperKEKB, an asymmetric e <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">+</sup> xmlns:xlink="http://www.w3.org/1999/xlink">-</sup> collider whose target luminosity (8 × 10 xmlns:xlink="http://www.w3.org/1999/xlink">35</sup> Hz/cm...
This document illustrates the technical layout and expected performance of a Time Projection Chamber as central tracking system PANDA experiment. The detector is based on continuously operating TPC with Gas Electron Multiplier (GEM) amplification.
A pattern recognition software for a continuously operating high-rate Time Projection Chamber with Gas Electron Multiplier amplification (GEM-TPC) has been designed and tested. Space points are delivered by track-independent clustering algorithm. true 3-dimensional track follower combines them to helical tracks, without constraints on the vertex position. Fast helix fits, based conformal mapping Riemann sphere, basis deciding whether belong one track. To assess performance of algorithm in...
The GENFIT toolkit, initially developed at the Technische Universitaet Muenchen, has been extended and modified to be more general user-friendly. new GENFIT, called GENFIT2, provides track representation, track-fitting algorithms graphic visualization of tracks detectors, it can used for any experiment that determines parameters charged particle trajectories from spacial coordinate measurements. Based on Kalman filter routines, perform extrapolations covariance matrices. It also interfaces...
We use the P&L on a particular class of swaps, representing variance and higher moments for log returns, as estimators in our empirical study S&P500 that investigates factors determining higher-moment risk premia. This is discretisation invariant sub-class swaps with Neuberger's aggregating characteristics. Besides market excess return, momentum dominant driver both skewness kurtosis premia, which exhibit highly significant negative correlation. By contrast, premium responds...
We propose the conjecture that every graph $G$ of order $n$ with less than $3n-6$ edges has a vertex cut induces forest. Maximal planar graphs do not have such cuts and show density condition would be best possible. verify for $\frac{11}{5}n-\frac{18}{5}$
Confirming a conjecture posed by Caro, it was shown Chen and Yu that every graph $G$ with $n$ vertices at most $2n-4$ edges has stable cutset, which is set of whose removal disconnects the graph. Le Pfender showed all graphs $2n-3$ without cutset arise recursively glueing together triangles triangular prisms along an edge or triangle. Pfender's proof contains gap, we fill in present article.
We describe the implementation of exact solver weberknecht and heuristic weberknecht_h for One-Sided Crossing Minimization problem.