Researcher profile

Stefan Huber

Stefan Huber contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
6works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

6 published item(s)

preprint2026arXiv

Generative Modeling of Approximately Periodic Time Series by a Posterior-Weighted Gaussian Process

Discrete automated processes in industrial and cyber-physical systems often exhibit a repetitive structure in which successive repetitions follow a common trajectory while differing in duration, amplitude, and fine-scale dynamics. Such \emph{approximately periodic} behavior poses a challenge for Gaussian Processes (GP) modeling: strictly periodic models suppress inter-repetition variability, while non-periodic models fail to capture the strong structural regularities required for generation. In this work, we propose a stochastic generative model for approximately periodic time series. The model is based on a GP whose posterior is modulated by a novel kernel. Our approach decouples intra-repetition structure from inter-repetition variability through a two-stage construction which yields a generative distribution with a identical mean function across repetitions, while allowing smooth variation between repetitions. The modeling choices are supported by an implementation in which realistic synthetic trajectories are generated from toy datasets.

preprint2026arXiv

Secure Data Bridging in Industry 4.0: An OPC UA Aggregation Approach for Including Insecure Legacy Systems

The increased connectivity of industrial networks has led to a surge in cyberattacks, emphasizing the need for cybersecurity measures tailored to the specific requirements of industrial systems. Modern Industry 4.0 technologies, such as OPC UA, offer enhanced resilience against these threats. However, widespread adoption remains limited due to long installation times, proprietary technology, restricted flexibility, and formal process requirements (e.g. safety certifications). Consequently, many systems do not yet implement these technologies, or only partially. This leads to the challenge of dealing with so-called brownfield systems, which are often placed in isolated security zones to mitigate risks. However, the need for data exchange between secure and insecure zones persists. This paper reviews existing solutions to address this challenge by analysing their approaches, advantages, and limitations. Building on these insights, we identify three key concepts, evaluate their suitability and compatibility, and ultimately introduce the SigmaServer, a novel TCP-level aggregation method. The developed proof-of-principle implementation is evaluated in an operational technology (OT) testbed, demonstrating its applicability and effectiveness in bridging secure and insecure zones.

preprint2024arXiv

CSRX: A novel Crossover Operator for a Genetic Algorithm applied to the Traveling Salesperson Problem

In this paper, we revisit the application of Genetic Algorithm (GA) to the Traveling Salesperson Problem (TSP) and introduce a family of novel crossover operators that outperform the previous state of the art. The novel crossover operators aim to exploit symmetries in the solution space, which allows us to more effectively preserve well-performing individuals, namely the fitness invariance to circular shifts and reversals of solutions. These symmetries are general and not limited to or tailored to TSP specifically.

preprint2021arXiv

Understanding Emails and Drafting Responses -- An Approach Using GPT-3

Providing computer systems with the ability to understand and generate natural language has long been a challenge of engineers. Recent progress in natural language processing (NLP), like the GPT-3 language model released by OpenAI, has made both possible to an extent. In this paper, we explore the possibility of rationalising email communication using GPT-3. First, we demonstrate the technical feasibility of understanding incoming emails and generating responses, drawing on literature from the disciplines of software engineering as well as data science. Second, we apply knowledge from both business studies and, again, software engineering to identify ways to tackle challenges we encountered. Third, we argue for the economic viability of such a solution by analysing costs and market demand. We conclude that applying GPT-3 to rationalising email communication is feasible both technically and economically.

preprint2019arXiv

Towards a first measurement of the free neutron bound beta decay detecting hydrogen atoms at a throughgoing beamtube in a high flux reactor

In addition to the common 3-body decay of the neutron $n\rightarrow p e^-\overline{ν_e}$ there should exist an effective 2-body subset with the electron and proton forming a Hydrogen bound state with well defined total momentum, total spin and magnetic quantum numbers. The atomic spectroscopic analysis of this bound system can reveal details about the underlying weak interaction as it mirrors the helicity distributions of all outgoing particles. Thus, it is unique in the information it carries, and an experiment unravelling this information is an analogue to the Goldhaber experiment performed more than 60 years ago. The proposed experiment will search for monoenergetic metastable BoB H atoms with 326 eV kinetic energy, which are generated at the center of a throughgoing beamtube of a high-flux reactor (e.g., at the PIK reactor, Gatchina). Although full spectroscopic information is needed to possibly reveal new physics our first aim is to prove the occurrence of this decay and learn about backgrounds. Key to the detection is the identification of a monoerergtic line of hydrogen atoms occurring at a rate of about 1 $\rm{s}^{-1}$ in the environment of many hydrogen atoms, however having a thermal distribution of about room temperature. Two scenarios for velocity (energy) filtering are discussed in this paper. The first builds on an purely electric chopper system, in which metastable hydrogen atoms are quenched to their ground state and thus remain mostly undetectable. This chopper system employs fast switchable Bradbury Nielsen gates. The second method exploits a strongly energy dependent charge exchange process of metastable hydrogen picking up an electron while traversing an argon filled gas cell, turning it into manipulable charged hydrogen. The final detection of hydrogen occurs through multichannel plate (MCP) detector.

preprint2018arXiv

Jointly constrained semidefinite bilinear programming with an application to Dobrushin curves

We propose a branch-and-bound algorithm for minimizing a bilinear functional of the form \[ f(X,Y) = \mathrm{tr}((X\otimes Y)Q)+\mathrm{tr}(AX)+\mathrm{tr}(BY) , \] of pairs of Hermitian matrices $(X,Y)$ restricted by joint semidefinite programming constraints. The functional is parametrized by self-adjoint matrices $Q$, $A$ and $B$. This problem generalizes that of a bilinear program, where $X$ and $Y$ belong to polyhedra. The algorithm converges to a global optimum and yields upper and lower bounds on its value in every step. Various problems in quantum information theory can be expressed in this form. As an example application, we compute Dobrushin curves of quantum channels, giving upper bounds on classical coding with energy constraints.